The routine may be called by the names s18dcf or nagf_specfun_bessel_k_complex.
s18dcf evaluates a sequence of values for the modified Bessel function , where is complex, , and is the real, non-negative order. The -member sequence is generated for orders , . Optionally, the sequence is scaled by the factor .
The routine is derived from the routine CBESK in Amos (1986).
Note: although the routine may not be called with less than zero, for negative orders the formula may be used.
When is greater than , extra values of are computed using recurrence relations.
For very large or , argument reduction will cause total loss of accuracy, and so no computation is performed. For slightly smaller or , the computation is performed but results are accurate to less than half of machine precision. If is very small, near the machine underflow threshold, or is too large, there is a risk of overflow and so no computation is performed. In all the above cases, a warning is given by the routine.
Amos D E (1986) Algorithm 644: A portable package for Bessel functions of a complex argument and non-negative order ACM Trans. Math. Software12 265–273
1: – Real (Kind=nag_wp)Input
On entry: , the order of the first member of the sequence of functions.
2: – Complex (Kind=nag_wp)Input
On entry: the argument of the functions.
3: – IntegerInput
On entry: , the number of members required in the sequence .
4: – Character(1)Input
On entry: the scaling option.
The results are returned unscaled.
The results are returned scaled by the factor .
5: – Complex (Kind=nag_wp) arrayOutput
On exit: the required function values: contains
, for .
6: – IntegerOutput
On exit: the number of components of cy that are set to zero due to underflow. If and , elements are set to zero. If , nz simply states the number of underflows, and not which elements they are.
7: – IntegerInput/Output
On entry: ifail must be set to , or to set behaviour on detection of an error; these values have no effect when no error is detected.
A value of causes the printing of an error message and program execution will be halted; otherwise program execution continues. A value of means that an error message is printed while a value of means that it is not.
If halting is not appropriate, the value or is recommended. If message printing is undesirable, then the value is recommended. Otherwise, the value is recommended. When the value or is used it is essential to test the value of ifail on exit.
On exit: unless the routine detects an error or a warning has been flagged (see Section 6).
6Error Indicators and Warnings
If on entry or , explanatory error messages are output on the current error message unit (as defined by x04aaf).
No computation – algorithm termination condition not met.
An unexpected error has been triggered by this routine. Please
See Section 7 in the Introduction to the NAG Library FL Interface for further information.
Your licence key may have expired or may not have been installed correctly.
See Section 8 in the Introduction to the NAG Library FL Interface for further information.
Dynamic memory allocation failed.
See Section 9 in the Introduction to the NAG Library FL Interface for further information.
All constants in s18dcf are given to approximately digits of precision. Calling the number of digits of precision in the floating-point arithmetic being used , then clearly the maximum number of correct digits in the results obtained is limited by . Because of errors in argument reduction when computing elementary functions inside s18dcf, the actual number of correct digits is limited, in general, by , where represents the number of digits lost due to the argument reduction. Thus the larger the values of and , the less the precision in the result. If s18dcf is called with , then computation of function values via recurrence may lead to some further small loss of accuracy.
If function values which should nominally be identical are computed by calls to s18dcf with different base values of and different n, the computed values may not agree exactly. Empirical tests with modest values of and have shown that the discrepancy is limited to the least significant – digits of precision.
8Parallelism and Performance
s18dcf is not threaded in any implementation.
The time taken for a call of s18dcf is approximately proportional to the value of n, plus a constant. In general it is much cheaper to call s18dcf with n greater than , rather than to make separate calls to s18dcf.
Paradoxically, for some values of and , it is cheaper to call s18dcf with a larger value of n than is required, and then discard the extra function values returned. However, it is not possible to state the precise circumstances in which this is likely to occur. It is due to the fact that the base value used to start recurrence may be calculated in different regions for different n, and the costs in each region may differ greatly.
Note that if the function required is or , i.e., or , where is real and positive, and only a single function value is required, then it may be much cheaper to call s18acf,s18adf,s18ccfors18cdf, depending on whether a scaled result is required or not.
The example program prints a caption and then proceeds to read sets of data from the input data stream. The first datum is a value for the order fnu, the second is a complex value for the argument, z, and the third is a character value
to set the argument scal. The program calls the routine with to evaluate the function for orders fnu and , and it prints the results. The process is repeated until the end of the input data stream is encountered.