Pointwise and uniform convergence of Fourier extensions
From MaRDI portal
Publication:784753
DOI10.1007/S00365-019-09486-XzbMATH Open1444.42003arXiv1811.09527OpenAlexW2991544909WikidataQ126806979 ScholiaQ126806979MaRDI QIDQ784753FDOQ784753
Authors: Marcus Webb, Vincent Coppé, Daan Huybrechs 
Publication date: 3 August 2020
Published in: Constructive Approximation (Search for Journal in Brave)
Abstract: Fourier series approximations of continuous but nonperiodic functions on an interval suffer the Gibbs phenomenon, which means there is a permanent oscillatory overshoot in the neighbourhoods of the endpoints. Fourier extensions circumvent this issue by approximating the function using a Fourier series which is periodic on a larger interval. Previous results on the convergence of Fourier extensions have focused on the error in the L2 norm, but in this paper we analyze pointwise and uniform convergence of Fourier extensions (formulated as the best approximation in the L2 norm). We show that the pointwise convergence of Fourier extensions is more similar to Legendre series than classical Fourier series. In particular, unlike classical Fourier series, Fourier extensions yield pointwise convergence at the endpoints of the interval. Similar to Legendre series, pointwise convergence at the endpoints is slower by an algebraic order of a half compared to that in the interior. The proof is conducted by an analysis of the associated Lebesgue function, and Jackson- and Bernstein-type theorems for Fourier extensions. Numerical experiments are provided. We conclude the paper with open questions regarding the regularized and oversampled least squares interpolation versions of Fourier extensions.
Full work available at URL: https://arxiv.org/abs/1811.09527
Recommendations
- On the numerical stability of Fourier extensions
- On the resolution power of Fourier extensions for oscillatory functions
- On the Fourier Extension of Nonperiodic Functions
- Fast algorithms for the computation of Fourier extensions of arbitrary length
- On the Gibbs phenomenon. I: Recovering exponential accuracy from the Fourier partial sum of a nonperiodic analytic function
Trigonometric approximation (42A10) Numerical methods for trigonometric approximation and interpolation (65T40) Inequalities in approximation (Bernstein, Jackson, Nikol'ski?-type inequalities) (41A17) General harmonic expansions, frames (42C15)
Cites Work
- Interpolation and approximation by polynomials
- Title not available (Why is that?)
- Title not available (Why is that?)
- Approximation theory and approximation practice
- Title not available (Why is that?)
- The Riemann--Hilbert approach to strong asymptotics for orthogonal polynomials on [-1,1]
- Title not available (Why is that?)
- Prolate Spheroidal Wave Functions, Fourier Analysis, and Uncertainty-V: The Discrete Case
- Title not available (Why is that?)
- A class of orthogonal polynomials
- Title not available (Why is that?)
- On the Fourier Extension of Nonperiodic Functions
- A comparison of numerical algorithms for Fourier extension of the first, second, and third kinds
- Accurate, high-order representation of complex three-dimensional surfaces via Fourier continuation analysis
- Title not available (Why is that?)
- The prolate matrix
- 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}\)
- Bernstein's inequality for algebraic polynomials on circular arcs
- On the resolution power of Fourier extensions for oscillatory functions
- A fast algorithm for Fourier continuation
- On the numerical stability of Fourier extensions
- On the convergence rates of Legendre approximation
- Title not available (Why is that?)
- On the Periodic Discrete Prolate Spheroidal Sequences
- Parameter selection and numerical approximation properties of Fourier extensions from fixed data
- Fast algorithms for the computation of Fourier extensions of arbitrary length
- Function approximation on arbitrary domains using Fourier extension frames
- Freud equations for Legendre polynomials on a circular arc and solution of the Grünbaum-Delsarte-Janssen-Vries problem.
- The fast Slepian transform
- Extension of Chebfun to periodic functions
- Computing with functions on domains with arbitrary shapes
- Frames and numerical approximation
Cited In (13)
- A uniform boundedness principle for compact sets and the decay of Fourier transforms
- On the Fourier Extension of Nonperiodic Functions
- Local behaviors of Fourier expansions for functions of limited regularities
- Fast algorithms for the computation of Fourier extensions of arbitrary length
- Insight into the stability analysis of the reaction-diffusion equation interconnected with a finite-dimensional system taking support on Legendre orthogonal basis
- Parameter selection and numerical approximation properties of Fourier extensions from fixed data
- On the resolution power of Fourier extensions for oscillatory functions
- Lebesgue points and restricted convergence of Fourier transforms and Fourier series
- A robust spline approach in partially linear additive models
- Sets of uniform convergence of Fourier expansions of piecewise smooth functions
- The Fourier extension method and discrete orthogonal polynomials on an arc of the circle
- Pointwise convergence of the Calderón reproducing formula
- Fast and stable approximation of analytic functions from equispaced samples via polynomial frames
Uses Software
This page was built for publication: Pointwise and uniform convergence of Fourier extensions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q784753)
