A note on computing the matrix square root (Q2504778)

The author provides a direct derivation of Meini's algorithm from Newton's iteration. The obtained algorithm computes iteratively the principal root of a matrix with no non-positive real eigenvalues. The first order error analysis shows good numerical properties of the algorithm. In some cases, the convergence can be substantially improved by a suitable scaling. The numerical experiments illustrate the effects of this scaling.