Pages that link to "Item:Q4891742"
From MaRDI portal
The following pages link to Rapid Computation of the Discrete Fourier Transform (Q4891742):
Displaying 34 items.
- A multiscale sub-linear time Fourier algorithm for noisy data (Q262947) (← links)
- The Fourier approximation of smooth but non-periodic functions from unevenly spaced data (Q489772) (← links)
- Discrete orthogonal function expansions for non-uniform grids using the fast Fourier transform (Q761787) (← links)
- Fast and accurate polar Fourier transform (Q849677) (← links)
- Combinatorial sublinear-time Fourier algorithms (Q972615) (← links)
- A note on fast Fourier transforms for nonequispaced grids (Q1272511) (← links)
- Fast Fourier transforms for nonequispaced data. II (Q1345056) (← links)
- Fast Fourier transforms of piecewise constant functions (Q1346547) (← links)
- A version of the discrete Fourier transform with nodes on parallelepipedal lattices (Q1395319) (← links)
- A new theoretical derivation of NFFT and its implementation on GPU (Q1690700) (← links)
- Speedy numerical algorithms and architecture for additive spectral analysis (Q1868500) (← links)
- Approximate factorizations of Fourier matrices with nonequispaced knots (Q1874676) (← links)
- Non-equispaced fast Fourier transforms with applications to tomography (Q1879325) (← links)
- On the fast Fourier transform of functions with singularities (Q1907304) (← links)
- Approximation of multivariate periodic functions by trigonometric polynomials based on rank-1 lattice sampling (Q2349094) (← links)
- An extra-component method for evaluating fast matrix-vector multiplication with special functions (Q2691900) (← links)
- Exact computation in numerical linear algebra: The discrete Fourier transform (Q2776695) (← links)
- Fast and approximate computation of Laplace and Fourier transforms (Q2797847) (← links)
- (Q3713555) (← links)
- (Q3736869) (← links)
- On computing the discrete Fourier and cosine transforms (Q3757261) (← links)
- Unscrambling for fast DFT algorithms (Q3806773) (← links)
- Fast computation of real discrete Fourier transform for any number of data points (Q3986791) (← links)
- Vector computation of the discrete Fourier transform (Q4220994) (← links)
- The Fast Computation of Dolph‐Chebyshev Coefficients (Q4319394) (← links)
- The Fast Staggered Transform, composite symmetries, and compact symmetric algorithms (Q4320785) (← links)
- A recursive fast Fourier transformation algorithm (Q4338093) (← links)
- A Nonuniform Fast Fourier Transform Based on Low Rank Approximation (Q4603509) (← links)
- Fast polynomial transforms based on Toeplitz and Hankel matrices (Q4637582) (← links)
- <i>Unbiased</i> cosmology inference from biased tracers using the EFT likelihood (Q5035270) (← links)
- A Parallel Nonuniform Fast Fourier Transform Library Based on an “Exponential of Semicircle" Kernel (Q5238750) (← links)
- A Multiscale Butterfly Algorithm for Multidimensional Fourier Integral Operators (Q5266236) (← links)
- Fast Discrete Curvelet Transforms (Q5757470) (← links)
- NFFT.jl: Generic and Fast Julia Implementation of the Nonequidistant Fast Fourier Transform (Q6098516) (← links)