Approximation error in regularized SVD-based Fourier continuations
From MaRDI portal
Recommendations
- Sobolev smoothing of SVD-based Fourier continuations
- A fast algorithm for Fourier continuation
- Estimates for the SVD of the truncated Fourier transform on \(L^2(\cosh (B|\cdot |))\) and stable analytic continuation
- On the numerical stability of Fourier extensions
- Convergence of the truncation error in calculating singular convolutions
Cites work
- 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 3258269 (Why is no real title available?)
- A Padé-based algorithm for overcoming the Gibbs phenomenon
- A comparison of numerical algorithms for Fourier extension of the first, second, and third kinds
- A fast algorithm for Fourier continuation
- A fast randomized algorithm for the approximation of matrices
- A spectral FC solver for the compressible Navier-Stokes equations in general domains. I: Explicit time-stepping
- Accurate, high-order representation of complex three-dimensional surfaces via Fourier continuation analysis
- Exponentially-convergent strategies for defeating the Runge phenomenon for the approximation of non-periodic functions. I: Single-interval schemes
- Extension of the range of a differentiable function
- 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
- Fast monte-carlo algorithms for finding low-rank approximations
- Fitting a C^m-smooth function to data. III.
- 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
- Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
- 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
- On the numerical stability of Fourier extensions
- On the resolution power of Fourier extensions for oscillatory functions
- Optimal filter and mollifier for piecewise smooth spectral data
- Randomized algorithms for the low-rank approximation of matrices
- Rational trigonometric approximations using Fourier series partial sums
- Robust reprojection methods for the resolution of the Gibbs phenomenon
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- Whitney’s extension problems and interpolation of data
Cited in
(13)- Frames and numerical approximation
- On the numerical stability of Fourier extensions
- A Hermite extension method for numerical differentiation
- Fast algorithms for the computation of Fourier extensions of arbitrary length
- Numerical differentiation by a Fourier extension method with super-order regularization
- Parameter selection and numerical approximation properties of Fourier extensions from fixed data
- Pointwise and uniform convergence of Fourier extensions
- Computer assisted Fourier analysis in sequence spaces of varying regularity
- Numerical differentiation for two-dimensional functions by a Fourier extension method
- On the resolution power of Fourier extensions for oscillatory functions
- Estimates for the SVD of the truncated Fourier transform on \(L^2(\cosh (B|\cdot |))\) and stable analytic continuation
- The Fourier approximation of smooth but non-periodic functions from unevenly spaced data
- Sobolev smoothing of SVD-based Fourier continuations
This page was built for publication: Approximation error in regularized SVD-based Fourier continuations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1760113)
