M. Baudin, Error bounds of complex arithmetic Available at http, 2011.

M. Baudin and R. L. Smith, A robust complex division in Scilab (2012) Available at http://arxiv.org/abs, p.4539, 1210.

R. Brent, C. Percival, and P. Zimmermann, Error bounds on complex floating-point multiplication, Mathematics of Computation, vol.76, issue.259, pp.1469-1481, 2007.
DOI : 10.1090/S0025-5718-07-01931-X

URL : https://hal.archives-ouvertes.fr/inria-00120352

W. P. Champagne, On finding roots of polynomials by hook or by crook, 1964.

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

D. E. Knuth, The Art of Computer Programming Seminumerical Algorithms, 1998.

D. M. Priest, Efficient scaling for complex division, ACM Transactions on Mathematical Software, vol.30, issue.4, 2004.
DOI : 10.1145/1039813.1039814

S. M. Rump, T. Ogita, and S. Oishi, Accurate Floating-Point Summation Part I: Faithful Rounding, SIAM Journal on Scientific Computing, vol.31, issue.1, pp.189-224, 2008.
DOI : 10.1137/050645671

R. L. Smith, Algorithm 116: Complex division, Communications of the ACM, vol.5, issue.8, p.435, 1962.
DOI : 10.1145/368637.368661

G. W. Stewart, A note on complex division, ACM Transactions on Mathematical Software, vol.11, issue.3, pp.238-241, 1985.
DOI : 10.1145/214408.214414

J. H. Wilkinson, The Algebraic Eigenvalue Problem, 1965.

A. Ziv, Sharp ULP rounding error bound for the hypotenuse function, Mathematics of Computation, vol.68, issue.227, pp.1143-1148, 1999.
DOI : 10.1090/S0025-5718-99-01103-5