Note on FastTwoSum with Directed Roundings
Abstract
In [2], Graillat and Jezequel prove a bound on the maximal error for the FastTwoSum
algorithm with directed roundings. We improve that bound by a factor 2, even in the case of underflow.
We also study the case when FastTwoSum is used in the ``wrong order''.
Origin | Files produced by the author(s) |
---|