Theorems on efficient argument reductions

Proceedings - Symposium on Computer Arithmetic

Volumn , Issue , 2003, Pages 129-136

  Li, Ren Cang ^a   Boldo, Sylvie ^b   Daumas, Marc ^b  

^a UNIVERSITY OF KENTUCKY   (United States)

^b UNIVERSITÉ DE LYON   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; POLYNOMIAL APPROXIMATION; THEOREM PROVING;

ARGUMENT REDUCTIONS;

DIGITAL ARITHMETIC;

EID: 0042134517     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (20)

1. American National Standards Institute and Institute of Electrical and Electronic Engineers. IEEE standard for binary floating-point arithmetic. ANSI/IEEE Standard, Std 754-1985, New York, 1985.
2. ANSI/ISO/IEC 9899:1999. Programming Languages - C. 1999.
3. M. Daumas, L. Rideau, and L. Théry. A generic library of floating-point numbers and its application to exact computing. In 14th International Conference on Theorem Proving in Higher Order Logics, pages 169-184, Edinburgh, Scotland, 2001.
4. D. Goldberg. What every computer scientist should know about floating-point arithmetic. ACM Computing Surveys, 23(1):5-47, Mar. 1991.
5. J. Harrison, T. Kubaska, S. Story, and P. T. P. Tang. The computation of transcendental functions on the IA-64 architecture. Intel Technology Journal, (Q4):1-7, November 1999.
6. N. J. Higham. Accuracy and Stability of Numerical Algorithms. SIAM, Philadephia, 1996.
7. G. Huet, G. Kahn, and C. Paulin-Mohring. The Coq proof assistant: a tutorial: version 7.2. Technical Report 256, Institut National de Recherche en Informatique et en Automatique, Le Chesnay, France, 2002. Available at ftp://ftp.inria.fr/INRIA/publication/publi-pdf/RT/RT-0256.pdf.
8. W. Kahan. Minimizing q*m-n. At the beginning of the file "nearpi.c", available electronically at http://http.cs.berkeley.edu/̃wkahan/testpi, 1983.
9. D. Knuth. The Art of Computer Programming, volume 2. Addison Wesley, Reading, MA, 1981.
10. R.-C. Li. Always Chebyshev interpolation in elementary function computations, submitted for publication, June 2001.
11. P. Markstein. IA-64 and Elementary Functions: Speed and Precision. Prentice Hall, New Jersey, 2000.
12. J.-M. Muller. Elementary Functions: Algorithms and Implementation. Birkhåuser, Boston•Basel•Berlin, 1997.
13. K. C. Ng. Argument reduction for huge arguments: Good to the last bit. Technical report, SunPro, 1992. available electronically at http://www.validgh.com/.
14. M. L. Overton. Numerical Computing with IEEE Floating Point Arithmetic. SIAM, Philadelphia, 2001.
15. M. J. D. Powell. On the maximum errors of polynomial approximations defined by interpolation and by least squares criteria. The Computer Journal, 9(4):404 - 407, February 1967.
16. P. H. Sterbenz. Floating-Point Computation. Prentice-Hall series in automatic computation. Prentice-Hall, Englewood Cliffs, NJ, USA, 1974.
17. P. T. P. Tang. Table-driven implementation of the exponential function in IEEE floating-point arithmetic. ACM Transactions on Mathematical Software, 15(2):144-157, June 1989.
18. P. T. P. Tang. Table-driven implementation of the logarithm function in IEEE floating-point arithmetic. ACM Transactions on Mathematical Software, 16(4):378-400, Dec. 1990.
19. P. T. P. Tang. Table lookup algorithms for elementary functions and their error analysis. In P. Kornerup and D. W. Matula, editors, Proceedings of the 10th IEEE Symposium on Computer Arithmetic, pages 232-236, Grenoble, France, June 1991. IEEE Computer Society Press, Los Alamitos, CA.
20. P. T. P. Tang. Table-driven implementation of the expm1 function in IEEE floating-point arithmetic. ACM Transactions on Mathematical Software, 18(2):211-222, June 1992.