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.
No takes yet. Share an insight, caveat, or question.
Dennis et al. (1978) studied this question.
Synapse has enriched 5 related papers. Consider them for comparative context: