Reusing Chebyshev points for polynomial interpolation
From MaRDI portal
Publication:747725
DOI10.1007/s11075-014-9945-6zbMath1327.65024OpenAlexW1970914917MaRDI QIDQ747725
Saman Ghili, Gianluca Iaccarino
Publication date: 19 October 2015
Published in: Numerical Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11075-014-9945-6
Related Items (2)
Lebesgue constant using sinc points ⋮ Stable discontinuous mapped bases: the Gibbs-Runge-avoiding stable polynomial approximation (GRASPA) method
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Numerical experiments on the condition number of the interpolation matrices for radial basis functions
- A simple regularization of the polynomial interpolation for the resolution of the Runge phenomenon
- A method for numerical integration on an automatic computer
- Divergence (Runge phenomenon) for least-squares polynomial approximation on an equispaced grid and mock-Chebyshev subset interpolation
- Fast Leja points
- Norms of inverses and condition numbers for matrices associated with scattered data
- Sur certaines suites liées aux ensembles plans et leur application à la représentation conforme
- Problems and results on the theory of interpolation. II
- A Sparse Grid Stochastic Collocation Method for Partial Differential Equations with Random Input Data
- Numerical Methods for Special Functions
- Is Gauss Quadrature Better than Clenshaw–Curtis?
- Lagrangian Interpolation at the Chebyshev Points xn, cos ( /n), = 0(1)n; some Unnoted Advantages
This page was built for publication: Reusing Chebyshev points for polynomial interpolation
