Generation and analysis of hard to round cases for binary floating point division

Proceedings - Symposium on Computer Arithmetic

Volumn , Issue , 2001, Pages 119-127

  McFearin, L D ^a   Matula, D W ^a  

^a Southern Methodist University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BINARY SEQUENCES; COMPUTATIONAL METHODS;

ROUNDING ERRORS;

DIGITAL ARITHMETIC;

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

References (17)

1. Series approximation methods for divide and square root in the power3 processor
2. Correctness proofs outline for Newton-Raphson based floating-point divide and square root algorithms
3. On infinitely precise rounding for division, square root, reciprocal, and square root reciprocal
4. Analysis of reciprocal and square root reciprocal instructions in the AMD K6-2 implementation of 3DNow!
5. Towards correctly rounded transcendentals
6. Foundations of finite precision rational arithmetic
7. Number theoretic foundations of binary floating point division with rounding
8. Number theoretic foundations of binary floating point division with rounding
9. Number-theoretic test generation for directed rounding
10. Exact rounding of certain elementary functions