Skip to Main content Skip to Navigation
Conference papers

Numerical Validation of Compensated Summation Algorithms with Stochastic Arithmetic

Stef Graillat 1, * Fabienne Jézéquel 2, 1, * Romain Picot 1, *
* Corresponding author
1 PEQUAN - Performance et Qualité des Algorithmes Numériques
LIP6 - Laboratoire d'Informatique de Paris 6
Abstract : Compensated summation algorithms are designed to improve the accuracy of ill-conditioned sums. They are based on algorithms, such as FastTwoSum, which are proved to provide, with rounding to nearest, the sum of two floating-point numbers and the associated rounding error. Discrete stochastic arithmetic enables one to estimate rounding error propagation in numerical codes. It requires a random rounding mode which consists in rounding each computed result toward −∞ or +∞ with the same probability. In this paper we analyse the impact of this random rounding mode on compensated summations based on the FastTwoSum algorithm. We show the accuracy improvement obtained using such compensated summations in numerical simulations controlled with discrete stochastic arithmetic.
Document type :
Conference papers
Complete list of metadatas

Cited literature [14 references]  Display  Hide  Download
Contributor : Gestionnaire Hal-Upmc <>
Submitted on : Thursday, November 19, 2015 - 10:39:36 AM
Last modification on : Thursday, March 21, 2019 - 2:43:06 PM
Long-term archiving on: : Friday, April 28, 2017 - 8:31:03 PM


Publication funded by an institution


Distributed under a Creative Commons Attribution - NonCommercial - NoDerivatives 4.0 International License



Stef Graillat, Fabienne Jézéquel, Romain Picot. Numerical Validation of Compensated Summation Algorithms with Stochastic Arithmetic. 8th International Workshop on Numerical Software Verification, NSV 2015, Apr 2015, Seattle, United States. pp.55-69, ⟨10.1016/j.entcs.2015.10.007⟩. ⟨hal-01230860⟩



Record views


Files downloads