Addendum: Is The Polar Decomposition Finitely Computable?

DOI10.1137/S0895479896303260zbMATH Open0870.65037OpenAlexW2088724424MaRDI QIDQ3126201FDOQ3126201

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

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

zbMATH Keywords

polar decompositionsquare rootcomplex matrixfinite computation

Mathematics Subject Classification ID

Factorization of matrices (15A23)

Cited In (4)

• 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
• Solving the two-dimensional CIS problem by a rational algorithm

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)