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

PDF version (NAG web site, 64-bit version, 64-bit version)

Chapter Contents

Chapter Introduction

NAG Toolbox

NAG Toolbox: nag_specfun_hankel_complex (s17dl)

▸▿ Contents

1 Purpose

2 Syntax

3 Description

4 References

▸▿ 5 Parameters

5.1 Compulsory Input Parameters

5.2 Optional Input Parameters

5.3 Output Parameters

6 Error Indicators and Warnings

7 Accuracy

8 Further Comments

9 Example

Purpose

nag_specfun_hankel_complex (s17dl) returns a sequence of values for the Hankel functions

H_{ν + n}^{(1)} (z)

H_{ν + n}^{(2)} (z)

for complex

z

, non-negative

ν

and

n = 0, 1, \dots, N - 1

, with an option for exponential scaling.

Syntax

[cy, nz, ifail] = s17dl(m, fnu, z, n, scal)

[cy, nz, ifail] = nag_specfun_hankel_complex(m, fnu, z, n, scal)

Description

nag_specfun_hankel_complex (s17dl) evaluates a sequence of values for the Hankel function

H_{ν}^{(1)} (z)

H_{ν}^{(2)} (z)

, where

z

is complex,

- π < \arg z \leq π

, and

ν

is the real, non-negative order. The

N

-member sequence is generated for orders

ν

ν + 1, \dots, ν + N - 1

. Optionally, the sequence is scaled by the factor

e^{- i z}

if the function is

H_{ν}^{(1)} (z)

or by the factor

e^{i z}

if the function is

H_{ν}^{(2)} (z)

Note: although the function may not be called with

ν

less than zero, for negative orders the formulae

H_{- ν}^{(1)} (z) = e^{ν π i} H_{ν}^{(1)} (z)

, and

H_{- ν}^{(2)} (z) = e^{- ν π i} H_{ν}^{(2)} (z)

may be used.

The function is derived from the function CBESH in Amos (1986). It is based on the relation

H_{ν}^{(m)} (z) = \frac{1}{p} e^{- p ν} K_{ν} (z e^{- p}),

where

p = \frac{i π}{2}

m = 1

and

p = - \frac{i π}{2}

m = 2

, and the Bessel function

K_{ν} (z)

is computed in the right half-plane only. Continuation of

K_{ν} (z)

to the left half-plane is computed in terms of the Bessel function

I_{ν} (z)

. 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_{ν}^{(m)} (z)

are computed using recurrence relations.

For very large

|z|

(ν + N - 1)

, argument reduction will cause total loss of accuracy, and so no computation is performed. For slightly smaller

|z|

(ν + N - 1)

, the computation is performed but results are accurate to less than half of machine precision. If

|z|

is very small, near the machine underflow threshold, or

(ν + N - 1)

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 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: $m$ – int64int32nag_int scalar

The kind of functions required.

$m = 1$: The functions are $H_{ν}^{(1)} (z)$ .
$m = 2$: The functions are $H_{ν}^{(2)} (z)$ .

Constraint:

m = 1

2

2: $fnu$ – double scalar

ν

, the order of the first member of the sequence of functions.

Constraint:

fnu \geq 0.0

3: $z$ – complex scalar

The argument

z

of the functions.

Constraint:

z \neq (0.0, 0.0)

4: $n$ – int64int32nag_int scalar

N

, the number of members required in the sequence

H_{ν}^{(m)} (z), H_{ν + 1}^{(m)} (z), \dots, H_{ν + N - 1}^{(m)} (z)

Constraint:

n \geq 1

5: $scal$ – string (length ≥ 1)

The scaling option.

$scal ='U'$: The results are returned unscaled.
$scal ='S'$: The results are returned scaled by the factor $e^{- i z}$ when $m = 1$ , or by the factor $e^{i z}$ when $m = 2$ .

Constraint:

scal ='U'

'S'

Optional Input Parameters

None.

Output Parameters

1: $cy (n)$ – complex array: The $N$ required function values: $cy (i)$ contains $H_{ν + i - 1}^{(m)} (z)$ , for $i = 1, 2, \dots, N$ .
2: $nz$ – int64int32nag_int scalar: The number of components of cy that are set to zero due to underflow. If $nz > 0$ , then if $Im (z) > 0.0$ and $m = 1$ , or $Im (z) < 0.0$ and $m = 2$ , elements $cy (1), cy (2), \dots, cy (nz)$ are set to zero. In the complementary half-planes, nz simply states the number of underflows, and not which elements they are.
3: $ifail$ – int64int32nag_int scalar: $ifail = 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.

$ifail = 1$

On entry,	$m \neq 1$ and $m \neq 2$ ,
or	$fnu < 0.0$ ,
or	$z = (0.0, 0.0)$ ,
or	$n < 1$ ,
or	$scal \neq'U'$ or $'S'$ .

$ifail = 2$: No computation has been performed due to the likelihood of overflow, because $abs (z)$ is less than a machine-dependent threshold value.

$ifail = 3$: No computation has been performed due to the likelihood of overflow, because $fnu + n - 1$ is too large – how large depends on z and the overflow threshold of the machine.

W $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 nag_specfun_hankel_complex (s17dl) are accurate to less than half of machine precision. This error exit may occur if either $abs (z)$ or $fnu + n - 1$ is greater than a machine-dependent threshold value.

$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 nag_specfun_hankel_complex (s17dl) would be lost. This error exit may occur when either of $abs (z)$ or $fnu + n - 1$ is greater than a machine-dependent threshold value.

$ifail = 6$: No results are returned because the algorithm termination condition has not been met. This may occur because the arguments supplied to nag_specfun_hankel_complex (s17dl) would have caused overflow or underflow.

$ifail = - 99$: An unexpected error has been triggered by this routine. Please contact NAG.

$ifail = - 399$: Your licence key may have expired or may not have been installed correctly.

$ifail = - 999$: Dynamic memory allocation failed.

Accuracy

All constants in nag_specfun_hankel_complex (s17dl) 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 = \min (t, 18)

. Because of errors in argument reduction when computing elementary functions inside nag_specfun_hankel_complex (s17dl), the actual number of correct digits is limited, in general, by

p - s

, where

s \approx \max (1, |\log_{10} |z||, |\log_{10} ν|)

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 nag_specfun_hankel_complex (s17dl) 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 nag_specfun_hankel_complex (s17dl) 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.

Further Comments

The time taken for a call of nag_specfun_hankel_complex (s17dl) is approximately proportional to the value of n, plus a constant. In general it is much cheaper to call nag_specfun_hankel_complex (s17dl) with n greater than

1

, rather than to make

N

separate calls to nag_specfun_hankel_complex (s17dl).

Paradoxically, for some values of

z

and

ν

, it is cheaper to call nag_specfun_hankel_complex (s17dl) 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.

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

Open in the MATLAB editor: s17dl_example

function s17dl_example


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

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

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

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

  fprintf('%2d %7.3f  %7.3f%+7.3fi', m(i), 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

s17dl example results

 m    nu           z         scaled?     H_{nu+0}(z)      H_{nu+1}(z)   nz
 1   0.000    0.300 +0.400i  unscaled   0.347  -0.559i  -0.791  -0.818i  0
 1   2.300    2.000 +0.000i  unscaled   0.272  -0.740i   0.089  -1.412i  0
 1   2.120   -1.000 +0.000i  unscaled  -0.772  -1.693i   2.601  +6.527i  0
 2   6.000    3.100 -1.600i  unscaled  -1.371  -1.280i  -1.491  -5.993i  0
 2   6.000    3.100 -1.600i    scaled   7.050  +6.052i   8.614 +29.352i  0

PDF version (NAG web site, 64-bit version, 64-bit version)

Chapter Contents

Chapter Introduction

NAG Toolbox