Accurate Sum and Dot Product

  title={Accurate Sum and Dot Product},
  author={Takeshi Ogita and Siegfried M. Rump and Shin'ichi Oishi},
  journal={SIAM J. Sci. Comput.},
Algorithms for summation and dot product of floating-point numbers are presented which are fast in terms of measured computing time. We show that the computed results are as accurate as if computed in twice or K-fold working precision, $K\ge 3$. For twice the working precision our algorithms for summation and dot product are some 40% faster than the corresponding XBLAS routines while sharing similar error estimates. Our algorithms are widely applicable because they require only addition… 
Accurate Floating-Point Product and Exponentiation
  • S. Graillat
  • Computer Science
    IEEE Transactions on Computers
  • 2009
A method to improve the accuracy of the product of floating-point numbers is focused on and it is shown that the computed result is as accurate as if computed in twice the working precision.
Parallel algorithms for accurate sum and dot product on GPU
An efficient data parallel algorithm applying the all-prefix-sums operation (or the parallel reduction, more simply) suitable for multicore processors, especially GPUs is developed.
Choosing a twice more accurate dot product implementation
It is shown that the FMA does not improve in a significant way the accuracy of the result whereas it increases significantly the actual speed of the algorithms.
Accurate Floating Point Product
A method to improve the accuracy of the product of floating point numbers is focused on and it is shown that the computed result is as accurate as if computed in twice the working precision.
A Correctly-Rounded Fixed-Point-Arithmetic Dot-Product Algorithm
This article describes an algorithm that computes a correctly-rounded sum of products from inputs whose format is known in advance, and relies on odd rounding (that is easily implemented in hardware) and comes with a careful proof and some cost analysis.
Enhanced Floating-Point Sums, Dot Products, and Polynomial Values
In this chapter, we focus on the computation of sums and dot products, and on the evaluation of polynomials in IEEE 754 floating-point arithmetic.1 Such calculations arise in many fields of numerical
Accurate Floating Point Arithmetic through Hardware Error-Free Transformations
It is shown that the time×area product can be improved by a factor of 4 and 6 over software error-free addition and multiplication and it is illustrated that a number of area and performance trade-offs can be made when calculating vector sums and dot products.
Correctly rounded architectures for Floating-Point multi-operand addition and dot-product computation
This study presents hardware architectures performing correctly rounded Floating-Point (FP) multioperand addition and dot-product computation, both of which are widely used in various fields, such as


Accurate and Efficient Floating Point Summation
Several simple algorithms for accurately computing the sum of n floating point numbers using a wider accumulator are presented and how the cost of sorting can be reduced or eliminated while retaining accuracy is investigated.
A Distillation Algorithm for Floating-Point Summation
This paper describes an efficient "distillation" style algorithm which produces a precise sum by exploiting the natural accuracy of compensated cancellation, applicable to all sets of data but particularly appropriate for ill-conditioned data.
Floating-point computation of functions with maximum accuracy
  • G. Bohlender
  • Mathematics
    1975 IEEE 3rd Symposium on Computer Arithmetic (ARITH)
  • 1975
Algorithms are given which compute multiple sums and products and arbitray roots of floating-point numbers with maximum accuracy and simple error formulas and the smallest floating- point intervals containing the exact result can be obtained.
Algorithms for arbitrary precision floating point arithmetic
  • Douglas M. Priest
  • Computer Science
    [1991] Proceedings 10th IEEE Symposium on Computer Arithmetic
  • 1991
The author presents techniques for performing computations of very high accuracy using only straightforward floating-point arithmetic operations of limited precision, and an algorithm is presented which computes the intersection of a line and a line segment.
Software for Doubled-Precision Floating-Point Computations
A modffication of Dekker's method is presented and is proved to be valid in most existing arithmetics, while the original method is valid only in a qmte restricted class of anthmetms.
The Accuracy of Floating Point Summation
  • N. Higham
  • Computer Science
    SIAM J. Sci. Comput.
  • 1993
Five summation methods and their variations are analyzed here and no one method is uniformly more accurate than the others, but some guidelines are given on the choice of method in particular cases.
A floating-point technique for extending the available precision
A technique is described for expressing multilength floating-point arithmetic in terms of singlelength floating point arithmetic, i.e. the arithmetic for an available (say: single or double
On properties of floating point arithmetics: numerical stability and the cost of accurate computations
It is concluded that programmers and theorists alike must be willing to adopt a more sophisticated view of floating point arithmetic, even if only to consider that more accurate and reliable computations than those presently in common use might be possible based on stronger hypotheses than are customarily assumed.
Representable correcting terms for possibly underflowing floating point operations
  • S. Boldo, M. Daumas
  • Computer Science
    Proceedings 2003 16th IEEE Symposium on Computer Arithmetic
  • 2003
The proposed conditions guarantee that the correcting term is exact when the result is a number, and have validated the proofs against Coq automatic proof checker.