Several error-free transformations from the scientific literature
0 Stars
Updated Last
9 Years Ago
Started In
January 2015


Build Status Coverage Status

Rounding errors are a common problem in floating point arithmetic. For a pair of floating point numbers a, b, an error-free transformation (EFT) is an operation that maps (a, b) into (x, y), where a โ—‹ b = x + y and x = fl(a โ—‹ b) with โ—‹ being either addition, subtraction or multiplication. Standard EFTs are the TwoSum algorithm by Knuth (implemented as err_add) and the TwoProd algorithm by Dekker (implemented as err_mul).

This package implements several EFTs from the scientific literature.

Current status

This project is still very much a work in progress. It requires a recent build of Julia 0.4 to work.