Integer type:  int32  int64  nag_int  show int32  show int32  show int64  show int64  show nag_int  show nag_int

Chapter Contents
Chapter Introduction
NAG Toolbox

# NAG Toolbox: nag_specfun_bessel_j_complex (s17de)

## Purpose

nag_specfun_bessel_j_complex (s17de) returns a sequence of values for the Bessel functions ${J}_{\nu +n}\left(z\right)$ for complex $z$, non-negative $\nu$ and $n=0,1,\dots ,N-1$, with an option for exponential scaling.

## Syntax

[cy, nz, ifail] = s17de(fnu, z, n, scal)
[cy, nz, ifail] = nag_specfun_bessel_j_complex(fnu, z, n, scal)

## Description

nag_specfun_bessel_j_complex (s17de) evaluates a sequence of values for the Bessel function ${J}_{\nu }\left(z\right)$, where $z$ is complex, $-\pi <\mathrm{arg}z\le \pi$, and $\nu$ is the real, non-negative order. The $N$-member sequence is generated for orders $\nu$, $\nu +1,\dots ,\nu +N-1$. Optionally, the sequence is scaled by the factor ${e}^{-\left|\mathrm{Im}\left(z\right)\right|}$.
Note:  although the function may not be called with $\nu$ less than zero, for negative orders the formula ${J}_{-\nu }\left(z\right)={J}_{\nu }\left(z\right)\mathrm{cos}\left(\pi \nu \right)-{Y}_{\nu }\left(z\right)\mathrm{sin}\left(\pi \nu \right)$ may be used (for the Bessel function ${Y}_{\nu }\left(z\right)$, see nag_specfun_bessel_y_complex (s17dc)).
The function is derived from the function CBESJ in Amos (1986). It is based on the relations ${J}_{\nu }\left(z\right)={e}^{\nu \pi i/2}{I}_{\nu }\left(-iz\right)$, $\mathrm{Im}\left(z\right)\ge 0.0$, and ${J}_{\nu }\left(z\right)={e}^{-\nu \pi i/2}{I}_{\nu }\left(iz\right)$, $\mathrm{Im}\left(z\right)<0.0$.
The Bessel function ${I}_{\nu }\left(z\right)$ is computed using a variety of techniques depending on the region under consideration.
When $N$ is greater than $1$, extra values of ${J}_{\nu }\left(z\right)$ are computed using recurrence relations.
For very large $\left|z\right|$ or $\left(\nu +N-1\right)$, argument reduction will cause total loss of accuracy, and so no computation is performed. For slightly smaller $\left|z\right|$ or $\left(\nu +N-1\right)$, the computation is performed but results are accurate to less than half of machine precision. If $\mathrm{Im}\left(z\right)$ 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 function.

## 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

## Parameters

### Compulsory Input Parameters

1:     $\mathrm{fnu}$ – double scalar
$\nu$, the order of the first member of the sequence of functions.
Constraint: ${\mathbf{fnu}}\ge 0.0$.
2:     $\mathrm{z}$ – complex scalar
The argument $z$ of the functions.
3:     $\mathrm{n}$int64int32nag_int scalar
$N$, the number of members required in the sequence ${J}_{\nu }\left(z\right),{J}_{\nu +1}\left(z\right),\dots ,{J}_{\nu +N-1}\left(z\right)$.
Constraint: ${\mathbf{n}}\ge 1$.
4:     $\mathrm{scal}$ – string (length ≥ 1)
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}^{-\left|\mathrm{Im}\left(z\right)\right|}$.
Constraint: ${\mathbf{scal}}=\text{'U'}$ or $\text{'S'}$.

None.

### Output Parameters

1:     $\mathrm{cy}\left({\mathbf{n}}\right)$ – complex array
The $N$ required function values: ${\mathbf{cy}}\left(i\right)$ contains ${J}_{\nu +i-1}\left(z\right)$, for $\mathit{i}=1,2,\dots ,N$.
2:     $\mathrm{nz}$int64int32nag_int scalar
The number of components of cy that are set to zero due to underflow. If ${\mathbf{nz}}>0$, then elements ${\mathbf{cy}}\left({\mathbf{n}}-{\mathbf{nz}}+1\right)$, ${\mathbf{cy}}\left({\mathbf{n}}-{\mathbf{nz}}+2\right),\dots ,{\mathbf{cy}}\left({\mathbf{n}}\right)$ are set to zero.
3:     $\mathrm{ifail}$int64int32nag_int scalar
${\mathbf{ifail}}={\mathbf{0}}$ unless the function detects an error (see Error Indicators and Warnings).

## Error Indicators and Warnings

Errors or warnings detected by the function:

Cases prefixed with W are classified as warnings and do not generate an error of type NAG:error_n. See nag_issue_warnings.

${\mathbf{ifail}}=1$
 On entry, ${\mathbf{fnu}}<0.0$, 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{Im}{\mathbf{z}}$ is larger than a machine-dependent threshold value. This error exit can only occur when ${\mathbf{scal}}=\text{'U'}$.
W  ${\mathbf{ifail}}=3$
The computation has been performed, but the errors due to argument reduction in elementary functions make it likely that the results returned by nag_specfun_bessel_j_complex (s17de) 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 machine-dependent threshold value.
${\mathbf{ifail}}=4$
No computation has been performed because the errors due to argument reduction in elementary functions mean that all precision in results returned by nag_specfun_bessel_j_complex (s17de) would be lost. This error exit may occur when either $\mathrm{abs}\left({\mathbf{z}}\right)$ or ${\mathbf{fnu}}+{\mathbf{n}}-1$ is greater than a machine-dependent threshold value.
${\mathbf{ifail}}=5$
No results are returned because the algorithm termination condition has not been met. This may occur because the arguments supplied to nag_specfun_bessel_j_complex (s17de) would have caused overflow or underflow.
${\mathbf{ifail}}=-99$
${\mathbf{ifail}}=-399$
Your licence key may have expired or may not have been installed correctly.
${\mathbf{ifail}}=-999$
Dynamic memory allocation failed.

## Accuracy

All constants in nag_specfun_bessel_j_complex (s17de) 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 nag_specfun_bessel_j_complex (s17de), the actual number of correct digits is limited, in general, by $p-s$, where $s\approx \mathrm{max}\phantom{\rule{0.125em}{0ex}}\left(1,\left|{\mathrm{log}}_{10}\left|z\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 $\left|z\right|$ and $\nu$, the less the precision in the result. If nag_specfun_bessel_j_complex (s17de) 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 nag_specfun_bessel_j_complex (s17de) 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 nag_specfun_bessel_j_complex (s17de) is approximately proportional to the value of ${\mathbf{n}}$, plus a constant. In general it is much cheaper to call nag_specfun_bessel_j_complex (s17de) with ${\mathbf{n}}$ greater than $1$, rather than to make $N$ separate calls to nag_specfun_bessel_j_complex (s17de).
Paradoxically, for some values of $z$ and $\nu$, it is cheaper to call nag_specfun_bessel_j_complex (s17de) 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.
Note that if the function required is ${J}_{0}\left(x\right)$ or ${J}_{1}\left(x\right)$, i.e., $\nu =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 nag_specfun_bessel_j0_real (s17ae) or nag_specfun_bessel_j1_real (s17af) respectively.

## 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 argument scal. The program calls the function 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.
```function s17de_example

fprintf('s17de example results\n\n');

n  = int64(2);
nu = [0             2.3       2.12      1.58          1.58];
z  = [0.3 + 0.4i;   2 + 0i;  -1 + 0i;  -2.3 + 5.6i;  -2.3 + 5.6i];
scal = {'U';        'U';      'U';      'U';          'S'};

fprintf('   nu           z         scaled?');
fprintf('     J_{nu+%d}(z) ',[0:n-1]);
fprintf('   nz\n');
for i=1:numel(nu)

[cy, nz, ifail] = s17de(nu(i), complex(z(i)), n, scal{i});

fprintf('%7.3f  %7.3f%+7.3fi', nu(i), real(z(i)), imag(z(i)));
if scal{i} == 'U'
fprintf('  unscaled');
else
fprintf('    scaled');
end
for j = 1:n
fprintf(' %7.3f%+8.3fi', real(cy(j)), imag(cy(j)));
end
fprintf('%3d\n',nz);
end

```
```s17de example results

nu           z         scaled?     J_{nu+0}(z)      J_{nu+1}(z)    nz
0.000    0.300 +0.400i  unscaled   1.017  -0.061i   0.157  +0.197i  0
2.300    2.000 +0.000i  unscaled   0.272  -0.000i   0.089  -0.000i  0
2.120   -1.000 +0.000i  unscaled   0.088  +0.035i  -0.014  -0.006i  0
1.580   -2.300 +5.600i  unscaled  -1.551 -36.476i  25.910  +2.677i  0
1.580   -2.300 +5.600i    scaled  -0.006  -0.135i   0.096  +0.010i  0
```