Rapid Computation of the Discrete Fourier Transform
From MaRDI portal
Recommendations
- Fast computation of partial Fourier transforms
- On a fast algorithm for computing the Fourier transform
- Very fast computation of the radix-2 discrete Fourier transform
- Computational aspects of fast Fourier transformation
- scientific article; zbMATH DE number 610966
- Hardware efficient fast computation of the discrete Fourier transform
- Fast and precise Fourier transforms
- On a fast and accurate method for computing Fourier transforms
- scientific article; zbMATH DE number 3894433
Cited in
(39)- Fast Fourier transforms for nonequispaced data. II
- Fast Fourier transforms of piecewise constant functions
- A version of the discrete Fourier transform with nodes on parallelepipedal lattices
- A new theoretical derivation of NFFT and its implementation on GPU
- Speedy numerical algorithms and architecture for additive spectral analysis
- Approximate factorizations of Fourier matrices with nonequispaced knots
- Non-equispaced fast Fourier transforms with applications to tomography
- On the fast Fourier transform of functions with singularities
- Approximation of multivariate periodic functions by trigonometric polynomials based on rank-1 lattice sampling
- A multiscale sub-linear time Fourier algorithm for noisy data
- An extra-component method for evaluating fast matrix-vector multiplication with special functions
- Exact computation in numerical linear algebra: The discrete Fourier transform
- Fast and approximate computation of Laplace and Fourier transforms
- Using NFFT 3 -- a software library for various nonequispaced fast Fourier transforms
- scientific article; zbMATH DE number 4130975 (Why is no real title available?)
- Fast computation of partial Fourier transforms
- scientific article; zbMATH DE number 3942982 (Why is no real title available?)
- scientific article; zbMATH DE number 3970070 (Why is no real title available?)
- On computing the discrete Fourier and cosine transforms
- scientific article; zbMATH DE number 4007688 (Why is no real title available?)
- Unscrambling for fast DFT algorithms
- scientific article; zbMATH DE number 4082931 (Why is no real title available?)
- Fast computation of real discrete Fourier transform for any number of data points
- Vector computation of the discrete Fourier transform
- The Fast Computation of Dolph‐Chebyshev Coefficients
- The Fast Staggered Transform, composite symmetries, and compact symmetric algorithms
- A recursive fast Fourier transformation algorithm
- A nonuniform fast Fourier transform based on low rank approximation
- Fast polynomial transforms based on Toeplitz and Hankel matrices
- The Fourier approximation of smooth but non-periodic functions from unevenly spaced data
- Approximate calculation of ordinary Fourier transform by means of the discrete one
- \textit{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
- Fast Discrete Curvelet Transforms
- NFFT.jl: Generic and Fast Julia Implementation of the Nonequidistant Fast Fourier Transform
- Discrete orthogonal function expansions for non-uniform grids using the fast Fourier transform
- Fast and accurate polar Fourier transform
- Combinatorial sublinear-time Fourier algorithms
This page was built for publication: Rapid Computation of the Discrete Fourier Transform
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4891742)
