History of Numerical Analysis

Introduction

Oral Histories

Articles

Links

Links

 

James W. Cooley

Full Article (pdf)

James Cooley recalls the history of the Fast Fourier Transform algorithm (FFT). He discusses aspects of numerical analysis, computer implementation, and applications. He also touches on the role of scientific societies in disseminating significant advances.

Key words: crystallography, seismic monitoring, acoustic detection, discrete Fourier transform, digital filtering, spectral analysis, speech processing, music processing image processing, radix 2 algorithm, nlog(n) timing

Time frame: 1960's

People: Dick Garwin, John Tukey, George Sande, Peter Welch, Peter Lewis, Norman Brenner, Phillip Rudnick, G. C. Danielson, Cornelius Lanczos,

Location: Watson Scientific Laboratory of Columbia University, Massachusetts Institute of Technology, Arden House, Scripps Institution of Oceanography (San Diego)

Copyright: Reprinted from "A History of Scientific Computing," Stephen G.
Nash, editor, pp. 133 -140. (c) 1990 ACM Press (Association for Computing
Machinery, Inc.) by permission.

 

 

Copyright ©, Society for Industrial and Applied Mathematics
3600 University City Science Center | Philadelphia, PA 19104 USA
Phone: +1-215-382-9800 | FAX: +1-215-386-7999
site map | webmaster@siam.org

This project is funded by a grant from the United States Department of Energy.