Fast algorithms for Fourier extension based on boundary interval data
From MaRDI portal
Cites work
- A comparison of numerical algorithms for Fourier extension of the first, second, and third kinds
- A fast algorithm for Fourier continuation
- A Padé-based algorithm for overcoming the Gibbs phenomenon
- A stable high-order FC-based methodology for hemodynamic wave propagation
- An FC-based spectral solver for elastodynamic problems in general three-dimensional domains
- Fast algorithms for the computation of Fourier extensions of arbitrary length
- Function approximation on arbitrary domains using Fourier extension frames
- High-order unconditionally stable FC-AD solvers for general smooth domains. I: Basic elements
- scientific article; zbMATH DE number 1889798 (Why is no real title available?)
- scientific article; zbMATH DE number 803211 (Why is no real title available?)
- Numerical Fourier analysis
- 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
- Optimal filter and mollifier for piecewise smooth spectral data
- Parameter selection and numerical approximation properties of Fourier extensions from fixed data
- Pointwise and uniform convergence of Fourier extensions
- Rational trigonometric approximations using Fourier series partial sums
- Robust reprojection methods for the resolution of the Gibbs phenomenon
- Sobolev smoothing of SVD-based Fourier continuations
- Two-dimensional Fourier continuation and applications
This page was built for publication: Fast algorithms for Fourier extension based on boundary interval data
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7345702)
