d02bjf integrates a system of first-order ordinary differential equations over an interval with suitable initial conditions, using a fixed order Runge–Kutta method, until a user-specified function, if supplied, of the solution is zero, and returns the solution at points specified by you, if desired.

2 Specification

Fortran Interface

Subroutine d02bjf (

x, xend, n, y, fcn, tol, relabs, output, g, w, ifail)

Integer, Intent (In)	::	n
Integer, Intent (Inout)	::	ifail
Real (Kind=nag_wp), External	::	g
Real (Kind=nag_wp), Intent (In)	::	xend, tol
Real (Kind=nag_wp), Intent (Inout)	::	x, y(n)
Real (Kind=nag_wp), Intent (Out)	::	w(20*n)
Character (1), Intent (In)	::	relabs
External	::	fcn, output

C Header Interface

#include <nag.h>

void

d02bjf_ (double *x, const double *xend, const Integer *n, double y[],
void (NAG_CALL *fcn)(const double *x, const double y[], double f[]),
const double *tol, const char *relabs,
void (NAG_CALL *output)(double *xsol, const double y[]),
double (NAG_CALL *g)(const double *x, const double y[]),
double w[], Integer *ifail, const Charlen length_relabs)

The routine may be called by the names d02bjf or nagf_ode_ivp_rk_zero_simple.

3 Description

d02bjf advances the solution of a system of ordinary differential equations

y_{i}^{'} = f_{i} (x, y_{1}, y_{2}, \dots, y_{n}), i = 1, 2, \dots, n,

from

x = x

x = xend

using a fixed order Runge–Kutta method. The system is defined by fcn, which evaluates

f_{i}

in terms of

x

and

y = (y_{1}, y_{2}, \dots, y_{n})

. The initial values of

y = (y_{1}, y_{2}, \dots, y_{n})

must be given at

x = x

The solution is returned via the output supplied by you and at points specified by you, if desired: this solution is obtained by

C^{1}

interpolation on solution values produced by the method. As the integration proceeds a check can be made on the user-specified function

g (x, y)

to determine an interval where it changes sign. The position of this sign change is then determined accurately by

C^{1}

interpolation to the solution. It is assumed that

g (x, y)

is a continuous function of the variables, so that a solution of

g (x, y) = 0

can be determined by searching for a change in sign in

g (x, y)

. The accuracy of the integration, the interpolation and, indirectly, of the determination of the position where

g (x, y) = 0

, is controlled by the arguments tol and relabs.

4 References

Shampine L F (1994) Numerical solution of ordinary differential equations Chapman and Hall

5 Arguments

1: $x$ – Real (Kind=nag_wp) Input/Output

On entry: the initial value of the independent variable

x

On exit: if

g

is supplied by you, it contains the point where

g (x, y) = 0

, unless

g (x, y) \neq 0

anywhere on the range x to xend, in which case, x will contain xend (and the error indicator

ifail = 6

is set); if

g

is not supplied by you it contains xend. However, if an error has occurred, it contains the value of

x

at which the error occurred.

2: $xend$ – Real (Kind=nag_wp) Input

On entry: the final value of the independent variable. If

xend < x

, integration will proceed in the negative direction.

Constraint:

xend \neq x

3: $n$ – Integer Input

On entry:

n

, the number of equations.

Constraint:

n > 0

4: $y (n)$ – Real (Kind=nag_wp) array Input/Output

On entry: the initial values of the solution

y_{1}, y_{2}, \dots, y_{n}

x = x

On exit: the computed values of the solution at the final point

x = x

5: $fcn$ – Subroutine, supplied by the user. External Procedure

fcn must evaluate the functions

f_{i}

(i.e., the derivatives

y_{i}^{'}

) for given values of its arguments

x, y_{1}, \dots, y_{n}

The specification of fcn is:

Fortran Interface

Subroutine fcn (

x, y, f)

Real (Kind=nag_wp), Intent (In)	::	x, y(*)
Real (Kind=nag_wp), Intent (Inout)	::	f(*)

C Header Interface

void	fcn (const double *x, const double y[], double f[])

1: $x$ – Real (Kind=nag_wp) Input: On entry: $x$ , the value of the independent variable.
2: $y (*)$ – Real (Kind=nag_wp) array Input: Note: the dimension, $n$ , of y is n as in the call of d02bjf.

On entry: $y_{i}$ , for $i = 1, 2, \dots, n$ , the value of the variable.
3: $f (*)$ – Real (Kind=nag_wp) array Output: Note: the dimension, $n$ , of f is n as in the call of d02bjf.

On exit: the value of $f_{i}$ , for $i = 1, 2, \dots, n$ .

fcn must either be a module subprogram USEd by, or declared as EXTERNAL in, the (sub)program from which d02bjf is called. Arguments denoted as Input must not be changed by this procedure.

Note: fcn should not return floating-point NaN (Not a Number) or infinity values, since these are not handled by d02bjf. If your code inadvertently does return any NaNs or infinities, d02bjf is likely to produce unexpected results.

6: $tol$ – Real (Kind=nag_wp) Input

On entry: a positive tolerance for controlling the error in the integration. Hence tol affects the determination of the position where

g (x, y) = 0

, if

g

is supplied.

d02bjf has been designed so that, for most problems, a reduction in tol leads to an approximately proportional reduction in the error in the solution. However, the actual relation between tol and the accuracy achieved cannot be guaranteed. You are strongly recommended to call d02bjf with more than one value for tol and to compare the results obtained to estimate their accuracy. In the absence of any prior knowledge, you might compare the results obtained by calling d02bjf with

relabs ='D'

and with each of

tol = {10.0}^{- p}

and

tol = {10.0}^{- p - 1}

where

p

correct significant digits are required in the solution,

y

. The accuracy of the value

x

such that

g (x, y) = 0

is indirectly controlled by varying tol. You should experiment to determine this accuracy.

Constraint:

10.0 \times machine precision < tol < 0.01

7: $relabs$ – Character(1) Input

On entry: the type of error control. At each step in the numerical solution an estimate of the local error,

est

, is made. For the current step to be accepted the following condition must be satisfied:

est = \max (e_{i} / (τ_{r} \times \max (| y_{i} |, τ_{a}))) \leq 1.0

where

τ_{r}

and

τ_{a}

are defined by

relabs	$τ_{r}$	$τ_{a}$
'M'	tol	1.0
'A'	$ε_{r}$	$tol / ε_{r}$
'R'	tol	$ε_{a}$
'D'	tol	$ε_{a}$

where

ε_{r}

and

ε_{a}

are small machine-dependent numbers and

e_{i}

is an estimate of the local error at

y_{i}

, computed internally. If the condition is not satisfied, the step size is reduced and the solution is recomputed on the current step. If you wish to measure the error in the computed solution in terms of the number of correct decimal places, relabs should be set to 'A' on entry, whereas if the error requirement is in terms of the number of correct significant digits, relabs should be set to 'R'. If you prefer a mixed error test, relabs should be set to 'M', otherwise if you have no preference, relabs should be set to the default 'D'. Note that in this case 'D' is taken to be 'R'.

Constraint:

relabs ='M'

'A'

'R'

'D'

8: $output$ – Subroutine, supplied by the NAG Library or the user. External Procedure

output permits access to intermediate values of the computed solution (for example to print or plot them), at successive user-specified points. It is initially called by d02bjf with

xsol = x

(the initial value of

x

). You must reset xsol to the next point (between the current xsol and xend) where output is to be called, and so on at each call to output. If, after a call to output, the reset point xsol is beyond xend, d02bjf will integrate to xend with no further calls to output; if a call to output is required at the point

xsol = xend

, xsol must be given precisely the value xend.

The specification of output is:

Fortran Interface

Subroutine output (

xsol, y)

Real (Kind=nag_wp), Intent (In)	::	y(*)
Real (Kind=nag_wp), Intent (Inout)	::	xsol

C Header Interface

void	output (double *xsol, const double y[])

1: $xsol$ – Real (Kind=nag_wp) Input/Output: On entry: the output value of the independent variable $x$ .

On exit: you must set xsol to the next value of $x$ at which output is to be called.
2: $y (*)$ – Real (Kind=nag_wp) array Input: Note: the dimension, $n$ , of y is n as in the call of d02bjf.

On entry: the computed solution at the point xsol.

output must either be a module subprogram USEd by, or declared as EXTERNAL in, the (sub)program from which d02bjf is called. Arguments denoted as Input must not be changed by this procedure.

Note: output should not return floating-point NaN (Not a Number) or infinity values, since these are not handled by d02bjf. If your code inadvertently does return any NaNs or infinities, d02bjf is likely to produce unexpected results.

If you do not wish to access intermediate output, the actual argument output must be the dummy routine d02bjx. (d02bjx is included in the NAG Library.)

9: $g$ – real (Kind=nag_wp) Function, supplied by the user. External Procedure

g must evaluate the function

g (x, y)

for specified values

x, y

. It specifies the function

g

for which the first position

x

where

g (x, y) = 0

is to be found.

The specification of g is:

Fortran Interface

Function g (

x, y)

Real (Kind=nag_wp)	::	g
Real (Kind=nag_wp), Intent (In)	::	x, y(*)

C Header Interface

double

g (const double *x, const double y[])

1: $x$ – Real (Kind=nag_wp) Input: On entry: $x$ , the value of the independent variable.
2: $y (*)$ – Real (Kind=nag_wp) array Input: Note: the dimension, $n$ , of y is n as in the call of d02bjf.

On entry: $y_{i}$ , for $i = 1, 2, \dots, n$ , the value of the variable.

g must either be a module subprogram USEd by, or declared as EXTERNAL in, the (sub)program from which d02bjf is called. Arguments denoted as Input must not be changed by this procedure.

Note: g should not return floating-point NaN (Not a Number) or infinity values, since these are not handled by d02bjf. If your code inadvertently does return any NaNs or infinities, d02bjf is likely to produce unexpected results.

If you do not require the root-finding option, the actual argument g must be the dummy routine d02bjw. (d02bjw is included in the NAG Library.)

10: $w (20 \times n)$ – Real (Kind=nag_wp) array Workspace

11: $ifail$ – Integer Input/Output

On entry: ifail must be set to

0

−1

1

to set behaviour on detection of an error; these values have no effect when no error is detected.

A value of

0

causes the printing of an error message and program execution will be halted; otherwise program execution continues. A value of

−1

means that an error message is printed while a value of

1

means that it is not.

If halting is not appropriate, the value

−1

1

is recommended. If message printing is undesirable, then the value

1

is recommended. Otherwise, the value

0

is recommended. 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, $n = ⟨ value ⟩$ .
Constraint: $n \geq 1$ .

On entry, $relabs = ⟨ value ⟩$ .
Constraint: $relabs ='M'$ , $'A'$ , $'R'$ or $'D'$ .

On entry, $tol = ⟨ value ⟩$ .
Constraint: $⟨ value ⟩ \leq tol < 0.01$ .

On entry, $x = xend = ⟨ value ⟩$ .
Constraint: $x \neq xend$ .

$ifail = 2$: With the given value of tol, no further progress can be made across the integration range from the current point $x = x$ .
The solution is returned at this point, $x = ⟨ value ⟩$ .
With the given value of tol, no further progress can be made across the integration range from the current point $x = x$ . (See Section 9 for a discussion of this error exit.) The components $y (1), y (2), \dots, y (n)$ contain the computed values of the solution at the current point $x = x$ . If you have supplied $g$ , no point at which $g (x, y)$ changes sign has been located up to the point $x = x$ .

$ifail = 3$: With the given value of tol, no initial progress can be made from the starting point of integration provided.
tol is too small for d02bjf to take an initial step. x and $y (1), y (2), \dots, y (n)$ retain their initial values.

$ifail = 4$: On the first call to output, xsol remained unchanged.

On the first call to output, xsol was returned as $⟨ value ⟩$ , which is inconsistent with $(x, xend)$ — $(⟨ value ⟩, ⟨ value ⟩)$ .

$ifail = 5$: On a call to output, xsol remained unchanged.

On a call to output, xsol was returned as $⟨ value ⟩$ , which is inconsistent with previous xsol and xend — $(⟨ value ⟩, ⟨ value ⟩)$ .

$ifail = 6$: No change in sign of the function $g (x, y)$ was detected in the integration range.

$ifail = 7$: Unexpected internal error in call to interpolation routine.
The interpolation routine returned error flag $⟨ value ⟩$ .

Unexpected internal error in call to zero-finding routine.
The zero-finding routine returned error flag $⟨ value ⟩$ .

$ifail = 8$: Unexpected internal error in call to step integrator.
The step integrator returned error flag $⟨ value ⟩$ .

$ifail = - 99$: An unexpected error has been triggered by this routine. Please contact NAG.
See Section 7 in the Introduction to the NAG Library FL Interface for further information.

$ifail = - 399$: Your licence key may have expired or may not have been installed correctly.
See Section 8 in the Introduction to the NAG Library FL Interface for further information.

$ifail = - 999$: Dynamic memory allocation failed.
See Section 9 in the Introduction to the NAG Library FL Interface for further information.

7 Accuracy

The accuracy of the computation of the solution vector y may be controlled by varying the local error tolerance tol. In general, a decrease in local error tolerance should lead to an increase in accuracy. You are advised to choose

relabs ='D'

unless you have a good reason for a different choice.

If the problem is a root-finding one, then the accuracy of the root determined will depend on the properties of

g (x, y)

and on the values of tol and relabs. You should try to code g without introducing any unnecessary cancellation errors.

8 Parallelism and Performance

d02bjf makes calls to BLAS and/or LAPACK routines, which may be threaded within the vendor library used by this implementation. Consult the documentation for the vendor library for further information.

Please consult the X06 Chapter Introduction for information on how to control and interrogate the OpenMP environment used within this routine. Please also consult the Users' Note for your implementation for any additional implementation-specific information.

9 Further Comments

If more than one root is required, then to determine the second and later roots d02bjf may be called again starting a short distance past the previously determined roots. Alternatively you may construct your own root-finding code using c05azf, d02pff and d02psf.

If d02bjf fails with

ifail = 3

, then it can be called again with a larger value of tol if this has not already been tried. If the accuracy requested is really needed and cannot be obtained with this routine, the system may be very stiff (see below) or so badly scaled that it cannot be solved to the required accuracy.

If d02bjf fails with

ifail = 2

, it is probable that it has been called with a value of tol which is so small that a solution cannot be obtained on the range x to xend. This can happen for well-behaved systems and very small values of tol. You should, however, consider whether there is a more fundamental difficulty. For example:

(a)in the region of a singularity (infinite value) of the solution, the routine will usually stop with $ifail = 2$ , unless overflow occurs first. Numerical integration cannot be continued through a singularity, and analytic treatment should be considered;
(b)for ‘stiff’ equations where the solution contains rapidly decaying components, the routine will use very small steps in $x$ (internally to d02bjf) to preserve stability. This will exhibit itself by making the computing time excessively long, or occasionally by an exit with $ifail = 2$ . Runge–Kutta methods are not efficient in such cases, and you should try d02ejf.

10 Example

This example illustrates the solution of four different problems. In each case the differential system (for a projectile) is

\begin{array}{l} y^{'} = \tan ϕ \\ v^{'} = \frac{- 0.032 \tan ϕ}{v} - \frac{0.02 v}{\cos ϕ} \\ ϕ^{'} = \frac{- 0.032}{v^{2}} \end{array}

over an interval

x = 0.0

xend = 10.0

starting with values

y = 0.5

v = 0.5

and

ϕ = π / 5

. We solve each of the following problems with local error tolerances

1.0E−4

and

1.0E−5

(i)To integrate to $x = 10.0$ producing intermediate output at intervals of $2.0$ until a root is encountered where $y = 0.0$ .
(ii)As (i) but with no intermediate output.
(iii)As (i) but with no termination on a root-finding condition.
(iv)As (i) but with no intermediate output and no root-finding termination condition.

d02bj: FL CL CPP AD

NAG FL Interfaced02bjf (ivp_​rk_​zero_​simple)

▸▿ 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

NAG FL Interface
d02bjf (ivp_rk_zero_simple)