Gauss and the history of the fast Fourier transform
DOI10.1007/BF00348431zbMATH Open0577.01027OpenAlexW2069502471WikidataQ56048271 ScholiaQ56048271MaRDI QIDQ1065775FDOQ1065775
Authors: Michael T. Heideman, Don H. Johnson, C. Sidney Burrus
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
Recommendations
- An Algorithm for the Machine Calculation of Complex Fourier Series
- scientific article; zbMATH DE number 4135377
- Fast Fourier transforms: A tutorial review and a state of the art
- scientific article; zbMATH DE number 703110
- scientific article; zbMATH DE number 1217618
- scientific article; zbMATH DE number 4113830
- scientific article; zbMATH DE number 60565
numerical analysisdiscrete Fourier transformdigital signal processing\textit{J. W. Cooley}\textit{J. W. Tukey}
History of mathematics in the 19th century (01A55) History of mathematics in the 20th century (01A60) History of harmonic analysis on Euclidean spaces (42-03)
Cites Work
- An Algorithm for the Machine Calculation of Complex Fourier Series
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Some improvements in practical Fourier analysis and their application to X-ray scattering from liquids
- Title not available (Why is that?)
- Note on the Calculation of Fourier Series
- On computing the Discrete Fourier Transform
- Index mappings for multidimensional formulation of the DFT and convolution
- The inversion of the discrete gauss transform
Cited In (21)
- A two-scale FE-FFT approach to nonlinear magneto-elasticity
- Randomized low-rank approximation methods for projection-based model order reduction of large nonlinear dynamical problems
- A multiscale FE-FFT framework for electro-active materials at finite strains
- A conversation with I. J. Good
- Rigorous computation of linear response for intermittent maps
- QTT-rank-one vectors with QTT-rank-one and full-rank Fourier images
- On equilibrium solutions to nonlocal mechanistic models in ecology
- Even faster integer multiplication
- The partial fast Fourier transform
- Integer multiplication in time \(O(n\log n)\)
- Fast and numerically stable algorithms for discrete cosine transforms
- Reading Gauss in the computer age: On the U.S. Reception of Gauss's number theoretical work (1938-1989)
- Polynomial multiplication over finite fields in time \(O(n\log n)\)
- Miracles, misconceptions and scotomas in the theory of solitary waves
- An in-place truncated Fourier transform
- Gauss and the Earth's magnetic field model
- Supercharacters and the discrete Fourier, cosine, and sine transforms
- Separation of variables and the computation of Fourier transforms on finite groups. II
- The Heritage of Fourier
- Decomposing monomial representations of solvable groups.
- Necklaces, convolutions, and \(X+Y\)
This page was built for publication: Gauss and the history of the fast Fourier transform
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1065775)