Computational frameworks for the fast fourier transform

✍ Scribed by Charles Van Loan

• Publisher: Society for Industrial and Applied Mathematics
• Year: 1987
• Tongue: English
• Leaves: 291
• Series: Frontiers in applied mathematics 10
• Category: Library

✦ Synopsis

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.