论文信息 - Algorithms for solvents of matrix polynomials

Algorithms for solvents of matrix polynomials

In an earlier paper we developed the algebraic theory of matrix polynomials. Here we introduce two algorithms for computing “dominant” solvents. Global convergence of the algorithms under certain conditions is established.

[1] Joseph F. Traub,et al. A class of globally convergent iteration functions for the solution of polynomial equations , 1966 .

[2] M. A. Jenkins,et al. A three-stage variable-shift iteration for polynomial zeros and its relation to generalized rayleigh iteration , 1970 .

[3] J. Dennis,et al. On the Matrix Polynomial, Lambda-Matrix and Block Eigenvalue Problems , 1971 .

[4] Peter Lancaster,et al. Algorithms for lambda-matrices , 1964 .

[5] Joseph F. Traub,et al. The Algebraic Theory of Matrix Polynomials , 1976 .