The Algebraic Theory of Matrix Polynomials

Dennis Jr., J.E.; Traub, Joseph F.; Weber, R.P.

A matrix S is a solvent of the matrix polynomial M(X)=A₀Xᵐ +...+ Am if M(S)=O where A, X, and S are square matrices. In this paper we develop the algebraic theory of matrix polynomials and solvents. We define division and interpolation, investigate the properties of block Vandermonde matrices, and define and study the existence of a complete set of solvents. We study the relation between the matrix polynomial problem and the lambda-matrix problem, which is to find a scalar
A₀λᵐ + A₁λᵐ⁻¹ +...+ Am is singular. In a future paper we extend Traub’s algorithm for calculating zeros of scalar polynomials to matrix polynomials and establish global convergence properties of this algorithm for a class of matrix polynomials.


  • thumnail for Traub__algebraic_theory_of_matrix_polynomials.pdf Traub__algebraic_theory_of_matrix_polynomials.pdf application/pdf 1.3 MB Download File

Also Published In

SIAM Journal on Numerical Analysis

More About This Work

Academic Units
Computer Science
Published Here
October 10, 2013