Stable discontinuous mapped bases: the Gibbs-Runge-avoiding stable polynomial approximation (GRASPA) method
From MaRDI portal
Publication:2064949
Abstract: The mapped bases or Fake Nodes Approach (FNA), introduced in [10], allows to change the set of nodes without the need of resampling the function. Such scheme has been successfully applied in preventing the appearance of the Gibbs phenomenon when interpolating discontinuous functions. However, the originally proposed S-Gibbs map suffers of a subtle instability when the interpolant is constructed at equidistant nodes, due to the Runge's phenomenon. Here, we propose a novel approach, termed Gibbs-Runge-Avoiding Stable Polynomial Approximation (GRASPA), where both Runge's and Gibbs phenomena are mitigated. After providing a theoretical analysis of the Lebesgue constant associated to the mapped nodes, we test the new approach by performing different numerical experiments which confirm the theoretical findings.
Recommendations
- A mapped polynomial method for high-accuracy approximations on arbitrary grids
- Stable discretization methods with external approximation schemes
- Discontinuous Galerkin method based on non-polynomial approximation spaces
- scientific article; zbMATH DE number 1322579
- scientific article; zbMATH DE number 4155786
- Simple technique for constructing stability polynomials for explicit stabilized Runge-Kutta methods
- Galerkin method with discontinuous basis functions on staggered grips a priory estimates for the homogeneous Dirichlet problem
- Mapped polynomials and discontinuous kernels for Runge and Gibbs phenomena
- scientific article; zbMATH DE number 1788258
- Optimal Runge-Kutta stability polynomials for multidimensional high-order methods
Cites work
- scientific article; zbMATH DE number 3469437 (Why is no real title available?)
- scientific article; zbMATH DE number 1083107 (Why is no real title available?)
- A mapped polynomial method for high-accuracy approximations on arbitrary grids
- A periodic map for linear barycentric rational trigonometric interpolation
- Approximation theory and approximation practice
- Lagrangian Interpolation at the Chebyshev Points xn, cos ( /n), = 0(1)n; some Unnoted Advantages
- Lebesgue functions and Lebesgue constants in polynomial interpolation
- Multivariate approximation at fake nodes
- On \((\beta,\gamma)\)-Chebyshev functions and points of the interval
- On a certain class of Lebesgue constants
- On the Gibbs Phenomenon and Its Resolution
- On the Lebesgue Function for Polynomial Interpolation
- Polynomial interpolation via mapped bases without resampling
- Reusing Chebyshev points for polynomial interpolation
- Shape-driven interpolation with discontinuous kernels: error analysis, edge extraction, and applications in magnetic particle imaging
- Spectral filtering for the reduction of the Gibbs phenomenon for polynomial approximation methods on Lissajous curves with applications in MPI
- Treating the Gibbs phenomenon in barycentric rational interpolation and approximation via the S-Gibbs algorithm
Cited in
(8)- Mapped polynomials and discontinuous kernels for Runge and Gibbs phenomena
- Treating the Gibbs phenomenon in barycentric rational interpolation and approximation via the S-Gibbs algorithm
- Quadrature at \textit{fake nodes}
- More properties of \((\beta,\gamma)\)-Chebyshev functions and points
- Multivariate approximation at fake nodes
- Polynomial interpolation via mapped bases without resampling
- Padua points and ``fake nodes for polynomial approximation: old, new and open problems
- Polynomial mapped bases: theory and applications
This page was built for publication: Stable discontinuous mapped bases: the Gibbs-Runge-avoiding stable polynomial approximation (GRASPA) method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2064949)
