
TL;DR
This paper introduces twofold arithmetic algorithms and code for standard exponential and logarithm functions in C/C++, achieving nearly double precision and significantly faster performance for accuracy assessment.
Contribution
It presents novel twofold variants of exp, log, expm1, and log1p functions, with algorithms and experimental implementation for improved precision and performance.
Findings
Twofold functions are nearly 2x more precise than standard functions.
Twofold texp() over double is approximately 10x faster than GNU quadmath's expq().
The approach enables on-the-fly accuracy assessment.
Abstract
This article is about twofold arithmetic. Here I introduce algorithms and experimental code for twofold variant of C/C++ standard functions exp() and log(), and expm1() and log1p(). Twofold function 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 quadmath.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsNumerical Methods and Algorithms · Polynomial and algebraic computation · Cryptography and Residue Arithmetic
