Addendum: Is The Polar Decomposition Finitely Computable?

DOI10.1137/S0895479896303260MaRDI QIDQ3126201zbMATH OpenOpenAlexFDO

Authors Alan George, Kh. D. Ikramov

Publication date 28 July 1997

Published in SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/s0895479896303260

zbMATH Keywords

complex matrixfinite computationpolar decompositionsquare root

Mathematics Subject Classification ID

Factorization of matrices (15A23)

Recommendations

• Is the Polar Decomposition Finitely Computable?
• A note on computing the polar decomposition
• scientific article; zbMATH DE number 962110
• An algorithm to compute the polar decomposition of a \(3 \times 3\) matrix

Cited in

(5)

• Solving the two-dimensional CIS problem by a rational algorithm
• A heuristic rational algorithm for checking the congruence of normal matrices
• A simple proof of the polar decomposition theorem
• Computing Fundamental Matrix Decompositions Accurately via the Matrix Sign Function in Two Iterations: The Power of Zolotarev's Functions
• Is the Polar Decomposition Finitely Computable?

This page was built for publication: Addendum: Is The Polar Decomposition Finitely Computable?

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