On the numerical stability of Fourier extensions
From MaRDI portal
(Redirected from Publication:404262)
Abstract: An effective means to approximate an analytic, nonperiodic function on a bounded interval is by using a Fourier series on a larger domain. When constructed appropriately, this so-called Fourier extension is known to converge geometrically fast in the truncation parameter. Unfortunately, computing a Fourier extension requires solving an ill-conditioned linear system, and hence one might expect such rapid convergence to be destroyed when carrying out computations in finite precision. The purpose of this paper is to show that this is not the case. Specifically, we show that Fourier extensions are actually numerically stable when implemented in finite arithmetic, and achieve a convergence rate that is at least superalgebraic. Thus, in this instance, ill-conditioning of the linear system does not prohibit a good approximation. In the second part of this paper we consider the issue of computing Fourier extensions from equispaced data. A result of Platte, Trefethen & Kuijlaars states that no method for this problem can be both numerically stable and exponentially convergent. We explain how Fourier extensions relate to this theoretical barrier, and demonstrate that they are particularly well suited for this problem: namely, they obtain at least superalgebraic convergence in a numerically stable manner.
Recommendations
- On the Fourier Extension of Nonperiodic Functions
- Function approximation on arbitrary domains using Fourier extension frames
- Fast algorithms for the computation of Fourier extensions of arbitrary length
- A comparison of numerical algorithms for Fourier extension of the first, second, and third kinds
- Parameter selection and numerical approximation properties of Fourier extensions from fixed data
Cites work
- scientific article; zbMATH DE number 43996 (Why is no real title available?)
- scientific article; zbMATH DE number 48688 (Why is no real title available?)
- scientific article; zbMATH DE number 3640828 (Why is no real title available?)
- scientific article; zbMATH DE number 739279 (Why is no real title available?)
- scientific article; zbMATH DE number 1012640 (Why is no real title available?)
- scientific article; zbMATH DE number 2042292 (Why is no real title available?)
- scientific article; zbMATH DE number 3081880 (Why is no real title available?)
- A Class of Nonharmonic Fourier Series
- A Practical Guide to Pseudospectral Methods
- A comparison of numerical algorithms for Fourier extension of the first, second, and third kinds
- A fast algorithm for Fourier continuation
- A modified Chebyshev pseudospectral method with an \(O(N^{-1})\) time step restriction
- A spectral FC solver for the compressible Navier-Stokes equations in general domains. I: Explicit time-stepping
- A spectral embedding method applied to the advection-diffusion equation
- Accurate, high-order representation of complex three-dimensional surfaces via Fourier continuation analysis
- An introduction to frames and Riesz bases
- Approximation error in regularized SVD-based Fourier continuations
- Divergence (Runge phenomenon) for least-squares polynomial approximation on an equispaced grid and mock-Chebyshev subset interpolation
- Exponentially-convergent strategies for defeating the Runge phenomenon for the approximation of non-periodic functions. I: Single-interval schemes
- 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}\)
- High-order unconditionally stable FC-AD solvers for general smooth domains. I: Basic elements
- High-order unconditionally stable FC-AD solvers for general smooth domains. II: Elliptic, parabolic and hyperbolic PDEs; theoretical considerations
- Impossibility of fast stable approximation of analytic functions from equispaced samples
- On the Fourier Extension of Nonperiodic Functions
- On the Gibbs Phenomenon and Its Resolution
- On the Gibbs phenomenon. I: Recovering exponential accuracy from the Fourier partial sum of a nonperiodic analytic function
- On the resolution power of Fourier extensions for oscillatory functions
- Prolate Spheroidal Wave Functions, Fourier Analysis, and Uncertainty-V: The Discrete Case
- Spectral Methods
- The Future Fast Fourier Transform?
- The Growth of Polynomials Bounded at Equally Spaced Points
- The prolate matrix
- Trouble with Gegenbauer reconstruction for defeating Gibbs' phenomenon: Runge phenomenon in the diagonal limit of Gegenbauer polynomial approximations
Cited in
(45)- Convergence analysis of oversampled collocation boundary element methods in 2D
- Numerical Properties of Fat Schemes with Special Support
- Numerical differentiation for two-dimensional functions by a Fourier extension method
- A Super Order Regularization Scheme in Hilbert Scales under General Smoothing Conditions
- Frames and numerical approximation. II: Generalized sampling
- A radial basis function based frames strategy for bypassing the Runge phenomenon
- Two-dimensional Fourier continuation and applications
- An Adaptive Partition of Unity Method for Multivariate Chebyshev Polynomial Approximations
- On the Convergence of the Quasi-Periodic Approximations on a Finite Interval
- Oversampled collocation approximation method of functions via Jacobi frames
- Exponential tractability of \(L_2\)-approximation with function values
- Numerical differentiation by a Fourier extension method with super-order regularization
- A fast algorithm for the convolution of functions with compact support using Fourier extensions
- Approximation error in regularized SVD-based Fourier continuations
- Subperiodic trigonometric subsampling: a numerical approach
- An efficient spectral method for elliptic PDEs in complex domains with circular embedding
- Fast algorithms for the computation of Fourier extensions of arbitrary length
- A Windowed Fourier Method for Approximation of Non-periodic Functions on Equispaced Nodes
- scientific article; zbMATH DE number 4133459 (Why is no real title available?)
- Improved bounds for the eigenvalues of prolate spheroidal wave functions and discrete prolate spheroidal sequences
- A comparison of numerical algorithms for Fourier extension of the first, second, and third kinds
- Function approximation on arbitrary domains using Fourier extension frames
- On the resolution power of Fourier extensions for oscillatory functions
- Discrete prolate spheroidal wave functions: further spectral analysis and some related applications
- A Hermite extension method for numerical differentiation
- Spectral methods in non-tensor geometry. II: Chebyshev versus Zernike polynomials, gridding strategies and spectral extension on squircle-bounded and perturbed-quadrifolium domains
- The Fourier approximation of smooth but non-periodic functions from unevenly spaced data
- Computing with functions on domains with arbitrary shapes
- The Fourier extension method and discrete orthogonal polynomials on an arc of the circle
- Two algorithms for periodic extension on uniform grids
- How exponentially ill-conditioned are contiguous submatrices of the Fourier matrix?
- APPROXIMATING SMOOTH, MULTIVARIATE FUNCTIONS ON IRREGULAR DOMAINS
- A mapped polynomial method for high-accuracy approximations on arbitrary grids
- Parameter selection and numerical approximation properties of Fourier extensions from fixed data
- Pointwise and uniform convergence of Fourier extensions
- Infinite-dimensional \(\ell ^1\) minimization and function approximation from pointwise data
- AAA interpolation of equispaced data
- Fast and stable approximation of analytic functions from equispaced samples via polynomial frames
- On the Fourier Extension of Nonperiodic Functions
- Frames and numerical approximation
- scientific article; zbMATH DE number 1421270 (Why is no real title available?)
- A Fourier Extension Based Numerical Integration Scheme for Fast and High-Order Approximation of Convolutions with Weakly Singular Kernels
- Efficient function approximation on general bounded domains using splines on a Cartesian grid
- Subperiodic trigonometric hyperinterpolation
- Accurate and efficient spectral methods for elliptic PDEs in complex domains
This page was built for publication: On the numerical stability of Fourier extensions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q404262)
