G. Bennett and G. Jameson, Monotonic averages of convex functions, J. Math. Anal. Appl, vol.252, issue.1, pp.410-430, 2000.

R. P. Brent, C. Percival, and P. Zimmermann, Error bounds on complex floating-point multiplication, Mathematics of Computation, vol.76, pp.1469-1481, 2007.
URL : https://hal.archives-ouvertes.fr/inria-00120352

D. Calvetti, A stochastic roundoff error analysis for the fast Fourier transform, Mathematics of Computation, vol.56, pp.755-774, 1991.

J. W. Cooley and J. W. Tukey, An algorithm for the machine calculation of complex Fourier series, Mathematics of Computation, vol.19, issue.90, pp.297-301, 1965.

P. Duhamel and M. Vetterli, Fast Fourier transforms: a tutorial review and a state of the art, Signal Process, vol.19, pp.259-299, 1990.

W. M. Gentleman and G. Sande, Fast Fourier transforms-for fun and profit, Proc. Fall Joint Computer Conference, pp.563-578, 1966.

M. T. Heidemann, D. H. Johnson, and C. S. Burrus, Gauss and the history of the fast Fourier transform, IEEE ASSP Mag, pp.14-21, 1984.

P. Henrici, Applied and Computational Complex Analysis, vol.3, 1986.

N. J. Higham, Accuracy and Stability of Numerical Algorithms, 2002.

, IEEE Computer Society. IEEE Standard for Floating-Point Arithmetic. IEEE Standard, 2008.

C. Jeannerod, P. Kornerup, N. Louvet, and J. Muller, Error bounds on complex floating-point multiplication with an FMA, Mathematics of Computation, vol.86, issue.304, pp.881-898, 2017.
URL : https://hal.archives-ouvertes.fr/hal-00867040

C. Jeannerod, N. Louvet, and J. Muller, Further analysis of Kahan's algorithm for the accurate computation of 2 × 2 determinants, Mathematics of Computation, vol.82, issue.284, pp.2245-2264, 2013.

D. E. Knuth, The Art of Computer Programming, vol.2, 1998.

A. V. Oppenheim and R. W. Schafer, Discrete-Time Signal Processing, 2010.

C. , Rapid multiplication modulo the sum and difference of highly composite numbers, Mathematics of Computation, vol.72, pp.387-395, 2002.

G. Plonka and M. Tasche, Fast and numerically stable algorithms for discrete cosine transforms, Linear Algebra and its Applications, vol.394, pp.309-345, 2005.

G. U. Ramos, Roundoff error analysis of the fast Fourier transform, vol.25, pp.757-768, 1971.

B. Salvy and P. Zimmermann, Gfun: A maple package for the manipulation of generating and holonomic functions in one variable, ACM Trans. Math. Softw, vol.20, issue.2, pp.163-177, 1994.
URL : https://hal.archives-ouvertes.fr/inria-00070025

J. C. Schatzman, Accuracy of the discrete Fourier transform and the fast Fourier transform, SIAM J. Sci. Comput, vol.17, issue.5, pp.1150-1166, 1996.

A. Schönhage and V. Strassen, Schnelle Multiplikation grosser Zahlen. Computing (Arch. Elektron. Rechnen), vol.7, pp.281-292, 1971.

M. Tasche and H. Zeuner, Worst and average case roundoff error analysis for fft, BIT, vol.41, issue.3, pp.563-581, 2001.

C. Van-loan, Computational frameworks for the fast Fourier transform, Frontiers in Applied Mathematics. Society for Industrial and Applied Mathematics (SIAM), vol.10, 1992.

H. Wilson and U. Keich, Accurate pairwise convolutions of nonnegative vectors via FFT, Comput. Statist. Data Anal, vol.101, pp.300-315, 2016.