Note on FastTwoSum with Directed Roundings - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Preprints, Working Papers, ... Year : 2023

Note on FastTwoSum with Directed Roundings

Abstract

In [2], Graillat and Jezequel prove a bound on the maximal error for the FastTwoSum algorithm with directed roundings. We improve that bound by a factor 2, even in the case of underflow.
Fichier principal
Vignette du fichier
fasttwosum.pdf (204.97 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-03798376 , version 1 (05-10-2022)
hal-03798376 , version 2 (05-10-2022)
hal-03798376 , version 3 (06-10-2022)
hal-03798376 , version 4 (08-10-2022)
hal-03798376 , version 5 (28-03-2023)
hal-03798376 , version 6 (19-09-2023)

Licence

Attribution

Identifiers

  • HAL Id : hal-03798376 , version 6

Cite

Paul Zimmermann. Note on FastTwoSum with Directed Roundings. 2023. ⟨hal-03798376v6⟩
295 View
124 Download

Share

Gmail Facebook X LinkedIn More