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

N. Brisebarre, J. Muller, and A. Tisserand, Computing machine-efficient polynomial approximations, ACM Transactions on Mathematical Software, vol.32, issue.2, pp.236-256, 2006.
DOI : 10.1145/1141885.1141890
URL : https://hal.archives-ouvertes.fr/ensl-00086826

W. Cody and W. Waite, Software Manual for the Elementary Functions, 1980.

C. Daramy, D. Defour, J. Florent-de-dinechin, and . Muller, CR-LIBM: a correctly rounded elementary function library, Advanced Signal Processing Algorithms, Architectures, and Implementations XIII, 2003.
DOI : 10.1117/12.505591

M. Daumas and G. Melquiond, Generating formally certified bounds on values and round-off errors, 6th Conference on Real Numbers and Computers, pp.55-70, 2004.
URL : https://hal.archives-ouvertes.fr/inria-00070739

F. De-dinechin, D. Defour, and C. Lauter, Fast correct rounding of elementary functions in double precision using double-extended arithmetic, Research report, vol.5137, 2004.
URL : https://hal.archives-ouvertes.fr/inria-00071446

C. Florent-de-dinechin, J. Lauter, and . Muller, Fast and correctly rounded logarithms in double-precision, Theoretical Informatics and Applications, 2006.

G. Melquiond, De l'arithmétique d'intervallesàintervalles`intervallesà la certification de programmes, 2006.

J. Muller, Elementary Functions, Algorithms and Implementation, Birkhäuser Boston, 2006.
URL : https://hal.archives-ouvertes.fr/ensl-00000008

E. Remez, Sur un procédé convergent d'approximations successives pour déterminer les polynômes d'approximation, C.R. Académie des Sciences, vol.198, pp.2063-2065, 1934.

L. Veidinger, On the numerical determination of the best approximations in the Chebyshev sense, Numerische Mathematik, vol.13, issue.No. 67, pp.99-105, 1960.
DOI : 10.1007/BF01386215