FastTwoSum revisited - Inria - Institut national de recherche en sciences et technologies du numérique
Pré-Publication, Document De Travail (Preprint/Prepublication) Année : 2025

FastTwoSum revisited

Résumé

The FastTwoSum algorithm is a classical way to evaluate the rounding error that occurs when adding two numbers in finite precision arithmetic. Starting with Dekker in the early 1970s, numerous floating-point analyses have been made of this algorithm, that are aimed at identifying sufficient conditions for the error to be computed exactly and, otherwise, at quantifying the quality of the error estimate thus produced. In this paper we revisit these two aspects of FastTwoSum. We first provide new, less restrictive conditions for exactness, and show that FastTwoSum performs an error-free transform in more general situations than those found so far in the literature. Second, when exactness cannot be guaranteed we give several error analyses of the output of FastTwoSum and show that the bounds obtained are tight. In particular, this provides further insight into how the algorithm behaves when roundings other than 'to nearest' are used, or when the operands are reversed.
Fichier principal
Vignette du fichier
FastTwoSumRevisited.pdf (270.32 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-04875749 , version 1 (09-01-2025)

Licence

Identifiants

  • HAL Id : hal-04875749 , version 1

Citer

Claude-Pierre Jeannerod, Paul Zimmermann. FastTwoSum revisited. 2025. ⟨hal-04875749⟩
0 Consultations
0 Téléchargements

Partager

More