A note on fast Fourier transforms for nonequispaced grids
From MaRDI portal
Publication:1272511
DOI10.1023/A:1018901926283zbMath0917.65123MaRDI QIDQ1272511
Publication date: 11 March 1999
Published in: Advances in Computational Mathematics (Search for Journal in Brave)
fast Fourier transforms; trigonometric polynomials; B-splines; shift invariant spaces; Gaussian bells; nonequispaced grids
65T50: Numerical methods for discrete and fast Fourier transforms
42A16: Fourier coefficients, Fourier series of functions with special properties, special Fourier series
Related Items
Fast Gauss transforms with complex parameters using NFFTs, Efficient calculations of 3-D FFTs on spiral contours, Sparsity enforcing edge detection method for blurred and noisy Fourier data, On reconstruction from non-uniform spectral data, On the computation of the polar FFT, Numerical stability of nonequispaced fast Fourier transforms, Fourier series approximation of separable models, Approximate factorizations of Fourier matrices with nonequispaced knots, Fast algorithms for discrete polynomial transforms on arbitrary grids, Fast convolution with radial kernels at nonequispaced knots, Fast evaluation of trigonometric polynomials from hyperbolic crosses