Gander, Walter Algorithms for the polar decomposition. (English) Zbl 0722.65021 SIAM J. Sci. Stat. Comput. 11, No. 6, 1102-1115 (1990). A new family of iterative methods for the polar decomposition of rectangular matrices is proposed. The new methods converge globally and, like N. J. Higham’s method for square matrices [SIAM J. Sci. Stat. Comput. 7, 1160-1174 (1986; Zbl 0607.65014)] only matrix operations that vectorize and parallelize well are used. A listing of the computer program is supplied. Reviewer: S.Zlobec (Montreal) Cited in 9 Documents MSC: 65F20 Numerical solutions to overdetermined systems, pseudoinverses 65F30 Other matrix algorithms (MSC2010) 65Y05 Parallel numerical computation 15-04 Software, source code, etc. for problems pertaining to linear algebra 15A23 Factorization of matrices Keywords:iterative methods; polar decomposition; rectangular matrices; computer program Citations:Zbl 0607.65014 PDFBibTeX XMLCite \textit{W. Gander}, SIAM J. Sci. Stat. Comput. 11, No. 6, 1102--1115 (1990; Zbl 0722.65021) Full Text: DOI Link