Published in

Association for Computing Machinery (ACM), ACM Transactions on Mathematical Software, 1(44), p. 1-14, 2017

DOI: 10.1145/3054947



Export citation

Search in Google Scholar

On the robustness of the 2Sum and Fast2Sum algorithms

Journal article published in 2017 by Sylvie Boldo, Stef Graillat, Jean-Michel Muller ORCID
This paper is available in a repository.
This paper is available in a repository.

Full text: Download

Green circle
Preprint: archiving allowed
Green circle
Postprint: archiving allowed
Red circle
Published version: archiving forbidden
Data provided by SHERPA/RoMEO


A paraître ; International audience ; 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.