M. A. Cornea-hasegan, R. A. Golliver, and P. Markstein, Correctness proofs outline for newton-raphson based floating-point divide and square root algorithms, Proceedings of the 14th IEEE Symposium on Computer Arithmetic, pp.96-105, 1999.

M. D. Ercegovac and T. Lang, Division and Square Root : Digit-Recurrence Algorithms and Implementations, 1994.

D. Goldberg, What every computer scientist should know about floating-point arithmetic, ACM Computing Surveys, vol.23, issue.1, pp.5-47, 1991.

C. Iordache and D. W. Matula, On infinitely precise rounding for division, square root, reciprocal and square root reciprocal, Proceedings of the 14th IEEE Symposium on Computer Arithmetic, pp.233-240, 1999.

W. Kahan, Lecture notes on the status of IEEE-754, 1996.

D. Knuth, The Art of Computer Programming, vol.2, 1973.

I. Koren, Computer arithmetic algorithms, 1993.

T. Lang and J. M. Muller, Bound on run of zeros and ones for algebraic functions, Proc. of the 15th IEEE Symposium on Computer Arithmetic (Arith-15), 2001.
URL : https://hal.archives-ouvertes.fr/inria-00072593

P. Markstein, Ia-64 and Elementary Functions : Speed and Precision. Hewlett-Packard Professional Books, p.130183482, 2000.

P. W. Markstein, Computation of elementary functions on the IBM risc system/6000 processor, IBM Journal of Research and Development, vol.34, issue.1, pp.111-119, 1990.

S. F. Oberman and M. J. Flynn, Division algorithms and implementations, IEEE Transactions on Computers, 1997.

;. Unité-de-recherche-inria-lorraine and . Le-chesnay-cedex, Campus scientifique, 615 rue du Jardin Botanique, vol.101, 2004.