d02haf solves a two-point boundary value problem for a system of ordinary differential equations, using a Runge–Kutta–Merson method and a Newton iteration in a shooting and matching technique.

2 Specification

Fortran Interface

Subroutine d02haf (

u, v, n, a, b, tol, fcn, soln, m1, w, sdw, ifail)

Integer, Intent (In)	::	n, m1, sdw
Integer, Intent (Inout)	::	ifail
Real (Kind=nag_wp), Intent (In)	::	v(n,2), a, b, tol
Real (Kind=nag_wp), Intent (Inout)	::	u(n,2)
Real (Kind=nag_wp), Intent (Out)	::	soln(n,m1), w(n,sdw)
External	::	fcn

C Header Interface

#include <nag.h>

void	d02haf_ (double u[], const double v[], const Integer n, const double a, const double b, const double tol, void (NAG_CALL fcn)(const double x, const double y[], double f[]), double soln[], const Integer m1, double w[], const Integer sdw, Integer *ifail)

The routine may be called by the names d02haf or nagf_ode_bvp_shoot_bval.

3 Description

d02haf solves a two-point boundary value problem for a system of

n

ordinary differential equations in the range

a, b

. The system is written in the form:

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

(1)

and the derivatives

f_{i}

are evaluated by fcn. Initially,

n

boundary values of the variables

y_{i}

must be specified, some at

a

and some at

b

. You must supply estimates of the remaining

n

boundary values (called parameters below); the subroutine corrects these by a form of Newton iteration. It also calculates the complete solution on an equispaced mesh if required.

Starting from the known and estimated values of

y_{i}

a

, the subroutine integrates the equations from

a

b

(using a Runge–Kutta–Merson method). The differences between the values of

y_{i}

b

from integration and those specified initially should be zero for the true solution. (These differences are called residuals below.) The subroutine uses a generalized Newton method to reduce the residuals to zero, by calculating corrections to the estimated boundary values. This process is repeated iteratively until convergence is obtained, or until the routine can no longer reduce the residuals. See Hall and Watt (1976) for a simple discussion of shooting and matching techniques.

4 References

Hall G and Watt J M (ed.) (1976) Modern Numerical Methods for Ordinary Differential Equations Clarendon Press, Oxford

5 Arguments

1: $u (n, 2)$ – Real (Kind=nag_wp) array Input/Output

On entry:

u (i, 1)

must be set to the known or estimated value of

y_{i}

a

and

u (i, 2)

must be set to the known or estimated value of

y_{i}

b

, for

i = 1, 2, \dots, n

On exit: the known values unaltered, and corrected values of the estimates, unless an error has occurred. If an error has occurred, u contains the known values and the latest values of the estimates.

2: $v (n, 2)$ – Real (Kind=nag_wp) array Input

On entry:

v (i, j)

must be set to

0.0

u (i, j)

is a known value and to

1.0

u (i, j)

is an estimated value, for

i = 1, 2, \dots, n

and

j = 1, 2

Constraint: precisely

n

of the

v (i, j)

must be set to

0.0

, i.e., precisely

n

of the

u (i, j)

must be known values, and these must not be all at

a

or all at

b

3: $n$ – Integer Input

On entry:

n

, the number of equations.

Constraint:

n \geq 1

4: $a$ – Real (Kind=nag_wp) Input

On entry:

a

, the initial point of the interval of integration.

5: $b$ – Real (Kind=nag_wp) Input

On entry:

b

, the final point of the interval of integration.

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

On entry: must be set to a small quantity suitable for:

(a)testing the local error in $y_{i}$ during integration,
(b)testing for the convergence of $y_{i}$ at $b$ ,
(c)calculating the perturbation in estimated boundary values for $y_{i}$ , which are used to obtain the approximate derivatives of the residuals for use in the Newton iteration.

You are advised to check your results by varying tol.

Constraint:

tol > 0.0

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

fcn must evaluate the functions

f_{i}

(i.e., the derivatives

y_{i}^{'}

), for

i = 1, 2, \dots, n

, at a general point

x

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 (Out)	::	f(*)

C Header Interface

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

In the description of the arguments of d02haf below,

n

denotes the actual value of n in the call of d02haf.

1: $x$ – Real (Kind=nag_wp) Input: On entry: $x$ , the value of the argument.
2: $y (*)$ – Real (Kind=nag_wp) array Input: On entry: $y_{i}$ , for $i = 1, 2, \dots, n$ , the value of the argument.
3: $f (*)$ – Real (Kind=nag_wp) array Output: On exit: the values of $f_{i} (x)$ , 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 d02haf 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 d02haf. If your code inadvertently does return any NaNs or infinities, d02haf is likely to produce unexpected results.

8: $soln (n, m1)$ – Real (Kind=nag_wp) array Output

On exit: the solution when

m1 > 1

9: $m1$ – Integer Input

On entry: a value which controls output.

$m1 = 1$: The final solution is not evaluated.
$m1 > 1$: The final values of $y_{i}$ at interval $(b - a) / (m1 - 1)$ are calculated and stored in the array soln by columns, starting with values $y_{i}$ at $a$ stored in $soln (i, 1)$ , for $i = 1, 2, \dots, n$ .

Constraint:

m1 \geq 1

10: $w (n, sdw)$ – Real (Kind=nag_wp) array Output

On exit: if

ifail = 2

3

4

5

w (i, 1)

, for

i = 1, 2, \dots, n

, contains the solution at the point where the integration fails and the point of failure is returned in

w (1, 2)

11: $sdw$ – Integer Input

On entry: the second dimension of the array w as declared in the (sub)program from which d02haf is called.

Constraint:

sdw \geq 3 n + 17 + \max (11, n)

12: $ifail$ – Integer Input/Output

This routine uses an ifail input value codification that differs from the normal case to distinguish between errors and warnings (see Section 4 in the Introduction to the NAG Library FL Interface).

On entry: ifail must be set to one of the values below to set behaviour on detection of an error; these values have no effect when no error is detected. The behaviour relate to whether or not program execution is halted and whether or not messages are printed when an error or warning is detected.

ifail	Execution	Error Printing	Warning Printed
$0$	halted	No	No
$1$	continue	No	No
$10$	halted	Yes	No
$11$	continue	Yes	No
$100$	halted	No	Yes
$101$	continue	No	Yes
$110$	halted	Yes	Yes
$111$	continue	Yes	Yes

For environments where it might be inappropriate to halt program execution when an error is detected, the value

1

11

101

111

is recommended. If the printing of messages is undesirable, then the value

1

is recommended. Otherwise, the recommended value is

110

. When the value $1$ , $11$ , $101$ or $111$ 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, incorrect number of boundary values were flagged as known.
Number flagged as known: $〈value〉$ , but number should be $〈value〉$ .

On entry, $m1 = 〈value〉$ .
Constraint: $m1 \geq 1$ .

On entry, $n = 〈value〉$ .
Constraint: $n \geq 1$ .

On entry, $sdw = 〈value〉$ .
Constraint: $sdw \geq 3 \times n + \max (28, n + 17)$ ; that is, $〈value〉$ .

On entry, $tol = 〈value〉$ .
Constraint: $tol > 0.0$ .

On entry all left-hand boundary values were flagged as known.

On entry no left-hand boundary values were flagged as known.

$ifail = 2$: In the integration with initial or final parameters, the step size was reduced too far for the integration to proceed. Either this routine is not a suitable method for solving the problem, or the initial choice of parameters is very poor.

$ifail = 3$: In the integration with initial or final parameters, a suitable initial step could not be found. Either this routine is not suitable for solving the problem, or the initial choice of parameters is very poor.

$ifail = 4$: An initial step-length could be found for integration to proceed with the current parameters.

$ifail = 5$: The step-length required to calculate the Jacobian to sufficient accuracy is too small

$ifail = 6$: The Jacobian has an insignificant column. Make sure that the solution vector depends on all the parameters.

$ifail = 7$: An internal singular value decomposition has failed.
This error can be avoided by changing the initial parameter estimates.

$ifail = 8$: The Newton iteration has failed to converge.
This can indicate a poor initial choice of parameters or a very difficult problem.
Consider varying elements of the parameter convergence control if the residuals are small; otherwise vary initial parameter estimates.

$ifail = 10$: Internal error in calculating residual. Please contact NAG.

$ifail = 11$: Internal error in calculating Jacobian. Please contact NAG.

$ifail = 12$: Internal error in Newton method. Please contact NAG.

$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

If the process converges, the accuracy to which the unknown parameters are determined is usually close to that specified by you; the solution, if requested, may be determined to a required accuracy by varying tol.

8 Parallelism and Performance

d02haf is not thread safe and should not be called from a multithreaded user program. Please see Section 1 in FL Interface Multithreading for more information on thread safety.

d02haf 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

The time taken by d02haf depends on the complexity of the system, and on the number of iterations required. In practice, integration of the differential equations is by far the most costly process involved.

Wherever it occurs in the routine, the error argument tol is used in ‘mixed’ form; that is tol always occurs in expressions of the form

tol \times (1 + |y_{i}|)

. Though not ideal for every application, it is expected that this mixture of absolute and relative error testing will be adequate for most purposes.

You are strongly recommended to set ifail to obtain self-explanatory error messages, and also monitoring information about the course of the computation. You may select the unit numbers on which this output is to appear by calls of x04aaf (for error messages) or x04abf (for monitoring information) – see Section 10 for an example. Otherwise the default unit numbers will be used, as specified in the Users' Note. The monitoring information produced at each iteration includes the current parameter values, the residuals and

2

-norms: a basic norm and a current norm. At each iteration the aim is to find parameter values which make the current norm less than the basic norm. Both these norms should tend to zero as should the residuals. (They would all be zero if the exact parameters were used as input.) For more details, you may consult the specification of d02saf, and especially the description of the argument monit there.

The computing time for integrating the differential equations can sometimes depend critically on the quality of the initial estimates. If it seems that too much computing time is required and, in particular, if the values of the residuals printed by the monitoring routine are much larger than the expected values of the solution at

b

, then the coding of fcn should be checked for errors. If no errors can be found, an independent attempt should be made to improve the initial estimates. In practical problems it is not uncommon for the differential equation to have a singular point at one or both ends of the range. Suppose

a

is a singular point; then the derivatives

y_{i}^{'}

in (1) (in Section 3) cannot be evaluated at

a

, usually because one or more of the expressions for

f_{i}

give overflow. In such a case it is necessary for you to take

a

a short distance away from the singularity, and to find values for

y_{i}

at the new value of

a

(e.g., use the first one or two terms of an analytical (power series) solution). You should experiment with the new position of

a

; if it is taken too close to the singular point, the derivatives

f_{i}

will be inaccurate, and the routine may sometimes fail with

ifail = 2

3

or, in extreme cases, with an overflow condition. A more general treatment of singular solutions is provided by the subroutine d02hbf.

Another difficulty which often arises in practice is the case when one end of the range,

b

say, is at infinity. You must approximate the end point by taking a finite value for

b

, which is obtained by estimating where the solution will reach its asymptotic state. The estimate can be checked by repeating the calculation with a larger value of

b

. If

b

is very large, and if the matching point is also at

b

, the numerical solution may suffer a considerable loss of accuracy in integrating across the range, and the program may fail with

ifail = 6

8

. (In the former case, solutions from all initial values at

a

are tending to the same curve at infinity.) The simplest remedy is to try to solve the equations with a smaller value of

b

, and then to increase

b

in stages, using each solution to give boundary value estimates for the next calculation. For problems where some terms in the asymptotic form of the solution are known, d02hbf will be more successful.

If the unknown quantities are not boundary values, but are eigenvalues or the length of the range or some other parameters occurring in the differential equations, d02hbf may be used.

10 Example

This example finds the angle at which a projectile must be fired for a given range.

The differential equations are:

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

with the following boundary conditions:

\begin{matrix} y = 0, & v = 0.5 & at x = 0, \\ y = 0 & at x = 5 . \end{matrix}

The remaining boundary conditions are estimated as:

\begin{matrix} ϕ = 1.15 & at x = 0, \\ ϕ = 1.2, & v = 0.46 & at x = 5 . \end{matrix}

We write

y = Z (1)

v = Z (2)

ϕ = Z (3)

. To check the accuracy of the results the problem is solved twice with

tol = 5 . 0E−3

and

5.0E−4

respectively. Note the call to x04abf before the call to d02haf.

d02ha: FL CL CPP AD

NAG FL Interfaced02haf (bvp_​shoot_​bval)

▸▿ 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
d02haf (bvp_shoot_bval)