Polynomial interpolation via mapped bases without resampling
Polynomial interpolation and many other approximation methods (such as kernel-based approximation or radial basis functions) often suffer from their dependence on the given data points (``knots) which includes deterioration of stability and error properties like Runge's or Gibbs phenomena if the knots are chosen badly. A trivial example for such usually bad choices are equally spaced points. There are several types of remedies for such difficulties: particular selection of data points from a larger amount given or choice of Chebyshev points etc. Unfortunately, one is not always free to use Chebyshev points, so the authors of the current paper suggest to map the given points by auxiliary functions into suitable data points. In other words, there is a composition of the bases of the desired approximation method (e.g., powers for polynomial interpolation) and artifical functions for each basis function that are composed with it. This can be achieved in two ways: the authors consider first the use of these compositions directly as basis functions for a new approximation algorithm. Alternatively, one can map the data first and then insert them into the classical methods (e.g., summing them up with the usual Lagrange functions for interpolation). The new maps have, of course, to satisfy some restrictions in order to avoid useless trivial results, and the authors require certain density properties that allow the use of Weierstraß-type theorems to show that convergence theorems of the new methods are still available.
- Polynomial mapped bases: theory and applications
- A kind of \(C^{n+k}\) polynomial interpolation with least-squares errors
- Multivariate approximation at fake nodes
- Treating the Gibbs phenomenon in barycentric rational interpolation and approximation via the S-Gibbs algorithm
- Stable discontinuous mapped bases: the Gibbs-Runge-avoiding stable polynomial approximation (GRASPA) method
- A mapped polynomial method for high-accuracy approximations on arbitrary grids
- A modified Chebyshev pseudospectral method with an \(O(N^{-1})\) time step restriction
- A note on the Gibbs phenomenon with multiquadric radial basis functions
- A periodic map for linear barycentric rational trigonometric interpolation
- A practical guide to splines
- Analysis of the Gibbs phenomenon in stationary subdivision schemes
- Convergence rates of derivatives of Floater-Hormann interpolants for well-spaced nodes
- Divergence (Runge phenomenon) for least-squares polynomial approximation on an equispaced grid and mock-Chebyshev subset interpolation
- Edge detection methods based on RBF interpolation
- scientific article; zbMATH DE number 3516003 (Why is no real title available?)
- scientific article; zbMATH DE number 1083107 (Why is no real title available?)
- scientific article; zbMATH DE number 3301601 (Why is no real title available?)
- Interpolation with variably scaled kernels
- Jumping with variably scaled discontinuous kernels (VSDKs)
- Lebesgue constant minimizing linear rational interpolation of continuous functions over the interval
- Mappings and accuracy for Chebyshev pseudo-spectral approximations
- Multivariate approximation at fake nodes
- New Quadrature Formulas from Conformal Maps
- On a nonlinear subdivision scheme avoiding Gibbs oscillations and converging towards $C^{s}$ functions with $s>1$
- On the Gibbs Phenomenon and Its Resolution
- On the Lebesgue constant of Berrut's rational interpolant at equidistant nodes
- On the Lebesgue Function for Polynomial Interpolation
- Optimal polynomial admissible meshes on some classes of compact subsets of \(\mathbb{R}^d\)
- Polynomial Fitting for Edge Detection in Irregularly Sampled Signals and Images
- Polynomials arising in factoring generalized Vandermonde determinants: An algorithm for computing their coefficients
- Radial Basis Functions
- Spectral filtering for the reduction of the Gibbs phenomenon for polynomial approximation methods on Lissajous curves with applications in MPI
- Generalizations of the constrained mock-Chebyshev least squares in two variables: tensor product vs total degree polynomial interpolation
- Stable discontinuous mapped bases: the Gibbs-Runge-avoiding stable polynomial approximation (GRASPA) method
- A linear barycentric rational interpolant on starlike domains
- Mapped polynomials and discontinuous kernels for Runge and Gibbs phenomena
- Polynomial mapped bases: theory and applications
- The Gibbs-Wilbraham phenomenon in the approximation of \(| x |\) by using Lagrange interpolation on the Chebyshev-Lobatto nodal systems
- Treating the Gibbs phenomenon in barycentric rational interpolation and approximation via the S-Gibbs algorithm
- Jumping with variably scaled discontinuous kernels (VSDKs)
- On \((\beta,\gamma)\)-Chebyshev functions and points of the interval
- Multivariate approximation at fake nodes
- On Kosloff Tal-Ezer least-squares quadrature formulas
- Two-dimensional polynomial interpolation from nonuniform samples
- FakeNodes
- Padua points and ``fake nodes for polynomial approximation: old, new and open problems
- A mapped polynomial method for high-accuracy approximations on arbitrary grids
- A regularization-correction approach for adapting subdivision schemes to the presence of discontinuities
- scientific article; zbMATH DE number 7709336 (Why is no real title available?)
- More properties of \((\beta,\gamma)\)-Chebyshev functions and points
- Many-stage optimal stabilized Runge-Kutta methods for hyperbolic partial differential equations
- Quadrature at \textit{fake nodes}
- Polynomial interpolation of function averages on interval segments
- A mixed interpolation-regression approximation operator on the triangle
- A Lagrange interpolation with preprocessing to nearly eliminate oscillations
- Polynomial histopolation on mock-Chebyshev segments
- A new fast algorithm for computing the mock-Chebyshev nodes
- Mapping for Approximation: A Unified View of Rescaled, Variably Scaled and Rational Kernel Methods
This page was built for publication: Polynomial interpolation via mapped bases without resampling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2279893)
