A class of iterative methods for computing polar decomposition

DOI10.1080/00207160903410481zbMath1211.65050OpenAlexW1988915487MaRDI QIDQ5391477

Hamid Esmaeili

Publication date: 6 April 2011

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207160903410481

zbMATH Keywords

numerical examplesiterative methodsquadratic convergencepolar decomposition

Mathematics Subject Classification ID

Iterative numerical methods for linear systems (65F10) Orthogonalization in numerical linear algebra (65F25)

Cites Work

• Algorithms for the Polar Decomposition
• Computing the Polar Decomposition—with Applications
• Modified Kovarik Algorithm For Approximate Orthogonalization Of Arbitrary Matrices
• Some Iterative Methods for Improving Orthonormality
• A new version of Kovarik’s approximate orthogonalization algorithm without matrix inversion
• Unnamed Item

This page was built for publication: A class of iterative methods for computing polar decomposition