The three-term recursion for Chebyshev polynomials is mixed forward-backward stable

DOI10.1007/S11075-014-9925-XzbMATH Open1326.65031DBLPjournals/na/SmoktunowiczSP15arXiv1312.5677OpenAlexW1994629846WikidataQ59408544 ScholiaQ59408544MaRDI QIDQ494669FDOQ494669

Authors: Alicja Smoktunowicz, Agata Smoktunowicz, Ewa Pawelec 

Publication date: 1 September 2015

Published in: Numerical Algorithms (Search for Journal in Brave)

Abstract: This paper provides error analyses of the algorithms most commonly used for the evaluation of the Chebyshev polynomial of the first kind $T_N(x)$. Some of these algorithms are shown to be backward stable. This means that the computed value of $T_N(x)$ in floating point arithmetic by these algorithms can be interpreted as a slightly perturbed value of polynomial $T_N$, for slightly perturbed value of $x$.

Full work available at URL: https://arxiv.org/abs/1312.5677

Recommendations

• Evaluation of Chebyshev polynomials by a three-term recurrence in floating-point arithmetic
• Accurate evaluation of Chebyshev polynomials in floating-point arithmetic
• Backward stability of Clenshaw's algorithm
• Evaluation of Legendre polynomials by a three-term recurrence in floating-point arithmetic
• Is the recurrence relation for orthogonal polynomials always stable?

zbMATH Keywords

error analysisChebyshev polynomialsthree-term recurrence relationroots of polynomialsfloating point arithmeticmixed forward-backward stability

Mathematics Subject Classification ID

Computation of special functions and constants, construction of tables (65D20) Roundoff error (65G50) Orthogonal polynomials and functions of hypergeometric type (Jacobi, Laguerre, Hermite, Askey scheme, etc.) (33C45) Numerical computation of roots of polynomial equations (65H04) Numerical aspects of recurrence relations (65Q30)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Barycentric Lagrange Interpolation
• Title not available (Why is that?)
• Title not available (Why is that?)
• On algorithms for the summation of certain special functions
• A unified rounding error bound for polynomial evaluation
• Backward stability of Clenshaw's algorithm
• Analysis of a nonlinear system with random characteristics
• A general condition number for polynomials
• Title not available (Why is that?)
• Error analysis of an algorithm for summing certain finite series
• An error analysis of Goertzel's (Watt's) method for computing Fourier coefficients
• Stability of parallel algorithms to evaluate Chebyshev series
• Rounding error bounds for the Clenshaw and Forsythe algorithms for the evaluation of orthogonal polynomial series

Cited In (4)

• Backward stability of Clenshaw's algorithm
• Evaluation of Chebyshev polynomials by a three-term recurrence in floating-point arithmetic
• Accurate evaluation of Chebyshev polynomials in floating-point arithmetic
• Faster stochastic trace estimation with a Chebyshev product identity

Uses Software

• mctoolbox
• Chebfun
• OPQ

This page was built for publication: The three-term recursion for Chebyshev polynomials is mixed forward-backward stable

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