On the Stieltjes Approximation Error to Logarithmic Integral
Jonatan Gomez

TL;DR
This paper derives explicit, uniform bounds for the approximation error of the logarithmic integral using Stieltjes asymptotics, providing the first global bounds and supporting the conjecture of its asymptotic behavior.
Contribution
It introduces the first fully explicit global bounds for the Stieltjes approximation error to the logarithmic integral, advancing understanding of its asymptotic behavior.
Findings
Established explicit bounds for the approximation error for all x ≥ e.
Provided numerical constants for bounds beyond x > e^{1000}.
Supported the conjecture that the error behaves like (1/3)√(2π/ln x) asymptotically.
Abstract
We study the approximation error arising from the classical Stieltjes asymptotic expansion for the logarithmic integral. Our analysis is based on the discrete values and their increments for which we derive new unconditional analytic bounds. Using precise integral representations for each increment , together with sharp upper and lower estimates for the associated kernel integrals, we obtain computable and uniform bounds for for all , and hence for for all . We prove the following unconditional bounds: $$\begin{array}{l} \displaystyle \frac{1}{3}\sqrt{\frac{2\pi}{\ln(x)}} + o\left(\frac{1}{\sqrt{\ln(x)}}\right) \le \varepsilon(x) \le \frac{1}{3}\sqrt{\frac{2\pi}{\ln(x)}} +…
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.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMatrix Theory and Algorithms · Mathematical functions and polynomials · Spectral Theory in Mathematical Physics
