Evaluation of Chebyshev polynomials by a three-term recurrence in floating-point arithmetic

DOI10.1007/s10543-017-0683-8zbMath1477.65046OpenAlexW2755037429MaRDI QIDQ1647657

Sebastian Schmutzhard, Tomasz Hrycak

Publication date: 26 June 2018

Published in: BIT (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10543-017-0683-8

zbMATH Keywords

Chebyshev polynomialsfloating-point arithmeticthree-term recurrenceupper and lower error bound

Mathematics Subject Classification ID

Roundoff error (65G50) Computation of special functions and constants, construction of tables (65D20) Numerical approximation and evaluation of special functions (33F05) Numerical aspects of recurrence relations (65Q30)

Related Items

Rounding error analysis of linear recurrences using generating series, Accurate evaluation of Chebyshev polynomials in floating-point arithmetic, Error bounds for the numerical evaluation of Legendre polynomials by a three-term recurrence, Enclosing Chebyshev Expansions in Linear Time, Inequalities involving Gegenbauer polynomials and their tangent lines

Uses Software

• mctoolbox
• DLMF
• Chebfun

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The three-term recursion for Chebyshev polynomials is mixed forward-backward stable
• A fast algorithm for evaluation of normalized Hermite functions
• An Error Analysis of the Modified Clenshaw Method for Evaluating Chebyshev and Fourier Series
• Accuracy and Stability of Numerical Algorithms
• Error analysis of an algorithm for summing certain finite series