Fast Fourier transform: Difference between revisions
Jump to navigation
Jump to search
Carl McBride (talk | contribs) m (→References) |
mNo edit summary |
||
| Line 4: | Line 4: | ||
==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)] | ||
[[Category: Mathematics]] | |||
Revision as of 12:56, 27 February 2007
Invented by James W. Cooley and John W. Tukey in 1965 (Ref 1). The fast Fourier transform reduces the number of operations from 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^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} .