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.

[1]  James Hardy Wilkinson,et al.  Rounding errors in algebraic processes , 1964, IFIP Congress.

[2]  Nicholas J. Higham,et al.  INVERSE PROBLEMS NEWSLETTER , 1991 .

[3]  Juan Manuel Peña,et al.  Error analysis of corner cutting algorithms , 2004, Numerical Algorithms.

[4]  Walter Gautschi,et al.  The condition of orthogonal polynomials , 1972 .

[5]  James Hardy Wilkinson,et al.  The evaluation of the zeros of ill-conditioned polynomials. Part I , 1959, Numerische Mathematik.

[6]  W. Gautschi.  Questions of Numerical Condition Related to Polynomials , 1978 .

[7]  Walter Gautschi,et al.  The condition of polynomials in power form , 1979 .

[8]  C. W. Clenshaw.  A note on the summation of Chebyshev series , 1955 .

[9]  D. Elliott.  Error analysis of an algorithm for summing certain finite series , 1968, Journal of the Australian Mathematical Society.

[10]  Hong Zhang,et al.  NUMERICAL CONDITION OF POLYNOMIALS IN DIFFERENT FORMS , 2001 .

[11]  Juan Manuel Peña,et al.  Running Relative Error for the Evaluation of Polynomials , 2009, SIAM J. Sci. Comput..

[12]  Roberto Barrio,et al.  Generation and evaluation of orthogonal polynomials in discrete Sobolev spaces II: numerical stability , 2005 .

[13]  Rida T. Farouki,et al.  On the numerical condition of polynomials in Bernstein form , 1987, Comput. Aided Geom. Des..

[14]  Roberto Barrio Gil.  A matrix analysis of the stability of the Clenshaw algorithm , 1998 .

[15]  Roberto Barrio.  A Unified Rounding Error Bound for Polynomial Evaluation , 2003, Adv. Comput. Math..

[16]  L. Trefethen,et al.  Numerical linear algebra , 1997 .

[17]  Gerald Farin,et al.  Curves and surfaces for computer aided geometric design , 1990 .

[18]  Roberto Barrio,et al.  Rounding error bounds for the Clenshaw and Forsythe algorithms for the evaluation of orthogonal polynomial series , 2002 .