Search preferences
Skip to main search results

Search filters

Product Type

  • All Product Types 
  • Books (1)
  • Magazines & Periodicals (No further results match this refinement)
  • Comics (No further results match this refinement)
  • Sheet Music (No further results match this refinement)
  • Art, Prints & Posters (No further results match this refinement)
  • Photographs (No further results match this refinement)
  • Maps (No further results match this refinement)
  • Manuscripts & Paper Collectibles (No further results match this refinement)

Condition

Binding

Collectible Attributes

Language (1)

Price

  • Any Price 
  • Under US$ 25 (No further results match this refinement)
  • US$ 25 to US$ 50 (No further results match this refinement)
  • Over US$ 50 
Custom price range (US$)

Free Shipping

  • Free Shipping to U.S.A. (No further results match this refinement)

Seller Location

  • Seller image for An Algorithm for the Machine Calculation of Complex Fourier Series [within] Mathematics of Computation XIX Nos. 89-92 1965 for sale by Midway Book Store (ABAA)

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

    Published by American Mathematical Society, 1965

    Seller: Midway Book Store (ABAA), St. Paul, MN, U.S.A.

    Association Member: ABAA ILAB MWABA

    Seller rating 5 out of 5 stars 5-star rating, Learn more about seller ratings

    Contact seller

    First Edition

    US$ 7.00 shipping within U.S.A.

    Destination, rates & speeds

    Quantity: 1 available

    Add to basket

    Hardcover. Condition: Very Good. First edition. 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.