We describe a new implementation of the elementary transcendental functions exp, sin, cos, log and atan for variable precision up to approximately 4096 bits. Compared to the MPFR library, we achieve a maximum speedup ranging from a factor 3 for cos to 30 for atan. Our implementation uses table-based argument reduction together with rectangular splitting to evaluate Taylor series. We collect denominators to reduce the number of divisions in the Taylor series, and avoid overhead by doing all multiprecision arithmetic using the mpn layer of the GMP library. Our implementation provides rigorous error bounds.Algorithmic Number Theory in Computer Scienc
A new algorithm for computing the complex logarithm and exponential functions is proposed. This algo...
Abstract: A new range reduction algorithm, called Modular Range Reduction (MRR), brie y introduced b...
Let M(t) denote the time required to multiply two t-digit numbers using base b arithmetic. Meth...
International audienceWe describe a new implementation of the elementary transcendental functions ex...
We describe an algorithm for arbitrary-precision computation of the elementary functions (exp, log, ...
This textbook presents the concepts and tools necessary to understand, build, and implement algorith...
Certain methods of realizing numeric functions, such as sin(x) or x , in hardware involve a Taylor S...
We show the architecture and design of a numeric function generator that realizes, at high speed, ar...
With computers, it is possible to evaluate some numerical functions such as f = exp, sin, arccos, et...
The IA-64 architecture provides new opportunities and challenges for implementing an improved set of...
Abstract. Some methods being used to speed up floating-point computation in Maple are described. Spe...
(eng) This article shows that IEEE-754 double-precision correct rounding of the most common elementa...
We propose approximating transcendental math functions with polynomial Taylor series and Remez algor...
AbstractThis paper is a continuation of a study of numerical software for evaluating elementary func...
In several cases, the input argument of an elementary function evaluation is given bit-serially, mos...
A new algorithm for computing the complex logarithm and exponential functions is proposed. This algo...
Abstract: A new range reduction algorithm, called Modular Range Reduction (MRR), brie y introduced b...
Let M(t) denote the time required to multiply two t-digit numbers using base b arithmetic. Meth...
International audienceWe describe a new implementation of the elementary transcendental functions ex...
We describe an algorithm for arbitrary-precision computation of the elementary functions (exp, log, ...
This textbook presents the concepts and tools necessary to understand, build, and implement algorith...
Certain methods of realizing numeric functions, such as sin(x) or x , in hardware involve a Taylor S...
We show the architecture and design of a numeric function generator that realizes, at high speed, ar...
With computers, it is possible to evaluate some numerical functions such as f = exp, sin, arccos, et...
The IA-64 architecture provides new opportunities and challenges for implementing an improved set of...
Abstract. Some methods being used to speed up floating-point computation in Maple are described. Spe...
(eng) This article shows that IEEE-754 double-precision correct rounding of the most common elementa...
We propose approximating transcendental math functions with polynomial Taylor series and Remez algor...
AbstractThis paper is a continuation of a study of numerical software for evaluating elementary func...
In several cases, the input argument of an elementary function evaluation is given bit-serially, mos...
A new algorithm for computing the complex logarithm and exponential functions is proposed. This algo...
Abstract: A new range reduction algorithm, called Modular Range Reduction (MRR), brie y introduced b...
Let M(t) denote the time required to multiply two t-digit numbers using base b arithmetic. Meth...