Computing predecessor and successor in rounding to nearest

DOI10.1007/s10543-009-0218-zzbMath1196.65089OpenAlexW1973494351MaRDI QIDQ2391021

Sylvie Boldo, Guillaume Melquiond, Siegfried Michael Rump, Paul Zimmermann

Publication date: 24 July 2009

Published in: BIT (Search for Journal in Brave)

Full work available at URL: https://hal.inria.fr/inria-00337537/file/RuZiBoMe08.pdf

zbMATH Keywords

algorithmfloating-point arithmeticdirected roundingrounding to nearest

Mathematics Subject Classification ID

Roundoff error (65G50)

Related Items (7)

Simple floating-point filters for the two-dimensional orientation problem ⋮ Computation of the unit in the first place (ufp) and the unit in the last place (ulp) in precision-\(p\) base \(\beta\) ⋮ Floating-point arithmetic ⋮ Fast and accurate computation of the Euclidean norm of a vector ⋮ Primitive Floats in Coq ⋮ Optimal inverse projection of floating-point addition ⋮ Improvement of error-free splitting for accurate matrix multiplication

Uses Software

• INTLIB
• Algorithm 722

Cites Work

• Algorithm 722: Functions to support the IEEE standard for binary floating-point arithmetic
• Algorithm 737: INTLIB—a portable Fortran 77 interval standard-function library
• Accurate Floating-Point Summation Part I: Faithful Rounding
• Unnamed Item

This page was built for publication: Computing predecessor and successor in rounding to nearest