A sixth-order iterative method for approximating the polar decomposition of an arbitrary matrix

DOI10.1016/j.cam.2015.12.006zbMath1357.65037OpenAlexW2192506139MaRDI QIDQ507932

Alicia Cordero, Juan Ramón Torregrosa Sánchez

Publication date: 9 February 2017

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

Full work available at URL: http://hdl.handle.net/10251/105525

zbMATH Keywords

convergencesingular value decompositioniterative methodHermitian matrixpolar decompositionmatrix iterationnumerical testunitary factor

Mathematics Subject Classification ID

Numerical solutions to overdetermined systems, pseudoinverses (65F20) Iterative numerical methods for linear systems (65F10)

Related Items (1)

An iteration scheme for contraction mappings with an application to synchronization of discrete logistic maps

Cites Work

• Unnamed Item
• The matrix sign decomposition and its relation to the polar decomposition
• The iterative methods for computing the polar decomposition of rank-deficient matrix
• On a fourth-order matrix method for computing polar decomposition
• Variants of Newton's method using fifth-order quadrature formulas
• Algorithms for the Polar Decomposition
• A Family of Rational Iterations and Its Application to the Computation of the Matrix pth Root
• Matrix Analysis
• Computing the Polar Decomposition—with Applications
• On Scaling Newton’s Method for Polar Decomposition and the Matrix Sign Function

This page was built for publication: A sixth-order iterative method for approximating the polar decomposition of an arbitrary matrix