Computational Frameworks for the Fast Fourier Transform

by Charles F. Van Loan

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.

287 pages, Paperback

First published January 1, 1987

Reviews

[Brannon · Rating 5 out of 5]

For what it is, this book is very good. It includes both the derivations and algorithms in clear form, with a nice classification system for the algorithms.