S17DEF (PDF version)
S Chapter Contents
S Chapter Introduction
NAG Library Manual

NAG Library Routine Document


Note:  before using this routine, please read the Users' Note for your implementation to check the interpretation of bold italicised terms and other implementation-dependent details.

+ Contents

    1  Purpose
    7  Accuracy

1  Purpose

S17DEF returns a sequence of values for the Bessel functions Jν+nz for complex z, non-negative ν and n=0,1,,N-1, with an option for exponential scaling.

2  Specification

REAL (KIND=nag_wp)  FNU
COMPLEX (KIND=nag_wp)  Z, CY(N)

3  Description

S17DEF evaluates a sequence of values for the Bessel function Jνz, where z is complex, -π<argzπ, and ν is the real, non-negative order. The N-member sequence is generated for orders ν, ν+1,,ν+N-1. Optionally, the sequence is scaled by the factor e-Imz.
Note:  although the routine may not be called with ν less than zero, for negative orders the formula J-νz=Jνzcosπν-Yνzsinπν may be used (for the Bessel function Yνz, see S17DCF).
The routine is derived from the routine CBESJ in Amos (1986). It is based on the relations Jνz=eνπi/2Iν-iz, Imz0.0, and Jνz=e-νπi/2Iνiz, Imz<0.0.
The Bessel function Iνz is computed using a variety of techniques depending on the region under consideration.
When N is greater than 1, extra values of Jνz are computed using recurrence relations.
For very large z or ν+N-1, argument reduction will cause total loss of accuracy, and so no computation is performed. For slightly smaller z or ν+N-1, the computation is performed but results are accurate to less than half of machine precision. If Imz is 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.

4  References

Abramowitz M and Stegun I A (1972) Handbook of Mathematical Functions (3rd Edition) Dover Publications
Amos D E (1986) Algorithm 644: A portable package for Bessel functions of a complex argument and non-negative order ACM Trans. Math. Software 12 265–273

5  Parameters

1:     FNU – REAL (KIND=nag_wp)Input
On entry: ν, the order of the first member of the sequence of functions.
Constraint: FNU0.0.
2:     Z – COMPLEX (KIND=nag_wp)Input
On entry: the argument z of the functions.
3:     N – INTEGERInput
On entry: N, the number of members required in the sequence Jνz,Jν+1z,,Jν+N-1z.
Constraint: N1.
4:     SCAL – CHARACTER(1)Input
On entry: the scaling option.
The results are returned unscaled.
The results are returned scaled by the factor e-Imz.
Constraint: SCAL='U' or 'S'.
5:     CY(N) – COMPLEX (KIND=nag_wp) arrayOutput
On exit: the N required function values: CYi contains J ν+i-1 z , for i=1,2,,N.
6:     NZ – INTEGEROutput
On exit: the number of components of CY that are set to zero due to underflow. If NZ>0, then elements CYN-NZ+1, CYN-NZ+2,,CYN are set to zero.
7:     IFAIL – INTEGERInput/Output
On entry: IFAIL must be set to 0, -1​ or ​1. If you are unfamiliar with this parameter you should refer to Section 3.3 in the Essential Introduction for details.
For environments where it might be inappropriate to halt program execution when an error is detected, the value -1​ or ​1 is recommended. If the output of error messages is undesirable, then the value 1 is recommended. Otherwise, if you are not familiar with this parameter, the recommended value is 0. When the value -1​ or ​1 is used it is essential to test the value of IFAIL on exit.
On exit: IFAIL=0 unless the routine detects an error or a warning has been flagged (see Section 6).

6  Error Indicators and Warnings

If on entry IFAIL=0 or -1, explanatory error messages are output on the current error message unit (as defined by X04AAF).
Errors or warnings detected by the routine:
On entry,FNU<0.0,
orSCAL'U' or 'S'.
No computation has been performed due to the likelihood of overflow, because ImZ is larger than a machine-dependent threshold value (given in the Users' Note for your implementation). This error exit can only occur when SCAL='U'.
The computation has been performed, but the errors due to argument reduction in elementary functions make it likely that the results returned by S17DEF are accurate to less than half of machine precision. This error exit may occur if either absZ or FNU+N-1 is greater than a machine-dependent threshold value (given in the Users' Note for your implementation).
No computation has been performed because the errors due to argument reduction in elementary functions mean that all precision in results returned by S17DEF would be lost. This error exit may occur when either absZ or FNU+N-1 is greater than a machine-dependent threshold value (given in the Users' Note for your implementation).
No results are returned because the algorithm termination condition has not been met. This may occur because the parameters supplied to S17DEF would have caused overflow or underflow.

7  Accuracy

All constants in S17DEF are given to approximately 18 digits of precision. Calling the number of digits of precision in the floating point arithmetic being used t, then clearly the maximum number of correct digits in the results obtained is limited by p=mint,18. Because of errors in argument reduction when computing elementary functions inside S17DEF, the actual number of correct digits is limited, in general, by p-s, where s max1,log10z,log10ν  represents the number of digits lost due to the argument reduction. Thus the larger the values of z and ν, the less the precision in the result. If S17DEF is called with N>1, 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 S17DEF with different base values of ν and different N, the computed values may not agree exactly. Empirical tests with modest values of ν and z have shown that the discrepancy is limited to the least significant 3 – 4 digits of precision.

8  Further Comments

The time taken for a call of S17DEF is approximately proportional to the value of N, plus a constant. In general it is much cheaper to call S17DEF with N greater than 1, rather than to make N separate calls to S17DEF.
Paradoxically, for some values of z and ν, it is cheaper to call S17DEF 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 J0x or J1x, i.e., ν=0.0 or 1.0, where x is real and positive, and only a single unscaled function value is required, then it may be much cheaper to call S17AEF or S17AFF respectively.

9  Example

This example 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 parameter SCAL. The program calls the routine with N=2 to evaluate the function for orders FNU and FNU+1, and it prints the results. The process is repeated until the end of the input data stream is encountered.

9.1  Program Text

Program Text (s17defe.f90)

9.2  Program Data

Program Data (s17defe.d)

9.3  Program Results

Program Results (s17defe.r)

S17DEF (PDF version)
S Chapter Contents
S Chapter Introduction
NAG Library Manual

© The Numerical Algorithms Group Ltd, Oxford, UK. 2012