An optimum iteration for the matrix polar decomposition
From MaRDI portal
(Redirected from Publication:1292261)
The author shows that an acceleration parameter (derived from the Frobenius norm) makes Newton's iteration for the computation of the polar decomposition optimal and monotonic with respect to the associated norm. An application to full-rank rectangular matrices \(A\in \mathbb{R}^{m\times n}\) is also given.
Recommendations
Cited in
(9)- A parallel algorithm for computing the polar decomposition
- On a fourth-order matrix method for computing polar decomposition
- Optimizing Halley's Iteration for Computing the Matrix Polar Decomposition
- A New Scaling for Newton's Iteration for the Polar Decomposition and its Backward Stability
- Computing the Polar Decomposition—with Applications
- Iterative computation of the Fréchet derivative of the polar decomposition
- A class of iterative methods for computing polar decomposition
- On iterative algorithms for the polar decomposition of a matrix and the matrix sign function
- Time-stepping and preserving orthonormality
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)