Ramos, George U. Roundoff error analysis of the fast Fourier transform. (English) Zbl 0227.65068 Math. Comput. 25, 756-768 (1971). Page: −5 −4 −3 −2 −1 ±0 +1 +2 +3 +4 +5 Show Scanned Page Cited in 10 Documents MSC: 65T50 Numerical methods for discrete and fast Fourier transforms 65G50 Roundoff error × Cite Format Result Cite Review PDF Full Text: DOI References: [1] W. M. Gentleman & G. Sande, Fast Fourier Transforms–For Fun and Profit, Fall Joint Computer Conference AFIPS Proc., 1966, v. 29, Spartan, Washington, D.C., 1966, pp. 563-578. [2] P. D. Welch, “A fixed-point fast Fourier transform error analysis,” IEEE Trans. Audio and Electroacoustics, v. AU-17, 1969, pp. 151-157. [3] C. J. Weinstein, “Roundoff noise in floating point fast Fourier transform computation,” IEEE Trans. Audio and Electroacoustics, v. AU-17, 1969, pp. 209-215. [4] Toyohisa Kaneko and Bede Liu, Accumulation of round-off error in fast Fourier transforms, J. Assoc. Comput. Mach. 17 (1970), 637 – 654. · Zbl 0218.65037 · doi:10.1145/321607.321613 [5] James W. Cooley and John W. Tukey, An algorithm for the machine calculation of complex Fourier series, Math. Comp. 19 (1965), 297 – 301. · Zbl 0127.09002 [6] W. M. Gentleman, “Matrix multiplication and fast Fourier transforms,” Bell System Tech. J., v. 47, 1968, pp. 1099-1103. · Zbl 0187.12602 [7] Richard C. Singleton, On computing the fast Fourier transform, Comm. ACM 10 (1967), 647 – 654. · Zbl 0149.37301 · doi:10.1145/363717.363771 [8] F. Theilheimer, “A matrix version of the fast Fourier transform,” IEEE Trans. Audio and Electroacoustics, v. AU-17, 1969, pp. 158-161. [9] D. K. Kahaner, Matrix Description of the Fast Fourier Transform, Los Alamos Scientific Laboratory Report LA-4275-MS, 1969. [10] J. H. Wilkinson, Rounding errors in algebraic processes, Prentice-Hall, Inc., Englewood Cliffs, N.J., 1963. · Zbl 1041.65502 [11] Eugene Isaacson and Herbert Bishop Keller, Analysis of numerical methods, John Wiley & Sons, Inc., New York-London-Sydney, 1966. [12] N. M. Brenner, Three FORTRAN Programs that Perform the Cooley-Tukey Fourier Transform, Technical Note 1967-2, M.I.T. Lincoln Lab., Lexington, Mass., 1967. [13] R. C. Singleton, “An algorithm for computing the mixed radix fast Fourier transform,” IEEE Trans. Audio and Electroacoustics, v. AU-17, 1969, pp. 93-103. [14] M. C. Pease, “An adaptation of the fast Fourier transform for parallel processing,” J. ACM, v. 15, 1968, pp. 252-264. · Zbl 0165.51502 [15] I. J. Good, The interaction algorithm and practical Fourier analysis, J. Roy. Statist. Soc. Ser. B 20 (1958), 361 – 372. · Zbl 0086.12403 This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.