论文信息 - On a fourth-order matrix method for computing polar decomposition

On a fourth-order matrix method for computing polar decomposition

The purpose of this article is to study the construction of a higher-order matrix method for computing polar decomposition of any arbitrary matrix. It is shown analytically that the new method is convergent and possesses fourth order. The results of the paper are illustrated by numerical examples.

Fazlollah Soleymani | Farhad Khaksar Haghani

[1] Alicia Cordero,et al. On improved three-step schemes with high efficiency index and their dynamics , 2013, Numerical Algorithms.

[2] N. Higham. Computing the polar decomposition with applications , 1986 .

[3] Frobenius Iteration for the Matrix Polar Decomposition , 1994 .

[4] Nicholas J. Higham,et al. Computing the Polar Decomposition and the Matrix Sign Decomposition in Matrix Groups , 2004, SIAM J. Matrix Anal. Appl..

[5] N. Higham. Functions of Matrices: Theory and Computation (Other Titles in Applied Mathematics) , 2008 .

[6] K. Zietak,et al. Approximation of Matrices and a Family of Gander Methods for Polar Decomposition , 2006 .

[7] Adi Ben-Israel,et al. Generalized inverses: theory and applications , 1974 .

[8] Kui Du. The iterative methods for computing the polar decomposition of rank-deficient matrix , 2005, Appl. Math. Comput..

[9] Nicholas J. Higham,et al. Functions of matrices - theory and computation , 2008 .

[10] N. Higham. The matrix sign decomposition and its relation to the polar decomposition , 1994 .

[11] L. Autonne. Sur les groupes linéaires, réels et orthogonaux , 1902 .

[12] Alan J. Laub,et al. On Scaling Newton's Method for Polar Decomposition and the Matrix Sign Function , 1990, 1990 American Control Conference.

[13] W. Gander. On Halley's Iteration Method , 1985 .

[14] Walter Gander,et al. Algorithms for the Polar Decomposition , 1990, SIAM J. Sci. Comput..