If A is a square matrix of order n and I is the unit matrix, the equation in X obtained by equating to zero the determinant \A— \l\ is called the characteristic equation of A. The roots of this equation are called the characteristic roots of A. Although it is not possible to make any definite statement as to the nature of the characteristic roots of the general algebraic matrix A, several autho...

Univariate polynomial root-finding is both classical and important for modern computing. Frequently one seeks just the real roots of a polynomial with real coefficients. They can be approximated at a low computational cost if the polynomial has no nonreal roots, but typically nonreal roots are much more numerous than the real ones. We dramatically accelerate the known algorithms in this case by...

Effects of soil matrix potential on longevity of egg masses of Meloidogyne incognita were determined during simulated winter conditions. Egg masses were recovered from isolated root fragments incubated in field soil at matrix potentials of -0.1, -0.3, -1.0, and -4.0 bars throughout winter survival periods of 10 weeks for tomato roots and 12 weeks for cotton roots. Egg masses were more superfici...

In this paper we explore two sets of polynomials, the orthogonal polynomi-als and the residual polynomials, associated with a preconditioned conjugate gradient iteration for the solution of the linear system Ax = b. In the context of preconditioning by the matrix C, we show that the roots of the orthogonal polynomials, also known as generalized Ritz values, are the eigenvalues of an orthogonal ...

It is proved that the roots of combinations of matrix polynomials with real roots can be recast as eigenvalues of combinations of real symmetric matrices, under certain hypotheses. The proof is based on recent solution of the Lax conjecture. Several applications and corollaries, in particular concerning hyperbolic matrix polynomials, are presented.