The summation of n floating-point numbers is ubiquitous in numerical computations. We present a new distillation algorithm for floating-point summation which is stable, efficient, and accurate. The algorithm iteratively "distills" the summands without discarding any significant digit until the partial sums cannot change the whole sum. It uses standard floating-point arithmetic and does not rely on the choice of radix or any other specific assumption. Furthermore, the error bound of our algorithm is independent of n and less than 1 ulp
AbstractSeveral different techniques and softwares intend to improve the accuracy of results compute...
Abstract. Given a vector pi of floating-point numbers with exact sum s, we present a new algorithm w...
International audienceWe improve the usual relative error bound for the computation of x^n through i...
The summation of n floating-point numbers is ubiquitous in numerical computations. We present a new ...
Abstract. The addition of two or more floating-point numbers is fundamental to numerical computation...
AbstractSummation is a basic operation in scientific computing; furthermore division-free arithmetic...
. The usual recursive summation technique is just one of several ways of computing the sum of n floa...
Nowadays, parallel computing is ubiquitous in several application fields, both in engineering and sc...
Numerical data processing is a key task across different fields of computer technology use. However,...
International audienceWe present a fast algorithm together with its low-level implementation of corr...
Abstract. Given a vector of floating-point numbers with exact sum s, we present an algorithm for cal...
This is an extended version of our ARITH-19 article.This paper presents a study of some basic blocks...
International audienceFloating-point (FP) addition is non-associative and parallel reduction involvi...
The problem of exactly summing n floating-point numbers is a fundamental problem that has many appli...
10 pagesInternational audienceThis paper presents a study of some basic blocks needed in the design ...
AbstractSeveral different techniques and softwares intend to improve the accuracy of results compute...
Abstract. Given a vector pi of floating-point numbers with exact sum s, we present a new algorithm w...
International audienceWe improve the usual relative error bound for the computation of x^n through i...
The summation of n floating-point numbers is ubiquitous in numerical computations. We present a new ...
Abstract. The addition of two or more floating-point numbers is fundamental to numerical computation...
AbstractSummation is a basic operation in scientific computing; furthermore division-free arithmetic...
. The usual recursive summation technique is just one of several ways of computing the sum of n floa...
Nowadays, parallel computing is ubiquitous in several application fields, both in engineering and sc...
Numerical data processing is a key task across different fields of computer technology use. However,...
International audienceWe present a fast algorithm together with its low-level implementation of corr...
Abstract. Given a vector of floating-point numbers with exact sum s, we present an algorithm for cal...
This is an extended version of our ARITH-19 article.This paper presents a study of some basic blocks...
International audienceFloating-point (FP) addition is non-associative and parallel reduction involvi...
The problem of exactly summing n floating-point numbers is a fundamental problem that has many appli...
10 pagesInternational audienceThis paper presents a study of some basic blocks needed in the design ...
AbstractSeveral different techniques and softwares intend to improve the accuracy of results compute...
Abstract. Given a vector pi of floating-point numbers with exact sum s, we present a new algorithm w...
International audienceWe improve the usual relative error bound for the computation of x^n through i...