Fast Polar Decomposition of an Arbitrary Matrix

DOI10.1137/0911038zbMath0711.65024OpenAlexW2148632362WikidataQ56115600 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

conditioningpolar decompositioncondition estimatormatrix multiplicationcomplete orthogonal decompositioncutoff ratiohybrid inversion/multiplication algorithminner Schulz iterationsquare root of a Hermitian positive semidefinite matrix

Mathematics Subject Classification ID

Factorization of matrices (15A23) Iterative numerical methods for linear systems (65F10) Numerical computation of matrix norms, conditioning, scaling (65F35)

Related Items (13)

The matrix sign decomposition and its relation to the polar decomposition ⋮ Minimum-correction second-moment matching: theory, algorithms and applications ⋮ Iterative refinement of Schur decompositions ⋮ Geometric integration on symmetric spaces ⋮ Perturbation bounds on the polar decomposition ⋮ Time-stepping and preserving orthonormality ⋮ Normalized tight vs. general frames in sampling problems ⋮ Low-complexity 8-point DCT approximation based on angle similarity for image and video coding ⋮ The iterative methods for computing the polar decomposition of rank-deficient matrix ⋮ On tridiagonal matrices unitarily equivalent to normal matrices ⋮ Approximation of matrices and a family of Gander methods for polar decomposition ⋮ Perturbation analysis for best approximation and the polar factor by subunitary matrices ⋮ PCA reduced Gaussian mixture models with applications in superresolution

This page was built for publication: Fast Polar Decomposition of an Arbitrary Matrix