The function may be called by the names: s13aac, nag_specfun_integral_exp or nag_exp_integral.
3Description
s13aac calculates an approximate value for
using Chebyshev expansions, where is real. For , the real part of the principal value of the integral is taken. The value is infinite, and so, when , s13aac exits with an error and returns the largest representable machine number.
For ,
where .
For ,
where .
In both cases, .
For , the approximation is based on expansions proposed by Cody and Thatcher Jr. (1969). Precautions are taken to maintain good relative accuracy in the vicinity of , which corresponds to a simple zero of Ei().
s13aac guards against producing underflows and overflows by using the argument
, see the the Users' Note for your implementation for the value of . To guard against overflow, if the function terminates and returns the negative of the largest representable machine number. To guard against underflow, if the result is set directly to zero.
Cody W J and Thatcher Jr. H C (1969) Rational Chebyshev approximations for the exponential integral Ei Math. Comp.23 289–303
5Arguments
1: – doubleInput
On entry: the argument of the function.
Constraint:
or .
2: – NagError *Input/Output
The NAG error argument (see Section 7 in the Introduction to the NAG Library CL Interface).
6Error Indicators and Warnings
NE_ALLOC_FAIL
Dynamic memory allocation failed.
See Section 3.1.2 in the Introduction to the NAG Library CL Interface for further information.
NE_INTERNAL_ERROR
An internal error has occurred in this function. Check the function call and any array sizes. If the call is correct then please contact NAG for assistance.
See Section 7.5 in the Introduction to the NAG Library CL Interface for further information.
NE_NO_LICENCE
Your licence key may have expired or may not have been installed correctly.
See Section 8 in the Introduction to the NAG Library CL Interface for further information.
NE_REAL_ARG_LE
On entry, and the function is infinite.
On entry, and the constant .
The evaluation has been abandoned due to the likelihood of overflow.
Constraint: .
7Accuracy
Unless stated otherwise, it is assumed that .
If and are the relative errors in argument and result respectively, then in principle,
so the relative error in the argument is amplified in the result by at least a factor . The equality should hold if is greater than the machine precision (
due to data errors etc.) but if is simply a result of round-off in the machine representation, it is possible that an extra figure may be lost in internal calculation and round-off.
The behaviour of this amplification factor is shown in the following graph:
Figure 1
It should be noted that, for absolutely small , the amplification factor tends to zero and eventually the error in the result will be limited by machine precision.
For absolutely large ,
the absolute error in the argument.
For , empirical tests have shown that the maximum relative error is a loss of approximately decimal place.
8Parallelism and Performance
s13aac is not threaded in any implementation.
9Further Comments
None.
10Example
The following program reads values of the argument from a file, evaluates the function at each value of and prints the results.