Fast Fourier transform: Difference between revisions
Jump to navigation
Jump to search
mNo edit summary |
mNo edit summary |
||
| 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>. | ||
Revision as of 11:24, 27 September 2007
|
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 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} .