The Future Fast Fourier Transform?

DOI10.1137/S1064827597316266zbMath0926.65145OpenAlexW2011253351WikidataQ54087138 ScholiaQ54087138MaRDI QIDQ4253052

Alan Edelman, Peter McCorquodale, Sivan Toledo

Publication date: 24 June 1999

Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/s1064827597316266

zbMATH Keywords

fast Fourier transformparallel computationnonequispaced datafast multi-pole methodinexact discrete Fourier transform

Mathematics Subject Classification ID

Numerical methods for discrete and fast Fourier transforms (65T50) Parallel numerical computation (65Y05) Complexity and performance of numerical algorithms (65Y20)

Related Items (10)

Sampling for approximating $R$-limited functions ⋮ On the numerical stability of Fourier extensions ⋮ On the computation of the SVD of Fourier submatrices ⋮ Pairs of spectral projections of spin operators ⋮ The AZ Algorithm for Least Squares Systems with a Known Incomplete Generalized Inverse ⋮ On polynomials in spectral projections of spin operators ⋮ Performance of the 3D FFT on the 6D network torus QCDOC parallel supercomputer ⋮ The black-box fast multipole method ⋮ Efficient function approximation on general bounded domains using splines on a Cartesian grid ⋮ How Exponentially Ill-Conditioned Are Contiguous Submatrices of the Fourier Matrix?

This page was built for publication: The Future Fast Fourier Transform?