Item #K6279 An Algorithm for the Machine Calculation of Complex Fourier Series, in , Mathematics of Computation vol 19 1965. James W. Cooley, Mathematics of Computation vol 19 1965 John W. Tukey.

An Algorithm for the Machine Calculation of Complex Fourier Series, in , Mathematics of Computation vol 19 1965.

Mathematics of Computation vol 19 1965.

Condition: Good+ overall, green cloth hardcover, exlibrary from a technical library, rubberstamps on textblock edges and on endpages, with pocket at rear. Corner bumps, scuffs and shelfwear to boards. Original paper covers not bound-in. Text pages clean and unmarked.

Keywords: tukey cooley algorithms, fourier series, FFT transforms, cooley and tukey, james cooley and john tukey, An Algorithm for the Machine Calculation of Complex Fourier Series, mathematics of computation 1965, fast Fourier transform algorithm

Categories: 1960's computers and computing, Computer Science, Cryptanalysis, Cryptology, Computer Security, Highspots in the History of Computing, Mathematics, Technical Journals, Proceedings, Conferences, Miscellaneous

See all items by ,

Price: $150.00

Add to Cart Ask a Question

Item Description

Cooley, James W. and John W. Tukey. 'An algorithm for the Machine Calculation of Complex Fourier Series', in: Mathematics of Computation, volume 19, no.90, pp.297-301 Volume also includes paper by Metropolis and Ashenhurst, Radix Conversion in an Unnormalized Arithmetic System (MANIAC III)

'Cooley and Tukey's paper introduced the fast Fourier transform algorithm (FFT) to the scientific computing world. ... The great economies of calculation effected by FFT made possible a number of major advances in scientific computing, including digital filtering, spectral analysis, and digital methods for processing speech, music, and images' (Origins of Cyberspace, 548).