Ir al contenido

Documat

Resumen de Iterative methods for computing the matrix square root

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

  • 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.

Fundación Dialnet

Mi Documat