Is the Polar Decomposition Finitely Computable?

DOI10.1137/S0895479894274541MaRDI QIDQ4880258zbMATH OpenOpenAlexFDO

Authors Alan George, Kh. D. Ikramov

Publication date 4 June 1996

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

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

zbMATH Keywords

polar decompositionsquare rootcomplex matrixfinite computation

Mathematics Subject Classification ID

Factorization of matrices (15A23)

Recommendations

• Addendum: Is The Polar Decomposition Finitely Computable?
• Computing the Polar Decomposition—with Applications
• A note on computing the polar decomposition
• Algebraic Polar Decomposition

Cited in

(5)

• Computing Fundamental Matrix Decompositions Accurately via the Matrix Sign Function in Two Iterations: The Power of Zolotarev's Functions
• Algebraic Polar Decomposition
• Effective algorithms for decomplexifying a matrix by unitary similarities or congruences
• On the explicit determination of the polar decomposition in \(n\)-dimensional vector spaces
• The extraction of the square roots of symmetric sign-indefinite matrices. Polar decomposition version

This page was built for publication: 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 Q4880258)