A note on fast Fourier transforms for nonequispaced grids
From MaRDI portal
Publication:1272511
DOI10.1023/A:1018901926283zbMath0917.65123OpenAlexW35533706MaRDI QIDQ1272511
Publication date: 11 March 1999
Published in: Advances in Computational Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1018901926283
fast Fourier transformstrigonometric polynomialsB-splinesshift invariant spacesGaussian bellsnonequispaced grids
Numerical methods for discrete and fast Fourier transforms (65T50) Fourier coefficients, Fourier series of functions with special properties, special Fourier series (42A16)
Related Items
Approximate factorizations of Fourier matrices with nonequispaced knots ⋮ Fast algorithms for discrete polynomial transforms on arbitrary grids ⋮ An NFFT based approach to the efficient computation of dipole-dipole interactions under various periodic boundary conditions ⋮ Fast convolution with radial kernels at nonequispaced knots ⋮ Total Variation-Based Reconstruction and Phase Retrieval for Diffraction Tomography ⋮ Automated parameter tuning based on RMS errors for nonequispaced FFTs ⋮ Fast Algorithms and Efficient GPU Implementations for the Radon Transform and the Back-Projection Operator Represented as Convolution Operators ⋮ On the computation of the polar FFT ⋮ Aliasing error of the \(\exp(\beta\sqrt{1-z^2})\) kernel in the nonuniform fast Fourier transform ⋮ NFFT based Ewald summation for electrostatic systems with charges and dipoles ⋮ Direct inversion of the nonequispaced fast Fourier transform ⋮ On reconstruction from non-uniform spectral data ⋮ A new class of fully discrete sparse Fourier transforms: faster stable implementations with guarantees ⋮ A new theoretical derivation of NFFT and its implementation on GPU ⋮ NFFT.jl: Generic and Fast Julia Implementation of the Nonequidistant Fast Fourier Transform ⋮ Motion detection in diffraction tomography by common circle methods ⋮ Efficient calculations of 3-D FFTs on spiral contours ⋮ Sparsity enforcing edge detection method for blurred and noisy Fourier data ⋮ Nonuniform fast Fourier transforms with nonequispaced spatial and frequency data and fast sinc transforms ⋮ Accelerating the calculation of dipolar interactions in particle based simulations with open boundary conditions by means of the P\(^{2}\)NFFT method ⋮ Compressive optical deflectometric tomography: a constrained total-variation minimization approach ⋮ The Fourier approximation of smooth but non-periodic functions from unevenly spaced data ⋮ Numerical stability of nonequispaced fast Fourier transforms ⋮ A Mapped Polynomial Method for High-Accuracy Approximations on Arbitrary Grids ⋮ Fast evaluation of trigonometric polynomials from hyperbolic crosses ⋮ Fast Gauss transforms with complex parameters using NFFTs ⋮ Fast ewald summation based on NFFT with mixed periodicity ⋮ Continuous window functions for NFFT ⋮ Uniform error estimates for nonequispaced fast Fourier transforms ⋮ A Parallel Nonuniform Fast Fourier Transform Library Based on an “Exponential of Semicircle" Kernel ⋮ Learning in high-dimensional feature spaces using ANOVA-based fast matrix-vector multiplication ⋮ Fourier reconstruction for diffraction tomography of an object rotated into arbitrary orientations ⋮ Fourier series approximation of separable models
