0
Your cart

Your cart is empty

Books > Computing & IT > General theory of computing > Data structures

Buy Now

Fast Fourier Transform Algorithms for Parallel Computers (Hardcover, 1st ed. 2019) Loot Price: R3,797
Discovery Miles 37 970
Fast Fourier Transform Algorithms for Parallel Computers (Hardcover, 1st ed. 2019): Daisuke Takahashi

Fast Fourier Transform Algorithms for Parallel Computers (Hardcover, 1st ed. 2019)

Daisuke Takahashi

Series: High-Performance Computing Series, 2

 (sign in to rate)
Loot Price R3,797 Discovery Miles 37 970 | Repayment Terms: R356 pm x 12*

Bookmark and Share

Expected to ship within 10 - 15 working days

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 techniques relevant 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.

General

Imprint: Springer Verlag, Singapore
Country of origin: Singapore
Series: High-Performance Computing Series, 2
Release date: October 2019
First published: 2019
Authors: Daisuke Takahashi
Dimensions: 235 x 155mm (L x W)
Format: Hardcover
Pages: 114
Edition: 1st ed. 2019
ISBN-13: 978-981-13-9964-0
Categories: Books > Science & Mathematics > Mathematics > Numerical analysis
Books > Computing & IT > General theory of computing > Data structures
Books > Computing & IT > Computer programming > Algorithms & procedures
Books > Science & Mathematics > Mathematics > Applied mathematics > Mathematics for scientists & engineers
Promotions
LSN: 981-13-9964-6
Barcode: 9789811399640

Is the information for this product incomplete, wrong or inappropriate? Let us know about it.

Does this product have an incorrect or missing image? Send us a new image.

Is this product missing categories? Add more categories.

Review This Product

No reviews yet - be the first to create one!

Partners