61 citations · 445 across the 59 of their papers we have counts for
4 papers · 1 filter
A bound for the error term in the Brent-McMillan algorithm
Richard P. Brent, Fredrik Johansson
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 rigor…
Note on a double binomial sum relevant to the Hadamard maximal determinant problem
Richard P. Brent, Judy-anne H. Osborn
We prove a double binomial sum identity which differs from most binomial sum identities in that the summands involve the absolute value function. The identity is of interest becaus…
Further analysis of the binary Euclidean algorithm
Richard P. Brent
The binary Euclidean algorithm is a variant of the classical Euclidean algorithm. It avoids multiplications and divisions, except by powers of two, so is potentially faster than th…
Old and new algorithms for pi
Richard P. Brent
This is a letter to the editor concerning Semjon Adlaj's article "An eloquent formula for the perimeter of an ellipse", AMS Notices 59, 8 (2012), 1094-1099.