Evaluation of Chebyshev polynomials by a three-term recurrence in floating-point arithmetic
type: Item
instance of: scholarly article
title: Evaluation of Chebyshev polynomials by a three-term recurrence in floating-point arithmetic
zbMATH Open document ID: 1477.65046
author: Tomasz Hrycak
author: Sebastian Schmutzhard
published in: BIT
publication date: 2018-06-26T00:00:00Z
Mathematics Subject Classification ID: 65D20
Mathematics Subject Classification ID: 33F05
Mathematics Subject Classification ID: 65G50
Mathematics Subject Classification ID: 65Q30
zbMATH DE Number: 6894726
zbMATH Keywords: Chebyshev polynomials
zbMATH Keywords: three-term recurrence
zbMATH Keywords: floating-point arithmetic
zbMATH Keywords: upper and lower error bound
describes a project that uses: Chebfun
describes a project that uses: mctoolbox
describes a project that uses: Digital Library of Mathematical Functions
MaRDI profile type: Publication
full work available at URL: s10543-017-0683-8
OpenAlex ID: W2755037429
cites work: Q5558293
cites work: A fast algorithm for evaluation of normalized Hermite functions
cites work: Error analysis of an algorithm for summing certain finite series
cites work: Q5533821
cites work: Accuracy and Stability of Numerical Algorithms
cites work: An Error Analysis of the Modified Clenshaw Method for Evaluating Chebyshev and Fourier Series
cites work: Q3579593
cites work: The three-term recursion for Chebyshev polynomials is mixed forward-backward stable
DOI: 10.1007/S10543-017-0683-8
description: scientific article; zbMATH DE number 6894726