RISC RISC Research Institute for Symbolic Computation  
  • @techreport{RISC4882,
    author = {Richard P. Brent and Fredrik Johansson},
    title = {{A bound for the error term in the Brent-McMillan algorithm}},
    language = {english},
    abstract = {The Brent-McMillan algorithm B3 (1980), when implemented with binary splitting, is the fastest known algorithm for high-precision computation of Euler's constant. However, no rigorous error bound for the algorithm has ever been published. We provide such a bound and justify the empirical observations of Brent and McMillan. We also give bounds on the error in the asymptotic expansions of functions related to modified Bessel functions.},
    number = {1312.0039},
    year = {2013},
    institution = {arxiv},
    length = {10},
    url = {http://arxiv.org/abs/1312.0039}