• الرئیسیة
  • البحث المتقدم
  • قائمة المکتبات
  • حول الموقع
  • اتصل بنا
  • نشأة

عنوان
Fast Fourier transform algorithms for parallel computers

پدید آورنده
/ Daisuke Takahashi.

موضوع
Parallel processing (Electronic computers) -- Mathematics.,Fourier transformations.

رده
QA76
.
58
.
T35
2019

کتابخانه

محل استقرار
استان: طهران ـ شهر: طهران



تماس با کتابخانه : 61112616-66495290-021

9789811399657

E236

انگلیسی

Fast Fourier transform algorithms for parallel computers
[Electronic book]
/ Daisuke Takahashi.

Singapore
: Springer
, 2019.

ix, 114 p.

(High-performance computing series
; v. 2)

Includes bibliographical references and index.

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

Parallel processing (Electronic computers) -- Mathematics.
Fourier transformations.

QA76
.
58
.
T35
2019

Takahashi, Daisuke, 1961-

ایران
University of Tehran. Library of College of Science
20211220

UT_SCI_BL_DB_1002282_0001.pdf

e

BL
278840
1

a
Y

الاقتراح / اعلان الخلل

تحذیر! دقق في تسجیل المعلومات
ارسال عودة
تتم إدارة هذا الموقع عبر مؤسسة دار الحديث العلمية - الثقافية ومركز البحوث الكمبيوترية للعلوم الإسلامية (نور)
المكتبات هي المسؤولة عن صحة المعلومات كما أن الحقوق المعنوية للمعلومات متعلقة بها
برترین جستجوگر - پنجمین جشنواره رسانه های دیجیتال