Evgeny Latkin

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Learn More
Abstract: Here I propose C and C++ interfaces and experimental implementation for twofolds arithmetic I introduce in [1] for tracking floating-point inaccuracy. Testing shows, plain C enables high-performance computing with twofolds. C++ interface enables coding as easily as ordinary floating-point numbers. My goal is convincing you to try twofolds; I think(More)
Debugging accumulation of floating-point errors is hard; ideally, computer should track it automatically. Here we consider twofold approximation of exact real with value + error pair of floating-point numbers. Normally, value + error sum is more accurate than value alone, so error can estimate deviation between value and its exact target. Fast summation(More)
Can we assure math computations by automatic verifying floating-point accuracy? We define fast arithmetic (based on Dekker [1]) over twofold approximations z ≈ z0 + z1, such that z0 is standard result and z1 assesses inaccuracy ∆z0 = z − z0. We propose on-fly tracking z1, detecting if ∆z0 appears too high. We believe permanent tracking is worth its cost.(More)
This article is about twofold arithmetic [1, 2]. Here I introduce algorithms and experimental code for twofold variant of C/C++ standard functions exp() and log(), and expm1() and log1p(). Twofold function y0 + y1 ≈ f(x0 + x1) is nearly 2x-precise so can assess accuracy of standard one. Performance allows assessing on-fly: twofold texp() over double is ~10x(More)
  • 1