(eng) In several cases, the input argument of an elementary function evaluation is given bit-serially, most significant bit first. We suggest a solution for performing the first step of the evaluation (namely, the range reduction) \emph{on the fly}: the computation is overlapped with the reception of the input bits. This algorithm can be used for the trigonometric functions $\sin$, $\cos$, $\tan$ as well as for the exponential function
International audienceLinear (order-1) function evaluation schemes, such as bipartite and multiparti...
In this paper we present an algorithm for narrowing the constraint y = e x . The algorithm has be...
One of the main problems of interval computations is to compute the range Y of the given function f(...
Article dans revue scientifique avec comité de lecture.International audienceIn several cases, the i...
In several cases, the input argument of an elementary function evaluation is given bit-serially, mos...
International audienceSoftware evaluation of elementary functions usually requires three steps: a ra...
Abstract: A new range reduction algorithm, called Modular Range Reduction (MRR), brie y introduced b...
Range-reduction is a key point for getting accurate elementary function routines. We introduce a new...
A new range reduction algorithm, called ModularRange Reduction (MRR), briefly introduced by the auth...
(eng) Range reduction is a key point for getting accurate elementary function routines. We introduce...
Sometimes, a function f of n variables can be represented as a com-position of two functions of fewe...
Range reduction is a key point for getting accurate elementary function routines. We introduce a new...
We describe a new implementation of the elementary transcendental functions exp, sin, cos, log and a...
AbstractIn a recent paper by Aberth and Schaefer (1992), it was shown how an implementation of range...
Sometimes, a function f of n variables can be represented as a com-position of two functions of fewe...
International audienceLinear (order-1) function evaluation schemes, such as bipartite and multiparti...
In this paper we present an algorithm for narrowing the constraint y = e x . The algorithm has be...
One of the main problems of interval computations is to compute the range Y of the given function f(...
Article dans revue scientifique avec comité de lecture.International audienceIn several cases, the i...
In several cases, the input argument of an elementary function evaluation is given bit-serially, mos...
International audienceSoftware evaluation of elementary functions usually requires three steps: a ra...
Abstract: A new range reduction algorithm, called Modular Range Reduction (MRR), brie y introduced b...
Range-reduction is a key point for getting accurate elementary function routines. We introduce a new...
A new range reduction algorithm, called ModularRange Reduction (MRR), briefly introduced by the auth...
(eng) Range reduction is a key point for getting accurate elementary function routines. We introduce...
Sometimes, a function f of n variables can be represented as a com-position of two functions of fewe...
Range reduction is a key point for getting accurate elementary function routines. We introduce a new...
We describe a new implementation of the elementary transcendental functions exp, sin, cos, log and a...
AbstractIn a recent paper by Aberth and Schaefer (1992), it was shown how an implementation of range...
Sometimes, a function f of n variables can be represented as a com-position of two functions of fewe...
International audienceLinear (order-1) function evaluation schemes, such as bipartite and multiparti...
In this paper we present an algorithm for narrowing the constraint y = e x . The algorithm has be...
One of the main problems of interval computations is to compute the range Y of the given function f(...