An Asymptotic Expansion for the Error Term in the Brent-McMillan Algorithm for Euler’s Constant

R. B. Paris

Journal of Mathematics Research, 2019, vol. 11, issue 3, 60-66

Abstract: The Brent-McMillan algorithm is the fastest known procedure for the high-precision computation of Euler’s constant γ and is based on the modified Bessel functions I_0(2x) and K_0(2x). An error estimate for this algorithm relies on the optimally truncated asymptotic expansion for the product I_0(2x)K_0(2x) when x assumes large positive integer values. An asymptotic expansion for this optimal error term is derived by exploiting the techniques developed in hyperasymptotics, thereby enabling more precise information on the error term than recently obtained bounds and estimates.

Keywords: Euler's constant; Brent-McMillan algorithm; asymptotic expansion; optimal truncation; exponentially improved expansion (search for similar items in EconPapers)
Date: 2019
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.ccsenet.org/journal/index.php/jmr/article/download/0/0/39516/40392 (application/pdf)
http://www.ccsenet.org/journal/index.php/jmr/article/view/0/39516 (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ibn:jmrjnl:v:11:y:2019:i:3:p:60

Access Statistics for this article

More articles in Journal of Mathematics Research from Canadian Center of Science and Education Contact information at EDIRC.
Bibliographic data for series maintained by Canadian Center of Science and Education ().