Add to ORKGColloque avec actes et comité de lecture. internationale.International audienceThis paper provides a simpler proof of the "accurate summation" algorithm proposed by Demmel and Hida. It also gives improved bounds in some cases, and examples showing that those new bounds are optimal. This simpler proof will be used to obtain a computer-checked proof of Demmel-Hida's algorithm
AbstractAn algorithm is presented for computer summation of imprecise numbers that may have quite di...
The sum-of-linear-ratios problem is the most difficult to globally solve among fractional pro-grammi...
More than 45 years ago, Dekker proved that it is possible to evaluate the exact error of a floating-...
This paper provides a simpler proof of the “accurate summation ” algorithm proposed by Demmel and Hi...
Abstract. Given a vector of floating-point numbers with exact sum s, we present an algorithm for cal...
AbstractSummation is a basic operation in scientific computing; furthermore division-free arithmetic...
Numerical data processing is a key task across different fields of computer technology use. However,...
Abstract. Given a vector pi of floating-point numbers with exact sum s, we present a new algorithm w...
Algorithms for summation and dot product of floating point numbers are presented which are fast in t...
Numerical data processing is a key task across different fields of computer technology use. However ...
Modern algorithmic techniques for summation, most of which were introduced in the 1990s, are develop...
Nowadays, parallel computing is ubiquitous in several application fields, both in engineering and sc...
International audienceCompensated algorithms consist in computing the rounding errors of individual ...
This paper presents a study of some basic blocks needed in the design of floating-point summation al...
International audienceWe present a fast algorithm together with its low-level implementation of corr...
AbstractAn algorithm is presented for computer summation of imprecise numbers that may have quite di...
The sum-of-linear-ratios problem is the most difficult to globally solve among fractional pro-grammi...
More than 45 years ago, Dekker proved that it is possible to evaluate the exact error of a floating-...
This paper provides a simpler proof of the “accurate summation ” algorithm proposed by Demmel and Hi...
Abstract. Given a vector of floating-point numbers with exact sum s, we present an algorithm for cal...
AbstractSummation is a basic operation in scientific computing; furthermore division-free arithmetic...
Numerical data processing is a key task across different fields of computer technology use. However,...
Abstract. Given a vector pi of floating-point numbers with exact sum s, we present a new algorithm w...
Algorithms for summation and dot product of floating point numbers are presented which are fast in t...
Numerical data processing is a key task across different fields of computer technology use. However ...
Modern algorithmic techniques for summation, most of which were introduced in the 1990s, are develop...
Nowadays, parallel computing is ubiquitous in several application fields, both in engineering and sc...
International audienceCompensated algorithms consist in computing the rounding errors of individual ...
This paper presents a study of some basic blocks needed in the design of floating-point summation al...
International audienceWe present a fast algorithm together with its low-level implementation of corr...
AbstractAn algorithm is presented for computer summation of imprecise numbers that may have quite di...
The sum-of-linear-ratios problem is the most difficult to globally solve among fractional pro-grammi...
More than 45 years ago, Dekker proved that it is possible to evaluate the exact error of a floating-...