#### Filter Results:

- Full text PDF available (183)

#### Publication Year

1970

2018

- This year (3)
- Last 5 years (20)
- Last 10 years (42)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Richard P. Brent, H. T. Kung
- IEEE Transactions on Computers
- 1982

With VLSI architecture, the chip area and design regularity represent a better measure of cost than the conventional gate count. We show that addition of n-bit binary numbers can be performed on aâ€¦ (More)

- Richard P. Brent
- J. ACM
- 1974

It is shown that arithmetic expressions with <italic>n</italic> ≥ 1 variables and constants; operations of addition, multiplication, and division; and any depth of parenthesis nesting can beâ€¦ (More)

- Richard P. Brent, H. T. Kung
- J. ACM
- 1978

3 The classical algorithms require 0(n ) operations to compute the first n terms in the reversion of a power series or the composition of two series 2 and 0(n log n) operations if the fast Fourierâ€¦ (More)

- Richard P. Brent, Fred G. Gustavson, David Y. Y. Yun
- J. Algorithms
- 1980

We present two new algorithms, ADT and MDT, for solving order-n Toeplitz systems of linear equations Tz = b in time O(n log n) and space O(n). The fastest algorithms previously known, such asâ€¦ (More)

- Richard P. Brent
- J. ACM
- 1976

Let ƒ(<italic>x</italic>) be one of the usual elementary functions (exp, log, artan, sin, cosh, etc.), and let <italic>M</italic>(<italic>n</italic>) be the number of single-precision operationsâ€¦ (More)

- Richard P. Brent
- ArXiv
- 1976

We consider methods for finding high-precision approximations to simple zeros of .smooth functions. As an application, we give fast methods for evaluating the elementary functions log(x), exp(x),â€¦ (More)

- Richard P. Brent, H. T. Kung
- IEEE Transactions on Computers
- 1984

The problem of finding a greatest common divisor (GCD) of any two nonzero polynomials is fundamental to algebraic and symbolic computations, as well as to the decoder implementation for a variety ofâ€¦ (More)

We describe a computation which shows that the Riemann zeta function f(s) has exactly 75,000,000 zeros of the form a + it in the region 0 < t < 32,585,736.4; all these zeros are simple and lie on theâ€¦ (More)

- Richard P. Brent
- ACM Trans. Math. Softw.
- 1978

A collection of ANSI Standard Fortran subroutines for performing multiple-precision floatingpoint arithmetic and evaluating elementary and special functions is described. The subroutines are machineâ€¦ (More)

- Richard P. Brent
- Comput. J.
- 1971

An algorithm is presented for finding a zero of a function which changes sign in a given interval. The algorithm combines linear interpolation and inverse quadratic interpolation with bisection.â€¦ (More)