東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Fast Fourier transform algorithms fo...

Takahashi, Daisuke.

FindBook

Google Book

Amazon

博客來

Fast Fourier transform algorithms for parallel computers

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Fast Fourier transform algorithms for parallel computers/ by Daisuke Takahashi.
作者:	Takahashi, Daisuke.
出版者:	Singapore :Springer Singapore : : 2019.,
面頁冊數:	ix, 114 p. :ill., digital ;24 cm.
內容註:	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.
Contained By:	Springer eBooks
標題:	Parallel processing (Electronic computers) - Mathematics. -
電子資源:	https://doi.org/10.1007/978-981-13-9965-7
ISBN:	9789811399657

Fast Fourier transform algorithms for parallel computers
Takahashi, Daisuke.

Fast Fourier transform algorithms for parallel computers[electronic resource] /by Daisuke Takahashi. - Singapore :Springer Singapore :2019. - ix, 114 p. :ill., digital ;24 cm. - High-performance computing series,v.22662-3420 ;. - High-performance computing series ;v.2..

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.

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.

ISBN: 9789811399657

Standard No.: 10.1007/978-981-13-9965-7doiSubjects--Topical Terms:

3453406
Parallel processing (Electronic computers)
--Mathematics.

LC Class. No.: QA76.58 / .T35 2019

Dewey Class. No.: 004.35

Fast Fourier transform algorithms for parallel computers
LDR:02983nmm a2200337 a 4500 001 2218775
003 DE-He213
005 20191022012656.0
006 m d
007 cr nn 008maaau
008 201126s2019 si s 0 eng d
020 $a 9789811399657 $q (electronic bk.)
020 $a 9789811399640 $q (paper)
024 7 $a 10.1007/978-981-13-9965-7 $2 doi
035 $a 978-981-13-9965-7
040 $a GP $c GP
041 0 $a eng
050 4 $a QA76.58 $b .T35 2019
072 7 $a UMB $2 bicssc
072 7 $a COM051300 $2 bisacsh
072 7 $a UMB $2 thema
082 0 4 $a 004.35 $2 23
090 $a QA76.58 $b .T136 2019
100 1 $a Takahashi, Daisuke. $3 3453404
245 1 0 $a Fast Fourier transform algorithms for parallel computers $h [electronic resource] / $c by Daisuke Takahashi.
260 $a Singapore : $b Springer Singapore : $b Imprint: Springer, $c 2019.
300 $a ix, 114 p. : $b ill., digital ; $c 24 cm.
490 1 $a High-performance computing series, $x 2662-3420 ; $v v.2
505 0 $a 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.
520 $a 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.
650 0 $a Parallel processing (Electronic computers) $x Mathematics. $3 3453406
650 0 $a Fourier transformations. $3 533900
650 1 4 $a Algorithm Analysis and Problem Complexity. $3 891007
650 2 4 $a Algorithms. $3 536374
650 2 4 $a Mathematical and Computational Engineering. $3 3226306
710 2 $a SpringerLink (Online service) $3 836513
773 0 $t Springer eBooks
830 0 $a High-performance computing series ; $v v.2. $3 3453405
856 4 0 $u https://doi.org/10.1007/978-981-13-9965-7
950 $a Computer Science (Springer-11645)