Resumen
This paper addresses the numerical solution of the matrix square root problem. Two fixed point iterations are proposed by rearranging the nonlinear matrix equation A − X2 = 0 and incorporating a positive scaling parameter. The proposals only need to compute one matrix inverse and at most two matrix multiplications per iteration. A global convergence result is established. The numerical comparisons versus some existing methods from the literature, on several test problems, demonstrate the efficiency and effectiveness of our proposals.
Idioma original | Inglés |
---|---|
Páginas (desde-hasta) | 295-308 |
Número de páginas | 14 |
Publicación | Fixed Point Theory |
Volumen | 24 |
N.º | 1 |
DOI | |
Estado | Publicada - 1 feb. 2023 |
Publicado de forma externa | Sí |