Fast Fourier Transform Algorithms for Parallel Computers

• Κύριος συγγραφέας: Takahashi, Daisuke (Συγγραφέας, http://id.loc.gov/vocabulary/relators/aut)
• Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
• Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
• Γλώσσα: English
• Έκδοση: Singapore : Springer Singapore : Imprint: Springer, 2019.
• Έκδοση: 1st ed. 2019.
• Σειρά: High-Performance Computing Series, 2
• Θέματα: Algorithms.; Applied mathematics.; Engineering mathematics.; Algorithm Analysis and Problem Complexity.; Mathematical and Computational Engineering.

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...

Πίνακας περιεχομένων:

• 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.