Rapid Computation of the Discrete Fourier Transform
From MaRDI portal
Publication:4891742
DOI10.1137/0917059zbMath0858.65144OpenAlexW1981562337MaRDI 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 algorithmsfast Fourier transformdiscrete Fourier transforminverse Fourier transformlocal Taylor series expansionsnonequispaced points
Related Items
Approximate factorizations of Fourier matrices with nonequispaced knots ⋮ Unbiased cosmology inference from biased tracers using the EFT likelihood ⋮ Fast and accurate polar Fourier transform ⋮ A new theoretical derivation of NFFT and its implementation on GPU ⋮ NFFT.jl: Generic and Fast Julia Implementation of the Nonequidistant Fast Fourier Transform ⋮ A Nonuniform Fast Fourier Transform Based on Low Rank Approximation ⋮ An extra-component method for evaluating fast matrix-vector multiplication with special functions ⋮ The Fourier approximation of smooth but non-periodic functions from unevenly spaced data ⋮ Fast polynomial transforms based on Toeplitz and Hankel matrices ⋮ Combinatorial sublinear-time Fourier algorithms ⋮ A Parallel Nonuniform Fast Fourier Transform Library Based on an “Exponential of Semicircle" Kernel ⋮ Approximation of multivariate periodic functions by trigonometric polynomials based on rank-1 lattice sampling ⋮ A Multiscale Butterfly Algorithm for Multidimensional Fourier Integral Operators ⋮ A multiscale sub-linear time Fourier algorithm for noisy data
