Evaluation of Chebyshev Polynomials on Intervals and Application to Root Finding

DOI10.1007/978-3-030-43120-4_4OpenAlexW2996123376MaRDI QIDQ5014660

Guillaume Moroz, Viviane Ledoux

Publication date: 8 December 2021

Published in: Mathematical Aspects of Computer and Information Sciences (Search for Journal in Brave)

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

zbMATH Keywords

Chebyshev polynomialsinterval arithmeticClenshaw algorithmroot findingball arithmetic

Mathematics Subject Classification ID

Numerical analysis (65-XX) Computer science (68-XX)

Related Items (1)

Rigorous computation of linear response for intermittent maps

Cites Work

• Finding the Zeros of a Univariate Equation: Proxy Rootfinders, Chebyshev Interpolation, and the Companion Matrix
• Computing Real Roots of Real Polynomials ... and now For Real!
• An Error Analysis of the Modified Clenshaw Method for Evaluating Chebyshev and Fourier Series
• Computing Zeros on a Real Interval through Chebyshev Expansion and Polynomial Rootfinding
• Error analysis of an algorithm for summing certain finite series
• An error analysis of Goertzel's (Watt's) method for computing Fourier coefficients

This page was built for publication: Evaluation of Chebyshev Polynomials on Intervals and Application to Root Finding