Accurate evaluation of Chebyshev polynomials in floating-point arithmetic

DOI10.1007/s10543-018-0738-5zbMath1415.65052OpenAlexW2900397130MaRDI QIDQ1999710

Tomasz Hrycak, Sebastian Schmutzhard

Publication date: 27 June 2019

Published in: BIT (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10543-018-0738-5

zbMATH Keywords

Chebyshev polynomialsrecurrencefloating-point arithmetic

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)

Uses Software

• mctoolbox
• DLMF

Cites Work

• Evaluation of Chebyshev polynomials by a three-term recurrence in floating-point arithmetic
• Underflow and the Reliability of Numerical Software
• Accuracy and Stability of Numerical Algorithms
• Another Characterization of the Classical Orthogonal Polynomials
• Unnamed Item
• Unnamed Item

This page was built for publication: Accurate evaluation of Chebyshev polynomials in floating-point arithmetic