James w cooley (11 Ergebnisse)
- Softcover
Anbieter: PBShop.store US, Wood Dale, IL, USAPBShop.store US
Verkäufer/-in kontaktierenVerkäufer/-in mit 5 SternenZustand: Neu
EUR 24,42
Versand gratisVersand innerhalb von USAAnzahl: 15 verfügbar
PAP. Zustand: New. New Book. Shipped from UK. Established seller since 2000.
- Softcover
Anbieter: PBShop.store US, Wood Dale, IL, USAPBShop.store US
Verkäufer/-in kontaktierenVerkäufer/-in mit 5 SternenZustand: Neu
EUR 27,01
Versand gratisVersand innerhalb von USAAnzahl: 15 verfügbar
PAP. Zustand: New. New Book. Shipped from UK. Established seller since 2000.
- Softcover
Anbieter: PBShop.store UK, Fairford, GLOS, Vereinigtes KönigreichPBShop.store UK
Verkäufer/-in kontaktierenVerkäufer/-in mit 5 SternenZustand: Neu
EUR 24,37
EUR 3,84 VersandVersand von Vereinigtes Königreich nach USAAnzahl: 15 verfügbar
PAP. Zustand: New. New Book. Shipped from UK. Established seller since 2000.
- Softcover
Anbieter: PBShop.store UK, Fairford, GLOS, Vereinigtes KönigreichPBShop.store UK
Verkäufer/-in kontaktierenVerkäufer/-in mit 5 SternenZustand: Neu
EUR 26,28
EUR 4,85 VersandVersand von Vereinigtes Königreich nach USAAnzahl: 15 verfügbar
PAP. Zustand: New. New Book. Shipped from UK. Established seller since 2000.
Weitere BilderThe Southern Review, Volume 36, Number 1, Winter 2000
James Olney; Dave Smith (editors); W.D. Snodgrass; Cathy Smith Bowers; Peter Cooley; Kate Daniels; Tracy Daugherty; Gregory Fraser; Laura Kasischke; Richard Lange; Cleopatra Mathis; Lia Purpura; Ron Rash (contributors)
Verlag: Louisiana State University Press, Baton Rouge, 2000
- Softcover
- Erstausgabe
Anbieter: Dan Pope Books, West Hartford, CT, USADan Pope Books
Verkäufer/-in kontaktierenVerkäufer/-in mit 5 SternenZustand: Gebraucht - Sehr gut
EUR 17,68
EUR 3,86 VersandVersand innerhalb von USAAnzahl: 1 verfügbar
In den WarenkorbSoft cover. Zustand: Fine. 1st Edition. JOURNAL. A nice, clean copy. A fine copy, but for very light curling on lower-right corner. Although not marked in any such way, this book came from the library of poet and literary critic J.D. McClatchy, from his estate in Stonington, Connecticut.
- Hardcover
Anbieter: PBShop.store US, Wood Dale, IL, USAPBShop.store US
Verkäufer/-in kontaktierenVerkäufer/-in mit 5 SternenZustand: Neu
EUR 33,65
Versand gratisVersand innerhalb von USAAnzahl: 15 verfügbar
HRD. Zustand: New. New Book. Shipped from UK. Established seller since 2000.
- Hardcover
Anbieter: PBShop.store US, Wood Dale, IL, USAPBShop.store US
Verkäufer/-in kontaktierenVerkäufer/-in mit 5 SternenZustand: Neu
EUR 36,37
Versand gratisVersand innerhalb von USAAnzahl: 15 verfügbar
HRD. Zustand: New. New Book. Shipped from UK. Established seller since 2000.
- Hardcover
Anbieter: PBShop.store UK, Fairford, GLOS, Vereinigtes KönigreichPBShop.store UK
Verkäufer/-in kontaktierenVerkäufer/-in mit 5 SternenZustand: Neu
EUR 32,80
EUR 4,85 VersandVersand von Vereinigtes Königreich nach USAAnzahl: 15 verfügbar
HRD. Zustand: New. New Book. Shipped from UK. Established seller since 2000.
- Hardcover
Anbieter: PBShop.store UK, Fairford, GLOS, Vereinigtes KönigreichPBShop.store UK
Verkäufer/-in kontaktierenVerkäufer/-in mit 5 SternenZustand: Neu
EUR 34,70
EUR 4,85 VersandVersand von Vereinigtes Königreich nach USAAnzahl: 15 verfügbar
HRD. Zustand: New. New Book. Shipped from UK. Established seller since 2000.
Weitere BilderVerlag: National Academy of Sciences, Providence, 1965
- Softcover
- Erstausgabe
Anbieter: Heritage Book Shop, ABAA, Beverly Hills, CA, USAHeritage Book Shop, ABAA
Verkäufer/-in kontaktierenVerkäufer/-in mit 5 SternenZustand: Gebraucht
EUR 1.193,19
EUR 17,16 VersandVersand innerhalb von USAAnzahl: 1 verfügbar
In den WarenkorbFirst Edition. TUKEY, John W. An Algorithm for the Machine Calculation of Complex Fourier Series. [within] Mathematics of Computation, volume 19, no.90 pp.297-301. Providence: National Academy of Sciences, 1965. First edition of Cooley & Tukey's article entitled An Algorithm for the Machine Calculation of Complex Fourier Series…within the periodical Mathematics of Computation, volume 19, no.90 pp.297-301. This article is the introduction of the Cooley-Tukey algorithm (known as the Fast Fourier Transform, FFT). Original blue printed wrappers. Printed in black. Some very light wear along spine, otherwise wrappers and text are all about fine. '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). 'The introduction in 1965 of the Cooley-Tukey algorithm (known as the Fast Fourier Transform, FFT) greatly increases the speed of calculations and thereby the usefulness of the Fourier methods', Gedeon p.178. "With John Tukey, Cooley wrote the fast Fourier transform (FFT) paper (Cooley and Tukey 1965) that has been credited with introducing the algorithm to the digital signal processing and scientific community in general." Tukey is also known as the possible creator of the word "bit" in computer terminology. (Computer Pioneers by J. A. N. Lee) According to Christies "The paper had its basis in Tukey's demonstration that "if NI, the number of terms in a Fourier series, is a composite, N = ab, then the series can be expressed as an -term series of subseries of terms each. If one were computing all values of the series, this would reduce the number of operations from 2 to N log N. . Tukey's form of the algorithm, with repeated factors, has the great advantage that a computer program need only contain instructions for the algorithm for the common factor. Indexed loops repeat this basic calculation and permit one to iterate up to an arbitrary high NI, limited only by time and storage" (Cooley 1987, 133, 136)". HBS 68508. $1,350.
Weitere BilderVerlag: National Academy of Sciences-National Research Council, 1965., (Providence, RI):, 1965
- Softcover
- Erstausgabe
Anbieter: Jeff Weber Rare Books, Neuchatel, NEUCH, SchweizJeff Weber Rare Books
Verkäufer/-in kontaktierenVerkäufer/-in mit 4 SternenZustand: Gebraucht
EUR 883,84
EUR 25,00 VersandVersand von Schweiz nach USAAnzahl: 1 verfügbar
In den WarenkorbContained 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) a…lgorithm, 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 to algorithms for quick multiplication of large integers. "By far the most common FFT is the Cooley-Tukey algorithm. This is a divide and conquer algorithm that recursively breaks down a DFT of any composite size N = N1N2 into many smaller DFTs of sizes N1 and N2, along with O(N) multiplications by complex roots of unity, traditionally called twiddle factors (after Gentleman and Sande, 1966). This method (and the general idea of an FFT) was popularized by a publication of J. W. Cooley and J. W. Tukey in 1965, but it was later discovered that those two authors had independently re-invented an algorithm known to Carl Friedrich Gauss around 1805 (and subsequently rediscovered several times in limited forms). The most well-known use of the Cooley-Tukey algorithm is to divide the transform into two pieces of size N / 2 at each step, and is therefore limited to power-of-two sizes, but any factorization can be used in general (as was known to both Gauss and Cooley/Tukey). These are called the radix-2 and mixed-radix cases, respectively (and other variants such as the split-radix FFT have their own names as well). Although the basic idea is recursive, most traditional implementations rearrange the algorithm to avoid explicit recursion. Also, because the Cooley-Tukey algorithm breaks the DFT into smaller DFTs, it can be combined arbitrarily with any other algorithm for the DFT." [Wikip.]. Norman, Origins of Cyberspace 548.
