Rapid Computation of the Discrete Fourier Transform
From MaRDI portal
Publication:4891742
DOI10.1137/0917059zbMath0858.65144MaRDI QIDQ4891742
Marie Dillon Dahleh, Chris K. Anderson
Publication date: 22 October 1996
Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0917059
fast algorithms; fast Fourier transform; discrete Fourier transform; inverse Fourier transform; local Taylor series expansions; nonequispaced points
65T50: Numerical methods for discrete and fast Fourier transforms
Related Items
A Nonuniform Fast Fourier Transform Based on Low Rank Approximation, Fast polynomial transforms based on Toeplitz and Hankel matrices, Unbiased cosmology inference from biased tracers using the EFT likelihood, A Parallel Nonuniform Fast Fourier Transform Library Based on an “Exponential of Semicircle" Kernel, A Multiscale Butterfly Algorithm for Multidimensional Fourier Integral Operators, NFFT.jl: Generic and Fast Julia Implementation of the Nonequidistant Fast Fourier Transform, A multiscale sub-linear time Fourier algorithm for noisy data, The Fourier approximation of smooth but non-periodic functions from unevenly spaced data, Fast and accurate polar Fourier transform, Combinatorial sublinear-time Fourier algorithms, A new theoretical derivation of NFFT and its implementation on GPU, Approximate factorizations of Fourier matrices with nonequispaced knots, Approximation of multivariate periodic functions by trigonometric polynomials based on rank-1 lattice sampling, An extra-component method for evaluating fast matrix-vector multiplication with special functions
