Numerical behaviour of Higham's scaled method for polar decomposition
From MaRDI portal
Publication:1397923
DOI10.1023/A:1024098014869zbMath1036.65039OpenAlexW1624763321MaRDI QIDQ1397923
Andrzej Kiełbasiński, Krystyna Ziętak
Publication date: 6 August 2003
Published in: Numerical Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1024098014869
algorithmconvergencenumerical exampleserror analysiscondition numberiterative methodscalingpolar decompositionnumerical matrix inversion
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (6)
On the rational approximation of Markov functions, with applications to the computation of Markov functions of Toeplitz matrices ⋮ Numerical aspects of computing the Moore-Penrose inverse of full column rank matrices ⋮ On iterative algorithms for the polar decomposition of a matrix and the matrix sign function ⋮ The iterative methods for computing the polar decomposition of rank-deficient matrix ⋮ The geometric mean of two matrices from a computational viewpoint ⋮ Approximation of matrices and a family of Gander methods for polar decomposition
This page was built for publication: Numerical behaviour of Higham's scaled method for polar decomposition
