Computational frameworks for the fast Fourier transform

This document was uploaded by one of our users. The uploader already confirmed that they had the permission to publish it. If you are author/publisher or own the copyright of this documents, please report to us by using this DMCA report form.

Simply click on the Download Book button.

Yes, Book downloads on Ebookily are 100% Free.

Sometimes the book is free on Amazon As well, so go ahead and hit "Search on Amazon"

The most comprehensive treatment of FFTs to date. Van Loan captures the interplay between mathematics and the design of effective numerical algorithms--a critical connection as more advanced machines become available. A stylized Matlab notation, which is familiar to those engaged in high-performance computing, is used. The Fast Fourier Transform (FFT) family of algorithms has revolutionized many areas of scientific computation. The FFT is one of the most widely used algorithms in science and engineering, with applications in almost every discipline. This volume is essential for professionals interested in linear algebra as well as those working with numerical methods. The FFT is also a great vehicle for teaching key aspects of scientific computing.

Author(s): Charles Van Loan
Series: Frontiers in applied mathematics 10
Publisher: Society for Industrial and Applied Mathematics
Year: 1987

Language: English
Pages: 291
City: Philadelphia

Cover\r......Page 1
Kronecker Product Properties......Page 2
Front Matter......Page 3
Frontiers in Applied Mathematics\r......Page 4
Title......Page 7
Table of Contents......Page 11
Preface......Page 13
Preliminary Remarks......Page 15
1. The Radix-2 Frameworks......Page 19
2. General Radix Frameworks......Page 94
3. High-Performance Frameworks......Page 139
4. Selected Topics\r......Page 206
Bibliography\r......Page 277
Index......Page 287