Hacker News Reader

In short, how does u-bit solve multiplication problem when two u-intervals produce >1 interval? Like (1.01+ * 1.01+) = 1.02+ .. 1.04+, in 3-decimal precision

View on HN

In such cases, you get a ubound that contains the exact value. When the inputs are exact, the result is exact too.

Here is a sample implementation in Julia:

https://github.com/JuliaComputing/Unums.jl

Reply on news.ycombinator.com