A General Condition Number for Polynomials


This paper presents a generic condition number for polynomials that is useful for polynomial evaluation of a finite series of polynomial basis defined by means of a linear recurrence. This expression extends the classical one for the power and Bernstein bases, but it also provides us a general framework for all the families of orthogonal polynomials like Chebyshev, Legendre, Gegenbauer, Jacobi, and Sobolev orthogonal polynomial bases. The standard algorithm for the evaluation of finite series in any of these polynomial bases is the extended Clenshaw algorithm. The use of this new condition number permits us to give a general theorem about the forward error for that evaluation algorithm. A running-error bound of the extended algorithm is also presented and all the bounds are compared in several numerical examples

Similar works

Full text


Repositorio Universidad de Zaragoza

Provided a free PDF

This paper was published in Repositorio Universidad de Zaragoza.

Having an issue?

Is data on this page outdated, violates copyrights or anything else? Report the problem now and we will take corresponding actions after reviewing your request.