Fast Fourier transform

From SklogWiki

Revision as of 15:52, 23 February 2007 by Carl McBride (talk | contribs) (New page: 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>. ==References== #J...)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to navigation Jump to search

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

James W. Cooley and John W. Tukey", "An Algorithm for the Machine Calculation of Complex Fourier Series", Mathematics of Computation 19 pp. 297- (1965)

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