Evaluating Elementary Functions with Guaranteed Precision

  • Authors:
  • M. Yu. Loenko

  • Affiliations:
  • Ershov Institute of Information Systems, Siberian Division, Russian Academy of Sciences, pr. Akademika Lavrent'eva 6, Novosibirsk, 630090 Russia ml@nbsp.nsk.su

  • Venue:
  • Programming and Computing Software
  • Year:
  • 2001

Quantified Score

Hi-index 0.00

Visualization

Abstract

Because of changes in the computer markets, the problem of efficient evaluation of elementary functions (which seemed to be already solved) becomes important again. In this paper, after a brief review of current approaches to this problem, algorithms for finding guaranteed bounds for values of elementary functions are suggested. The evaluation time is reduced through increasing the amount of memory used.