M. Abramowitz and I. A. Stegun, Handbook of mathematical functions with formulas, graphs and mathematical tables, Applied Math. Series, vol.55, 1964.

N. Brisebarre, J. Muller, and S. Raina, Accelerating correctly rounded floating-point division when the divisor is known in advance, IEEE Transactions on Computers, vol.53, issue.8, pp.1069-1072, 2004.

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.

B. P. Flannery, W. H. Press, S. A. Teukolsky, and W. T. Vetterling, Numerical recipes in C, 1992.

G. H. Hardy and E. M. Wright, An introduction to the theory of numbers, 1979.

A. Ya, Khinchin. Continued Fractions, 1997.

V. Lefèvre, Developments in Reliable Computing, chapter An Algorithm That Computes a Lower Bound on the Distance Between a Segment and Z 2, pp.203-212, 1999.

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.

O. Perron, Die Lehre von den Kettenbruchen, 3. verb. und erweiterte Aufl, pp.1954-57

H. M. Stark, INRIA Unité de recherche INRIA Rhône-Alpes 655, avenue de l, 1981.

. Unité-de-recherche-inria-futurs, Parc Club Orsay Université -ZAC des Vignes 4, rue Jacques Monod -91893 ORSAY Cedex

. Unité-de-recherche-inria-lorraine, LORIA, Technopôle de Nancy-Brabois -Campus scientifique 615, rue du Jardin Botanique -BP 101 -54602