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

DOI10.1007/S10543-017-0683-8zbMATH Open1477.65046OpenAlexW2755037429MaRDI QIDQ1647657FDOQ1647657

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

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

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)

Cites Work

• NIST handbook of mathematical functions
• Title not available (Why is that?)
• Title not available (Why is that?)
• Accuracy and Stability of Numerical Algorithms
• The three-term recursion for Chebyshev polynomials is mixed forward-backward stable
• Error analysis of an algorithm for summing certain finite series
• An Error Analysis of the Modified Clenshaw Method for Evaluating Chebyshev and Fourier Series
• A fast algorithm for evaluation of normalized Hermite functions

Cited In (7)

• 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
• Title not available (Why is that?)
• Enclosing Chebyshev expansions in linear time

Uses Software

• Digital Library of Mathematical Functions
• mctoolbox
• Chebfun

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)