Feb 10, 2011 · Abstract: This paper presents a study of some basic blocks needed in the design of floating-point summation algorithms.

Dec 13, 2010 · Abstract—This paper presents a study of some basic blocks needed in the design of floating-point summa- tion algorithms.

This paper presents a study of some basic blocks needed in the design of floating-point summation algorithms. In particular, in radix-2 floating-point ...

This paper presents a study of some basic blocks needed in the design of floating-point summation algorithms. In particular, we show that among the set of ...

Abstract: This paper presents a study of some basic blocks needed in the design of floating- point summation algorithms. In particular, in radix-2 ...

This paper presents a study of some basic blocks needed in the design of floating-point summation algorithms. In particular, we show that among the set of ...

This paper presents a study of some basic blocks needed in the design of floating-point summation algorithms. In particular, we show that among the set of ...

In radix-2 floating-point arithmetic, it is proved that under reasonable conditions, an algorithm performing only round-to-nearest additions/subtractions ...

Oct 1, 2008 · On the computation of correctly-rounded sums. P. Kornerup. V. Lefèvre. N. Louvet. J.-M. Muller ∗. This is LIP research report No 2008-35.

Mar 23, 2009 · This paper presents a study of some basic blocks needed in the design of floating-point summation algorithms. In.