منابع مشابه
Twofold exp and log
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 times faster than expq() by GNU quadm...
متن کاملDistributed Contingency Logic and Security
In information security, ignorance is not bliss. It is always stated that hiding the protocols (let the other be ignorant about it) does not increase the security of organizations. However, there are cases that ignorance creates protocols. In this paper, we propose distributed contingency logic, a proper extension of contingency (ignorance) logic. Intuitively, a formula is distributed contingen...
متن کاملTwofold fast arithmetic
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. C++ test code for Intel AVX available vi...
متن کاملTwofold fast summation
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 algorithm, that provides twofold sum of ∑...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Simmel Studies
سال: 2018
ISSN: 2512-1022,1616-2552
DOI: 10.7202/1051007ar