# 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}
}
• R. Brent
• Published 1 July 1975
• Mathematics, Computer Science
• ArXiv
On the Sign of a Trigonometric Expression
• Computer Science, Mathematics
ISSAC
• 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
• R. Dupont
• Computer Science, Mathematics
Math. 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
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
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
• Mathematics
Numerical 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
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
• Ce Jin
• 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
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
• R. Brent
• 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.