Service interruption on Monday 11 July from 12:30 to 13:00: all the sites of the CCSD (HAL, EpiSciences, SciencesConf, AureHAL) will be inaccessible (network hardware connection).
Skip to Main content Skip to Navigation
Journal articles

On Ziv's rounding test

Florent de Dinechin 1, 2 Christoph Lauter 3 Jean-Michel Muller 1, 2 Serge Torres 1, 2 
2 ARIC - Arithmetic and Computing
Inria Grenoble - Rhône-Alpes, LIP - Laboratoire de l'Informatique du Parallélisme
3 PEQUAN - Performance et Qualité des Algorithmes Numériques
LIP6 - Laboratoire d'Informatique de Paris 6
Abstract : A very simple test, introduced by Ziv, allows one to determine if an approximation to the value f (x) of an elementary function at a given point x suffices to return the floating-point number nearest f(x). The same test may be used when implementing floating-point operations with input and output operands of different formats, using arithmetic operators tailored for manipulating operands of the same format. That test depends on a "magic constant" e. We show how to choose that constant e to make the test reliable and efficient. Various cases are considered, depending on the availability of an fma instruction, and on the range of f (x).
Document type :
Journal articles
Complete list of metadata

Cited literature [6 references]  Display  Hide  Download

https://hal-ens-lyon.archives-ouvertes.fr/ensl-00693317
Contributor : Jean-Michel Muller Connect in order to contact the contributor
Submitted on : Monday, July 8, 2013 - 10:56:40 AM
Last modification on : Monday, May 16, 2022 - 4:58:02 PM
Long-term archiving on: : Wednesday, October 9, 2013 - 4:20:52 AM

File

ZivRounding-final.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : ensl-00693317, version 2

Citation

Florent de Dinechin, Christoph Lauter, Jean-Michel Muller, Serge Torres. On Ziv's rounding test. ACM Transactions on Mathematical Software, Association for Computing Machinery, 2013, 39 (4), pp.26. ⟨ensl-00693317v2⟩

Share

Metrics

Record views

574

Files downloads

710