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

Alicja Smoktunowicz, Agata Smoktunowicz, Ewa Pawelec

Research output: Contribution to journalArticlepeer-review

Abstract

This paper provides an error analysis of the three-term recurrence relation (TTRR) T n+1(x)=2x T n (x)−T n−1(x) for the evaluation of the Chebyshev polynomial of the first kind T N (x) in the interval [−1,1]. We prove that the computed value of T N (x) from this recurrence is very close to the exact value of the Chebyshev polynomial T N of a slightly perturbed value of x. The lower and upper bounds for the function CN(x)=|TN(x)|+|xT′N(x)| are also derived. Numerical examples that illustrate our theoretical results are given.
Original languageEnglish
Pages (from-to)785-794
Number of pages10
JournalNumerical Algorithms
Volume69
Issue number4
DOIs
Publication statusPublished - 1 Aug 2015

Fingerprint Dive into the research topics of 'The three-term recursion for Chebyshev polynomials is mixed forward-backward stable'. Together they form a unique fingerprint.

Cite this