You are here: MIMS > EPrints
MIMS EPrints

2006.184: Stable iterations for the matrix square root

2006.184: Nicholas J. Higham (1997) Stable iterations for the matrix square root. Numerical Algorithms, 15 (2). pp. 227-242. ISSN 1572-9265

Full text available as:

PDF - Archive staff only - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader
191 Kb

DOI: 10.1023/A:1019150005407


Any matrix with no nonpositive real eigenvalues has a unique square root for which every eigenvalue lies in the open right half-plane. A link between the matrix sign function and this square root is exploited to derive both old and new iterations for the square root from iterations for the sign function. One new iteration is a quadratically convergent Schulz iteration based entirely on matrix multiplication; it converges only locally, but can be used to compute the square root of any nonsingular M-matrix. A new Padé iteration well suited to parallel implementation is also derived and its properties explained. Iterative methods for the matrix square root are notorious for suffering from numerical instability. It is shown that apparently innocuous algorithmic modifications to the Padé iteration can lead to instability, and a perturbation analysis is given to provide some explanation. Numerical experiments are included and advice is offered on the choice of iterative method for computing the matrix square root.

Item Type:Article
Uncontrolled Keywords:matrix square root - matrix logarithm - matrix sign function - M-matrix - symmetric positive definite matrix - Padé approximation - numerical stability - Newton''s method - Schulz method - 65F30
Subjects:MSC 2000 > 15 Linear and multilinear algebra; matrix theory
MSC 2000 > 65 Numerical analysis
MIMS number:2006.184
Deposited By:Miss Louise Stait
Deposited On:06 July 2006

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