| 书目名称 | Fast Fourier Transform Algorithms for Parallel Computers |
| 编辑 | Daisuke Takahashi |
| 视频video | |
| 概述 | Provides implementation details on FFTs for parallel computers.Features a wealth of program examples in pseudo-code.The first book exclusively focused on this topic |
| 丛书名称 | High-Performance Computing Series |
| 图书封面 |  |
| 描述 | 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 |
| 出版日期 | Book 2019 |
| 关键词 | Fast Fourier Transform; FFT; Parallel Computer; Supercomputer; High Performance Computing; Discrete Fouri |
| 版次 | 1 |
| doi | https://doi.org/10.1007/978-981-13-9965-7 |
| isbn_softcover | 978-981-13-9967-1 |
| isbn_ebook | 978-981-13-9965-7Series ISSN 2662-3420 Series E-ISSN 2662-3439 |
| issn_series | 2662-3420 |
| copyright | Springer Nature Singapore Pte Ltd. 2019 |
发表于 2025-3-21 17:54:11
