Numerical behaviour of Higham's scaled method for polar decomposition
From MaRDI portal
Publication:1397923
DOI10.1023/A:1024098014869zbMath1036.65039MaRDI 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
algorithm; convergence; numerical examples; error analysis; condition number; iterative method; scaling; polar decomposition; numerical matrix inversion
Related Items
The geometric mean of two matrices from a computational viewpoint, 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, On the rational approximation of Markov functions, with applications to the computation of Markov functions of Toeplitz matrices, Approximation of matrices and a family of Gander methods for polar decomposition