The iterative methods for computing the polar decomposition of rank-deficient matrix

DOI10.1016/j.amc.2003.12.083zbMath1061.65026OpenAlexW2161386812MaRDI QIDQ1763254

Kui Du

Publication date: 22 February 2005

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2003.12.083

zbMATH Keywords

numerical examplesiterative methodsNewton methodSingular value decompositionPolar decompositionMatrix sign function

Mathematics Subject Classification ID

Factorization of matrices (15A23) Numerical solutions to overdetermined systems, pseudoinverses (65F20) Iterative numerical methods for linear systems (65F10)

Related Items (5)

A novel iterative method for polar decomposition and matrix sign function ⋮ A sixth-order iterative method for approximating the polar decomposition of an arbitrary matrix ⋮ A third-order Newton-type method for finding polar decomposition ⋮ Several numerical methods for computing unitary polar factor of a matrix ⋮ On a fourth-order matrix method for computing polar decomposition

Cites Work

• A parallel algorithm for computing the polar decomposition
• The matrix sign decomposition and its relation to the polar decomposition
• Numerical behaviour of Higham's scaled method for polar decomposition
• Generalized inverses. Theory and applications.
• Algorithms for the Polar Decomposition
• Fast Polar Decomposition of an Arbitrary Matrix
• Computing the Polar Decomposition—with Applications
• On Scaling Newton’s Method for Polar Decomposition and the Matrix Sign Function
• New Perturbation Bounds for Unitary Polar Factors
• Computing the Polar Decomposition and the Matrix Sign Decomposition in Matrix Groups
• Polar Decomposition and Matrix Sign Function Condition Estimates

This page was built for publication: The iterative methods for computing the polar decomposition of rank-deficient matrix