Journal ArticleDOI
Historical notes on the fast Fourier transform
J.W. Cooley,Peter A. W. Lewis,Peter D. Welch +2 more
- Vol. 55, Iss: 10, pp 1675-1677
Reads0
Chats0
TLDR
The contributions of many investigators are described and placed in historical perspective in this paper on the fast Fourier transform algorithm.Abstract:
The fast Fourier transform algorithm has a long and interesting history that has only recently been appreciated. In this paper, the contributions of many investigators are described and placed in historical perspective.read more
Citations
More filters
Journal ArticleDOI
The Fast Fourier Transform and Its Applications
TL;DR: A description of the alogorithm and its programming is given here and followed by a theorem relating its operands, the finite sample sequences, to the continuous functions they often are intended to approximate.
Book
The design and analysis of parallel algorithms
TL;DR: Kurskod av teknisk-naturvetenskapliga fakultetsnämnden Kursplan giltig från: 2012, vecka 10 Ansvarig enhet: Inst för datavetenskap SCB-ämnesrubrik: Informatik/Dataoch systemvetenskapskap Huvudområden och successiv fördjupning.
Book
Data-Driven Science and Engineering: Machine Learning, Dynamical Systems, and Control
Steven L. Brunton,J. Nathan Kutz +1 more
TL;DR: In this paper, the authors bring together machine learning, engineering mathematics, and mathematical physics to integrate modeling and control of dynamical systems with modern methods in data science, and highlight many of the recent advances in scientific computing that enable data-driven methods to be applied to a diverse range of complex systems, such as turbulence, the brain, climate, epidemiology, finance, robotics, and autonomy.
Journal ArticleDOI
Gauss and the history of the fast fourier transform
TL;DR: The algorithm developed by Cooley and Tukey clearly had its roots in, though perhaps not a direct influence from, the early twentieth century, and remains the most Widely used method of computing Fourier transforms.
Journal ArticleDOI
An Adaptation of the Fast Fourier Transform for Parallel Processing
TL;DR: A modified version of the Fast Fourier Transform is developed and described and it is suggested that this form is of general use in the development and classification of various modifications and extensions of the algorithm.
References
More filters
Journal ArticleDOI
An algorithm for the machine calculation of complex Fourier series
J.W. Cooley,John W. Tukey +1 more
TL;DR: Good generalized these methods and gave elegant algorithms for which one class of applications is the calculation of Fourier series, applicable to certain problems in which one must multiply an N-vector by an N X N matrix which can be factored into m sparse matrices.
Proceedings ArticleDOI
Fast Fourier Transforms: for fun and profit
W. M. Gentleman,G. Sande +1 more
TL;DR: The "Fast Fourier Transform" has had a major effect on several areas of computing, the most striking example being techniques of numerical convolution, which have been completely revolutionized.
Journal ArticleDOI
Some improvements in practical Fourier analysis and their application to x-ray scattering from liquids
G.C. Danielson,Cornelius Lanczos +1 more
Journal ArticleDOI
Note on the calculation of Fourier series
TL;DR: A small-computer program has been written in this laboratory which uses the Danielson-Lanezos method with one minor modification, described below, and yields the same results as the binary form of the Cooley-Tukey algorithm with a comparable number of arithmetical operations.