Volume 12, pp. 66-87, 2001.

Numerical condition of polynomials in different forms

Hong Zhang

Abstract

The zeros of high-degree polynomials are notoriously sensitive to changes in the coefficients, causing problems for available zero-finding software. In this paper, we study how this sensitivity depends on the polynomial representation. We first extend the algebraic characterization of polynomial pseudozero sets from the power basis to general bases. We show that for a polynomial, the numerical conditions of its values and zeros are closely related and can be visualized simultaneously by its pseudozero sets. Comparing the pseudozero sets on a set of testing polynomials in the power, Taylor, Chebyshev, and Bernstein bases reveals that appropriate representation of polynomials gives rise to locally well-conditioned zeros, which then leads to an Iterative Refinement Algorithm that combines symbolic formulation with numeric processing to reduce computational errors of polynomial zeros located in the region of interest.

Full Text (PDF) [733 KB]

Key words

polynomial equation, polynomial basis, pseudozero set, iterative refinement algorithm.

AMS subject classifications

65F35.

ETNA articles which cite this article

Vol. 17 (2004), pp. 195-205 Dario A. Bini, Luca Gemignani, and Victor Y. Pan: Improved initialization of the accelerated and robust QR-like polynomial root-finding

< Back