Accelerated Shift-and-Add algorithms - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Reliable Computing Year : 2000

Accelerated Shift-and-Add algorithms

Nathalie Revol


The problem addressed in this paper is the computation of elementary functions (exponential, logarithm, trigonometric functions, hyperbolic functions and their reciprocals) in fixed precision, typically the computer single or double precision. The method proposed here combines Shift-and-Add algorithms and classical methods for the numerical integration of ODEs: it consists in performing the Shift-and-Add iteration until a point close enough to the argument is reached, thus only one step of Euler method or Runge-Kutta method is performed. This speeds up the computation while ensuring the desired accuracy is preserved. Time estimations on various processors are presented which illustrate the advantage of this hybrid method.
No file

Dates and versions

inria-00545004 , version 1 (09-12-2010)



Nathalie Revol, Jean-Claude Yakoubsohn. Accelerated Shift-and-Add algorithms. Reliable Computing, 2000, 6 (2), pp.193-205. ⟨10.1023/A:1009921407000⟩. ⟨inria-00545004⟩
110 View
2 Download



Gmail Facebook X LinkedIn More