Integer, Intent (In)	::	n
Integer, Intent (Inout)	::	ifail
Integer, Intent (Out)	::	ivalid(n)
Real (Kind=nag_wp), Intent (In)	::	x(n)
Real (Kind=nag_wp), Intent (Out)	::	f(n)

C Header Interface

#include nagmk26.h

void	s17atf_ ( const Integer n, const double x[], double f[], Integer ivalid[], Integer ifail)

3

Description

s17atf evaluates an approximation to the Bessel function of the first kind

J_{1} (x_{i})

for an array of arguments

x_{i}

, for

i = 1, 2, \dots, n

Note:

J_{1} (- x) = - J_{1} (x)

, so the approximation need only consider

x \geq 0

The routine is based on three Chebyshev expansions:

For

0 < x \leq 8

J_{1} (x) = \frac{x}{8} \underset{r = 0}{\sum^{'}} a_{r} T_{r} (t),   with ​ t = 2 {(\frac{x}{8})}^{2} - 1 .

For

x > 8

J_{1} (x) = \sqrt{\frac{2}{π x}} \{P_{1} (x) \cos (x - \frac{3 π}{4}) - Q_{1} (x) \sin (x - \frac{3 π}{4})\}

where

P_{1} (x) = \underset{r = 0}{\sum^{'}} b_{r} T_{r} (t)

and

Q_{1} (x) = \frac{8}{x} \underset{r = 0}{\sum^{'}} c_{r} T_{r} (t)

with

t = 2 {(\frac{8}{x})}^{2} - 1

For

x

near zero,

J_{1} (x) ≃ \frac{x}{2}

. This approximation is used when

x

is sufficiently small for the result to be correct to machine precision.

For very large

x

, it becomes impossible to provide results with any reasonable accuracy (see Section 7), hence the routine fails. Such arguments contain insufficient information to determine the phase of oscillation of

J_{1} (x)

; only the amplitude,

\sqrt{\frac{2}{π |x|}}

, can be determined and this is returned on soft failure. The range for which this occurs is roughly related to machine precision; the routine will fail if

|x| ≳ 1 / machine precision

(see the Users' Note for your implementation for details).

4

References

Abramowitz M and Stegun I A (1972) Handbook of Mathematical Functions (3rd Edition) Dover Publications

Clenshaw C W (1962) Chebyshev Series for Mathematical Functions Mathematical tables HMSO

5

Arguments

1: $n$ – IntegerInput

On entry:

n

, the number of points.

Constraint:

n \geq 0

2: $x (n)$ – Real (Kind=nag_wp) arrayInput

On entry: the argument

x_{i}

of the function, for

i = 1, 2, \dots, n

3: $f (n)$ – Real (Kind=nag_wp) arrayOutput

On exit:

J_{1} (x_{i})

, the function values.

4: $ivalid (n)$ – Integer arrayOutput

On exit:

ivalid (i)

contains the error code for

x_{i}

, for

i = 1, 2, \dots, n

$ivalid (i) = 0$

No error.

$ivalid (i) = 1$

On entry,

x_{i}

is too large.

f (i)

contains the amplitude of the

J_{1}

oscillation,

\sqrt{\frac{2}{π |x_{i}|}}

5: $ifail$ – IntegerInput/Output

On entry: ifail must be set to

0

- 1 ​ or ​ 1

. If you are unfamiliar with this argument you should refer to Section 3.4 in How to Use the NAG Library and its Documentation 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 argument, 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

- 1

, explanatory error messages are output on the current error message unit (as defined by x04aaf).

Errors or warnings detected by the routine:

$ifail = 1$: On entry, at least one value of x was invalid.
Check ivalid for more information.

$ifail = 2$: On entry, $n = 〈value〉$ .
Constraint: $n \geq 0$ .

$ifail = - 99$: An unexpected error has been triggered by this routine. Please contact NAG.
See Section 3.9 in How to Use the NAG Library and its Documentation for further information.

$ifail = - 399$: Your licence key may have expired or may not have been installed correctly.
See Section 3.8 in How to Use the NAG Library and its Documentation for further information.

$ifail = - 999$: Dynamic memory allocation failed.
See Section 3.7 in How to Use the NAG Library and its Documentation for further information.

7

Accuracy

Let

δ

be the relative error in the argument and

E

be the absolute error in the result. (Since

J_{1} (x)

oscillates about zero, absolute error and not relative error is significant.)

δ

is somewhat larger than machine precision (e.g., if

δ

is due to data errors etc.), then

E

and

δ

are approximately related by:

E ≃ |x J_{0} (x) - J_{1} (x)| δ

(provided

E

is also within machine bounds). Figure 1 displays the behaviour of the amplification factor

|x J_{0} (x) - J_{1} (x)|

However, if

δ

is of the same order as machine precision, then rounding errors could make

E

slightly larger than the above relation predicts.

For very large

x

, the above relation ceases to apply. In this region,

J_{1} (x) ≃ \sqrt{\frac{2}{π |x|}} \cos (x - \frac{3 π}{4})

. The amplitude

\sqrt{\frac{2}{π |x|}}

can be calculated with reasonable accuracy for all

x

, but

\cos (x - \frac{3 π}{4})

cannot. If

x - \frac{3 π}{4}

is written as

2 N π + θ

where

N

is an integer and

0 \leq θ < 2 π

, then

\cos (x - \frac{3 π}{4})

is determined by

θ

only. If

x ≳ δ^{- 1}

θ

cannot be determined with any accuracy at all. Thus if

x

is greater than, or of the order of, the reciprocal of machine precision, it is impossible to calculate the phase of

J_{1} (x)

and the routine must fail.

Figure 1

8

Parallelism and Performance

s17atf is not threaded in any implementation.

9

Further Comments

None.

10

Example

This example reads values of x from a file, evaluates the function at each value of

x_{i}

and prints the results.

NAG Library Routine Document

s17atf (bessel_j1_real_vector)

▸▿ Contents

1 Purpose

2 Specification

3 Description

4 References

5 Arguments

6 Error Indicators and Warnings

7 Accuracy

8 Parallelism and Performance

9 Further Comments

10 Example

10.1 Program Text

10.2 Program Data

10.3 Program Results

1

Purpose

2

Specification

3

Description

4

References

5

Arguments

6

Error Indicators and Warnings

7

Accuracy

8

Parallelism and Performance

9

Further Comments

10

Example

10.1

Program Text

10.2

Program Data

10.3

Program Results