Pages that link to "Item:Q4891742"
From MaRDI portal
The following pages link to Rapid Computation of the Discrete Fourier Transform (Q4891742):
Displayed 14 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)
- Fast and accurate polar Fourier transform (Q849677) (← links)
- Combinatorial sublinear-time Fourier algorithms (Q972615) (← links)
- A new theoretical derivation of NFFT and its implementation on GPU (Q1690700) (← links)
- Approximate factorizations of Fourier matrices with nonequispaced knots (Q1874676) (← 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)
- 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)
- NFFT.jl: Generic and Fast Julia Implementation of the Nonequidistant Fast Fourier Transform (Q6098516) (← links)