A bound for the error term in the Brent-McMillan algorithm

DOI10.1090/S0025-5718-2015-02931-7zbMath1320.33007arXiv1312.0039OpenAlexW3099902031MaRDI QIDQ5264130

Fredrik Johansson, Richard P. Brent

Publication date: 20 July 2015

Published in: Mathematics of Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1312.0039

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Analysis of algorithms (68W40) Bessel and Airy functions, cylinder functions, ({}_0F_1) (33C10) Complexity and performance of numerical algorithms (65Y20) Evaluation of number-theoretic constants (11Y60) Algorithms in computer science (68W99) Error analysis and interval analysis (65G99)

Related Items (3)

A Conjectured Integer Sequence Arising From the Exponential Integral ⋮ Computing Hypergeometric Functions Rigorously ⋮ A HARMONIC SUM OVER NONTRIVIAL ZEROS OF THE RIEMANN ZETA-FUNCTION

Uses Software

• DLMF
• HolonomicFunctions

Cites Work

• Unnamed Item
• Unnamed Item
• Modern Computer Arithmetic
• Some New Algorithms for High-Precision Computation of Euler's Constant

This page was built for publication: A bound for the error term in the Brent-McMillan algorithm