论文信息 - The polar decomposition— properties, applications and algorithms

The polar decomposition— properties, applications and algorithms

In the paper we review the numerical methods for computing the polar decomposition of a matrix. Numerical tests comparing these methods are included. Moreover, the applications of the polar decomposition and the most important its properties are mentioned.

K. Zietak | P. Zieliński

[1] K. Fan. Some matrix inequalities , 1966 .

[2] Kenneth A. Fegley,et al. Orthogonalization Techniques of a Direction Cosine Matrix , 1969, IEEE Transactions on Aerospace and Electronic Systems.

[3] Å. Björck,et al. An Iterative Algorithm for Computing the Best Estimate of an Orthogonal Matrix , 1971 .

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

[5] R. Byers. Solving the algebraic Riccati equation with the matrix sign function , 1987 .

[6] Anders Barrlund,et al. Perturbation bounds on the polar decomposition , 1990 .

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

[8] R. Bhatia,et al. Approximation by positive operators , 1992 .