# Multiple-precision zero-finding methods and the complexity of elementary function evaluation

@article{Brent2010MultipleprecisionZM, title={Multiple-precision zero-finding methods and the complexity of elementary function evaluation}, author={Richard P. Brent}, journal={ArXiv}, year={2010}, volume={abs/1004.3412} }

## Tables from this paper

## 85 Citations

On the Sign of a Trigonometric Expression

- Computer Science, MathematicsISSAC
- 2015

We propose a set of simple and fast algorithms for evaluating and using trigonometric expressions in the form F=Σkd=0fkΕZd‹ n, for a fixed nin>0:ΕZ > 0: computing the sign of such an expression,…

Fast evaluation of modular functions using Newton iterations and the AGM

- Computer Science, MathematicsMath. Comput.
- 2011

We present an asymptotically fast algorithm for the numerical evaluation of modular functions such as the elliptic modular function j. Our algorithm makes use of the natural connection between the…

Arbitrary-precision computation of the gamma function

- Computer ScienceArXiv
- 2021

The best methods available for computing the gamma function Γ(z) in arbitrary-precision arithmetic with rigorous error bounds are discussed and some new formulas, estimates, bounds and algorithmic improvements are presented.

An alternative to the Euler--Maclaurin formula: Approximating sums by integrals only

- Mathematics
- 2015

The Euler--Maclaurin (EM) summation formula is used in many theoretical studies and numerical calculations. It approximates the sum $\sum_{k=0}^{n-1} f(k)$ of values of a function $f$ by a linear…

New higher-order methods for the simultaneous inclusion of polynomial zeros

- MathematicsNumerical Algorithms
- 2011

Higher-order methods for the simultaneous inclusion of complex zeros of algebraic polynomials are presented in parallel and serial versions and it is proved that the order of convergence of the proposed methods is at least six.

Modern Computer Arithmetic

- Computer Science
- 2010

Modern Computer Arithmetic focuses on arbitrary-precision algorithms for efficiently performing arithmetic operations such as addition, multiplication and division, and their connections to topics…

A note on the fast power series' exponential

- Mathematics, Computer ScienceArXiv
- 2012

It is shown that the exponential of a complex power series up to order n can be implemented via (23/12+o(1))M(n) binary arithmetic operations over complex field, where M(n) stands for the (smoothed)…

A Simple Near-Linear Pseudopolynomial Time Randomized Algorithm for Subset Sum

- Computer Science, Mathematics
- 2018

A simple and elegant randomized algorithm for Subset Sum in Õ(n + t) time that actually solves its counting version modulo prime p > t, by manipulating generating functions using FFT.

The complexity of multiple-precision arithmetic

- Computer ScienceArXiv
- 2010

Upper and lower bounds on the number of single-precision operations required to perform various multiple-Precision operations are given, and some interesting consequences concerning the relative efficiencies of methods for solving nonlinear equations using variable-length multiple- Precision arithmetic are deduced.

The Borwein Brothers, Pi and the AGM

- Computer Science, Mathematics
- 2017

It is shown that an iteration of the Borwein-Borwein quartic algorithm is equivalent to two iterations of the Gauss–Legendre quadratic algorithm for \(\pi), in the sense that they produce exactly the same sequence of approximations to \(\pi \) if performed using exact arithmetic.

## References

SHOWING 1-10 OF 32 REFERENCES

The complexity of multiple-precision arithmetic

- Computer ScienceArXiv
- 2010

Upper and lower bounds on the number of single-precision operations required to perform various multiple-Precision operations are given, and some interesting consequences concerning the relative efficiencies of methods for solving nonlinear equations using variable-length multiple- Precision arithmetic are deduced.

Fast Multiple-Precision Evaluation of Elementary Functions

- Physics, MathematicsJACM
- 1976

It is shown that ƒ(x) can be evaluated, with relative error, in the Schönhage-Strassen bound on M(n), the number of single-precision operations required to multiply n-bit integers.

On the Complexity of Composition and Generalized Composition of Power Series

- Mathematics, Computer ScienceSIAM J. Comput.
- 1980

It is shown that the factor $\log _2 q$ can be eliminated in the computation of the first n terms of $(F(x)^q) $ by a change of representation, using the logarithm and exponential functions.

O((n log n)3/2) ALGORITHMS FOR COMPOSITION AND REVERSION OF POWER SERIES

- Mathematics, Computer Science
- 1976

Computation of π Using Arithmetic-Geometric Mean

- Mathematics
- 1976

A new formula for π is derived. It is a direct consequence of Gauss’ arithmetic-geometric mean, the traditional method for calculating elliptic integrals, and of Legendre’s relation for elliptic…

Schnelle Multiplikation großer Zahlen

- Computer ScienceComputing
- 2005

ZusammenfassungEs wird ein Algorithmus zur Berechnung des Produktes von zweiN-stelligen Dualzahlen angegeben. Zwei Arten der Realisierung werden betrachtet: Turingmaschinen mit mehreren Bändern und…

The Art of Computer Programming

- Engineering, Physics
- 1968

The arrangement of this invention provides a strong vibration free hold-down mechanism while avoiding a large pressure drop to the flow of coolant fluid.

Calculation of π to 100,000 Decimals

- Physics
- 1962

The following comparison of the previous calculations of π performed on electronic computers shows the rapid increase in computational speeds which has taken place.

The Art in Computer Programming

- Art
- 2001

Here the authors haven’t even started the project yet, and already they’re forced to answer many questions: what will this thing be named, what directory will it be in, what type of module is it, how should it be compiled, and so on.