On the resolution power of Fourier extensions for oscillatory functions
From MaRDI portal
Publication:2511207
DOI10.1016/J.CAM.2013.09.069zbMATH Open1293.65177arXiv1105.3426OpenAlexW2055315600WikidataQ117717439 ScholiaQ117717439MaRDI QIDQ2511207FDOQ2511207
Authors: Ben Adcock, Daan Huybrechs 
Publication date: 5 August 2014
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Abstract: Functions that are smooth but non-periodic on a certain interval possess Fourier series that lack uniform convergence and suffer from the Gibbs phenomenon. However, they can be represented accurately by a Fourier series that is periodic on a larger interval. This is commonly called a Fourier extension. When constructed in a particular manner, Fourier extensions share many of the same features of a standard Fourier series. In particular, one can compute Fourier extensions which converge spectrally fast whenever the function is smooth, and exponentially fast if the function is analytic, much the same as the Fourier series of a smooth/analytic and periodic function. With this in mind, the purpose of this paper is to describe, analyze and explain the observation that Fourier extensions, much like classical Fourier series, also have excellent resolution properties for representing oscillatory functions. The resolution power, or required number of degrees of freedom per wavelength, depends on a user-controlled parameter and, as we show, it varies between 2 and pi. The former value is optimal and is achieved by classical Fourier series for periodic functions, for example. The latter value is the resolution power of algebraic polynomial approximations. Thus, Fourier extensions with an appropriate choice of parameter are eminently suitable for problems with moderate to high degrees of oscillation.
Full work available at URL: https://arxiv.org/abs/1105.3426
Recommendations
- On the Fourier Extension of Nonperiodic Functions
- On the Gibbs phenomenon. I: Recovering exponential accuracy from the Fourier partial sum of a nonperiodic analytic function
- Pointwise and uniform convergence of Fourier extensions
- Parameter selection and numerical approximation properties of Fourier extensions from fixed data
- On the numerical stability of Fourier extensions
Cites Work
- Algorithm 840: computation of grid points, quadrature weights and derivatives for spectral element methods using prolate spheroidal wave functions---prolate elements
- Equivalent Norms for Sobolev Spaces
- Linear and nonlinear stability of the Blasius boundary layer
- Is Gauss Quadrature Better than Clenshaw–Curtis?
- Spectral Methods
- Prolate spheroidal wavefunctions, quadrature and interpolation
- Title not available (Why is that?)
- Title not available (Why is that?)
- An introduction to frames and Riesz bases
- A modified Chebyshev pseudospectral method with an \(O(N^{-1})\) time step restriction
- Title not available (Why is that?)
- On the Gibbs Phenomenon and Its Resolution
- On a high order numerical method for functions with singularities
- Exponentially-convergent strategies for defeating the Runge phenomenon for the approximation of non-periodic functions. I: Single-interval schemes
- On the Fourier Extension of Nonperiodic Functions
- New Quadrature Formulas from Conformal Maps
- Spectral domain embedding for elliptic PDEs in complex domains
- On the Gibbs phenomenon. I: Recovering exponential accuracy from the Fourier partial sum of a nonperiodic analytic function
- On a Fourier method of embedding domains using an optimal distributed control
- A comparison of numerical algorithms for Fourier extension of the first, second, and third kinds
- High-order unconditionally stable FC-AD solvers for general smooth domains. I: Basic elements
- Accurate, high-order representation of complex three-dimensional surfaces via Fourier continuation analysis
- A new class of highly accurate differentiation schemes based on the prolate spheroidal wave functions
- A spectral FC solver for the compressible Navier-Stokes equations in general domains. I: Explicit time-stepping
- High-order unconditionally stable FC-AD solvers for general smooth domains. II: Elliptic, parabolic and hyperbolic PDEs; theoretical considerations
- Extensions and Applications of the Householder Algorithm for Solving Linear Least Squares Problems
- Title not available (Why is that?)
- Approximation error in regularized SVD-based Fourier continuations
- Fourier embedded domain methods: Extending a function defined on an irregular region to a rectangle so that the extension is spatially periodic and \(C^{\infty}\)
- A spectral embedding method applied to the advection-diffusion equation
- A fast algorithm for Fourier continuation
- Spectral Methods for Partial Differential Equations in Irregular Domains: The Spectral Smoothed Boundary Method
- Fourier spectral embedded boundary solution of the Poisson's and Laplace equations with Dirichlet boundary conditions
- Fourier embedded domain methods: Periodic and \(C^{\infty}\) extension of a function defined on an irregular region to a rectangle via convolution with Gaussian kernels
- Spectral smoothed boundary methods: The role of external boundary conditions
- A spectral fictitious domain method with internal forcing for solving elliptic PDEs
- On Some Applications of the Superposition Principle with Fourier Basis
- Resolution properties of the Fourier method for discontinuous waves
Cited In (29)
- Subperiodic trigonometric subsampling: a numerical approach
- On the numerical stability of Fourier extensions
- On the Fourier Extension of Nonperiodic Functions
- On the Convergence of the Quasi-Periodic Approximations on a Finite Interval
- Fast algorithms for the computation of Fourier extensions of arbitrary length
- A Hermite extension method for numerical differentiation
- A mapped polynomial method for high-accuracy approximations on arbitrary grids
- Approximation error in regularized SVD-based Fourier continuations
- Exclusive robustness of Gegenbauer method to truncated convolution errors
- An Adaptive Partition of Unity Method for Multivariate Chebyshev Polynomial Approximations
- Parameter selection and numerical approximation properties of Fourier extensions from fixed data
- Approximation on non-tensor domains including squircles. III: Polynomial hyperinterpolation and radial basis function interpolation on Chebyshev-like grids and truncated uniform grids
- Pointwise and uniform convergence of Fourier extensions
- A fast algorithm for the convolution of functions with compact support using Fourier extensions
- Convergence and error theorems for Hermite function pseudo-RBFs: interpolation on a finite interval by Gaussian-localized polynomials
- Resolution-optimal exponential and double-exponential transform methods for functions with endpoint singularities
- Subperiodic trigonometric hyperinterpolation
- Nonperiodic trigonometric polynomial approximation
- An oversampled collocation approach of the wave based method for Helmholtz problems
- Stable and accurate least squares radial basis function approximations on bounded domains
- The Fourier approximation of smooth but non-periodic functions from unevenly spaced data
- Sobolev smoothing of SVD-based Fourier continuations
- The Fourier extension method and discrete orthogonal polynomials on an arc of the circle
- A radial basis function based frames strategy for bypassing the Runge phenomenon
- AAA interpolation of equispaced data
- Fast and stable approximation of analytic functions from equispaced samples via polynomial frames
- Function approximation on arbitrary domains using Fourier extension frames
- Spectral methods in non-tensor geometry. II: Chebyshev versus Zernike polynomials, gridding strategies and spectral extension on squircle-bounded and perturbed-quadrifolium domains
- Frames and numerical approximation
This page was built for publication: On the resolution power of Fourier extensions for oscillatory functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2511207)
