Abstract
For the polar decomposition of a square nonsingular matrix, Higham [SIAM J. Sci. Statist. Comput., 7 (1986), pp. 1160–1174] has given a reliable quadratically convergent algorithm that is based on Newton's iteration. Motivated by Halley's iteration, the author constructs a new family of methods that contains both methods (Higham's and Halley's) as special cases. These methods generalize to rectangular matrices and some of them are also useful in computing the polar decomposition of rank deficient matrices.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
