On the robustness of the 2Sum and Fast2Sum algorithms - ENS de Lyon - École normale supérieure de Lyon Accéder directement au contenu
Article Dans Une Revue ACM Transactions on Mathematical Software Année : 2017

On the robustness of the 2Sum and Fast2Sum algorithms

Résumé

The 2Sum and Fast2Sum algorithms are important building blocks in numerical computing. They are used (implicitely or explicitely) in many compensated algorithms (such as compensated summation or compensated polynomial evaluation). They are also used for manipulating floating-point expansions. We show that these algorithms are much more robust than it is usually believed: the returned result makes sense even when the rounding function is not round-to-nearest, and they are almost immune to overflow.

Domaines

Autre [cs.OH]
Fichier principal
Vignette du fichier
FaithfulTwoSum-Final-Fev2017.pdf (310.83 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

ensl-01310023 , version 1 (01-05-2016)
ensl-01310023 , version 2 (22-02-2017)

Identifiants

  • HAL Id : ensl-01310023 , version 2

Citer

Sylvie Boldo, Stef Graillat, Jean-Michel Muller. On the robustness of the 2Sum and Fast2Sum algorithms. ACM Transactions on Mathematical Software, 2017, 44 (1). ⟨ensl-01310023v2⟩
961 Consultations
1754 Téléchargements

Partager

Gmail Facebook X LinkedIn More