Iterative methods for computing the matrix square root

• Amat Plata, Sergio ^[1] ; Ezquerro Fernández, José Antonio ^[2] ; Hernández Verón, Miguel Angel ^[2]
  1. [1] Universidad Politécnica de Cartagena

     Universidad Politécnica de Cartagena

     Cartagena, España

     
  2. [2] Universidad de La Rioja

     Universidad de La Rioja

     Logroño, España

     
• Localización: SeMA Journal: Boletín de la Sociedad Española de Matemática Aplicada, ISSN-e 2254-3902, ISSN 2254-3902, Vol. 70, Nº. 1, 2015-10, págs. 11-21
• Idioma: inglés
• DOI: 10.1007/S40324-015-0038-9
• Texto completo no disponible (Saber más ...)
• Resumen

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