Correctly rounded multiplication by arbitrary precision constants

IEEE Transactions on Computers

Volumn 57, Issue 2, 2008, Pages 165-174

  Brisebarre, Nicolas ^a   Muller, Jean Michel ^b  

^a UNIVERSITÉ JEAN MONNET   (France)

^b UNIVERSITÉ DE LYON   (France)

Author keywords

Computer arithmetic; Floating point arithmetic

Indexed keywords

MULTIPLYING CIRCUITS; NUMBER THEORY; PROGRAM PROCESSORS;

COMPUTER ARITHMETIC; FLOATING-POINT ARITHMETIC;

DIGITAL ARITHMETIC;

EID: 38349079110     PISSN: 00189340     EISSN: None     Source Type: Journal    
DOI: 10.1109/TC.2007.70813     Document Type: Article

References (17)

1. M. Abramowitz and I.A. Stegun, Handbook of Mathematical Functions with Formulas, Graphs and Mathematical Tables, Applied Math. Series 55, US Nat'l Bureau of Standards, 1964.
2. N. Brisebarre, J.-M. Muller, and S. Raina, "Accelerating Correctly Rounded Floating-Point Division When the Divisor Is Known in Advance," IEEE Trans. Computers, vol. 53, no. 8, pp. 1069-1072, Aug. 2004.
3. M.A. Cornea-Hasegan, R.A. Golliver, and P. Markstein "Correctness Proofs Outline for Newton-Raphson Based Floating-Point Divide and Square Root Algorithms," Proc. 14th IEEE Symp. Computer Arithmetic, I. Koren and P. Kornerup, eds., pp. 96-105, Apr. 1999.
4. B.P. Flannery, W.H. Press, S.A. Teukolsky, and W.T. Vetterling, Numerical Recipes in C, second ed. Cambridge Univ. Press, 1992.
5. D. Goldberg, "What Every Computer Scientist Should Know about Floating-Point Arithmetic," ACM Computing Surveys, vol. 23, no. 1, pp. 5-47, Mar. 1991.
6. G.H. Hardy and E.M. Wright, An Introduction to the Theory of Numbers Oxford Univ. Press, 1979.
7. J. Harrison, "A Machine-Checked Theory of Floating-Point Arithmetic," Proc. 12th Int'l Conf. Theorem Proving in Higher Order Logics, Y. Bertot, G. Dowek, A. Hirschowitz, C. Paulin, and L. Théry, eds., pp. 113-130, Sept. 1999.
8. W. Kahan, "A Logarithm Too Clever by Half," http:// http.cs.berkeley.edu/wkahan/LO10GHAF.TXT, 2004.
9. A.Y. Khinchin, Continued Fractions. Dover, 1997.
10. 2," Developments in Reliable Computing, pp. 203-212, Kluwer Academic, 1999.
11. R.-C. Li, S. Boldo, and M. Daumas, "Theorems on Efficient Argument Reductions," Proc. 16th IEEE Symp. Computer Arithmetic, 2003.
12. P. Markstem, IA-64 and Elementary Functions: Speed and Precision, Hewlett-Packard Professional Books. Prentice Hall, 2000.
13. P.W. Markstein, "Computation of Elementary Functions on the IBM Risc System/6000 Processor," IBM J. Research and Development, vol. 34, no. 1, pp. 111-119, Jan. 1990.
14. J.-M. Muller, "On the Definition of ulp(x)," Technical Report 2005-09, LIP Laboratory, ENS Lyon, ftp://ftp.ens-lyon.fr/pub/LIP/ Rapports/RR/RR2005/RR2005-09.pdf, 2005.
15. M.A. Overton, Numerical Computing with IEEE Floating-Point Arithmetic SIAM, 2001.
16. O. Perron, Die Lehre von den Kettenbrüchen, 3. verb. und erweiterte Aufl., pp. 1954-1957. Teubner,
17. H.M. Stark, An Introduction to Number Theory. MIT Press, 1981.