International audienceWe 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
With computers, it is possible to evaluate some numerical functions such as f = exp, sin, arccos, et...
This textbook presents the concepts and tools necessary to understand, build, and implement algorith...
International audienceWe describe algorithms used to optimize the GNU MPFR library when the operands...
We describe a new implementation of the elementary transcendental functions exp, sin, cos, log and a...
We describe an algorithm for arbitrary-precision computation of the elementary functions (exp, log, ...
In this paper a slightly modification is proposed to the original Wong and Gotos ATA method for the ...
Let M(t) denote the time required to multiply two t-digit numbers using base b arithmetic. Meth...
This article shows that IEEE-754 double-precision correct rounding of the most common elementary fun...
Range-reduction is a key point for getting accurate elementary function routines. We introduce a new...
AbstractThis paper is a continuation of a study of numerical software for evaluating elementary func...
In this paper, we present new algorithms for the computation of fast Fourier transforms over complex...
This paper presents an implementation of the double precision exponential function. A novel table-ba...
This paper presents a new scheme for the hardware evaluation of functions in fixed-point format, for...
Abstract: A new range reduction algorithm, called Modular Range Reduction (MRR), brie y introduced b...
In many applications of real-number computation we need to evaluate elementary functions such as exp...
With computers, it is possible to evaluate some numerical functions such as f = exp, sin, arccos, et...
This textbook presents the concepts and tools necessary to understand, build, and implement algorith...
International audienceWe describe algorithms used to optimize the GNU MPFR library when the operands...
We describe a new implementation of the elementary transcendental functions exp, sin, cos, log and a...
We describe an algorithm for arbitrary-precision computation of the elementary functions (exp, log, ...
In this paper a slightly modification is proposed to the original Wong and Gotos ATA method for the ...
Let M(t) denote the time required to multiply two t-digit numbers using base b arithmetic. Meth...
This article shows that IEEE-754 double-precision correct rounding of the most common elementary fun...
Range-reduction is a key point for getting accurate elementary function routines. We introduce a new...
AbstractThis paper is a continuation of a study of numerical software for evaluating elementary func...
In this paper, we present new algorithms for the computation of fast Fourier transforms over complex...
This paper presents an implementation of the double precision exponential function. A novel table-ba...
This paper presents a new scheme for the hardware evaluation of functions in fixed-point format, for...
Abstract: A new range reduction algorithm, called Modular Range Reduction (MRR), brie y introduced b...
In many applications of real-number computation we need to evaluate elementary functions such as exp...
With computers, it is possible to evaluate some numerical functions such as f = exp, sin, arccos, et...
This textbook presents the concepts and tools necessary to understand, build, and implement algorith...
International audienceWe describe algorithms used to optimize the GNU MPFR library when the operands...