Richard Brent (scientist)
From Wikipedia, the free encyclopedia
 |
This article or section needs sources or references that appear in reliable, third-party publications. Primary sources and sources affiliated with the subject of the article are generally not sufficient for a Wikipedia article. Please include more appropriate citations from reliable sources, or discuss the issue on the talk page. This article has been tagged since November 2007. |
Richard Peirce Brent is an Australian mathematician and computer scientist, born in 1946. As of October 2005 he is an ARC Federation Fellow at the Australian National University. His research interests include number theory (in particular factorization), random number generators, computer architecture, and analysis of algorithms.
In 1973, he published a root-finding algorithm (an algorithm for solving equations numerically) which is now known as Brent's method.[1]
In 1975 he and Eugene Salamin independently discovered the Brent-Salamin algorithm, used in high-precision calculation of π. At the same time, he showed that all the elementary functions (such as log(x), sin(x) etc) can be evaluated to high precision in the same time as π (apart from a small constant factor) using the arithmetic-geometric mean of Carl Friedrich Gauss.
In 1979 he showed that the first 75 million complex zeros of the Riemann zeta function lie on the critical line, providing some experimental evidence for the Riemann Hypothesis.
In 1980 he and Nobel laureate Edwin McMillan found a new algorithm for high-precision computation of the Euler-Mascheroni constant γ using Bessel functions, and showed that γ can not have a simple rational form p/q (where p and q are integers) unless q is extremely large (greater than 1015000).
In 1980 he and John Pollard factored the eighth Fermat number using a variant of the Pollard rho algorithm. He later factored the tenth and eleventh Fermat numbers using Lenstra's elliptic curve factorization algorithm.
In 2002 he (with Samuli Larvala and Paul Zimmermann) discovered a very large primitive trinomial [1]:
- x6972593 + x3037958 + 1.
The degree 6972593 is the exponent of a Mersenne prime.
He is descended from Hannah Ayscough, mother of Isaac Newton.
He is currently a Chief Investigator of the ARC Centre of Excellence for Mathematics and Statistics of Complex Systems. He is a Fellow of the Association for Computing Machinery, the IEEE and the Australian Academy of Science.
[edit] References
- ^ Brent (1973). Algorithms for Minimization without Derivatives. Prentice-Hall, Englewood Cliffs, NJ.
