Librería: GreatBookPrices, Columbia, MD, Estados Unidos de America
EUR 119,93
Cantidad disponible: 1 disponibles
Añadir al carritoCondición: New.
Librería: GreatBookPrices, Columbia, MD, Estados Unidos de America
EUR 143,02
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: As New. Unread book in perfect condition.
Librería: Ria Christie Collections, Uxbridge, Reino Unido
EUR 139,47
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New. In.
Librería: GreatBookPricesUK, Woodford Green, Reino Unido
EUR 139,46
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New.
Librería: GreatBookPricesUK, Woodford Green, Reino Unido
EUR 154,61
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: As New. Unread book in perfect condition.
Librería: Kennys Bookshop and Art Galleries Ltd., Galway, GY, Irlanda
EUR 163,01
Cantidad disponible: 15 disponibles
Añadir al carritoCondición: New.
Librería: Books Puddle, New York, NY, Estados Unidos de America
EUR 180,13
Cantidad disponible: 4 disponibles
Añadir al carritoCondición: New. pp. IX, 114 32 illus. 1st ed. 2019 edition NO-PA16APR2015-KAP.
Librería: Revaluation Books, Exeter, Reino Unido
EUR 191,46
Cantidad disponible: 2 disponibles
Añadir al carritoHardcover. Condición: Brand New. 124 pages. 9.25x6.10x0.51 inches. In Stock.
Librería: Kennys Bookstore, Olney, MD, Estados Unidos de America
EUR 202,54
Cantidad disponible: 15 disponibles
Añadir al carritoCondición: New.
Idioma: Inglés
Publicado por Springer Nature Singapore, Springer Nature Singapore, 2019
ISBN 10: 9811399646 ISBN 13: 9789811399640
Librería: AHA-BUCH GmbH, Einbeck, Alemania
EUR 145,40
Cantidad disponible: 1 disponibles
Añadir al carritoBuch. Condición: Neu. Druck auf Anfrage Neuware - Printed after ordering - Following an introduction to the basis of the fast Fourier transform (FFT), this book focuses on the implementation details on FFT for parallel computers. FFT is an efficient implementation of the discrete Fourier transform (DFT), and is widely used for many applications in engineering, science, and mathematics. Presenting many algorithms in pseudo-code and a complexity analysis, this book offers a valuable reference guide for graduate students, engineers, and scientists in the field who wish to apply FFT to large-scale problems.Parallel computation is becoming indispensable in solving the large-scale problems increasingly arising in a wide range of applications. The performance of parallel supercomputers is steadily improving, and it is expected that a massively parallel system with hundreds of thousands of compute nodes equipped with multi-core processors and accelerators will be available in the near future. Accordingly, the book also provides up-to-date computational techniquesrelevant to the FFT in state-of-the-art parallel computers.Following the introductory chapter, Chapter 2 introduces readers to the DFT and the basic idea of the FFT. Chapter 3 explains mixed-radix FFT algorithms, while Chapter 4 describes split-radix FFT algorithms. Chapter 5 explains multi-dimensional FFT algorithms, Chapter 6 presents high-performance FFT algorithms, and Chapter 7 addresses parallel FFT algorithms for shared-memory parallel computers. In closing, Chapter 8 describes parallel FFT algorithms for distributed-memory parallel computers.
Librería: Mispah books, Redhill, SURRE, Reino Unido
EUR 192,52
Cantidad disponible: 1 disponibles
Añadir al carritoHardcover. Condición: New. New. book.
Librería: Brook Bookstore On Demand, Napoli, NA, Italia
EUR 110,26
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: new. Questo è un articolo print on demand.
Idioma: Inglés
Publicado por Springer Nature Singapore Okt 2019, 2019
ISBN 10: 9811399646 ISBN 13: 9789811399640
Librería: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Alemania
EUR 139,09
Cantidad disponible: 2 disponibles
Añadir al carritoBuch. Condición: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -Following an introduction to the basis of the fast Fourier transform (FFT), this book focuses on the implementation details on FFT for parallel computers. FFT is an efficient implementation of the discrete Fourier transform (DFT), and is widely used for many applications in engineering, science, and mathematics. Presenting many algorithms in pseudo-code and a complexity analysis, this book offers a valuable reference guide for graduate students, engineers, and scientists in the field who wish to apply FFT to large-scale problems.Parallel computation is becoming indispensable in solving the large-scale problems increasingly arising in a wide range of applications. The performance of parallel supercomputers is steadily improving, and it is expected that a massively parallel system with hundreds of thousands of compute nodes equipped with multi-core processors and accelerators will be available in the near future. Accordingly, the book also provides up-to-date computational techniquesrelevant to the FFT in state-of-the-art parallel computers.Following the introductory chapter, Chapter 2 introduces readers to the DFT and the basic idea of the FFT. Chapter 3 explains mixed-radix FFT algorithms, while Chapter 4 describes split-radix FFT algorithms. Chapter 5 explains multi-dimensional FFT algorithms, Chapter 6 presents high-performance FFT algorithms, and Chapter 7 addresses parallel FFT algorithms for shared-memory parallel computers. In closing, Chapter 8 describes parallel FFT algorithms for distributed-memory parallel computers. 124 pp. Englisch.
Idioma: Inglés
Publicado por Springer Nature Singapore, 2019
ISBN 10: 9811399646 ISBN 13: 9789811399640
Librería: moluna, Greven, Alemania
EUR 118,61
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Provides implementation details on FFTs for parallel computersFeatures a wealth of program examples in pseudo-codeThe first book exclusively focused on this topicProvides implementation details on FFTs for parallel com.
Librería: Biblios, Frankfurt am main, HESSE, Alemania
EUR 176,78
Cantidad disponible: 4 disponibles
Añadir al carritoCondición: New. PRINT ON DEMAND pp. IX, 114 32 illus.
Librería: Majestic Books, Hounslow, Reino Unido
EUR 188,38
Cantidad disponible: 4 disponibles
Añadir al carritoCondición: New. Print on Demand pp. IX, 114 32 illus.
Idioma: Inglés
Publicado por Springer Nature Singapore, Springer Nature Singapore Okt 2019, 2019
ISBN 10: 9811399646 ISBN 13: 9789811399640
Librería: buchversandmimpf2000, Emtmannsberg, BAYE, Alemania
EUR 139,09
Cantidad disponible: 1 disponibles
Añadir al carritoBuch. Condición: Neu. This item is printed on demand - Print on Demand Titel. Neuware -Following an introduction to the basis of the fast Fourier transform (FFT), this book focuses on the implementation details on FFT for parallel computers. FFT is an efficient implementation of the discrete Fourier transform (DFT), and is widely used for many applications in engineering, science, and mathematics. Presenting many algorithms in pseudo-code and a complexity analysis, this book offers a valuable reference guide for graduate students, engineers, and scientists in the field who wish to apply FFT to large-scale problems.Parallel computation is becoming indispensable in solving the large-scale problems increasingly arising in a wide range of applications. The performance of parallel supercomputers is steadily improving, and it is expected that a massively parallel system with hundreds of thousands of compute nodes equipped with multi-core processors and accelerators will be available in the near future. Accordingly, the book also provides up-to-date computational techniquesrelevant to the FFT in state-of-the-art parallel computers.Following the introductory chapter, Chapter 2 introduces readers to the DFT and the basic idea of the FFT. Chapter 3 explains mixed-radix FFT algorithms, while Chapter 4 describes split-radix FFT algorithms. Chapter 5 explains multi-dimensional FFT algorithms, Chapter 6 presents high-performance FFT algorithms, and Chapter 7 addresses parallel FFT algorithms for shared-memory parallel computers. In closing, Chapter 8 describes parallel FFT algorithms for distributed-memory parallel computers.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 124 pp. Englisch.