Accuracy of the discrete Fourier transform and the fast Fourier transform (1996) [9 citations — 0 self]
by James C. Schatzman
SIAM J. Sci. Comput
http://epubs.siam.org/sam-bin/getfile/SISC/articles/24702.ps.Z
Add To MetaCart
Abstract:
Abstract. Fast Fourier transform (FFT)-based computations can be far more accurate than the slow transforms suggest. Discrete Fourier transforms computed through the FFT are far more accurate than slow transforms, and convolutions computed via FFT are far more accurate than the direct results. However, these results depend critically on the accuracy of the FFT software employed, which should generally be considered suspect. Popular recursions for fast computation of the sine/cosine table (or twiddle factors) are inaccurate due to inherent instability. Some analyses of these recursions that have appeared heretofore in print, suggesting stability, are incorrect. Even in higher dimensions, the FFT is remarkably stable.
Citations
| 223 | Computational Frameworks for the Fast Fourier Transform, ser – Loan - 1992 |
| 18 | Self-sorting mixed-radix Fast Fourier Transforms – Temperton - 1983 |
| 14 | Fast Fourier transformsfor fun and profit – Gentleman, Sande - 1966 |
| 7 | Index Mappings for Multidimensional Formulation of the DFT and Convolution – Burrus - 1977 |
| 7 | Roundoff Error in Fast Fourier Transforms (Decimation – Liu, Kaneko - 1975 |
| 6 | The Fast Fourier Transform on Hypercube Parallel Computers – Chu - 1987 |
| 5 | A stochastic roundoff error analysis for the fast Fourier transform – Calvetti - 1991 |
| 3 | The accuracy of floating-point summation – Higham - 1993 |
| 1 | Numerical Analysis of Spectral Analysis – GOTTLIEB, ORSZAG - 1977 |
| 1 | Stable methods for evaluating the points cos(i#/n – OLIVER - 1975 |
| 1 | Fast Fourier transform algorithms and complexity of the discrete Fourier transform – SCHATZMAN |
| 1 | mappings for the fast Fourier transform – Index - 1996 |
