Exact computation of the sign of a finite sum

DOI10.1016/S0096-3003(98)00010-1zbMath0936.65005OpenAlexW2032762786MaRDI QIDQ1294292

H. Ratschek, Jon G. Rokne

Publication date: 3 May 2000

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0096-3003(98)00010-1

zbMATH Keywords

exact sumsgeometric computationsrounding error free algorithmssign of a finite sum

Mathematics Subject Classification ID

Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Software, source code, etc. for problems pertaining to geometry (51-04) Numerical summation of series (65B10)

Related Items (3)

EXACT AND OPTIMAL CONVEX HULLS IN 2D ⋮ AN EXPLICIT SOLUTION FOR COMPUTING THE VERTICES OF THE EUCLIDEAN d-DIMENSIONAL VORONOI DIAGRAM OF SPHERES IN A FLOATING-POINT ARITHMETIC ⋮ Line segment intersection testing

Uses Software

• BIGNUM

Cites Work

• Unnamed Item
• Unnamed Item
• An efficient and numerically correct algorithm for the 2D convex hull problem
• Axioms and hulls
• Numerical stability of a convex hull algorithm for simple polygons
• Computing convex hull in a floating point arithmetic
• The Accuracy of Floating Point Summation
• On Floating-Point Summation

This page was built for publication: Exact computation of the sign of a finite sum