The Future Fast Fourier Transform?
From MaRDI portal
Recommendations
Cited in
(14)- The black-box fast multipole method
- Assessing fast Fourier transform algorithms.
- Efficient function approximation on general bounded domains using splines on a Cartesian grid
- On polynomials in spectral projections of spin operators
- Sampling for approximating R-limited functions
- A parallel scheme of discrete and fast Fourier transforms based on a polynomial representation of the basis.
- On the numerical stability of Fourier extensions
- How exponentially ill-conditioned are contiguous submatrices of the Fourier matrix?
- The AZ algorithm for least squares systems with a known incomplete generalized inverse
- How to multiply a matrix of normal equations by an arbitrary vector using FFT
- On the computation of the SVD of Fourier submatrices
- Pairs of spectral projections of spin operators
- Direct interpolative construction of the discrete Fourier transform as a matrix product operator
- Performance of the 3D FFT on the 6D network torus QCDOC parallel supercomputer
This page was built for publication: The Future Fast Fourier Transform?
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4253052)