Fast Fourier transform: Difference between revisions
Jump to navigation
Jump to search
Carl McBride (talk | contribs) m (→References) |
m (Added link to code F.37) |
||
(2 intermediate revisions by the same user not shown) | |||
Line 1: | Line 1: | ||
{{Stub-general}} | |||
Invented by James W. Cooley and John W. Tukey in 1965 (Ref 1). | Invented by James W. Cooley and John W. Tukey in 1965 (Ref 1). | ||
The fast Fourier transform reduces the number of operations from <math>N^2</math> to <math>N \ln N</math>. | The fast Fourier transform reduces the number of operations from <math>N^2</math> to <math>N \ln N</math>. | ||
==References== | ==References== | ||
#[http://links.jstor.org/sici?sici=0025-5718%28196504%2919%3A90%3C297%3AAAFTMC%3E2.0.CO%3B2-7 James W. Cooley and John W. Tukey", "An Algorithm for the Machine Calculation of Complex Fourier Series", Mathematics of Computation '''19''' pp. 297-301 (1965)] | #[http://links.jstor.org/sici?sici=0025-5718%28196504%2919%3A90%3C297%3AAAFTMC%3E2.0.CO%3B2-7 James W. Cooley and John W. Tukey", "An Algorithm for the Machine Calculation of Complex Fourier Series", Mathematics of Computation '''19''' pp. 297-301 (1965)] | ||
==External resources== | |||
*[ftp://ftp.dl.ac.uk/ccp5/ALLEN_TILDESLEY/F.37 Routines to calculate Fourier transforms] sample FORTRAN computer code from the book [http://www.oup.com/uk/catalogue/?ci=9780198556459 M. P. Allen and D. J. Tildesley "Computer Simulation of Liquids", Oxford University Press (1989)]. | |||
[[Category: Mathematics]] |
Latest revision as of 18:38, 8 February 2009
Invented by James W. Cooley and John W. Tukey in 1965 (Ref 1). The fast Fourier transform reduces the number of operations from to .
References[edit]
External resources[edit]
- Routines to calculate Fourier transforms sample FORTRAN computer code from the book M. P. Allen and D. J. Tildesley "Computer Simulation of Liquids", Oxford University Press (1989).