Accurate evaluation of Chebyshev polynomials in floating-point arithmetic
type: Item
instance of: scholarly article
title: Accurate evaluation of Chebyshev polynomials in floating-point arithmetic
zbMATH Open document ID: 1415.65052
author: Tomasz Hrycak
author: Sebastian Schmutzhard
published in: BIT
publication date: 2019-06-27T00:00:00Z
Mathematics Subject Classification ID: 65D20
Mathematics Subject Classification ID: 65Q30
Mathematics Subject Classification ID: 33F05
Mathematics Subject Classification ID: 65G50
zbMATH DE Number: 7074119
zbMATH Keywords: Chebyshev polynomials
zbMATH Keywords: floating-point arithmetic
zbMATH Keywords: recurrence
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-018-0738-5
OpenAlex ID: W2900397130
cites work: Another Characterization of the Classical Orthogonal Polynomials
cites work: Q4303344
cites work: Underflow and the Reliability of Numerical Software
cites work: Accuracy and Stability of Numerical Algorithms
cites work: Evaluation of Chebyshev polynomials by a three-term recurrence in floating-point arithmetic
cites work: Q3579593
DOI: 10.1007/S10543-018-0738-5
description: scientific article; zbMATH DE number 7074119