A matrix S is a solvent of the matrix polynomial $M(X) = A_0 X^m + \cdots + A_m $ if $M(S) = 0$ where $A_i ,X,S$ are square matrices. In this paper we develop the algebraic theory of matrix… Expand

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… Expand

Abstract : A matrix S is a solvent of the matrix polynomial M(X) identically equal to X sup m + A(sub 1) X sup(M - 1) + ... + A sub m, if M(S) = 0, where A sub i, X and S are square matrices. The… Expand

This paper is a short introduction to computer-aided content analysis in which words or phrases are the basic units. The advantages of computer-aided content analysis are noted and some general… Expand