For negative arguments the function is oscillatory and hence absolute error is appropriate. In the positive region the function has essentially exponential behaviour and hence relative error is needed. The absolute error,
, and the relative error
, are related in principle to the relative error in the argument
, by
,
.
In practice, approximate equality is the best that can be expected. When
,
or
is of the order of the machine precision, the errors in the result will be somewhat larger.
For small
, positive or negative, errors are strongly attenuated by the function and hence will effectively be bounded by the machine precision.
For moderate to large negative
, the error is, like the function, oscillatory. However, the amplitude of the absolute error grows like
. Therefore it becomes impossible to calculate the function with any accuracy if
.
For large positive
, the relative error amplification is considerable:
. However, very large arguments are not possible due to the danger of overflow. Thus in practice the actual amplification that occurs is limited.