[2] Univ La Rioja, Dept Matemat & Comp, Logrono, Spain
来源:
JOURNAL OF COMPUTATIONAL MATHEMATICS
|
2024年
关键词:
Matrix p-th root;
Incremental Newton method;
Chebyshev's method;
Order of convergence;
Convergence;
Efficiency;
SCHUR-PADE ALGORITHM;
FRACTIONAL-POWERS;
NEWTON METHOD;
PTH ROOTS;
D O I:
10.4208/jcm.2406-m2024-0017
中图分类号:
O29 [应用数学];
学科分类号:
070104 ;
摘要:
The aim of this paper is to present an improvement of the incremental Newton method proposed by Iannazzo [SIAM J. Matrix Anal. Appl., 28:2 (2006), 503-523] for approximating the principal pp-th root of a matrix. We construct and analyze an incremental Chebyshev method with better numerical behavior. We present a convergence and numerical analysis of the method, where we compare it with the corresponding incremental Newton method. The new method has order of convergence three and is stable and more efficient than the incremental Newton method.