1 option
Fast Fourier Transform Algorithms for Parallel Computers / by Daisuke Takahashi.
- Format:
- Book
- Author/Creator:
- Takahashi, Daisuke, author.
- Series:
- Computer Science (Springer-11645)
- High-Performance Computing Series, 2662-3420 ; 2.
- High-Performance Computing Series, 2662-3420 ; 2
- Language:
- English
- Subjects (All):
- Algorithms.
- Applied mathematics.
- Engineering mathematics.
- Algorithm Analysis and Problem Complexity.
- Mathematical and Computational Engineering.
- Local Subjects:
- Algorithm Analysis and Problem Complexity.
- Algorithms.
- Mathematical and Computational Engineering.
- Physical Description:
- 1 online resource (IX, 114 pages) : 32 illustrations.
- Edition:
- First edition 2019.
- Contained In:
- Springer eBooks
- Place of Publication:
- Singapore : Springer Singapore : Imprint: Springer, 2019.
- System Details:
- text file PDF
- Summary:
- 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.
- Contents:
- Chapter 1: Introduction
- Chapter 2: Fast Fourier Transform
- Chapter 3: Mixed-Radix FFT Algorithms
- Chapter 4: Split-Radix FFT Algorithms
- Chapter 5: Multidimensional FFT Algorithms
- Chapter 6: High-Performance FFT Algorithms
- Chapter 7: Parallel FFT Algorithms for Shared-Memory Parallel Computers
- Chapter 8: Parallel FFT Algorithms for Distributed-Memory Parallel Computers.
- Other Format:
- Printed edition:
- ISBN:
- 978-981-13-9965-7
- 9789811399657
- 9789811399640
- 9789811399664
- 9789811399671
- Access Restriction:
- Restricted for use by site license.
The Penn Libraries is committed to describing library materials using current, accurate, and responsible language. If you discover outdated or inaccurate language, please fill out this feedback form to report it and suggest alternative language.