Accurate evaluation of a polynomial in Chebyshev form

DOI10.1016/j.amc.2011.04.054zbMath1228.65028OpenAlexW2003604862WikidataQ57704075 ScholiaQ57704075MaRDI QIDQ555368

Fang Su, Hao Jiang, Roberto Barrio, Housen Li, Li-Zhi Cheng, Xiang-Ke Liao

Publication date: 22 July 2011

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2011.04.054

zbMATH Keywords

Chebyshev polynomialsnumerical examplesround-off errorClenshaw algorithmpolynomial evaluationcompensated algorithmerror-free transformation

Mathematics Subject Classification ID

Computation of special functions and constants, construction of tables (65D20) Real polynomials: analytic properties, etc. (26C05) Exponential and trigonometric functions (33B10)

Related Items (7)

High-precision computation: mathematical physics and dynamics ⋮ Accurate quotient-difference algorithm: error analysis, improvements and applications ⋮ Accurate and efficient evaluation of Chebyshev tensor product surface ⋮ Numerical validation of compensated algorithms with stochastic arithmetic ⋮ An accurate algorithm for evaluating rational functions ⋮ Accurate evaluation of polynomials in Legendre basis ⋮ \textsf{ORTHOPOLY}: a library for accurate evaluation of series of classical orthogonal polynomials and their derivatives

Uses Software

• mctoolbox
• LBNL
• XBLAS

Cites Work

• Accurate evaluation of a polynomial and its derivative in Bernstein form
• Algorithms for accurate, validated and fast polynomial evaluation
• Accurate simple zeros of polynomials in floating point arithmetic
• On algorithms for the summation of certain special functions
• Rounding error propagation in polynomial evaluation schemes
• Polynomial evaluation and associated polynomials
• A unified rounding error bound for polynomial evaluation
• Backward stability of Clenshaw's algorithm
• Basis conversions among univariate polynomial representations
• The evaluation of the zeros of ill-conditioned polynomials. I, II
• A floating-point technique for extending the available precision
• Accurate Floating-Point Summation Part II: Sign, K-Fold Faithful and Rounding to Nearest
• An Error Analysis of the Modified Clenshaw Method for Evaluating Chebyshev and Fourier Series
• Accuracy and Stability of Numerical Algorithms
• Accurate Floating-Point Product and Exponentiation
• Accurate Floating-Point Summation Part I: Faithful Rounding
• Design, implementation and testing of extended and mixed precision BLAS
• Error analysis of an algorithm for summing certain finite series
• An error analysis of Goertzel's (Watt's) method for computing Fourier coefficients
• Accurate Sum and Dot Product
• Numerical condition of polynomials in different forms
• Rounding error bounds for the Clenshaw and Forsythe algorithms for the evaluation of orthogonal polynomial series
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Accurate evaluation of a polynomial in Chebyshev form