first edition
1965 · (Providence, RI):
by COOLEY, James W. (1926-2016) & John W. TUKEY (1915-2000).
(Providence, RI):: National Academy of Sciences-National Research Council, 1965., 1965. Contained in Mathematics of Computation, Vol. 19, No. 90, pp. 297-301. 8vo. pp. 177-364. Original printed wrappers bound in. Black cloth, printed paper spine label. Institutional exlib stamp on printed wrapper cover, ownership marks on printed covers. Fine. FIRST EDITION. This important work on the fast Fourier transform (FFT) algorithm, which is an efficient algorithm to compute the discrete Fourier transform (DFT) and its inverse. FFTs are of great importance to a wide variety of applications, from digital signal processing and solving partial differential equations (truncated)