On error representation in exact-decisions number types

07/11/2018
by   Martin Wilhelm, et al.
0

Accuracy-driven computation is a strategy widely used in exact-decisions number types for robust geometric algorithms. This work provides an overview on the usage of error bounds in accuracy-driven computation, compares different approaches on the representation and computation of these error bounds and points out some caveats. The stated claims are supported by experiments.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/09/2018

Restructuring expression dags for efficient parallelization

In the field of robust geometric computation it is often necessary to ma...
research
02/19/2018

Multithreading for the expression-dag-based number type Real_algebraic

Many algorithms, especially in the field of computational geometry, are ...
research
04/03/2019

Exact Lower Bounds for Monochromatic Schur Triples and Generalizations

We derive exact and sharp lower bounds for the number of monochromatic g...
research
04/03/2019

Internal versus external balancing in the evaluation of graph-based number types

Number types for exact computation are usually based on directed acyclic...
research
08/01/2017

Exact Approaches for the Travelling Thief Problem

Many evolutionary and constructive heuristic approaches have been introd...
research
11/30/2017

Nonseparable Gaussian Stochastic Process: A Unified View and Computational Strategy

Gaussian stochastic process (GaSP) has been widely used as a prior over ...
research
10/12/2020

Computation of the Complex Error Function using Modified Trapezoidal Rules

In this paper we propose a method for computing the Faddeeva function w(...

Please sign up or login with your details

Forgot password? Click here to reset