Resumen de Iterative methods for computing the matrix square root

Sergio Amat Plata, José Antonio Ezquerro Fernández, Miguel Angel Hernández Verón

• This paper is devoted to the approximation of the square root of a matrix. We present a family of any order of convergence as a generalization of the classical Newton and Chebychev methods. The semilocal convergence of the family is presented. After an analysis of the efficiency, we conclude that the most efficient method depends on the matrix and on the implementation way.