Evaluation of Chebyshev Polynomials on Intervals and Application to Root Finding

DOI10.1007/978-3-030-43120-4_4MaRDI QIDQ5014660zbMATH OpenOpenAlexFDO

Authors Viviane Ledoux, Guillaume Moroz

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

ball arithmeticChebyshev polynomialsClenshaw algorithminterval arithmeticroot finding

Mathematics Subject Classification ID

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

Recommendations

• Evaluation of Chebyshev polynomials by a three-term recurrence in floating-point arithmetic
• Enclosing Chebyshev expansions in linear time
• Accurate evaluation of a polynomial in Chebyshev form
• Accurate evaluation of Chebyshev polynomials in floating-point arithmetic
• Computing Zeros on a Real Interval through Chebyshev Expansion and Polynomial Rootfinding

Cites work

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

Cited in

(9)

• The Laurent-Horner method for validated evaluation of Chebyshev expansions
• Chebyshev expansion on intervals with branch points with application to the root of Kepler's equation: A Chebyshev-Hermite-Padé method
• Computing real roots of a polynomial in Chebyshev series form through subdivision with linear testing and cubic solves
• scientific article; zbMATH DE number 6824981 (Why is no real title available?)
• scientific article; zbMATH DE number 4182705 (Why is no real title available?)
• Book review of: J. P. Boyd, Solving transcendental equations. The Chebyshev polynomial proxy and other numerical rootfinders, perturbation series, and oracles
• Rigorous computation of linear response for intermittent maps
• Numerical methods for the simulation of quantum walks and quantum annealing
• Computing the zeros, maxima and inflection points of Chebyshev, Legendre and Fourier series: solving transcendental equations by spectral interpolation and polynomial rootfinding

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

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