Transcription of An Algorithm for the Machine Calculation of Complex ...
{{id}} {{{paragraph}}}
Example: air traffic controller
An Algorithm for the Machine Calculation of Complex ...
An Algorithm for the Machine Calculation ofComplex Fourier SeriesBy James W. Cooley and John W. TukeyAn efficient method for the Calculation of the interactions of a 2m factorial ex-periment was introduced by Yates and is widely known by his name. The generaliza-tion to 3m was given by Box et al. [1]. Good [2] generalized these methods and gaveelegant algorithms for which one class of applications is the Calculation of Fourierseries. In their full generality, Good's methods are applicable to certain problems inwhich one must multiply an JV-vector by an JV X N matrix which can be factoredinto m sparse matrices, where m is proportional to log JV.
where the given Fourier coefficients Aik) are complex and W is the principal JVth root of unity, (2) W = e2rilN. ... factors of 2 can be combined in pairs without loss. If we are able to choose JV to be highly composite, we may make very real gains. If all r¡ are equal to r, then, from
Loading..
Tags:
Information
Domain:
Source:
Link to this page:
Please notify us if you found a problem with this document: