Artículos relacionados a Fast Fourier Transform Algorithms for Parallel Computers:...
Fast Fourier Transform Algorithms for Parallel Computers: 2 (High-Performance Computing Series) - Tapa blanda
Sinopsis
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.
"Sinopsis" puede pertenecer a otra edición de este libro.
Acerca del autor
Daisuke Takahashi received his B.E. and M.E. degrees in Information and Computer Sciences from Toyohashi University of Technology in 1993 and 1995, respectively, and his Ph.D. in Information Science from the University of Tokyo in 1999. He was a research associate at the Computer Centre, University of Tokyo from 1997 to 2000, and at the Graduate School of Science and Engineering, Saitama University from 2000 to 2001. He joined the University of Tsukuba in 2001, where he is currently a Professor at the Center for Computational Sciences. His primary research interest is in high-performance computing. In 2011 he was a member of the team that won the ACM Gordon Bell Prize (Sustained Performance Prize). He is a member of the ACM, IEEE, SIAM, IPSJ and JSIAM.
De la contraportada
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.?"Sobre este título" puede pertenecer a otra edición de este libro.
- EditorialSpringer
- Año de publicación2020
- ISBN 10 9811399670
- ISBN 13 9789811399671
- EncuadernaciónTapa blanda
- IdiomaInglés
- Número de edición1
- Número de páginas124
- Contacto del fabricanteno disponible
Comprar nuevo
Ver este artículo
EUR 98,80
EUR 4,65 gastos de envío desde Reino Unido a España
Destinos, gastos y plazos de envíoOtras ediciones populares con el mismo título
Resultados de la búsqueda para Fast Fourier Transform Algorithms for Parallel Computers:...
Imagen de archivo
Fast Fourier Transform Algorithms for Parallel Computers (High-Performance Computing Series)
Librería: Ria Christie Collections, Uxbridge, Reino Unido
Calificación del vendedor: 5 de 5 estrellas
Condición: New. In. Nº de ref. del artículo: ria9789811399671_new
Cantidad disponible: Más de 20 disponibles
Imagen de archivo
Fast Fourier Transform Algorithms for Parallel Computers
Librería: Chiron Media, Wallingford, Reino Unido
Calificación del vendedor: 5 de 5 estrellas
PF. Condición: New. Nº de ref. del artículo: 6666-IUK-9789811399671
Cantidad disponible: 10 disponibles
Imagen de archivo
FAST FOURIER TRANSFORM ALGORITHMS FOR PARALLEL COMPUTERS (PB 2019)
Librería: Basi6 International, Irving, TX, Estados Unidos de America
Calificación del vendedor: 5 de 5 estrellas
Condición: Brand New. New. US edition. Expediting shipping for all USA and Europe orders excluding PO Box. Excellent Customer Service. Nº de ref. del artículo: ABEJUNE24-385718
Cantidad disponible: 2 disponibles
Imagen del vendedor
Fast Fourier Transform Algorithms for Parallel Computers
Impresión bajo demandaLibrería: moluna, Greven, Alemania
Calificación del vendedor: 5 de 5 estrellas
Condición: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Provides implementation details on FFTs for parallel computersFeatures a wealth of program examples in pseudo-codeThe first book exclusively focused on this topicDaisuke Takahashi received his B.E. and M.E. degrees in Inf. Nº de ref. del artículo: 405560864
Cantidad disponible: Más de 20 disponibles
Imagen del vendedor
Fast Fourier Transform Algorithms for Parallel Computers
Publicado por
Springer Nature Singapore, Springer Nature Singapore, 2020
ISBN 10: 9811399670
ISBN 13: 9789811399671
Nuevo
Taschenbuch
Librería: AHA-BUCH GmbH, Einbeck, Alemania
Calificación del vendedor: 5 de 5 estrellas
Taschenbuch. Condición: Neu. Druck auf Anfrage Neuware - Printed after ordering - 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. Nº de ref. del artículo: 9789811399671
Cantidad disponible: 1 disponibles
Imagen del vendedor
Fast Fourier Transform Algorithms for Parallel Computers
Publicado por
Springer Nature Singapore Okt 2020, 2020
ISBN 10: 9811399670
ISBN 13: 9789811399671
Nuevo
Taschenbuch
Librería: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Alemania
Calificación del vendedor: 5 de 5 estrellas
Taschenbuch. Condición: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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. 124 pp. Englisch. Nº de ref. del artículo: 9789811399671
Cantidad disponible: 2 disponibles
Imagen del vendedor
Fast Fourier Transform Algorithms for Parallel Computers
Publicado por
Springer Nature Singapore, Springer Nature Singapore Okt 2020, 2020
ISBN 10: 9811399670
ISBN 13: 9789811399671
Nuevo
Taschenbuch
Librería: buchversandmimpf2000, Emtmannsberg, BAYE, Alemania
Calificación del vendedor: 5 de 5 estrellas
Taschenbuch. Condición: Neu. This item is printed on demand - Print on Demand Titel. Neuware -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.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 124 pp. Englisch. Nº de ref. del artículo: 9789811399671
Cantidad disponible: 1 disponibles
Imagen de archivo
Fast Fourier Transform Algorithms for Parallel Computers
Librería: Books Puddle, New York, NY, Estados Unidos de America
Calificación del vendedor: 4 de 5 estrellas
Condición: New. pp. IX, 114 32 illus. 1 Edition NO-PA16APR2015-KAP. Nº de ref. del artículo: 26384557655
Cantidad disponible: 4 disponibles
Imagen de archivo
Fast Fourier Transform Algorithms for Parallel Computers
Impresión bajo demandaLibrería: Majestic Books, Hounslow, Reino Unido
Calificación del vendedor: 5 de 5 estrellas
Condición: New. Print on Demand pp. IX, 114 32 illus. Nº de ref. del artículo: 379346312
Cantidad disponible: 4 disponibles
Imagen de archivo
Fast Fourier Transform Algorithms for Parallel Computers (High-Performance Computing Series)
Librería: Lucky's Textbooks, Dallas, TX, Estados Unidos de America
Calificación del vendedor: 5 de 5 estrellas
Condición: New. Nº de ref. del artículo: ABLIING23Apr0412070087383
Cantidad disponible: Más de 20 disponibles