Computing predecessor and successor in rounding to nearest

Siegfried Rump 1, 2 Paul Zimmermann 3 Sylvie Boldo 4 Guillaume Melquiond 5
3 CACAO - Curves, Algebra, Computer Arithmetic, and so On
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
4 PROVAL - Proof of Programs
UP11 - Université Paris-Sud - Paris 11, Inria Saclay - Ile de France, CNRS - Centre National de la Recherche Scientifique : UMR
Abstract : We give simple and efficient methods to compute and/or estimate the predecessor and successor of a floating-point number using only floating-point operations in rounding to nearest. This may be used to simulate interval operations, in which case the quality in terms of the diameter of the result is significantly improved compared to existing approaches.
Document type :
Journal articles
Complete list of metadatas

Cited literature [7 references]  Display  Hide  Download

https://hal.inria.fr/inria-00337537
Contributor : Paul Zimmermann <>
Submitted on : Friday, November 7, 2008 - 12:05:24 PM
Last modification on : Thursday, January 11, 2018 - 6:22:14 AM
Long-term archiving on : Monday, June 7, 2010 - 10:48:20 PM

File

RuZiBoMe08.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

Siegfried Rump, Paul Zimmermann, Sylvie Boldo, Guillaume Melquiond. Computing predecessor and successor in rounding to nearest. BIT Numerical Mathematics, Springer Verlag, 2009, 49 (2), pp.419-431. ⟨10.1007/s10543-009-0218-z⟩. ⟨inria-00337537⟩

Share

Metrics

Record views

885

Files downloads

722