Fast Polar Decomposition of an Arbitrary Matrix

DOI10.1137/0911038zbMath0711.65024WikidataQ56115600 ScholiaQ56115600MaRDI QIDQ3497123

Nicholas J. Higham, Robert Schreiber

Publication date: 1990

Published in: SIAM Journal on Scientific and Statistical Computing (Search for Journal in Brave)

Full work available at URL: http://eprints.maths.manchester.ac.uk/340/1/0911038.pdf

zbMATH Keywords

conditioning; polar decomposition; condition estimator; matrix multiplication; complete orthogonal decomposition; cutoff ratio; hybrid inversion/multiplication algorithm; inner Schulz iteration; square root of a Hermitian positive semidefinite matrix

Mathematics Subject Classification ID

15A23: Factorization of matrices

65F10: Iterative numerical methods for linear systems

65F35: Numerical computation of matrix norms, conditioning, scaling

Related Items

Time-stepping and preserving orthonormality, Perturbation bounds on the polar decomposition, On tridiagonal matrices unitarily equivalent to normal matrices, Perturbation analysis for best approximation and the polar factor by subunitary matrices, The matrix sign decomposition and its relation to the polar decomposition, The iterative methods for computing the polar decomposition of rank-deficient matrix, Approximation of matrices and a family of Gander methods for polar decomposition