Gauss and the history of the fast Fourier transform
type: Item
instance of: scholarly article
title: Gauss and the history of the fast Fourier transform
zbMATH Open document ID: 0577.01027
DOI: 10.1007/BF00348431
author: Michael T. Heideman
author: Don H. Johnson
author: C. Sidney Burrus
published in: Archive for History of Exact Sciences
publication date: 1985-01-01T00:00:00Z
review text: The fast Fourier transform algorithm as a means of calculating the discrete Fourier transform was published in 1965 by \textit{J. W. Cooley} and \textit{J. W. Tukey} in the paper ''An algorithm for the machine calculation of complex Fourier series'' [Math. Comput. 19, 297-301 (1965; Zbl 0127.090)]. It is considered to be a turning point in digital signal processing and in certain areas of numerical analysis. After its publication, some similar algorithms were discovered in older literature of the 20th century, until in 1977 \textit{H. H. Goldstine}, in his ''History of numerical analysis from the 16th through the 19th century'' (1977; Zbl 0402.01005), attributed an algorithm of this kind to C. F. Gauss. This caused the authors to trace the history of Fourier series coefficient calculation back into the 18th and 19th centuries. Their findings are summarized in the following paragraph (p. 272); ''This investigation has once again demonstrated the virtuosity of Carl Friedrich Gauss. In addition, it has shown how certain problems can be timeless, but that their solution can be rediscovered again and again. Burkhardt pointed out this algorithm in 1904 and Goldstine suggested the connection between Gauss and the FFT in 1977, but both of these went largely unnoticed, presumably because they were published in books dealing primarily with history. It was shown that various attempts at efficient algorithms were used in Great Britain and elsewhere in the 19th century, but were unrelated to the work of Gauss and were, in fact, not as general or well- formulated as Gauss' work. Almost one hundred years passed between the publication of Gauss' algorithm and the modern rediscovery of this approach by Cooley and Tukey''.
Mathematics Subject Classification ID: 01A55
Mathematics Subject Classification ID: 01A60
Mathematics Subject Classification ID: 42-03
zbMATH DE Number: 3922590
zbMATH Keywords: discrete Fourier transform
zbMATH Keywords: \textit{J. W. Cooley}
zbMATH Keywords: \textit{J. W. Tukey}
zbMATH Keywords: digital signal processing
zbMATH Keywords: numerical analysis
Wikidata QID: Q56048271
reviewed by: Christoph J. Scriba
MaRDI profile type: Publication
cites work: An Algorithm for the Machine Calculation of Complex Fourier Series
cites work: Q4154030
cites work: Q3258578
cites work: Note on the Calculation of Fourier Series
cites work: Some improvements in practical Fourier analysis and their application to X-ray scattering from liquids
cites work: Q4186267
cites work: On computing the Discrete Fourier Transform
cites work: Q3228574
cites work: Q3967932
cites work: Index mappings for multidimensional formulation of the DFT and convolution
cites work: The inversion of the discrete gauss transform
full work available at URL: https://doi.org/10.1007/bf00348431
OpenAlex ID: W2069502471
Recommended article: An Algorithm for the Machine Calculation of Complex Fourier Series
Recommended article: Q3468597
Recommended article: Fast Fourier transforms: A tutorial review and a state of the art
Recommended article: Q4316191
Recommended article: Q4214963
Recommended article: Q4729231
Recommended article: Q4009095
description: scientific article; zbMATH DE number 3922590