Papers › Not-Quite Transcendental Functions and their Applications
Not-Quite Transcendental Functions and their Applications
Jonah M. Miller, Joshua C. Dolence, Daniel Holladay
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
Transcendental functions, such as exponentials and logarithms, appear in a broad array of computational domains: from simulations in curvilinear coordinates, to interpolation, to machine learning. Unfortunately they are typically expensive to compute accurately. In this note, we argue that in many cases, the properties of the function matters more than the exact functional form. We present new functions, which are not transcendental, that can be used as drop-in replacements for the exponential and logarithm in many settings for a significant performance boost. We show that for certain applications using these functions result in no drop in the accuracy at all, as they are perfectly accurate representations of themselves, if not the original transcendental functions.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections