论文信息 - A faster, more stable method for computing the pth roots of positive definite matrices

A faster, more stable method for computing the pth roots of positive definite matrices

Abstract An accelerated, more stable generalization of Newton's method for finding matrix p th roots is developed in a form suitable for finding the positive definite p th root of a positive definite matrix. Numerical examples are given and compared with the corresponding Newton iterates.

W. D. Hoskins | D. J. Walton

[1] L. Fox. An introduction to numerical linear algebra , 1964 .

[2] D. Walton,et al. A faster method of computing the square root of a matrix , 1978 .

[3] E. Denman,et al. The matrix sign function and computations in systems , 1976 .

[4] F. T. Man. A High-Order Method of Solution for the Lyapunov Matrix Equation , 1971, Comput. J..

[5] A. Ostrowski. Solution of equations in Euclidean and Banach spaces , 1973 .