New fast algorithms for polynomial interpolation and evaluation on the Chebyshev node set

DOI10.1016/S0898-1221(97)00283-6zbMath0914.65002OpenAlexW2050062373MaRDI QIDQ1129510

Pan, Victor Y.

Publication date: 7 June 1999

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0898-1221(97)00283-6

zbMATH Keywords

computational complexityfast algorithmsChebyshev nodespolynomial interpolation

Mathematics Subject Classification ID

Numerical interpolation (65D05) Complexity and performance of numerical algorithms (65Y20)

Related Items (4)

Rigorous uniform approximation of D-finite functions using Chebyshev expansions ⋮ Lifting/descending processes for polynomial zeros. ⋮ New progress in real and complex polynomial root-finding ⋮ Fast conversion algorithms for orthogonal polynomials

Cites Work

• Fast and efficient parallel evaluation of the zeros of a polynomial having only real zeros
• A Fast Algorithm for the Multiplication of Generalized Hilbert Matrices with Vectors
• Unnamed Item
• Unnamed Item

This page was built for publication: New fast algorithms for polynomial interpolation and evaluation on the Chebyshev node set