An Algorithm for the Machine Calculation of Complex Fourier Series [within] Mathematics of Computation XIX Nos. 89-92 1965

Cooley, James W.; John W. Tukey; Harry Polacheck [chairman]

Editore: American Mathematical Society, 1965

Riguardo questo articolo

25.5 x 17.5 cm. 724pp. Four issues of the Journal Mathematics of Computation 19, bound together into green boards. The table of contents are present and printed on stiff blue paper, the original covers are not present. The highlight is pages 297-302 which contain the paper "An Algorithm for the Machine Calculation of Complex Fourier Series" by Cooley and Tukey. Provenance: From the Autonetics Research Library with stamps on the bottom foredge. First publication of the Cooley-Tukey Fast Fourier Transform Algorithm (FFT), a faster method for calculating the discrete Fourier transform (DFT). The Cooley-Tukey algorithm is a divide and conquer algorithm which calculates the DFT directly with fewer summations and without matrix mulitplication. A similar algorithm was discovered by Frederick Gauss in 1805, though Cooley and Tukey independently discovered it at are credited with the invention of the modern FFT algorithm during a meeting of President Kennedy's Science Advisory Committee. References: Jeremy Norman's History of Information website and his bibliography. Origins of Cyberspace, 548. C. Sidney Burrus's article on FFTs on LibreTexts. The article "What Makes a Fourier Transform Fast" on the site algorithm-archive by Jamers Schloss.

Codice articolo 73082

Dati bibliografici

• Titolo: An Algorithm for the Machine Calculation of Complex Fourier Series [within] Mathematics of Computation XIX Nos. 89-92 1965
• Editore: American Mathematical Society
• Data di pubblicazione: 1965
• Rilegatura: Hardcover
• Edizione: First edition.
• Condizione: Very Good
• Cataloghi dei venditori:
  • Mathematics