Gauss and the history of the fast Fourier transform

DOI10.1007/BF00348431zbMath0577.01027OpenAlexW2069502471WikidataQ56048271 ScholiaQ56048271MaRDI QIDQ1065775

Michael T. Heideman, C. Sidney Burrus, Don H. Johnson

Publication date: 1985

Published in: Archive for History of Exact Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00348431

zbMATH Keywords

discrete Fourier transformdigital signal processingnumerical analysis\textit{J. W. Cooley}\textit{J. W. Tukey}

Mathematics Subject Classification ID

History of mathematics in the 20th century (01A60) History of mathematics in the 19th century (01A55) History of harmonic analysis on Euclidean spaces (42-03)

Related Items (17)

Even faster integer multiplication ⋮ Miracles, misconceptions and scotomas in the theory of solitary waves ⋮ Polynomial Multiplication over Finite Fields in Time \( O(n \log n \) ⋮ Integer multiplication in time \(O(n\log n)\) ⋮ Supercharacters and the discrete Fourier, cosine, and sine transforms ⋮ Rigorous computation of linear response for intermittent maps ⋮ QTT-rank-one vectors with QTT-rank-one and full-rank Fourier images ⋮ Separation of variables and the computation of Fourier transforms on finite groups. II ⋮ Necklaces, convolutions, and \(X+Y\) ⋮ A multiscale FE-FFT framework for electro-active materials at finite strains ⋮ Fast and numerically stable algorithms for discrete cosine transforms ⋮ The partial fast Fourier transform ⋮ An in-place truncated Fourier transform ⋮ Reading Gauss in the computer age: On the U.S. Reception of Gauss's number theoretical work (1938-1989) ⋮ A conversation with I. J. Good ⋮ Gauss et le modèle du champ magnétique terrestre ⋮ Decomposing monomial representations of solvable groups.

Cites Work

• Some improvements in practical Fourier analysis and their application to X-ray scattering from liquids
• The inversion of the discrete gauss transform
• On computing the Discrete Fourier Transform
• Index mappings for multidimensional formulation of the DFT and convolution
• An Algorithm for the Machine Calculation of Complex Fourier Series
• Note on the Calculation of Fourier Series
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Gauss and the history of the fast Fourier transform