Fast Fourier Transform Algorithms for Parallel Computers (Record no. 172706)
[ view plain ]
000 -LEADER | |
---|---|
fixed length control field | 03808nam a22005295i 4500 |
001 - CONTROL NUMBER | |
control field | 978-981-13-9965-7 |
003 - CONTROL NUMBER IDENTIFIER | |
control field | DE-He213 |
005 - DATE AND TIME OF LATEST TRANSACTION | |
control field | 20240423124950.0 |
007 - PHYSICAL DESCRIPTION FIXED FIELD--GENERAL INFORMATION | |
fixed length control field | cr nn 008mamaa |
008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION | |
fixed length control field | 191005s2019 si | s |||| 0|eng d |
020 ## - INTERNATIONAL STANDARD BOOK NUMBER | |
International Standard Book Number | 9789811399657 |
-- | 978-981-13-9965-7 |
024 7# - OTHER STANDARD IDENTIFIER | |
Standard number or code | 10.1007/978-981-13-9965-7 |
Source of number or code | doi |
050 #4 - LIBRARY OF CONGRESS CALL NUMBER | |
Classification number | QA76.9.A43 |
072 #7 - SUBJECT CATEGORY CODE | |
Subject category code | UMB |
Source | bicssc |
072 #7 - SUBJECT CATEGORY CODE | |
Subject category code | COM051300 |
Source | bisacsh |
072 #7 - SUBJECT CATEGORY CODE | |
Subject category code | UMB |
Source | thema |
082 04 - DEWEY DECIMAL CLASSIFICATION NUMBER | |
Classification number | 518.1 |
Edition number | 23 |
100 1# - MAIN ENTRY--PERSONAL NAME | |
Personal name | Takahashi, Daisuke. |
Relator term | author. |
Relator code | aut |
-- | http://id.loc.gov/vocabulary/relators/aut |
245 10 - TITLE STATEMENT | |
Title | Fast Fourier Transform Algorithms for Parallel Computers |
Medium | [electronic resource] / |
Statement of responsibility, etc | by Daisuke Takahashi. |
250 ## - EDITION STATEMENT | |
Edition statement | 1st ed. 2019. |
264 #1 - | |
-- | Singapore : |
-- | Springer Nature Singapore : |
-- | Imprint: Springer, |
-- | 2019. |
300 ## - PHYSICAL DESCRIPTION | |
Extent | IX, 114 p. 32 illus. |
Other physical details | online resource. |
336 ## - | |
-- | text |
-- | txt |
-- | rdacontent |
337 ## - | |
-- | computer |
-- | c |
-- | rdamedia |
338 ## - | |
-- | online resource |
-- | cr |
-- | rdacarrier |
347 ## - | |
-- | text file |
-- | |
-- | rda |
490 1# - SERIES STATEMENT | |
Series statement | High-Performance Computing Series, |
International Standard Serial Number | 2662-3439 ; |
Volume number/sequential designation | 2 |
505 0# - FORMATTED CONTENTS NOTE | |
Formatted contents note | 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 ## - SUMMARY, ETC. | |
Summary, etc | 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 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
Topical term or geographic name as entry element | Algorithms. |
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
Topical term or geographic name as entry element | Engineering mathematics. |
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
Topical term or geographic name as entry element | Engineering |
General subdivision | Data processing. |
650 14 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
Topical term or geographic name as entry element | Algorithms. |
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
Topical term or geographic name as entry element | Mathematical and Computational Engineering Applications. |
710 2# - ADDED ENTRY--CORPORATE NAME | |
Corporate name or jurisdiction name as entry element | SpringerLink (Online service) |
773 0# - HOST ITEM ENTRY | |
Title | Springer Nature eBook |
776 08 - ADDITIONAL PHYSICAL FORM ENTRY | |
Display text | Printed edition: |
International Standard Book Number | 9789811399640 |
776 08 - ADDITIONAL PHYSICAL FORM ENTRY | |
Display text | Printed edition: |
International Standard Book Number | 9789811399664 |
776 08 - ADDITIONAL PHYSICAL FORM ENTRY | |
Display text | Printed edition: |
International Standard Book Number | 9789811399671 |
830 #0 - SERIES ADDED ENTRY--UNIFORM TITLE | |
Uniform title | High-Performance Computing Series, |
-- | 2662-3439 ; |
Volume number/sequential designation | 2 |
856 40 - ELECTRONIC LOCATION AND ACCESS | |
Uniform Resource Identifier | <a href="https://doi.org/10.1007/978-981-13-9965-7">https://doi.org/10.1007/978-981-13-9965-7</a> |
912 ## - | |
-- | ZDB-2-SCS |
912 ## - | |
-- | ZDB-2-SXCS |
942 ## - ADDED ENTRY ELEMENTS (KOHA) | |
Koha item type | eBooks-CSE-Springer |
No items available.