- Home
- Best Scientists - Mathematics
- Richard P. Brent

Discipline name
D-index
D-index (Discipline H-index) only includes papers and citation values for an examined
discipline in contrast to General H-index which accounts for publications across all
disciplines.
Citations
Publications
World Ranking
National Ranking

Computer Science
D-index
40
Citations
13,149
182
World Ranking
4432
National Ranking
115

Mathematics
D-index
42
Citations
9,269
164
World Ranking
884
National Ranking
24

2009 - SIAM Fellow For contributions to algorithms, numerical analysis, and computational number theory.

1995 - ACM Fellow For research in the areas of parallel algorithms, computational number theory, multiple-precision arithmetic, computational complexity and numerical analysis, and leadership in Australian Computer Science.

1991 - IEEE Fellow For contributions to the development and analysis of parallel algorithms.

- Algorithm
- Algebra
- Complex number

Richard P. Brent mostly deals with Discrete mathematics, Algorithm, Combinatorics, Arithmetic and Multiplication. Richard P. Brent interconnects Matrix, Simple, Fraction, Elementary function and Formal power series in the investigation of issues within Discrete mathematics. He combines subjects such as Factorization, Linear interpolation, Scaling and Minification with his study of Algorithm.

His Linear interpolation research integrates issues from Spline interpolation and Bilinear interpolation. His biological study spans a wide range of topics, including Singular value, Eigenvalues and eigenvectors, Eigendecomposition of a matrix and Symmetric matrix. The concepts of his Multiplication study are interwoven with issues in Time complexity, Algebraic operation and Nesting.

- Algorithms for Minimization Without Derivatives (2389 citations)
- The Parallel Evaluation of General Arithmetic Expressions (704 citations)
- Table errata: Algorithms for minimization without derivatives (Prentice-Hall, Englewood Cliffs, N. J., 1973) (616 citations)

Richard P. Brent mainly investigates Combinatorics, Discrete mathematics, Algorithm, Parallel computing and Computation. His Combinatorics research is multidisciplinary, incorporating perspectives in Matrix, Hadamard transform, Hadamard matrix, Upper and lower bounds and Order. His studies in Discrete mathematics integrate themes in fields like Binary number and Degree.

His Algorithm study combines topics in areas such as Factorization, Toeplitz matrix and Constant. His Toeplitz matrix research is multidisciplinary, incorporating elements of Linear system and Numerical stability. His Computation study typically links adjacent topics like Theoretical computer science.

- Combinatorics (28.44%)
- Discrete mathematics (25.62%)
- Algorithm (20.94%)

- Combinatorics (28.44%)
- Discrete mathematics (25.62%)
- Hadamard transform (3.75%)

Richard P. Brent focuses on Combinatorics, Discrete mathematics, Hadamard transform, Hadamard matrix and Upper and lower bounds. His work carried out in the field of Combinatorics brings together such families of science as Matrix, Hadamard's maximal determinant problem, Order and Binary number. His work in Matrix addresses issues such as Parallel algorithm, which are connected to fields such as Computation.

He has included themes like Order, Tangent and Binomial in his Discrete mathematics study. His Hadamard transform research focuses on subjects like Identity, which are linked to Congruence and Mathematical proof. Richard P. Brent works mostly in the field of Spectrum, limiting it down to topics relating to Extension and, in certain cases, Algorithm, as a part of the same area of interest.

- The Great Trinomial Hunt (14 citations)
- High-performance pseudo-random number generation on graphics processing units (13 citations)
- Note on best possible bounds for determinants of matrices close to the identity matrix (12 citations)

- Algorithm
- Algebra
- Complex number

The scientist’s investigation covers issues in Combinatorics, Discrete mathematics, Hadamard transform, Upper and lower bounds and Hadamard matrix. His research integrates issues of Connection, Matrix, Hadamard's maximal determinant problem, Binomial and Riemann hypothesis in his study of Combinatorics. His work in the fields of Identity matrix, Involutory matrix and Square matrix overlaps with other areas such as Integer matrix.

His research in the fields of Bernoulli number overlaps with other disciplines such as Root. Within one scientific family, Richard P. Brent focuses on topics pertaining to Order under Hadamard transform, and may sometimes address concerns connected to Square and Gramian matrix. As part of one scientific family, Richard P. Brent deals mainly with the area of Hadamard matrix, narrowing it down to issues related to the Conjecture, and often Interval, Block matrix, Hadamard's inequality, Binary number and Congruence.

This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.

Algorithms for Minimization Without Derivatives

Richard P Brent.

**(1972)**

3817 Citations

The Parallel Evaluation of General Arithmetic Expressions

Richard P. Brent.

Journal of the ACM **(1974)**

1091 Citations

Table errata: Algorithms for minimization without derivatives (Prentice-Hall, Englewood Cliffs, N. J., 1973)

Richard P. Brent.

Mathematics of Computation **(1975)**

970 Citations

Fast solution of toeplitz systems of equations and computation of Padé approximants

Richard P Brent;Fred G Gustavson;David Y.Y Yun.

Journal of Algorithms **(1980)**

533 Citations

An algorithm with guaranteed convergence for finding a zero of a function

Richard P. Brent.

The Computer Journal **(1971)**

515 Citations

Fast Multiple-Precision Evaluation of Elementary Functions

Richard P. Brent.

Journal of the ACM **(1976)**

498 Citations

The Solution of Singular-Value and Symmetric Eigenvalue Problems on Multiprocessor Arrays

Richard P. Brent;Franklin T. Luk.

Siam Journal on Scientific and Statistical Computing **(1985)**

445 Citations

Modern Computer Arithmetic

Richard Brent;Paul Zimmermann.

**(2010)**

350 Citations

Fast Algorithms for Manipulating Formal Power Series

R. P. Brent;H. T. Kung.

Journal of the ACM **(1978)**

340 Citations

An improved Monte Carlo factorization algorithm

Richard P. Brent.

Bit Numerical Mathematics **(1980)**

331 Citations

If you think any of the details on this page are incorrect, let us know.

Contact us

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Harvard University

University of Sydney

City University of Hong Kong

Australian National University

University of Melbourne

University of Tennessee at Knoxville

Hosei University

University of Maryland, College Park

Ames Research Center

Umeå University

French Institute for Research in Computer Science and Automation - INRIA

Publications: 15

Something went wrong. Please try again later.