國立虎尾科技大學 |

Fast Fourier Transform Algorithms for Parallel Computers

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
正題名/作者:	Fast Fourier Transform Algorithms for Parallel Computers/ by Daisuke Takahashi.
作者:	Takahashi, Daisuke.
面頁冊數:	IX, 114 p. 32 illus.online resource. :
Contained By:	Springer Nature eBook
標題:	Algorithms. -
電子資源:	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. - 1st ed. 2019. - IX, 114 p. 32 illus.online resource. - High-Performance Computing Series,22662-3420 ;. - High-Performance Computing Series,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:

527865
Algorithms.

LC Class. No.: QA76.9.A43

Dewey Class. No.: 005.1

Fast Fourier Transform Algorithms for Parallel Computers
LDR:03327nam a22004095i 4500 001 1013478
003 DE-He213
005 20200630192830.0
007 cr nn 008mamaa
008 210106s2019 si | s |||| 0|eng d
020 $a 9789811399657 $9 978-981-13-9965-7
024 7 $a 10.1007/978-981-13-9965-7 $2 doi
035 $a 978-981-13-9965-7
050 4 $a QA76.9.A43
072 7 $a UMB $2 bicssc
072 7 $a COM051300 $2 bisacsh
072 7 $a UMB $2 thema
082 0 4 $a 005.1 $2 23
100 1 $a Takahashi, Daisuke. $e author. $4 aut $4 http://id.loc.gov/vocabulary/relators/aut $3 1307739
245 1 0 $a Fast Fourier Transform Algorithms for Parallel Computers $h [electronic resource] / $c by Daisuke Takahashi.
250 $a 1st ed. 2019.
264 1 $a Singapore : $b Springer Singapore : $b Imprint: Springer, $c 2019.
300 $a IX, 114 p. 32 illus. $b online resource.
336 $a text $b txt $2 rdacontent
337 $a computer $b c $2 rdamedia
338 $a online resource $b cr $2 rdacarrier
347 $a text file $b PDF $2 rda
490 1 $a High-Performance Computing Series, $x 2662-3420 ; $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 Algorithms. $3 527865
650 0 $a Applied mathematics. $3 1069907
650 0 $a Engineering mathematics. $3 562757
650 1 4 $a Algorithm Analysis and Problem Complexity. $3 593923
650 2 4 $a Mathematical and Computational Engineering. $3 1139415
710 2 $a SpringerLink (Online service) $3 593884
773 0 $t Springer Nature eBook
776 0 8 $i Printed edition: $z 9789811399640
776 0 8 $i Printed edition: $z 9789811399664
776 0 8 $i Printed edition: $z 9789811399671
830 0 $a High-Performance Computing Series, $x 2662-3420 ; $v 2 $3 1307740
856 4 0 $u https://doi.org/10.1007/978-981-13-9965-7
912 $a ZDB-2-SCS
912 $a ZDB-2-SXCS
950 $a Computer Science (SpringerNature-11645)
950 $a Computer Science (R0) (SpringerNature-43710)