NAG Library Routine Document
S17DLF
1 Purpose
S17DLF returns a sequence of values for the Hankel functions ${H}_{\nu +n}^{\left(1\right)}\left(z\right)$ or ${H}_{\nu +n}^{\left(2\right)}\left(z\right)$ for complex $z$, nonnegative
$\nu $ and $n=0,1,\dots ,N1$, with an option for exponential scaling.
2 Specification
INTEGER 
M, N, NZ, IFAIL 
REAL (KIND=nag_wp) 
FNU 
COMPLEX (KIND=nag_wp) 
Z, CY(N) 
CHARACTER(1) 
SCAL 

3 Description
S17DLF evaluates a sequence of values for the Hankel function ${H}_{\nu}^{\left(1\right)}\left(z\right)$ or ${H}_{\nu}^{\left(2\right)}\left(z\right)$, where $z$ is complex, $\pi <\mathrm{arg}z\le \pi $, and $\nu $ is the real, nonnegative order. The $N$member sequence is generated for orders $\nu $, $\nu +1,\dots ,\nu +N1$. Optionally, the sequence is scaled by the factor ${e}^{iz}$ if the function is ${H}_{\nu}^{\left(1\right)}\left(z\right)$ or by the factor ${e}^{iz}$ if the function is ${H}_{\nu}^{\left(2\right)}\left(z\right)$.
Note: although the routine may not be called with $\nu $ less than zero, for negative orders the formulae ${H}_{\nu}^{\left(1\right)}\left(z\right)={e}^{\nu \pi i}{H}_{\nu}^{\left(1\right)}\left(z\right)$, and ${H}_{\nu}^{\left(2\right)}\left(z\right)={e}^{\nu \pi i}{H}_{\nu}^{\left(2\right)}\left(z\right)$ may be used.
The routine is derived from the routine CBESH in
Amos (1986). It is based on the relation
where
$p=\frac{i\pi}{2}$ if
$m=1$ and
$p=\frac{i\pi}{2}$ if
$m=2$, and the Bessel function
${K}_{\nu}\left(z\right)$ is computed in the right halfplane only. Continuation of
${K}_{\nu}\left(z\right)$ to the left halfplane is computed in terms of the Bessel function
${I}_{\nu}\left(z\right)$. These functions are evaluated using a variety of different techniques, depending on the region under consideration.
When $N$ is greater than $1$, extra values of ${H}_{\nu}^{\left(m\right)}\left(z\right)$ are computed using recurrence relations.
For very large $\leftz\right$ or $\left(\nu +N1\right)$, argument reduction will cause total loss of accuracy, and so no computation is performed. For slightly smaller $\leftz\right$ or $\left(\nu +N1\right)$, the computation is performed but results are accurate to less than half of machine precision. If $\leftz\right$ is very small, near the machine underflow threshold, or $\left(\nu +N1\right)$ 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.
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 nonnegative order ACM Trans. Math. Software 12 265–273
5 Parameters
 1: M – INTEGERInput
On entry: the kind of functions required.
 ${\mathbf{M}}=1$
 The functions are ${H}_{\nu}^{\left(1\right)}\left(z\right)$.
 ${\mathbf{M}}=2$
 The functions are ${H}_{\nu}^{\left(2\right)}\left(z\right)$.
Constraint:
${\mathbf{M}}=1$ or $2$.
 2: FNU – REAL (KIND=nag_wp)Input
On entry: $\nu $, the order of the first member of the sequence of functions.
Constraint:
${\mathbf{FNU}}\ge 0.0$.
 3: Z – COMPLEX (KIND=nag_wp)Input
On entry: the argument $z$ of the functions.
Constraint:
${\mathbf{Z}}\ne \left(0.0,0.0\right)$.
 4: N – INTEGERInput
On entry: $N$, the number of members required in the sequence ${H}_{\nu}^{\left({\mathbf{M}}\right)}\left(z\right),{H}_{\nu +1}^{\left({\mathbf{M}}\right)}\left(z\right),\dots ,{H}_{\nu +N1}^{\left({\mathbf{M}}\right)}\left(z\right)$.
Constraint:
${\mathbf{N}}\ge 1$.
 5: SCAL – CHARACTER(1)Input
On entry: the scaling option.
 ${\mathbf{SCAL}}=\text{'U'}$
 The results are returned unscaled.
 ${\mathbf{SCAL}}=\text{'S'}$
 The results are returned scaled by the factor ${e}^{iz}$ when ${\mathbf{M}}=1$, or by the factor ${e}^{iz}$ when ${\mathbf{M}}=2$.
Constraint:
${\mathbf{SCAL}}=\text{'U'}$ or $\text{'S'}$.
 6: CY(N) – COMPLEX (KIND=nag_wp) arrayOutput
On exit: the $N$ required function values: ${\mathbf{CY}}\left(i\right)$ contains
${H}_{\nu +i1}^{\left({\mathbf{M}}\right)}\left(z\right)$, for $\mathit{i}=1,2,\dots ,N$.
 7: NZ – INTEGEROutput
On exit: the number of components of
CY that are set to zero due to underflow. If
${\mathbf{NZ}}>0$, then if
$\mathrm{Im}\left(z\right)>0.0$ and
${\mathbf{M}}=1$, or
$\mathrm{Im}\left(z\right)<0.0$ and
${\mathbf{M}}=2$, elements
${\mathbf{CY}}\left(1\right),{\mathbf{CY}}\left(2\right),\dots ,{\mathbf{CY}}\left({\mathbf{NZ}}\right)$ are set to zero. In the complementary halfplanes,
NZ simply states the number of underflows, and not which elements they are.
 8: IFAIL – INTEGERInput/Output

On entry:
IFAIL must be set to
$0$,
$1\text{ 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\text{ 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 $\mathbf{1}\text{ or}\mathbf{1}$ is used it is essential to test the value of IFAIL on exit.
On exit:
${\mathbf{IFAIL}}={\mathbf{0}}$ unless the routine detects an error or a warning has been flagged (see
Section 6).
6 Error Indicators and Warnings
If on entry
${\mathbf{IFAIL}}={\mathbf{0}}$ or
${{\mathbf{1}}}$, explanatory error messages are output on the current error message unit (as defined by
X04AAF).
Errors or warnings detected by the routine:
 ${\mathbf{IFAIL}}=1$
On entry,  ${\mathbf{M}}\ne 1$ and ${\mathbf{M}}\ne 2$, 
or  ${\mathbf{FNU}}<0.0$, 
or  ${\mathbf{Z}}=\left(0.0,0.0\right)$, 
or  ${\mathbf{N}}<1$, 
or  ${\mathbf{SCAL}}\ne \text{'U'}$ or $\text{'S'}$. 
 ${\mathbf{IFAIL}}=2$

No computation has been performed due to the likelihood of overflow, because
$\mathrm{abs}\left({\mathbf{Z}}\right)$ is less than a machinedependent threshold value (given in the
Users' Note for your implementation).
 ${\mathbf{IFAIL}}=3$

No computation has been performed due to the likelihood of overflow, because
${\mathbf{FNU}}+{\mathbf{N}}1$ is too large – how large depends on
Z and the overflow threshold of the machine.
 ${\mathbf{IFAIL}}=4$
The computation has been performed, but the errors due to argument reduction in elementary functions make it likely that the results returned by S17DLF are accurate to less than half of
machine precision. This error exit may occur if either
$\mathrm{abs}\left({\mathbf{Z}}\right)$ or
${\mathbf{FNU}}+{\mathbf{N}}1$ is greater than a machinedependent threshold value (given in the
Users' Note for your implementation).
 ${\mathbf{IFAIL}}=5$
No computation has been performed because the errors due to argument reduction in elementary functions mean that all precision in results returned by S17DLF would be lost. This error exit may occur when either of
$\mathrm{abs}\left({\mathbf{Z}}\right)$ or
${\mathbf{FNU}}+{\mathbf{N}}1$ is greater than a machinedependent threshold value (given in the
Users' Note for your implementation).
 ${\mathbf{IFAIL}}=6$
No results are returned because the algorithm termination condition has not been met. This may occur because the parameters supplied to S17DLF would have caused overflow or underflow.
7 Accuracy
All constants in S17DLF 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=\mathrm{min}\phantom{\rule{0.125em}{0ex}}\left(t,18\right)$. Because of errors in argument reduction when computing elementary functions inside S17DLF, the actual number of correct digits is limited, in general, by $ps$, where $s\approx \mathrm{max}\phantom{\rule{0.125em}{0ex}}\left(1,\left{\mathrm{log}}_{10}\leftz\right\right,\left{\mathrm{log}}_{10}\nu \right\right)$ represents the number of digits lost due to the argument reduction. Thus the larger the values of $\leftz\right$ and $\nu $, the less the precision in the result. If S17DLF is called with ${\mathbf{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 S17DLF with different base values of $\nu $ and different ${\mathbf{N}}$, the computed values may not agree exactly. Empirical tests with modest values of $\nu $ and $z$ have shown that the discrepancy is limited to the least significant $3$ – $4$ digits of precision.
The time taken for a call of S17DLF is approximately proportional to the value of
N, plus a constant. In general it is much cheaper to call S17DLF with
N greater than
$1$, rather than to make
$N$ separate calls to S17DLF.
Paradoxically, for some values of $z$ and $\nu $, it is cheaper to call S17DLF with a larger value of ${\mathbf{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 ${\mathbf{N}}$, and the costs in each region may differ greatly.
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 kind of function,
M, the second is a value for the order
FNU, the third is a complex value for the argument,
Z, and the fourth is a character value
to set the parameter
SCAL. The program calls the routine with
${\mathbf{N}}=2$ to evaluate the function for orders
FNU and
${\mathbf{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 (s17dlfe.f90)
9.2 Program Data
Program Data (s17dlfe.d)
9.3 Program Results
Program Results (s17dlfe.r)