Expand description
Error-free transformations: the arithmetic exact predicates are built from.
Each operation here returns the rounded result AND the exact rounding error, so no information is lost. Chaining them lets a determinant be evaluated exactly in f64 arithmetic, which is what makes a sign certifiable rather than merely plausible.
These are the classical error-free transformations (Dekker, Knuth, Shewchuk). They are exact for all finite inputs with no overflow.
Functionsยง
- two_
diff - Difference of
aandb, plus the exact rounding error. - two_
product - Product of
aandb, plus the exact rounding error. - two_sum
- Sum of
aandb, plus the exact rounding error.