Daisuke Takahashi – författare

Interest in Robinson Crusoe has been on the rise during the past year, now that survival in the wilderness has become a staple of prime time. Explorer Takahashi's book examines the life and adventures of Scottish sailor Alexander Selkirk, the real-life model for Daniel Defoe's ultimate survivor. In Search of Robinson Crusoe records Takahashi's quest to understand what kind of man Selkirk was and how he had lived alone on an uninhabited island for four years and four months. Takahashi's hunt for the facts of Selkirk's life took him from the town of Largo in Scotland to the seas off the coast of Chile. In Scotland, Takahashi records his meeting with a descendant of Selkirk's, and uncovers records which detail the trouble Selkirk caused whenever he wasn't on a ship. After pursing his historical subject to Robinson Crusoe Island, Takahashi lived alone in the wilderness for a month, discovering how Selkirk survived and searching out the places where he lived, hunted, and fought off harrowing loneliness while hoping for rescue. The author's search for evidence of Selkirk's existence on Robinson Crusoe Island not only yields revelations about how the 18th-century man lived and grew attached to his rugged surroundings; for Takahashi, the journey in the footsteps of the real-life Crusoe is a test of his own abilities to survive in the wilderness, and the fulfillment of a boyhood dream.

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.

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.