Tight interval inclusions with compensated algorithms - Archive ouverte HAL Access content directly
Journal Articles IEEE Transactions on Computers Year : 2020

Tight interval inclusions with compensated algorithms

Abstract

Compensated algorithms consist in computing the rounding errors of individual operations and then adding them later on to the computed result. This makes it possible to increase the accuracy of the computed result efficiently. Computing the rounding error of an individual operation is possible through the use of a so-called error-free transformation. In this article, we show that it is possible to use compensated algorithms for having tight interval inclusion. We study compensated algorithms for summation, dot product and polynomial evaluation. We prove that the use of directed rounding makes it possible to get narrow inclusions with compensated algorithms. This is due to the fact that error-free transformations are no more exact but still sufficiently accurate to improve the numerical quality of results.
Fichier principal
Vignette du fichier
article_HAL_v2.pdf (273.39 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01963634 , version 1 (21-12-2018)
hal-01963634 , version 2 (09-07-2019)

Identifiers

Cite

Stef Graillat, Fabienne Jézéquel. Tight interval inclusions with compensated algorithms. IEEE Transactions on Computers, 2020, 69 (12), pp.1774-1783. ⟨10.1109/TC.2019.2924005⟩. ⟨hal-01963634v2⟩
201 View
253 Download

Altmetric

Share

Gmail Facebook X LinkedIn More