Note on FastTwoSum with Directed Roundings - Department of Algorithms, Computation, Image and Geometry
Pré-Publication, Document De Travail Année : 2024

Note on FastTwoSum with Directed Roundings

Sélène Corbineau
  • Fonction : Auteur
  • PersonId : 1397723

Résumé

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. We also study the case when FastTwoSum is used in the ``wrong order''.
Fichier principal
Vignette du fichier
fasttwosum.pdf (255.26 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)

Dates et 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)
hal-03798376 , version 7 (04-07-2024)
hal-03798376 , version 8 (04-07-2024)
hal-03798376 , version 9 (07-11-2024)
hal-03798376 , version 10 (17-12-2024)

Licence

Identifiants

  • HAL Id : hal-03798376 , version 10

Citer

Sélène Corbineau, Paul Zimmermann. Note on FastTwoSum with Directed Roundings. 2024. ⟨hal-03798376v10⟩
923 Consultations
243 Téléchargements

Partager

More