Reusing Chebyshev points for polynomial interpolation
From MaRDI portal
Recommendations
- Generalization of Polynomial Interpolation at Chebyshev Nodes
- Interpolation over extreme points of Chebyshev polynomials and its applications
- Chebyshev interpolation polynomial-based tools for rigorous computing
- scientific article; zbMATH DE number 939311
- scientific article; zbMATH DE number 3867905
- A note on polynomial interpolation at the Chebyshev extrema nodes
- Fast evaluation and interpolation at the Chebyshev sets of points
- On the filtered polynomial interpolation at Chebyshev nodes
- Interpolatory pointwise estimates for polynomial approximation
- scientific article; zbMATH DE number 3903243
Cites work
- scientific article; zbMATH DE number 3004109 (Why is no real title available?)
- A Sparse Grid Stochastic Collocation Method for Partial Differential Equations with Random Input Data
- A method for numerical integration on an automatic computer
- A simple regularization of the polynomial interpolation for the resolution of the Runge phenomenon
- Approximation theory and approximation practice
- Divergence (Runge phenomenon) for least-squares polynomial approximation on an equispaced grid and mock-Chebyshev subset interpolation
- Fast Leja points
- Is Gauss Quadrature Better than Clenshaw–Curtis?
- Lagrangian Interpolation at the Chebyshev Points xn, cos ( /n), = 0(1)n; some Unnoted Advantages
- Norms of inverses and condition numbers for matrices associated with scattered data
- Numerical Methods for Special Functions
- Numerical experiments on the condition number of the interpolation matrices for radial basis functions
- Problems and results on the theory of interpolation. II
- Sur certaines suites liées aux ensembles plans et leur application à la représentation conforme
Cited in
(2)
This page was built for publication: Reusing Chebyshev points for polynomial interpolation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q747725)
