You are here: MIMS > EPrints
MIMS EPrints

2006.161: Fast polar decomposition of an arbitrary matrix

2006.161: Nicholas J. Higham and Robert S. Schreiber (1990) Fast polar decomposition of an arbitrary matrix. SIAM Journal on Scientific and Statistical Computing, 11 (4). pp. 648-655. ISSN 1095-7197

Full text available as:

PDF - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader
818 Kb

Official URL:


The polar decomposition of an $m \times n$ matrix $A$ of full rank, where $m \geqq n$, can be computed using a quadratically convergent algorithm of Higham [SIAM J. Sci. Statist. Comput., 7(1986), pp. 1160–1174]. The algorithm is based on a Newton iteration involving a matrix inverse. It is shown how, with the use of a preliminary complete orthogonal decomposition, the algorithm can be extended to arbitrary $A$. The use of the algorithm to compute the positive semidefinite square root of a Hermitian positive semidefinite matrix is also described. A hybrid algorithm that adaptively switches from the matrix inversion based iteration to a matrix multiplication based iteration due to Kovarik, and to Björck and Bowie, is formulated. The decision when to switch is made using a condition estimator. This “matrix multiplication rich” algorithm is shown to be more efficient on machines for which matrix multiplication can be executed 1.5 times faster than matrix inversion.

Item Type:Article
Uncontrolled Keywords:polar decomposition, complete orthogonal decomposition, matrix square root, matrix multiplication, Schulz iteration, condition estimator
Subjects:MSC 2000 > 15 Linear and multilinear algebra; matrix theory
MSC 2000 > 65 Numerical analysis
MIMS number:2006.161
Deposited By:Miss Louise Stait
Deposited On:30 June 2006

Download Statistics: last 4 weeks
Repository Staff Only: edit this item