Fast Fourier transforms for nonequispaced data. II
From MaRDI portal
Publication:1345056
DOI10.1006/acha.1995.1007zbMath0822.65130OpenAlexW1998152471MaRDI QIDQ1345056
Publication date: 1 March 1995
Published in: Applied and Computational Harmonic Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/acha.1995.1007
Related Items (30)
Approximate factorizations of Fourier matrices with nonequispaced knots ⋮ Fast algorithms for discrete polynomial transforms on arbitrary grids ⋮ A geometric nonuniform fast Fourier transform ⋮ The uselessness of the fast Gauss transform for summing Gaussian radial basis function series ⋮ Fast and accurate polar Fourier transform ⋮ An efficient spectral method for computing dynamics of rotating two-component Bose-Einstein condensates via coordinate transformation ⋮ Computing the Hilbert transform using biorthogonal spline wavelets ⋮ Fourier reconstruction of univariate piecewise-smooth functions from non-uniform spectral data with exponential convergence rates ⋮ Direct inversion of the nonequispaced fast Fourier transform ⋮ 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 ⋮ Stable reconstructions in Hilbert spaces and the resolution of the Gibbs phenomenon ⋮ Fast SGL Fourier transforms for scattered data ⋮ Nonuniform fast Fourier transforms with nonequispaced spatial and frequency data and fast sinc transforms ⋮ An efficient boundary integral scheme for the MBO threshold dynamics method via the NUFFT ⋮ On the stability of unevenly spaced samples for interpolation and quadrature ⋮ A Frame Reconstruction Algorithm with Applications to Magnetic Resonance Imaging ⋮ The Fourier approximation of smooth but non-periodic functions from unevenly spaced data ⋮ A Mapped Polynomial Method for High-Accuracy Approximations on Arbitrary Grids ⋮ An algorithm for the rapid evaluation of special function transforms ⋮ An efficient boundary integral scheme for the threshold dynamics method. II. Applications to wetting dynamics ⋮ Continuous window functions for NFFT ⋮ Fast Fourier transforms of piecewise polynomials ⋮ Bounds on the Singular Values of Matrices with Displacement Structure ⋮ Uniform error estimates for nonequispaced fast Fourier transforms ⋮ A Parallel Nonuniform Fast Fourier Transform Library Based on an “Exponential of Semicircle" Kernel ⋮ Projective Fourier analysis for patterns ⋮ Fourier series approximation of separable models ⋮ A fast method for imposing periodic boundary conditions on arbitrarily-shaped lattices in two dimensions ⋮ A fast algorithm for the inversion of general Toeplitz matrices
This page was built for publication: Fast Fourier transforms for nonequispaced data. II
