Fast Fourier Transform Algorithms for Parallel Computers
暫譯: 平行計算機的快速傅立葉變換演算法

Takahashi, Daisuke

Fast Fourier Transform Algorithms for Parallel Computers
  • 出版商: Springer
  • 出版日期: 2019-10-17
  • 售價: $5,640
  • 貴賓價: 9.5 折 $5,358
  • 語言: 英文
  • 頁數: 114
  • 裝訂: Hardcover - also called cloth, retail trade, or trade
  • ISBN: 9811399646
  • ISBN-13: 9789811399640
  • 相關分類: Algorithms-data-structures

    • 海外代購書籍(需單獨結帳)

商品描述

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.

商品描述(中文翻譯)

本書在介紹快速傅立葉變換（FFT）的基本原理後，專注於並行計算機上FFT的實現細節。FFT是離散傅立葉變換（DFT）的高效實現，廣泛應用於工程、科學和數學的許多應用中。本書以偽代碼呈現多種算法並進行複雜度分析，為希望將FFT應用於大規模問題的研究生、工程師和科學家提供了寶貴的參考指南。

並行計算在解決日益增多的各種應用中的大規模問題時變得不可或缺。並行超級計算機的性能穩步提升，預計在不久的將來將會有配備多核處理器和加速器的數十萬計算節點的超大規模並行系統可供使用。因此，本書還提供了與先進並行計算機中FFT相關的最新計算技術。

在介紹章節之後，第二章向讀者介紹DFT及FFT的基本概念。第三章解釋混合基數FFT算法，而第四章描述分裂基數FFT算法。第五章解釋多維FFT算法，第六章介紹高性能FFT算法，第七章針對共享記憶體並行計算機討論並行FFT算法。最後，第八章描述分佈式記憶體並行計算機的並行FFT算法。

作者簡介

Daisuke Takahashi received his B.E. and M.E. degrees in Information and Computer Sciences from Toyohashi University of Technology in 1993 and 1995, respectively, and his Ph.D. in Information Science from the University of Tokyo in 1999. He was a research associate at the Computer Centre, University of Tokyo from 1997 to 2000, and at the Graduate School of Science and Engineering, Saitama University from 2000 to 2001. He joined the University of Tsukuba in 2001, where he is currently a Professor at the Center for Computational Sciences. His primary research interest is in high-performance computing. In 2011 he was a member of the team that won the ACM Gordon Bell Prize (Sustained Performance Prize). He is a member of the ACM, IEEE, SIAM, IPSJ and JSIAM.

作者簡介(中文翻譯)

高橋大輔（Daisuke Takahashi）於1993年和1995年分別在豐橋技術大學獲得資訊與計算科學的學士及碩士學位，並於1999年在東京大學獲得資訊科學的博士學位。他於1997年至2000年擔任東京大學計算中心的研究助理，並於2000年至2001年在埼玉大學科學與工程研究所工作。2001年，他加入筑波大學，目前擔任計算科學中心的教授。他的主要研究興趣在於高效能計算。2011年，他是獲得ACM戈登·貝爾獎（ACM Gordon Bell Prize，持續性能獎）的團隊成員之一。他是ACM、IEEE、SIAM、IPSJ和JSIAM的成員。

類似商品

最後瀏覽商品 (20)