Stable discontinuous mapped bases: the Gibbs-Runge-avoiding stable polynomial approximation (GRASPA) method
From MaRDI portal
Publication:2064949
DOI10.1007/s40314-021-01688-zzbMath1499.65029arXiv2105.09661OpenAlexW3213555853MaRDI QIDQ2064949
Giacomo Elefante, F. Marchetti, Stefano De Marchi
Publication date: 6 January 2022
Published in: Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2105.09661
Numerical interpolation (65D05) Interpolation in approximation theory (41A05) Algorithms for approximation of functions (65D15)
Related Items (3)
Polynomial mapped bases: theory and applications ⋮ Padua points and fake nodes for polynomial approximation: old, new and open problems ⋮ More properties of \((\beta,\gamma)\)-Chebyshev functions and points
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Lebesgue functions and Lebesgue constants in polynomial interpolation
- Reusing Chebyshev points for polynomial interpolation
- Treating the Gibbs phenomenon in barycentric rational interpolation and approximation via the S-Gibbs algorithm
- On \((\beta,\gamma)\)-Chebyshev functions and points of the interval
- Polynomial interpolation via mapped bases without resampling
- A periodic map for linear barycentric rational trigonometric interpolation
- Multivariate approximation at fake nodes
- On the Lebesgue Function for Polynomial Interpolation
- On the Gibbs Phenomenon and Its Resolution
- Shape-Driven Interpolation With Discontinuous Kernels: Error Analysis, Edge Extraction, and Applications in Magnetic Particle Imaging
- On a certain class of Lebesgue constants
- Lagrangian Interpolation at the Chebyshev Points xn, cos ( /n), = 0(1)n; some Unnoted Advantages
- A Mapped Polynomial Method for High-Accuracy Approximations on Arbitrary Grids
This page was built for publication: Stable discontinuous mapped bases: the Gibbs-Runge-avoiding stable polynomial approximation (GRASPA) method
