Fast and accurate floating point summation with application to computational geometry
From MaRDI portal
Publication:2387749
DOI10.1023/B:NUMA.0000049458.99541.38zbMath1074.65054OpenAlexW2075208936MaRDI QIDQ2387749
Publication date: 5 September 2005
Published in: Numerical Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/b:numa.0000049458.99541.38
numerical examplescomputational geometryrounding error analysisrobust geometric predicatefloating point summationsummation algorithm
Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Roundoff error (65G50)
Related Items (7)
Schur aggregation for linear systems and determinants ⋮ Accurate floating-point summation: a new approach ⋮ Adaptive and efficient algorithm for 2D orientation problem ⋮ Floating-point arithmetic ⋮ Additive preconditioning and aggregation in matrix computations ⋮ A fast parallel high-precision summation algorithm based on AccSumK ⋮ A note on Dekker's FastTwoSum algorithm
Uses Software
This page was built for publication: Fast and accurate floating point summation with application to computational geometry