On a new family of high‐order iterative methods for the matrix pth root |
| |
Authors: | S. Amat J. A. Ezquerro M. A. Hernández‐Verón |
| |
Affiliation: | 1. Departamento de Matemática Aplicada y Estadística, Universidad Politécnica de Cartagena, Cartagena, Spain;2. Department of Mathematics and Computation, University of La Rioja, Logro?o, Spain |
| |
Abstract: | The main goal of this paper is to approximate the principal pth root of a matrix by using a family of high‐order iterative methods. We analyse the semi‐local convergence and the speed of convergence of these methods. Concerning stability, it is well known that even the simplified Newton method is unstable. Despite it, we present stable versions of our family of algorithms. We test numerically the methods: we check the numerical robustness and stability by considering matrices that are close to be singular and badly conditioned. We find algorithms of the family with better numerical behavior than the Newton and the Halley methods. These two algorithms are basically the iterative methods proposed in the literature to solve this problem. Copyright © 2015 John Wiley & Sons, Ltd. |
| |
Keywords: | matrix pth root iterative method order of convergence stability semilocal convergence |
|
|