An asymptotic expansion for the error term in the Brent-McMillan algorithm for Euler’s constant

R. B. Paris

doi:10.5539/jmr.v11n3p60

An asymptotic expansion for the error term in the Brent-McMillan algorithm for Euler’s constant

R. B. Paris^*

^*Corresponding author for this work

Research output: Contribution to journal › Article › peer-review

142 Downloads (Pure)

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.

Original language	English
Pages (from-to)	60-66
Number of pages	7
Journal	Journal of Mathematics Research
Volume	11
Issue number	3
Early online date	22 May 2019
DOIs	https://doi.org/10.5539/jmr.v11n3p60
Publication status	Published - 22 May 2019

Access to Document

10.5539/jmr.v11n3p60Licence: CC BY

Paris_AnAsymptoticExpansionForTheErrorTerm_Published_2019Final published version, 87.7 KBLicence: CC BY

Fingerprint Dive into the research topics of 'An asymptotic expansion for the error term in the Brent-McMillan algorithm for Euler’s constant'. Together they form a unique fingerprint.

Cite this

@article{f3f32f3b439944dd81f746eec0e19efc,

title = "An asymptotic expansion for the error term in the Brent-McMillan algorithm for Euler{\textquoteright}s constant",

abstract = "The Brent-McMillan algorithm is the fastest known procedure for the high-precision computation of Euler{\textquoteright}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.",

author = "Paris, {R. B.}",

year = "2019",

month = may,

day = "22",

doi = "10.5539/jmr.v11n3p60",

language = "English",

volume = "11",

pages = "60--66",

journal = "Journal of Mathematics Research",

issn = "1916-9795",

publisher = "Canadian Center of Science and Education",

number = "3",

}

TY - JOUR

T1 - An asymptotic expansion for the error term in the Brent-McMillan algorithm for Euler’s constant

AU - Paris, R. B.

PY - 2019/5/22

Y1 - 2019/5/22

N2 - 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.

AB - 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.

U2 - 10.5539/jmr.v11n3p60

DO - 10.5539/jmr.v11n3p60

M3 - Article

VL - 11

SP - 60

EP - 66

JO - Journal of Mathematics Research

JF - Journal of Mathematics Research

SN - 1916-9795

IS - 3

ER -