Accelerated Shift-and-Add algorithms

Nathalie Revol 1 Jean-Claude Yakoubsohn 2
1 ARENAIRE - Computer arithmetic
Inria Grenoble - Rhône-Alpes, LIP - Laboratoire de l'Informatique du Parallélisme
Abstract : 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.
Document type :
Journal articles
Complete list of metadatas

https://hal.inria.fr/inria-00545004
Contributor : Nathalie Revol <>
Submitted on : Thursday, December 9, 2010 - 1:32:24 PM
Last modification on : Monday, April 29, 2019 - 4:35:38 PM

Identifiers

Citation

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

Share

Metrics

Record views

172