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

DOI10.1007/S10543-017-0683-8MaRDI QIDQ1647657zbMATH OpenOpenAlexFDO

Authors Tomasz Hrycak, Sebastian Schmutzhard

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

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

Recommendations

• Accurate evaluation of Chebyshev polynomials in floating-point arithmetic
• Error bounds for the numerical evaluation of Legendre polynomials by a three-term recurrence
• The three-term recursion for Chebyshev polynomials is mixed forward-backward stable
• Evaluation of Legendre polynomials by a three-term recurrence in floating-point arithmetic
• Accurate evaluation of a polynomial in Chebyshev form

Cites work

• scientific article; zbMATH DE number 3245839 (Why is no real title available?)
• scientific article; zbMATH DE number 3273551 (Why is no real title available?)
• A fast algorithm for evaluation of normalized Hermite functions
• Accuracy and Stability of Numerical Algorithms
• An Error Analysis of the Modified Clenshaw Method for Evaluating Chebyshev and Fourier Series
• Error analysis of an algorithm for summing certain finite series
• NIST handbook of mathematical functions
• The three-term recursion for Chebyshev polynomials is mixed forward-backward stable

Cited in

(8)

• Inequalities involving Gegenbauer polynomials and their tangent lines
• Evaluation of Legendre polynomials by a three-term recurrence in floating-point arithmetic
• Rounding error analysis of linear recurrences using generating series
• Error bounds for the numerical evaluation of Legendre polynomials by a three-term recurrence
• Accurate evaluation of Chebyshev polynomials in floating-point arithmetic
• scientific article; zbMATH DE number 1543291 (Why is no real title available?)
• Enclosing Chebyshev expansions in linear time
• The three-term recursion for Chebyshev polynomials is mixed forward-backward stable

Describes a project that uses

Uses Software

• Chebfun
• mctoolbox
• DLMF

This page was built for publication: Evaluation of Chebyshev polynomials by a three-term recurrence in floating-point arithmetic

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1647657)