Nemokamas pristatymas nuo 29€

  • check 10 + milijonai knygų
  • check Naujienos (kiekvieną dieną)
  • check 1 + mln. klientų mus pasitiki
  • check Geros kainos % Nuolaidos
  • check Nemokamas pristatymas nuo 29 eur

Fast Fourier Transform Algorithms for Parallel Computers - Daisuke Takahashi

Anglų
2019-10-17
165,15 € 220,20 €

-25% su kodu BOOKS

Turime sandėlyje pas mūsų tiekėją

Pristatymas per 17-23 d.d.

30 dienų grąžinimo politika

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 ... Visas aprašymas

Jums taip pat gali patikti

Aprašymas

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

Daugiau informacijos

Autorius Daisuke Takahashi
Leidėjas Springer Nature Singapore
Series High-Performance Computing Series
Išleidimo metai 2019
Viršelio tipas Kieti viršeliai
EAN 9789811399640
Parašykite savo atsiliepimą
Jūs peržiūrėjote: Fast Fourier Transform Algorithms for Parallel Computers
Jūsų įvertinimas:

Goodreads Atsiliepimai

165,15 € 220,20 €