%0 Journal Article %1 Higham:1986:CPD:13513.13520 %A Higham, Nicholas J %C Philadelphia, PA, USA %D 1986 %I Society for Industrial and Applied Mathematics %J SIAM J. Sci. Stat. Comput. %K matrix polar_decomposition %P 1160--1174 %R 10.1137/0907079 %T Computing the polar decomposition with applications %U http://portal.acm.org/citation.cfm?id=13513.13520 %V 7 %X A quadratically convergent Newton method for computing the polar decomposition of a full-rank matrix is presented and analysed. Acceleration parameters are introduced so as to enhance the initial rate of convergence and it is shown how reliable estimates of the optimal parameters may be computed in practice. To add to the known best approximation property of the unitary polar factor, the Hermitian polar factor $H$ of a nonsingular Hermitian matrix $A$ is shown to be a good positive definite approximation to $A$and $12(A + H)$ is shown to be a best Hermitian positive semi-definite approximation to $A$. Perturbation bounds for the polar factors are derived. Applications of the polar decomposition to factor analysis, aerospace computations and optimisation are outlined; and a new method is derived for computing the square root of a symmetric positive definite matrix.

@article{Higham:1986:CPD:13513.13520, abstract = {A quadratically convergent Newton method for computing the polar decomposition of a full-rank matrix is presented and analysed. Acceleration parameters are introduced so as to enhance the initial rate of convergence and it is shown how reliable estimates of the optimal parameters may be computed in practice. To add to the known best approximation property of the unitary polar factor, the Hermitian polar factor $H$ of a nonsingular Hermitian matrix $A$ is shown to be a good positive definite approximation to $A$and $\frac{1}{2}(A + H)$ is shown to be a best Hermitian positive semi-definite approximation to $A$. Perturbation bounds for the polar factors are derived. Applications of the polar decomposition to factor analysis, aerospace computations and optimisation are outlined; and a new method is derived for computing the square root of a symmetric positive definite matrix.}, acmid = {13520}, added-at = {2011-03-01T21:26:53.000+0100}, address = {Philadelphia, PA, USA}, author = {Higham, Nicholas J}, biburl = {https://www.bibsonomy.org/bibtex/2186936c1d1f9e3e9bd820de84aeb6b7b/ytyoun}, doi = {10.1137/0907079}, interhash = {cbb3025b3f29677b86a92cf9f64b52ec}, intrahash = {186936c1d1f9e3e9bd820de84aeb6b7b}, issn = {0196-5204}, issue = {4}, journal = {SIAM J. Sci. Stat. Comput.}, keywords = {matrix polar_decomposition}, month = {October}, numpages = {15}, pages = {1160--1174}, publisher = {Society for Industrial and Applied Mathematics}, timestamp = {2011-10-01T07:35:55.000+0200}, title = {Computing the polar decomposition with applications}, url = {http://portal.acm.org/citation.cfm?id=13513.13520}, volume = 7, year = 1986 }