International audienceWe present a fast algorithm together with its low-level implementation of correctly rounded arbitrary-precision floating-point summation. The arithmetic is the one used by the GNU MPFR library: radix 2; no subnormals; each variable (each input and the output) has its own precision. We also describe how the implementation is tested
Abstract. The addition of two or more floating-point numbers is fundamental to numerical computation...
International audienceFloating-point (FP) addition is non-associative and parallel reduction involvi...
International audienceRounding to odd is a non-standard rounding on floating-point numbers. By using...
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...
Abstract. Given a vector pi of floating-point numbers with exact sum s, we present a new algorithm w...
AbstractSummation is a basic operation in scientific computing; furthermore division-free arithmetic...
Abstract. In this Part II of this paper we first refine the analysis of error-free vector transforma...
10 pagesInternational audienceThis paper presents a study of some basic blocks needed in the design ...
We study the multiple-precision addition of two positive floating-point numbers in base 2, with exac...
This paper presents a study of some basic blocks needed in the design of floating-point summation al...
Algorithms for summation and dot product of floating point numbers are presented which are fast in t...
. The usual recursive summation technique is just one of several ways of computing the sum of n floa...
International audienceThis paper presents a multiple-precision binary floating-point library, writte...
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...
International audienceFloating-point (FP) addition is non-associative and parallel reduction involvi...
International audienceRounding to odd is a non-standard rounding on floating-point numbers. By using...
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...
Abstract. Given a vector pi of floating-point numbers with exact sum s, we present a new algorithm w...
AbstractSummation is a basic operation in scientific computing; furthermore division-free arithmetic...
Abstract. In this Part II of this paper we first refine the analysis of error-free vector transforma...
10 pagesInternational audienceThis paper presents a study of some basic blocks needed in the design ...
We study the multiple-precision addition of two positive floating-point numbers in base 2, with exac...
This paper presents a study of some basic blocks needed in the design of floating-point summation al...
Algorithms for summation and dot product of floating point numbers are presented which are fast in t...
. The usual recursive summation technique is just one of several ways of computing the sum of n floa...
International audienceThis paper presents a multiple-precision binary floating-point library, writte...
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...
International audienceFloating-point (FP) addition is non-associative and parallel reduction involvi...
International audienceRounding to odd is a non-standard rounding on floating-point numbers. By using...
DOI
Add to ORKG