Solving Polynomials with Small Leading Coefficients

Authors:
Gudbjörn F. Jónsson;Stephen Vavasis
Affiliations:
-;-
Venue:
SIAM Journal on Matrix Analysis and Applications
Year:
2005

Citing 0
Cited 6

Block LU factors of generalized companion matrix pencils

Theoretical Computer Science
New progress in real and complex polynomial root-finding

Computers & Mathematics with Applications
Efficient polynomial root-refiners: A survey and new record efficiency estimates

Computers & Mathematics with Applications
An improved non-linear method for the computation of a structured low rank approximation of the Sylvester resultant matrix

Journal of Computational and Applied Mathematics
Using implicit equations of parametric curves and surfaces without computing them: Polynomial algebra by values

Computer Aided Geometric Design
Resultant matrices and the computation of the degree of an approximate greatest common divisor of two inexact Bernstein basis polynomials

Computer Aided Geometric Design

Quantified Score

Hi-index	0.01

Visualization

Abstract

We explore the computation of roots of polynomials via eigenvalue problems. In particular, we look at the case when the leading coefficient is relatively very small. We argue that the companion matrix algorithm (used, for instance, by the Matlab {\tt roots} function) is inaccurate in this case. The accuracy problem is addressed by using matrix pencils instead. This improvement can be predicted from the backward error bound of Edelman and Murakami (for companion matrices) versus the bound of Van Dooren and Dewilde (for pencils). We then show how to extend the accurate algorithm to Bézier polynomials and present computational experiments.