Alternative Split Functions and Dekker's Product - Archive ouverte HAL Access content directly
Conference Papers Year : 2020

Alternative Split Functions and Dekker's Product


We introduce algorithms for splitting a positive binary floating-point number into two numbers of around half the system precision, using arithmetic operations all rounded either toward −∞ or toward +∞. We use these algorithms to compute "exact" products (i.e., to express the product of two floating-point numbers as the unevaluated sum of two floating-point numbers, the rounded product and an error term). This is similar to the classical Dekker product, adapted here to directed roundings.
Fichier principal
Vignette du fichier
SplitDirectedRoundings.pdf (115.07 Ko) Télécharger le fichier
arith2020-code.tar.gz (6.96 Ko) Télécharger le fichier
Origin Files produced by the author(s)

Dates and versions

hal-02470782 , version 1 (07-02-2020)
hal-02470782 , version 2 (14-05-2020)



Stef Graillat, Vincent Lefèvre, Jean-Michel Muller. Alternative Split Functions and Dekker's Product. ARITH-2020 - IEEE 27th Symposium on Computer Arithmetic, Jun 2020, Portland, United States. pp.1-7, ⟨10.1109/ARITH48897.2020.00015⟩. ⟨hal-02470782v2⟩
245 View
642 Download



Gmail Mastodon Facebook X LinkedIn More