Nicolas Brisebarre
Abstract
We are interested in obtaining error bounds for the classical Cooley-Tukey fast Fourier transform algorithm in floating-point arithmetic, for the 2-norm as well as for the infinity norm. For that purpose, we also give some results on the relative error of the complex multiplication by a root of unity, and on the largest value that can take the real or imaginary part of one term of the fast Fourier transform of a vector x, assuming that all terms of x have real and imaginary parts less than some value b.
- G. Bennett and G. Jameson. 2000. Monotonic averages of convex functions. J. Math. Anal. Appl. 252, 1 (2000), 410--430. DOI:https://doi.org/10.1006/jmaa.2000.7087Google Scholar
Cross Ref
- R. P. Brent, C. Percival, and P. Zimmermann. 2007. Error bounds on complex floating-point multiplication. Math. Comp. 76 (2007), 1469--1481.Google ScholarCross Ref
- D. Calvetti. 1991. A stochastic roundoff error analysis for the fast Fourier transform. Math. Comp. 56, 194 (1991), 755--774.Google ScholarCross Ref
- J. Cooley and J. Tukey. 1965. An algorithm for the machine calculation of complex Fourier series. Math. Comp. 19, 90 (1965), 297--301.Google ScholarCross Ref
- P. Duhamel and M. Vetterli. 1990. Fast Fourier transforms: A tutorial review and a state of the art. Signal Process. 19 (1990), 259--299.Google ScholarDigital Library
- W. Gentleman and G. Sande. 1966. Fast Fourier transforms—For fun and profit. In Proceedings of the Fall Joint Computer Conference. 563--578.Google Scholar
- M. Heidemann, D. Johnson, and C. Burrus. 1984. Gauss and the history of the fast Fourier transform. IEEE ASSP Mag. 1, 4 (Oct. 1984), 14--21.Google ScholarCross Ref
- P. Henrici. 1986. Applied and Computational Complex Analysis. Vol. 3. Wiley, New York, NY.Google Scholar
- N. J. Higham. 2002. Accuracy and Stability of Numerical Algorithms (2nd ed.). SIAM, Philadelphia, PA.Google Scholar
- IEEE Computer Society. 2008. 754-2008—IEEE Standard for Floating-Point Arithmetic. IEEE Standard 754-2008. Retrieved April 6, 2020 from http://ieeexplore.ieee.org/servlet/opac?punumber=4610933.Google Scholar
- C.-P. Jeannerod, P. Kornerup, N. Louvet, and J.-M. Muller. 2017. Error bounds on complex floating-point multiplication with an FMA. Math. Comp. 86, 304 (2017), 881--898. DOI:https://doi.org/10.1090/mcom/3123Google ScholarCross Ref
- C.-P. Jeannerod, N. Louvet, and J.-M. Muller. 2013. Further analysis of Kahan’s algorithm for the accurate computation of 2 × 2 determinants. Math. Comp. 82, 284 (Oct. 2013), 2245--2264. DOI:https://doi.org/10.1090/S0025-5718-2013-02679-8Google ScholarCross Ref
- D. E. Knuth. 1998. The Art of Computer Programming (3rd ed.). Vol. 2. Addison-Wesley, Reading, MA.Google ScholarDigital Library
- A. V. Oppenheim and R. W. Schafer. 2010. Discrete-Time Signal Processing. Prentice Hall.Google Scholar
- C. Percival. 2002. Rapid multiplication modulo the sum and difference of highly composite numbers. Math. Comp. 72 (2002), 387--395.Google ScholarDigital Library
- G. Plonka and M. Tasche. 2005. Fast and numerically stable algorithms for discrete cosine transforms. Linear Algebra Appl. 394 (2005), 309--345.Google ScholarCross Ref
- G. Ramos. 1971. Roundoff error analysis of the fast Fourier transform. Math. Comp. 25, 116 (1971), 757--768.Google ScholarCross Ref
- B. Salvy and P. Zimmermann. 1994. GFUN: A maple package for the manipulation of generating and holonomic functions in one variable. ACM Trans. Math. Softw. 20, 2 (June 1994), 163--177. DOI:https://doi.org/10.1145/178365.178368Google ScholarDigital Library
- J. Schatzman. 1996. Accuracy of the discrete Fourier transform and the fast Fourier transform. SIAM J. Sci. Comput. 17, 5 (1996), 1150--1166.Google ScholarDigital Library
- A. Schönhage and V. Strassen. 1971. Schnelle Multiplikation grosser Zahlen. Computing (Arch. Elektron. Rechnen) 7 (1971), 281--292. DOI:https://doi.org/10.1007/bf02242355 In German.Google Scholar
- M. Tasche and H. Zeuner. 2001. Worst and average case roundoff error analysis for FFT. BIT 41, 3 (June 2001), 563--581. DOI:https://doi.org/10.1023/A:1021923430250Google ScholarCross Ref
- C. Van Loan. 1992. Computational Frameworks for the Fast Fourier Transform. Frontiers in Applied Mathematics, Vol. 10. SIAM, Philadelphia, PA. DOI:https://doi.org/10.1137/1.9781611970999Google Scholar
- H. Wilson and U. Keich. 2016. Accurate pairwise convolutions of non-negative vectors via FFT. Comput. Statist. Data Anal. 101 (2016), 300--315. DOI:https://doi.org/10.1016/j.csda.2016.03.010Google ScholarDigital Library
Index Terms
- Error Analysis of Some Operations Involved in the Cooley-Tukey Fast Fourier Transform
Recommendations
Numerical Analysis: A fast fourier transform algorithm for real-valued series
A new procedure is presented for calculating the complex, discrete Fourier transform of real-valued time series. This procedure is described for an example where the number of points in the series is an integral power of two. This algorithm preserves ...
The Fast Hartley Transform Algorithm
The fast Hartley transform (FHT) is similar to the Cooley-Tukey fast Fourier transform (FFT) but performs much faster because it requires only real arithmetic computations compared to the complex arithmetic computations required by the FFT. Through use ...
Algorithm 338: algol procedures for the fast Fourier transform
The following procedures are based on the Cooley-Tukey algorithm [1] for computing the finite Fourier transform of a complex data vector; the dimension of the data vector is assumed here to be a power of two. Procedure COMPLEXTRANSFORM computes either ...
Comments