Year: 2014
Type: report
Abstract: 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 exploiting the correlation between the computations with matrices and polynomials, extending the techniques of the matrix sign iteration, and exploiting the structure of the companion matrix of the input polynomial.
Author: Victor Y. Pan
Institution: City University of New York
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
Funder: National Science Foundation
OpenAlex ID: W2211613637
