Is the Polar Decomposition Finitely Computable?
From MaRDI portal
Publication:4880258
DOI10.1137/S0895479894274541zbMath0853.65046OpenAlexW1986995983MaRDI QIDQ4880258
Khakim D. Ikramov, Alan George
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
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (2)
Computing Fundamental Matrix Decompositions Accurately via the Matrix Sign Function in Two Iterations: The Power of Zolotarev's Functions ⋮ Effective algorithms for decomplexifying a matrix by unitary similarities or congruences
This page was built for publication: Is the Polar Decomposition Finitely Computable?
