• Corpus ID: 1382563

Applications of fast and accurate summation in computational geometry

  title={Applications of fast and accurate summation in computational geometry},
  author={Stef Graillat},
In this paper, we present a recent algorithm given by Ogita, Rump and Oishi [39] for accurately computing the sum of n floating point numbers. They also give a computational error bound for the computed result. We apply this algorithm in computing determinant and more particularly in computing robust geometric predicates used in computational geometry. We improve existing results that use either a multiprecision libraries or extended large accumulators. 
On the Design and Performance of Reliable Geometric Predicates using Error-free Transformations and Exact Sign of Sum Algorithms
In a case study, several implementations of planar orientation test and incircle tests that make use of utilities for exact computation of the sign of a sum of floating-point numbers are compared.
Ultimately Fast Accurate Summation
  • S. Rump
  • Computer Science, Mathematics
    SIAM J. Sci. Comput.
  • 2009
Two new algorithms to compute a faithful rounding of the sum of floating-point numbers and the other for a result “as if” computed in $K$-fold precision, which are the fastest known in terms of flops.
Floating-point filters towards floating-point exceptions
This talk is concerned with robustness problems in computational geometry. Floating-point numbers and floating-point arithmetic are widely used on recent computational environments due to their high
Compensated Algorithm for Evaluating the Derivative of Bézier Tensor Product Surface
We present a compensated algorithm to evaluate the first derivative of B'ezier tensor product surface in floating arithmetic. The algorithm based on error-free transformation is fast in terms of
An efficient software implementation of correctly rounded operations extending FMA: A + b + c and a × b + c × d
  • C. Lauter
  • Computer Science
    2017 51st Asilomar Conference on Signals, Systems, and Computers
  • 2017
This work proposes an efficient software implementation of two additional operations of the Fused-Multiply-Twice-And-Add operation, guaranteeing correct rounding in all rounding modes and IEEE754 compliant signaling.
Fiabilité des algorithmes numériques : pseudosolutions structurées et précisions
Les travaux presentes dans cette these portent sur la stabilite et la precision de certains algorithmes numeriques. Les contributions de cette these se situent a quatre niveaux : 1) Amelioration de
Computing the exact sign of sums of products with floating point arithmetic
The algorithm is efficient and uses only of floating point arithmetic, which is much faster than exact arithmetic, and it is proved that the algorithm is correct and the efficient and tested C++ code for it is correct.


A Distillation Algorithm for Floating-Point Summation
  • I. Anderson
  • Mathematics, Computer Science
    SIAM J. Sci. Comput.
  • 1999
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.
Division of Floating Point Expansions with an Application to the Computation of a Determinant
This work presents a new algorithm that allows to extend the set of geometric operators with Bareiss' determinant on a matrix of size between 3 and 10 and is compared with GMP, a very common multi-precision package.
Fast and Accurate Floating Point Summation with Application to Computational Geometry
The results show that in the absence of massive cancellation (the most common case) the cost of guaranteed accuracy is about 30–40% more than the straightforward summation, and the accurate summation algorithm improves the existing algorithm by a factor of two on a nearly coplanar set of points.
Algorithms for arbitrary precision floating point arithmetic
  • Douglas M. Priest
  • Mathematics, 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.
Analysis of some known methods of improving the accuracy of floating-point sums
Some well-known methods for calculating the round-off error in floating-point addition are analyzed in this paper. The methods have been introduced by Møller [16], Kahan [11] and Knuth [12]. The
Accurate Sum and Dot Product
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
Adaptive Precision Floating-Point Arithmetic and Fast Robust Geometric Predicates
  • J. Shewchuk
  • Mathematics, Computer Science
    Discret. Comput. Geom.
  • 1997
This article offers fast software-level algorithms for exact addition and multiplication of arbitrary precision floating-point values and proposes a technique for adaptive precision arithmetic that can often speed these algorithms when they are used to perform multiprecision calculations that do not always require exact arithmetic, but must satisfy some error bound.
The Accuracy of Floating Point Summation
  • N. Higham
  • Mathematics, 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.
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.
Analysis and applications of Priest's distillation
Correcting an infinite loop in Douglas M. Priest's renormalization algorithm, the theory proved here supports streamlined algorithms to resolve the tablemaker's dilemma for the floating-point