Worst cases for correct rounding of the elementary functions in double precision

Proceedings - Symposium on Computer Arithmetic

Volumn , Issue , 2001, Pages 111-118

  Lefevre V ^a   Muller, J M ^a  

^a LORIA   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; BINARY SEQUENCES; POLYNOMIALS;

ELEMENTARY FUNCTIONS;

DIGITAL ARITHMETIC;

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

References (12)

1. New scalar and vector elementary functions for the IBM system/370
2. IEEE standard for binary floating-point arithmetic
3. Feasibility of "perfect" function evaluation
4. An accurate elementary mathematical library for the IEEE floating point standard
5. What every computer scientist should know about floating-point arithmetic
6. Toward correctly rounded transcendentals
7. Hardware designs for exactly rounded elementary functions
8. Faust evaluation of elementary mathematical functions with correctly rounded last bit