On an Incremental Version of the Chebyshev Method for the Matrix P-Th Root
The aim of this paper is to present an improvement of the incremental Newton methodproposed by Iannazzo [SIAM J. Matrix Anal. Appl., 28:2 (2006), 503–523] for approx-imating the principal p-th root of a matrix. We construct and analyze an incrementalChebyshev method with better numerical behavior. W...
| Autores: | ; ; ; ; |
|---|---|
| Tipo de documento: | Artículo |
| Estado: | Published version |
| Fecha de publicación: | 2025 |
| País: | España |
| Institución: | Universidad de La Rioja (UR) |
| Repositorio: | RIUR. Repositorio Institucional de la Universidad de La Rioja |
| OAI Identifier: | oai:portal.dialnet.es:doc/6878df8606ee264191ec4c33 |
| Acceso en línea: | https://investigacion.unirioja.es/documentos/6878df8606ee264191ec4c33 |
| Nivel de acceso: | Acceso abierto |
| Sumario: | The aim of this paper is to present an improvement of the incremental Newton methodproposed by Iannazzo [SIAM J. Matrix Anal. Appl., 28:2 (2006), 503–523] for approx-imating the principal p-th root of a matrix. We construct and analyze an incrementalChebyshev method with better numerical behavior. We present a convergence and nu-merical analysis of the method, where we compare it with the corresponding incrementalNewton method. The new method has order of convergence three and is stable and moreefficient than the incremental Newton method |
|---|