3 ms·
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
by wruza 9y ago
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
- zmonx 9y agoIn 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 https://github.com/JuliaComputing/Unums.jl