A Mapped Polynomial Method for High-Accuracy Approximations on Arbitrary Grids

@article{Adcock2016AMP,
  title={A Mapped Polynomial Method for High-Accuracy Approximations on Arbitrary Grids},
  author={Ben Adcock and Rodrigo B. Platte},
  journal={SIAM J. Numer. Anal.},
  year={2016},
  volume={54},
  pages={2256-2281}
}
  • B. Adcock, R. Platte
  • Published 19 July 2016
  • Mathematics, Computer Science
  • SIAM J. Numer. Anal.
The focus of this paper is the approximation of analytic functions on compact intervals from their pointwise values on arbitrary grids. We introduce a new method for this problem based on mapped polynomial approximation. By careful selection of the mapping parameter, we ensure both high accuracy of the approximation and an asymptotically optimal scaling of the polynomial degree with the grid spacing. As we explain, efficient implementation of this method can be achieved using nonuniform fast… 
On Kosloff Tal-Ezer least-squares quadrature formulas
TLDR
This work investigates the combination of the Kosloff Tal-Ezer map and Least-squares approximation for numerical quadrature and finds that some static choices of the map’s parameter improve the results of the composite trapezoidal rule, while a dynamic approach achieves larger stability and faster convergence, even when the sampling nodes are perturbed.
Optimal sampling rates for approximating analytic functions from pointwise samples
We consider the problem of approximating an analytic function on a compact interval from its values at $M+1$ distinct points. When the points are equispaced, a recent result (the so-called
Infinite-Dimensional $$\ell ^1$$ℓ1 Minimization and Function Approximation from Pointwise Data
We consider the problem of approximating a smooth function from finitely many pointwise samples using $$\ell ^1$$ℓ1 minimization techniques. In the first part of this paper, we introduce an
On the possibility of fast stable approximation of analytic functions from equispaced samples via polynomial frames
TLDR
The possibility theorem shows that there is a well-conditioned method that provides exponential decay of the error down to a finite, but user-controlled tolerance ǫ > 0, which in practice can be chosen close to machine epsilon.
Polynomial interpolation via mapped bases without resampling
TLDR
Numerical evidence confirms that such scheme can be applied to mitigate Runge and Gibbs phenomena and is referred to as a new method for univariate polynomial interpolation based on what is called mapped bases.
Multivariate approximation at fake nodes
TLDR
This work proposes an effective method for interpolating via mapped bases in the multivariate setting as Fake Nodes Approach (FNA), and the theoretical results are confirmed by various numerical experiments devoted to point out the robustness of the proposed scheme.
Mapped polynomials and discontinuous kernels for Runge and Gibbs phenomena
In this paper, we present recent solutions to the problem of approximating functions by polynomials for reducing in a substantial manner two well-known phenomena: Runge and Gibbs. The main idea is to
Linear Barycentric Rational Interpolation with Guaranteed Degree of Exactness
In recent years, linear barycentric rational interpolants, introduced in 1988 and improved in 2007 by Floater and Hormann, have turned out to be among the most efficient infinitely smooth
Stable discontinuous mapped bases: the Gibbs-Runge-Avoiding Stable Polynomial Approximation (GRASPA) method
TLDR
This work proposes a novel approach, termed Gibbs-Runge-Avoiding Stable Polynomial Approximation (GRASPA), where both Runge’s and Gibbs phenomena are mitigated and a theoretical analysis of the Lebesgue constant associated to the mapped nodes is provided.
Quadrature at fake nodes
We investigate the use of the so-called mapped bases or fake nodes approach in the framework of numerical integration. We show that such approach is able to mitigate the Gibbs phenomenon when
...
1
2
...

References

SHOWING 1-10 OF 44 REFERENCES
A note on fast Fourier transforms for nonequispaced grids
  • G. Steidl
  • Mathematics, Computer Science
    Adv. Comput. Math.
  • 1998
TLDR
A general efficient method for the fast evaluation of trigonometric polynomials at nonequispaced nodes based on the approximation of the poynomials by special linear combinations of translates of suitable functions ϕ is proposed.
A Windowed Fourier Method for Approximation of Non-periodic Functions on Equispaced Nodes
A windowed Fourier method is proposed for approximation of non-periodic functions on equispaced nodes. Spectral convergence is obtained in most of the domain, except near the boundaries, where
Accurate, high-order representation of complex three-dimensional surfaces via Fourier continuation analysis
TLDR
The approach is based on a very simple concept: use of Fourier analysis to continue smooth portions of a piecewise smooth function into new functions which, defined on larger domains, are both smooth and periodic.
Barycentric rational interpolation with no poles and high rates of approximation
TLDR
A family of barycentric rational interpolants that have no real poles and arbitrarily high approximation orders on any real interval, regardless of the distribution of the points are proposed and studied.
Nonperiodic Trigonometric Polynomial Approximation
  • H. Tal-Ezer
  • Mathematics, Computer Science
    J. Sci. Comput.
  • 2014
TLDR
The non-optimallity of polynomial approximation is addressed and it is suggested to switch from powers of x to powers of sin (px) where p is a parameter which depends on the dimension of the approximating subspace.
Approximation properties of a mapped Chebyshev method
We analyze a mapped Chebyshev technique to approximate derivatives recently developed by Kosloff and Tal-Ezer. The technique is based on a one-parameter family of mappings. Earlier numerical
New Quadrature Formulas from Conformal Maps
TLDR
New nonpolynomial quadrature methods are proposed that avoid the usual ellipse of convergence to an infinite strip or another approximately straight-sided domain by conformally mapping the usual circle of convergence.
Divergence (Runge Phenomenon) for least-squares polynomial approximation on an equispaced grid and Mock-Chebyshev subset interpolation
  • J. Boyd, F. Xu
  • Mathematics, Computer Science
    Appl. Math. Comput.
  • 2009
TLDR
The Runge Phenomenon can be completely defeated by interpolation on a ''mock-Chebyshev'' grid: a subset of (N+1) points from an equispaced grid with O(N^2) points chosen to mimic the non-uniform N+1-point ChebysheV-Lobatto grid.
On the Numerical Stability of Fourier Extensions
TLDR
This paper shows that Fourier extensions are actually numerically stable when implemented in finite arithmetic, and achieve a convergence rate that is at least superalgebraic, and demonstrates that they are particularly well suited for this problem.
Nonuniform fast Fourier transforms using min-max interpolation
TLDR
This paper presents an interpolation method for the nonuniform FT that is optimal in the min-max sense of minimizing the worst-case approximation error over all signals of unit norm and indicates that the proposed method easily generalizes to multidimensional signals.
...
1
2
3
4
5
...