Fast Fourier transform

From SklogWiki

Jump to navigation Jump to search

This article is a 'stub' page, it has no, or next to no, content. It is here at the moment to help form part of the structure of SklogWiki. If you add sufficient material to this article then please remove the {{Stub-general}} template from this page.

Invented by James W. Cooley and John W. Tukey in 1965 (Ref 1). The fast Fourier transform reduces the number of operations from $N^{2}$ to Failed to parse (SVG (MathML can be enabled via browser plugin): Invalid response ("Math extension cannot connect to Restbase.") from server "https://wikimedia.org/api/rest_v1/":): {\displaystyle N \ln N} .

References[edit]

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[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).

Retrieved from "http://www.sklogwiki.org/SklogWiki/index.php?title=Fast_Fourier_transform&oldid=7721"