One of the numerically stable methods to calculate he Squire root of a matrix is the Newton’s Method, but it has the disadvantage that in each iteration it is necessary to solve a Sylvester’s matrix equation for full matrix, which is computationally expensive. Modifications to the method have been made, resulting a pair of simplified iterations, but it has been proved, through the perturbations theory, that these are numerically unstable. In this article, a simplified alternative iteration of Newton’s Method for the calculation of the square root of a positive definite real matrix is presented, which is attractive for being convergent, computationally economic and, for practical purposes, numerically stable.

Full document

The PDF file did not load properly or your web browser does not support viewing PDF files. Download directly to your device: Download PDF document
Back to Top

Document information

Published on 01/01/10
Accepted on 01/01/10
Submitted on 01/01/10

Volume 26, Issue 1, 2010
Licence: CC BY-NC-SA license

Document Score


Views 6
Recommendations 0

Share this document

claim authorship

Are you one of the authors of this document?