Addendum: Is The Polar Decomposition Finitely Computable?
From MaRDI portal
Publication:3126201
DOI10.1137/S0895479896303260zbMath0870.65037OpenAlexW2088724424MaRDI QIDQ3126201
Alan George, Khakim 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
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (3)
Computing Fundamental Matrix Decompositions Accurately via the Matrix Sign Function in Two Iterations: The Power of Zolotarev's Functions ⋮ A heuristic rational algorithm for checking the congruence of normal matrices ⋮ Solving the two-dimensional CIS problem by a rational algorithm
This page was built for publication: Addendum: Is The Polar Decomposition Finitely Computable?
