A power method for computing square roots of complex matrices. (English) Zbl 0893.65028

Some higher-order convergent methods for computing square roots of nonsingular complex matrices are derived. These methods are globally convergent and are based on eigenvalue shifting and powering. It is shown that for each positive integer \(r\geq 2\), a convergent method of order \(r\) can be developed.


65F30 Other matrix algorithms (MSC2010)
15A24 Matrix equations and identities
Full Text: DOI


[1] Higham, N. J., Computing real square roots of a real matrix, Linear Algebra Appl., 88/89, 405-430 (1987) · Zbl 0625.65032
[2] Higham, N. J., Newton’s method for the matrix square root, Math. Comp., 46, 537-549 (1986) · Zbl 0614.65045
[3] Denman, E. D., Roots of real matrices, Linear Algebra Appl., 36, 133-139 (1981) · Zbl 0455.65031
[4] Shieh, L. S.; Chahin, N., A computer-aided method for the factorization of matrix polynomials, Appl. Math. Comput., 2, 63-94 (1976)
[5] Denman, E. D.; Beavers, A. N., The matrix sign function and computation of systems, Appl. Math. Comput., 2, 63-94 (1976) · Zbl 0398.65023
[6] Bjorck, A.; Hammarling, S., A Schur method for the square root of a matrix, Linear Algebra Appl., 52/53, 127-140 (1983) · Zbl 0515.65037
[7] Hoskins, W. D.; Walton, D. J., A fast method of computing the square root of a matrix, IEEE Trans. Automat. Control, AC-23, 494-495 (1978) · Zbl 0378.65028
[8] Hoskins, W. D.; Walton, D. J., A fast, more stable method for computing the \(p\), Linear Algebra Appl., 26, 139-163 (1979) · Zbl 0407.65017
[9] Henrici, P., Applied and Computational Complex Analysis (1974), Wiley: Wiley New York
[10] Householder, A. S., The Numerical Treatment of a Single Nonlinear Equation (1970), McGraw-Hill: McGraw-Hill New York · Zbl 0242.65047
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.