Academic Commons


Algorithms for Solvents of Matrix Polynomials

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

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.


  • thumnail for Traub__algorithms_for_solvents_of_matrix_polynomials.pdf Traub__algorithms_for_solvents_of_matrix_polynomials.pdf application/pdf 791 KB Download File

Also Published In

SIAM Journal on Numerical Analysis

More About This Work

Academic Units
Computer Science
Published Here
October 10, 2013
Academic Commons provides global access to research and scholarship produced at Columbia University, Barnard College, Teachers College, Union Theological Seminary and Jewish Theological Seminary. Academic Commons is managed by the Columbia University Libraries.