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.
Document type :
Journal articles
Complete list of metadatas

Cited literature [37 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-01963634
Contributor : Fabienne Jezequel <>
Submitted on : Tuesday, July 9, 2019 - 3:31:23 PM
Last modification on : Friday, July 12, 2019 - 1:31:01 AM

File

 Restricted access
To satisfy the distribution rights of the publisher, the document is embargoed until : 2019-12-20

Please log in to resquest access to the document

Identifiers

Données associées

Citation

Stef Graillat, Fabienne Jézéquel. Tight interval inclusions with compensated algorithms. IEEE Transactions on Computers, Institute of Electrical and Electronics Engineers, 2019, pp.1-10. ⟨10.1109/TC.2019.2924005⟩. ⟨hal-01963634v2⟩

Share

Metrics

Record views

33