Papers › An algorithm to approximate the real trilogarithm for a real argument

An algorithm to approximate the real trilogarithm for a real argument

21 Jun 2023arXiv:2308.11619links table onlyarchive 2025-07-28

Alexander Voigt

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.

We present an algorithm to approximate the real trilogarithm for a real argument with IEEE 754-1985 double precision accuracy. The approximation is structured such that it can make use of instruction-level parallelism when executed on appropriate CPUs.

PaperPDFCode

Code

Expander/polylogarithm officialmentioned in papermentioned on GitHub report
expander/polylog.jl officialmentioned in papermentioned on GitHub report
expander/polylog.rs officialmentioned in papermentioned on GitHub report
expander/polylog mentioned on GitHub report

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