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.











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)