scientific article; zbMATH DE number 1805995

MaRDI QIDQ3149238zbMATH OpenFDO

Authors Lei Li

Publication date 24 September 2002

zbMATH Keywords

fast algorithmChebyshev pointspolynomial interpolation

Mathematics Subject Classification ID

Numerical interpolation (65D05) Interpolation in approximation theory (41A05)

Recommendations

• A polynomial interpolation process at quasi-Chebyshev nodes with the FFT
• Fast evaluation and interpolation at the Chebyshev sets of points
• New fast algorithms for polynomial interpolation and evaluation on the Chebyshev node set
• Algorithms for solving Hermite interpolation problems using the fast Fourier transform
• An Algorithm Based on the FFT for a Generalized Chebyshev Interpolation

Cited in

(8)

• An Algorithm Based on the FFT for a Generalized Chebyshev Interpolation
• On computing the degree of a Chebyshev polynomial from its value
• Fast Algorithms for Polynomial Interpolation, Integration, and Differentiation
• Fast evaluation and interpolation at the Chebyshev sets of points
• A Chebychev-Vandermonde solver
• scientific article; zbMATH DE number 4066293 (Why is no real title available?)
• A polynomial interpolation process at quasi-Chebyshev nodes with the FFT
• Algorithms for solving Hermite interpolation problems using the fast Fourier transform

This page was built for publication:

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