Fast evaluation and interpolation at the Chebyshev sets of points

DOI10.1016/0893-9659(89)90064-5zbMath0705.65007OpenAlexW1990415201MaRDI QIDQ918113

Pan, Victor Y.

Publication date: 1989

Published in: Applied Mathematics Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0893-9659(89)90064-5

zbMATH Keywords

interpolationChebyshev pointsStable polynomial evaluation

Mathematics Subject Classification ID

Numerical interpolation (65D05) Computation of special functions and constants, construction of tables (65D20)

Related Items (5)

An algebraic approach to approximate evaluation of a polynomial on a set of real points ⋮ Lifting/descending processes for polynomial zeros. ⋮ The spectral connection matrix for classical orthogonal polynomials of a single parameter ⋮ A fast iterative method for determining the stability of a polynomial ⋮ The spectral connection matrix for any change of basis within the classical real orthogonal polynomials

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A fast algorithm for the discrete Laplace transformation
• Approximation by Polynomials: Interpolation and Optimal Nodes
• Polynomial Interpolation: Lagrange versus Newton
• Evaluating Polynomials at Fixed Sets of Points

This page was built for publication: Fast evaluation and interpolation at the Chebyshev sets of points