DeepAI AI Chat
Log In Sign Up

Computing elementary functions using multi-prime argument reduction

by   Fredrik Johansson, et al.

We describe an algorithm for arbitrary-precision computation of the elementary functions (exp, log, sin, atan, etc.) which, after a cheap precomputation, gives roughly a factor-two speedup over previous state-of-the-art algorithms at precision from a few thousand bits up to millions of bits. Following an idea of Schönhage, we perform argument reduction using Diophantine combinations of logarithms of primes; our contribution is to use a large set of primes instead of a single pair, aided by a fast algorithm to solve the associated integer relation problem. We also list new, optimized Machin-like formulas for the necessary logarithm and arctangent precomputations.


page 1

page 2

page 3

page 4


Fast evaluation of some p-adic transcendental functions

We design algorithms for computing values of many p-adic elementary and ...

Formally Verified Argument Reduction with a Fused-Multiply-Add

Cody & Waite argument reduction technique works perfectly for reasonably...

Putting Fürer Algorithm into Practice with the BPAS Library

Fast algorithms for integer and polynomial multiplication play an import...

A short note on Goppa codes over Elementary Abelian p-Extensions of F_p^s(x)

In this note, we investigate Goppa codes which are constructed by means ...

Implementation of high-precision computation capabilities into the open-source dynamic simulation framework YADE

This paper deals with the implementation of arbitrary precision calculat...

A note on time hierarchies for reasonable semantic classes without advice

We show time hierarchies for reasonable semantic classes without advice ...

Numerical methods and arbitrary-precision computation of the Lerch transcendent

We examine the use of the Euler-Maclaurin formula and new derived unifor...