Isolating critical cases for reciprocals using integer factorization

Proceedings - Symposium on Computer Arithmetic

Volumn , Issue , 2003, Pages 148-157

  Harrison, John ^a  

^a INTEL CORPORATION   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; DIGITAL ARITHMETIC; ERRORS;

INTEGER FACTORIZATIONS;

INTEGER PROGRAMMING;

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

References (14)

1. M. Cornea-Hasegan. Proving the IEEE correctness of iterative floating-point square root, divided remainder algorithms. Intel Technology Journal, 1998-Q2:1-11, 1998. Available on the Web as http://developer.intel.com/technology/itj/q21998/articles/art_3.htm.
2. G. H. Hardy and E. M. Wright. An Introduction to the Theory of Numbers. Clarendon Press, 5th edition, 1979.
3. J. Harrison. Formal verification of IA-64 division algorithms. In M. Aagaard and J. Harrison, editors, Theorem Proving in Higher Order Logics: 13th International Conference, TPHOLs 2000, volume 1869 of Lecture Notes in Computer Science, pages 234-251. Springer-Verlag, 2000.
4. C. Iordache and D. W. Matula. On infinitely precise rounding for division, square root, reciprocal and square root reciprocal. In I. Koren and P. Kornerup, editors, Proceedings, 14th IEEE symposium on on computer arithmetic, pages 233-240, Adelaide, Australia, 1999. IEEE Computer Society. See also Technical Report 99-CSE-1, Southern Methodist University.
5. T. Lang and J.-M. Muller. Bounds on runs of zeros and ones for algebraic functions. Research Report 4045, INRIA, 2000.
6. V. Lefèvre and J.-M. Muller. Worst cases for correct rounding of the elementary functions in double precision. Research Report 4044, INRIA, 2000.
7. R.-C. Li. The ABC conjecture and correctly rounded reciprocal square root. Preprint, 2002.
8. P. Markstein. IA-64 and Elementary Functions: Speed and Precision. Prentice-Hall, 2000.
9. P. W. Markstein. Computation of elementary functions on the IBM RISC System/6000 processor. IBM Journal of Research and Development, 34:111-119, 1990.
10. J.-L. Nicholas. On highly composite numbers. In Ramanujan Revisited: Proceedings of the Centenery Conference, pages 215-244. Academic Press, 1988.
11. M. Parks. Number-theoretic test generation for directed rounding. IEEE Transactions on Computers, 49:651-658, 2000.
12. V. Pratt. Every prime has a succinct certificate. SIAM Journal of Computing, 4:214-220, 1975.
13. S. Ramanujan. Highly composite numbers. Proceedings of the London Mathematical Society, 14:347-409, 1915.
14. P. T. P. Tang. Testing computer arithmetic by elementary number theory. Preprint MCS-P84-0889, Mathematics and Computer Science Division, Argonne National Labs, 1989.