Nonequispaced fast Fourier transforms without oversampling
From MaRDI portal
Publication:4582607
Recommendations
- Fast Fourier Transforms for Nonequispaced Data
- scientific article; zbMATH DE number 1284007
- Fast Fourier transforms for nonequispaced data. II
- Nonuniform fast Fourier transforms with nonequispaced spatial and frequency data and fast sinc transforms
- Accelerating the Nonuniform Fast Fourier Transform
- Optimized Least-Square Nonuniform Fast Fourier Transform
- Nonequispaced Hyperbolic Cross Fast Fourier Transform
- Fast Numerical Nonlinear Fourier Transforms
- scientific article; zbMATH DE number 3854372
- Numerical stability of nonequispaced fast Fourier transforms
Cited in
(10)- NFFT.jl: Generic and Fast Julia Implementation of the Nonequidistant Fast Fourier Transform
- Time and memory requirements of the nonequispaced FFT
- Preconditioned Legendre spectral Galerkin methods for the non-separable elliptic equation
- Multidimensional Nonseparable Oversampled Lapped Transforms: Theory and Design
- Accurate pairwise convolutions of non-negative vectors via FFT
- Nonequispaced FFT. Generalisation and inversion.
- Approximation of multivariate periodic functions by trigonometric polynomials based on rank-1 lattice sampling
- Nonuniform fast Fourier transforms with nonequispaced spatial and frequency data and fast sinc transforms
- Fast Fourier methods for trigonometric polynomials and bandlimited functions
- A nonuniform fast Fourier transform based on low rank approximation
This page was built for publication: Nonequispaced fast Fourier transforms without oversampling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4582607)
