Fast Computation of Bernoulli, Tangent and Secant Numbers
From MaRDI portal
Publication:5746436
DOI10.1007/978-1-4614-7621-4_8zbMath1310.11120arXiv1108.0286OpenAlexW1819331517MaRDI QIDQ5746436
Richard P. Brent, David I. Harvey
Publication date: 18 February 2014
Published in: Springer Proceedings in Mathematics & Statistics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1108.0286
Exact enumeration problems, generating functions (05A15) Bernoulli and Euler numbers and polynomials (11B68) Number-theoretic algorithms; complexity (11Y16) Calculation of integer sequences (11Y55)
Related Items (9)
Several closed expressions for the Euler numbers ⋮ Enumeration of binary trees compatible with a perfect phylogeny ⋮ A subquadratic algorithm for computing the $n$-th Bernoulli number ⋮ Rounding error analysis of linear recurrences using generating series ⋮ CORRELATIONS BETWEEN ELEMENTS AND SEQUENCES IN A NUMERICAL PRISM ⋮ Lower triangular Toeplitz-Ramanujan systems whose solution yields the Bernoulli numbers ⋮ Computing Hypergeometric Functions Rigorously ⋮ Volume computation for sparse Boolean quadric relaxations ⋮ Rigorous high-precision computation of the Hurwitz zeta function and its derivatives
Uses Software
This page was built for publication: Fast Computation of Bernoulli, Tangent and Secant Numbers