Rapid computation of the discrete fourier transform

SIAM Journal on Scientific Computing

Volumn 17, Issue 4, 1996, Pages 913-919

  Anderson, Chris ^a   Dahleh, Marie Dillon ^b  

^a IBM T J WATSON RESEARCH CENTER   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Iterative methods; Nonuniform fast Fourier transform

Indexed keywords

EID: 0001303146     PISSN: 10648275     EISSN: None     Source Type: Journal    
DOI: 10.1137/0917059     Document Type: Article

References (5)

1. J. W. COOLEY AND J. W. TUKEY, An algorithm for the machine compulation of complex Fourier series, Math. Comp., 19 (1965), pp. 297-301.
2. A. DUTT AND V. ROKHLIN, Fast Fourier transforms for nonequispaced data, SIAM J. Sci. Comput. Statist., 14 (1993), pp. 1368-1393.
3. _, Fast Fourier Transforms for Nonequispaced Data II, Research Report Yaleu/dcs/rr-980, Yale University, New Haven, CT, August 1993.
4. A. P. PEIRCE, S. SPOTTISWOODE, AND J. A. L. NAPIER, The spectral boundary element method: A new window on boundary elements in rock mechanics, Internat. J. Rock Mech. Min. Sci. Geomech. Abstr., 29 (1992), pp. 379-400.
5. Y. SAAD AND M. SCHULTZ, GMRES: A generalized minimal residual algorithm for solving nonsymmetric linear systems, SIAM J. Sci. Statist. Comput., 7 (1986), pp. 856-869.