An optimum iteration for the matrix polar decomposition

MaRDI QIDQ1292261zbMATH OpenFDO

Authors A. A. Dubrulle

Publication date 21 June 1999

Published in ETNA - Electronic Transactions on Numerical Analysis (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/120380, http://www.emis.de/journals/ETNA/vol.8.1999/pp21-25.dir/pp21-25.html

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

Newton iterationfull-rank rectangular matricesmatrix polar decomposition

Mathematics Subject Classification ID

Numerical computation of matrix norms, conditioning, scaling (65F35)

Recommendations

• Computing the Polar Decomposition—with Applications
• Algorithms for the Polar Decomposition
• On a fourth-order matrix method for computing polar decomposition
• A note on computing the polar decomposition
• New numerical methods for computing the polar decomposition

Cited in

(9)

• Optimizing Halley's Iteration for Computing the Matrix Polar Decomposition
• On a fourth-order matrix method for computing polar decomposition
• A parallel algorithm for computing the polar decomposition
• Iterative computation of the Fréchet derivative of the polar decomposition
• A class of iterative methods for computing polar decomposition
• Computing the Polar Decomposition—with Applications
• On iterative algorithms for the polar decomposition of a matrix and the matrix sign function
• Time-stepping and preserving orthonormality
• A New Scaling for Newton's Iteration for the Polar Decomposition and its Backward Stability

This page was built for publication: An optimum iteration for the matrix polar decomposition

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1292261)