国际著名数学图书（影印版）：快速傅里叶变换的计算框架（英文版）

　　Preface ix
　　Preliminary Remarks xi
　　1 The Radix-2 Frameworks
　　1.1 Matrix Notation and Algorithms
　　1.2 The FFT Idea
　　1.3 The Cooley-Tukey Radix-2 Factorizstion
　　1.4 Weight and Butterfly Computations
　　1.5 Bit Reversal and Transposition
　　1.6 The Cooley-Tukey Framework
　　1.7 The Stockham Autosort Frameworks
　　1.8 The Pease Framework
　　1.9 Decimation in Frequency and Inverse FFTs
　　2 General Radix Frameworks
　　2.1 General Radix Ideas
　　2.2 Index Reversal and Transposition
　　2.3 Mixed-Radix Factorizations
　　2.4 Radix-4 and Radix-8 Frameworks
　　2.5 The Spllt-Radix Framework
　　3 High-Performance Frameworks
　　3.1 The Multiple OFT Problem
　　3.2 Matrix Transposition
　　3.3 The Large Single-Vector FFT Problem
　　3.4 The Multidimensional FFT Problem
　　3.5 Distributed-Memory FFTs
　　3.6 Shared-Memory FFTs
　　4 Selected Topics
　　4.1 Prime Factor Frameworks
　　4.2 Convolution
　　4.3 FFTs of Real Data
　　4.4 Fast Trigonometric Transforms
　　4.5 Fast Poisson Solvers
　　Bibliography
　　Index

　　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 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. he uses a stylized matlab notation, which is familiar to those engaged in high-performance computing.
　　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.