Approximation error in regularized SVD-based Fourier continuations
From MaRDI portal
Publication:1760113
DOI10.1016/j.apnum.2012.06.032zbMath1255.65254MaRDI QIDQ1760113
Publication date: 12 November 2012
Published in: Applied Numerical Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.apnum.2012.06.032
convergence; numerical examples; singular value decomposition; Fourier series; Fourier extension; Fourier continuation
65T40: Numerical methods for trigonometric approximation and interpolation
42A16: Fourier coefficients, Fourier series of functions with special properties, special Fourier series
Related Items
Numerical differentiation for two-dimensional functions by a Fourier extension method, Frames and Numerical Approximation, On the numerical stability of Fourier extensions, The Fourier approximation of smooth but non-periodic functions from unevenly spaced data, Sobolev smoothing of SVD-based Fourier continuations, Parameter selection and numerical approximation properties of Fourier extensions from fixed data, Pointwise and uniform convergence of Fourier extensions, A Hermite extension method for numerical differentiation, Numerical differentiation by a Fourier extension method with super-order regularization, On the resolution power of Fourier extensions for oscillatory functions, Fast Algorithms for the Computation of Fourier Extensions of Arbitrary Length
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the numerical stability of Fourier extensions
- A spectral FC solver for the compressible Navier-Stokes equations in general domains. I: Explicit time-stepping
- Robust reprojection methods for the resolution of the Gibbs phenomenon
- A fast randomized algorithm for the approximation of matrices
- High-order unconditionally stable FC-AD solvers for general smooth domains. II: Elliptic, parabolic and hyperbolic PDEs; theoretical considerations
- On the Gibbs phenomenon. I: Recovering exponential accuracy from the Fourier partial sum of a nonperiodic analytic function
- A comparison of numerical algorithms for Fourier extension of the first, second, and third kinds
- Rational trigonometric approximations using Fourier series partial sums
- High-order unconditionally stable FC-AD solvers for general smooth domains. I: Basic elements
- Fitting a \(C^m\)-smooth function to data. III.
- Accurate, high-order representation of complex three-dimensional surfaces via Fourier continuation analysis
- On the resolution power of Fourier extensions for oscillatory functions
- Extension of the range of a differentiable function
- Randomized algorithms for the low-rank approximation of matrices
- On the Fourier Extension of Nonperiodic Functions
- Impossibility of Fast Stable Approximation of Analytic Functions from Equispaced Samples
- A Fast Algorithm for Fourier Continuation
- Optimal filter and mollifier for piecewise smooth spectral data
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
- Whitney’s extension problems and interpolation of data
- Fast monte-carlo algorithms for finding low-rank approximations
- Fast Monte Carlo Algorithms for Matrices II: Computing a Low-Rank Approximation to a Matrix
- Fast Monte Carlo Algorithms for Matrices III: Computing a Compressed Approximate Matrix Decomposition
- A Padé-based algorithm for overcoming the Gibbs phenomenon
