Aug 1, 2011 · This paper presents a compensated algorithm to accurately evaluate a polynomial expressed in Chebyshev basis of the first and second kind ...
May 6, 2014 · Evaluating polynomials of arbitrarily large degree in a Chebyshev basis is practical, and provably numerically stable, using a barycentric interpolation ...
Oct 22, 2024 · This paper presents a compensated algorithm to accurately evaluate a polynomial expressed in Chebyshev basis of the first and second kind ...
Oct 3, 2012 · Another alternative, if you have the Chebyshev coefficients of your interpolatory polynomial, is to use the Clenshaw algorithm.
This paper provides error analyses of the algorithms most commonly used for the evaluation of the Chebyshev polynomial of the first kind $T_N(x)$.
Dec 31, 2021 · CSPICE_CHBINT returns the value of a polynomial and its derivative, evaluated at the input `x', using the coefficients of the Chebyshev ...
Missing: Accurate | Show results with:Accurate
The Chebyshev polynomials form a complete orthogonal system. · The Chebyshev series converges to f(x) if the function is piecewise smooth and continuous. · At a ...
People also ask
What is the general formula for the Chebyshev polynomials?
How do you approximate using Chebyshev polynomials?
How do you prove the orthogonality property of Chebyshev polynomials?
What are the properties of the Chebyshev polynomial?
Aug 21, 2024 · Chebyshev polynomials are key players in numerical analysis, offering powerful tools for approximation and integration.
Sep 27, 2017 · This article illustrates an accurate evaluation for the surface in form of Chebyshev tensor product. This algorithm is based on the application of error-free ...
This paper describes an algorithm that delivers the required polynomial in Chebyshev form. It is based on the repeated use of the Newton representation ...