NAG FL Interface
d02raf (bvp_​fd_​nonlin_​gen)

1 Purpose

2 Specification

3 Description

4 References

5 Arguments

1: $\mathbf{n}$ – Integer Input

On entry: $\mathit{n}$, the number of differential equations.

Constraint: $\mathbf{n}>0$.

2: $\mathbf{mnp}$ – Integer Input

On entry: mnp must be set to the maximum permitted number of points in the finite difference mesh. If lwork or liwork are too small then internally mnp will be replaced by the maximum permitted by these values. (A warning message will be output if on entry ifail is set to obtain monitoring information.)

Constraint: $\mathbf{mnp}\ge 32$.

3: $\mathbf{np}$ – Integer Input/Output

On entry: must be set to the number of points to be used in the initial mesh.

Constraint: $4\le \mathbf{np}\le \mathbf{mnp}$.

On exit: the number of points in the final mesh.

4: $\mathbf{numbeg}$ – Integer Input

On entry: the number of left-hand boundary conditions (that is the number involving $y\left(a\right)$ only).

Constraint: $0\le \mathbf{numbeg}<\mathbf{n}$.

5: $\mathbf{nummix}$ – Integer Input

On entry: the number of coupled boundary conditions (that is the number involving both $y\left(a\right)$ and $y\left(b\right)$).

Constraint: $0\le \mathbf{nummix}\le \mathbf{n}-\mathbf{numbeg}$.

6: $\mathbf{tol}$ – Real (Kind=nag_wp) Input

On entry: a positive absolute error tolerance. If

$$a=x_1<x_2<\cdots <x_{\mathbf{np}}=b$$

is the final mesh, $z_j\left(x_i\right)$ is the $j$th component of the approximate solution at $x_i$, and $y_j\left(x\right)$ is the $j$th component of the true solution of (1) and (2), then, except in extreme circumstances, it is expected that

$$|z_j\left(x_i\right)-y_j\left(x_i\right)|\le \mathbf{tol}\text{, \hspace{1em}}i=1,2,\dots ,\mathbf{np}\text{ and }j=1,2,\dots ,n\text{.}$$

(5)

Constraint: $\mathbf{tol}>0.0$.

7: $\mathbf{init}$ – Integer Input

On entry: indicates whether you wish to supply an initial mesh and approximate solution ($\mathbf{init}=1$) or whether default values are to be used, ($\mathbf{init}=0$).

Constraint: $\mathbf{init}=0$ or $1$.

8: $\mathbf{x}\left(\mathbf{mnp}\right)$ – Real (Kind=nag_wp) array Input/Output

On entry: you must set $\mathbf{x}\left(1\right)=a$ and $\mathbf{x}\left(\mathbf{np}\right)=b$. If $\mathbf{init}=0$ on entry a default equispaced mesh will be used, otherwise you must specify a mesh by setting $\mathbf{x}\left(\mathit{i}\right)=x_{\mathit{i}}$, for $\mathit{i}=2,3,\dots ,\mathbf{np}-1$.

Constraints:

• if $\mathbf{init}=0$, $\mathbf{x}\left(1\right)<\mathbf{x}\left(\mathbf{np}\right)$;
• if $\mathbf{init}=1$, $\mathbf{x}\left(1\right)<\mathbf{x}\left(2\right)<\cdots <\mathbf{x}\left(\mathbf{np}\right)$.

On exit: $\mathbf{x}\left(1\right),\mathbf{x}\left(2\right),\dots ,\mathbf{x}\left(\mathbf{np}\right)$ define the final mesh (with the returned value of np) and $\mathbf{x}\left(1\right)=a$ and $\mathbf{x}\left(\mathbf{np}\right)=b$.

9: $\mathbf{y}(\mathbf{ldy},\mathbf{mnp})$ – Real (Kind=nag_wp) array Input/Output

On entry: if $\mathbf{init}=0$, y need not be set.

If $\mathbf{init}=1$, the array y must contain an initial approximation to the solution such that $\mathbf{y}(j,i)$ contains an approximation to

$$y_j\left(x_i\right)\text{, \hspace{1em}}i=1,2,\dots ,\mathbf{np}\text{ and }j=1,2,\dots ,n\text{.}$$

On exit: the approximate solution $z_j\left(x_i\right)$ satisfying (5) on the final mesh, that is

$$\mathbf{y}(j,i)=z_j\left(x_i\right)\text{, \hspace{1em}}i=1,2,\dots ,\mathbf{np}\text{ and }j=1,2,\dots ,n\text{,}$$

where np is the number of points in the final mesh. If an error has occurred then y contains the latest approximation to the solution. The remaining columns of y are not used.

10: $\mathbf{ldy}$ – Integer Input

On entry: the first dimension of the array y as declared in the (sub)program from which d02raf is called.

Constraint: $\mathbf{ldy}\ge \mathbf{n}$.

11: $\mathbf{abt}\left(\mathbf{n}\right)$ – Real (Kind=nag_wp) array Output

On exit: $\mathbf{abt}\left(\mathit{i}\right)$, for $\mathit{i}=1,2,\dots ,n$, holds the largest estimated error (in magnitude) of the $i$th component of the solution over all mesh points.

12: $\mathbf{fcn}$ – Subroutine, supplied by the user. External Procedure

fcn must evaluate the functions $f_i$ (i.e., the derivatives $y_i^{\prime }$) at a general point $x$ for a given value of $\epsilon$, the continuation parameter (see Section 3).

The specification of fcn is:

Fortran Interface copy

Subroutine fcn ( x, eps, y, f, n) Integer, Intent (In) :: n Real (Kind=nag_wp), Intent (In) :: x, eps, y(n) Real (Kind=nag_wp), Intent (Out) :: f(n)

C Header Interface copy

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

C++ Header Interface copy

#include <nag.h> extern "C" { void  fcn (const double &x, const double &eps, const double y[], double f[], const Integer &n) }

1: $\mathbf{x}$ – Real (Kind=nag_wp) Input

On entry: $x$, the value of the independent variable.

2: $\mathbf{eps}$ – Real (Kind=nag_wp) Input

On entry: $\epsilon$, the value of the continuation parameter. This is $1$ if continuation is not being used.

3: $\mathbf{y}\left(\mathbf{n}\right)$ – Real (Kind=nag_wp) array Input

On entry: $y_{\mathit{i}}$, for $\mathit{i}=1,2,\dots ,\mathit{n}$, the values of the dependent variables at $x$.

4: $\mathbf{f}\left(\mathbf{n}\right)$ – Real (Kind=nag_wp) array Output

On exit: the values of the derivatives $f_{\mathit{i}}$ evaluated at $x$ given $\epsilon$, for $\mathit{i}=1,2,\dots ,\mathit{n}$.

5: $\mathbf{n}$ – Integer Input

On entry: $n$, the number of equations.

fcn must either be a module subprogram USEd by, or declared as EXTERNAL in, the (sub)program from which d02raf 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 d02raf. If your code inadvertently does return any NaNs or infinities, d02raf is likely to produce unexpected results.

13: $\mathbf{g}$ – Subroutine, supplied by the user. External Procedure

g must evaluate the boundary conditions in equation (3) and place them in the array bc.

The specification of g is:

Fortran Interface copy

Subroutine g ( eps, ya, yb, bc, n) Integer, Intent (In) :: n Real (Kind=nag_wp), Intent (In) :: eps, ya(n), yb(n) Real (Kind=nag_wp), Intent (Out) :: bc(n)

C Header Interface copy

void  g (const double *eps, const double ya[], const double yb[], double bc[], const Integer *n)

C++ Header Interface copy

#include <nag.h> extern "C" { void  g (const double &eps, const double ya[], const double yb[], double bc[], const Integer &n) }

1: $\mathbf{eps}$ – Real (Kind=nag_wp) Input

On entry: $\epsilon$, the value of the continuation parameter. This is $1$ if continuation is not being used.

2: $\mathbf{ya}\left(\mathbf{n}\right)$ – Real (Kind=nag_wp) array Input

On entry: the value $y_{\mathit{i}}\left(a\right)$, for $\mathit{i}=1,2,\dots ,n$.

3: $\mathbf{yb}\left(\mathbf{n}\right)$ – Real (Kind=nag_wp) array Input

On entry: the value $y_{\mathit{i}}\left(b\right)$, for $\mathit{i}=1,2,\dots ,n$.

4: $\mathbf{bc}\left(\mathbf{n}\right)$ – Real (Kind=nag_wp) array Output

On exit: the values $g_{\mathit{i}}(y\left(a\right),y\left(b\right),\epsilon )$, for $\mathit{i}=1,2,\dots ,n$. These must be ordered as follows:

1. (i)first, the conditions involving only $y\left(a\right)$ (see numbeg);
2. (ii)next, the nummix coupled conditions involving both $y\left(a\right)$ and $y\left(b\right)$ (see nummix); and,
3. (iii)finally, the conditions involving only $y\left(b\right)$ ($\mathbf{n}-\mathbf{numbeg}-\mathbf{nummix}$).

5: $\mathbf{n}$ – Integer Input

On entry: $\mathit{n}$, the number of equations.

g must either be a module subprogram USEd by, or declared as EXTERNAL in, the (sub)program from which d02raf 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 d02raf. If your code inadvertently does return any NaNs or infinities, d02raf is likely to produce unexpected results.

14: $\mathbf{ijac}$ – Integer Input

On entry: indicates whether or not you are supplying Jacobian evaluation routines.

$\mathbf{ijac}\ne 0$

You must supply jacobf and jacobg and also, when continuation is used, jaceps and jacgep.

$\mathbf{ijac}=0$

Numerical differentiation is used to calculate the Jacobian and the routines d02gaw, d02gax, d02gay and d02gaz respectively may be used as the dummy arguments.

15: $\mathbf{jacobf}$ – Subroutine, supplied by the NAG Library or the user. External Procedure

jacobf evaluates the Jacobian $\left(\frac{\partial f_{\mathit{i}}}{\partial y_{\mathit{j}}}\right)$, for $\mathit{i}=1,2,\dots ,n$ and $\mathit{j}=1,2,\dots ,n$, given $x$ and $y_{\mathit{j}}$, for $\mathit{j}=1,2,\dots ,n$.

If $\mathbf{ijac}=0$, numerical differentiation is used to calculate the Jacobian and the routine d02gaz may be substituted for this argument.

The specification of jacobf is:

Fortran Interface copy

Subroutine jacobf ( x, eps, y, f, n) Integer, Intent (In) :: n Real (Kind=nag_wp), Intent (In) :: x, eps, y(n) Real (Kind=nag_wp), Intent (Out) :: f(n,n)

C Header Interface copy

void  jacobf (const double *x, const double *eps, const double y[], double f[], const Integer *n)

C++ Header Interface copy

#include <nag.h> extern "C" { void  jacobf (const double &x, const double &eps, const double y[], double f[], const Integer &n) }

1: $\mathbf{x}$ – Real (Kind=nag_wp) Input

On entry: $x$, the value of the independent variable.

2: $\mathbf{eps}$ – Real (Kind=nag_wp) Input

On entry: $\epsilon$, the value of the continuation parameter. This is $1$ if continuation is not being used.

3: $\mathbf{y}\left(\mathbf{n}\right)$ – Real (Kind=nag_wp) array Input

On entry: $y_{\mathit{i}}$, for $\mathit{i}=1,2,\dots ,\mathit{n}$, the values of the dependent variables at $x$.

4: $\mathbf{f}(\mathbf{n},\mathbf{n})$ – Real (Kind=nag_wp) array Output

On exit: $\mathbf{f}(\mathit{j},\mathit{i})$ must be set to the value of $\frac{\partial f_{\mathit{i}}}{\partial y_{\mathit{j}}}$, evaluated at the point $(x,y)$, for $\mathit{i}=1,2,\dots ,n$ and $\mathit{j}=1,2,\dots ,n$.

5: $\mathbf{n}$ – Integer Input

On entry: $\mathit{n}$, the number of equations.

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

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

16: $\mathbf{jacobg}$ – Subroutine, supplied by the NAG Library or the user. External Procedure

jacobg evaluates the Jacobians $\left(\frac{\partial g_i}{\partial y_j\left(a\right)}\right)$ and $\left(\frac{\partial g_i}{\partial y_j\left(b\right)}\right)$. The ordering of the rows of aj and bj must correspond to the ordering of the boundary conditions described in the specification of g.

If $\mathbf{ijac}=0$, numerical differentiation is used to calculate the Jacobian and the routine d02gay may be substituted for this argument.

The specification of jacobg is:

Fortran Interface copy

Subroutine jacobg ( eps, ya, yb, aj, bj, n) Integer, Intent (In) :: n Real (Kind=nag_wp), Intent (In) :: eps, ya(n), yb(n) Real (Kind=nag_wp), Intent (Out) :: aj(n,n), bj(n,n)

C Header Interface copy

void  jacobg (const double *eps, const double ya[], const double yb[], double aj[], double bj[], const Integer *n)

C++ Header Interface copy

#include <nag.h> extern "C" { void  jacobg (const double &eps, const double ya[], const double yb[], double aj[], double bj[], const Integer &n) }

1: $\mathbf{eps}$ – Real (Kind=nag_wp) Input

On entry: $\epsilon$, the value of the continuation parameter. This is $1$ if continuation is not being used.

2: $\mathbf{ya}\left(\mathbf{n}\right)$ – Real (Kind=nag_wp) array Input

On entry: the value $y_{\mathit{i}}\left(a\right)$, for $\mathit{i}=1,2,\dots ,n$.

3: $\mathbf{yb}\left(\mathbf{n}\right)$ – Real (Kind=nag_wp) array Input

On entry: the value $y_{\mathit{i}}\left(b\right)$, for $\mathit{i}=1,2,\dots ,n$.

4: $\mathbf{aj}(\mathbf{n},\mathbf{n})$ – Real (Kind=nag_wp) array Output

On exit: $\mathbf{aj}(\mathit{i},\mathit{j})$ must be set to the value $\frac{\partial g_{\mathit{i}}}{\partial y_{\mathit{j}}\left(a\right)}$, for $\mathit{i}=1,2,\dots ,n$ and $\mathit{j}=1,2,\dots ,n$.

5: $\mathbf{bj}(\mathbf{n},\mathbf{n})$ – Real (Kind=nag_wp) array Output

On exit: $\mathbf{bj}(\mathit{i},\mathit{j})$ must be set to the value $\frac{\partial g_{\mathit{i}}}{\partial y_{\mathit{j}}\left(b\right)}$, for $\mathit{i}=1,2,\dots ,n$ and $\mathit{j}=1,2,\dots ,n$.

6: $\mathbf{n}$ – Integer Input

On entry: $\mathit{n}$, the number of equations.

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

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

17: $\mathbf{deleps}$ – Real (Kind=nag_wp) Input/Output

On entry: must be given a value which specifies whether continuation is required. If $\mathbf{deleps}\le 0.0$ or $\mathbf{deleps}\ge 1.0$ then it is assumed that continuation is not required. If $0.0<\mathbf{deleps}<1.0$ then it is assumed that continuation is required unless $\mathbf{deleps}<\sqrt{\mathit{machine precision}}$ when an error exit is taken. deleps is used as the increment ${\epsilon }_2-{\epsilon }_1$ (see (4)) and the choice $\mathbf{deleps}=0.1$ is recommended.

On exit: an overestimate of the increment ${\epsilon }_p-{\epsilon }_{p-1}$ (in fact the value of the increment which would have been tried if the restriction ${\epsilon }_p=1$ had not been imposed). If continuation was not requested then $\mathbf{deleps}=0.0$.

If continuation is not requested then jaceps and jacgep may each be replaced by dummy actual arguments in the call to d02raf. (d02gaw and d02gax respectively may be used as the dummy arguments.)

18: $\mathbf{jaceps}$ – Subroutine, supplied by the NAG Library or the user. External Procedure

jaceps evaluates the derivative $\frac{\partial f_i}{\partial \epsilon }$ given $x$ and $y$ if continuation is being used.

If all Jacobians (derivatives) are to be approximated internally by numerical differentiation, or continuation is not being used, the routine d02gaw may be substituted for this argument.

The specification of jaceps is:

Fortran Interface copy

Subroutine jaceps ( x, eps, y, f, n) Integer, Intent (In) :: n Real (Kind=nag_wp), Intent (In) :: x, eps, y(n) Real (Kind=nag_wp), Intent (Out) :: f(n)

C Header Interface copy

void  jaceps (const double *x, const double *eps, const double y[], double f[], const Integer *n)

C++ Header Interface copy

#include <nag.h> extern "C" { void  jaceps (const double &x, const double &eps, const double y[], double f[], const Integer &n) }

1: $\mathbf{x}$ – Real (Kind=nag_wp) Input

On entry: $x$, the value of the independent variable.

2: $\mathbf{eps}$ – Real (Kind=nag_wp) Input

On entry: $\epsilon$, the value of the continuation parameter.

3: $\mathbf{y}\left(\mathbf{n}\right)$ – Real (Kind=nag_wp) array Input

On entry: the solution values $y_{\mathit{i}}$, for $\mathit{i}=1,2,\dots ,n$, at the point $x$.

4: $\mathbf{f}\left(\mathbf{n}\right)$ – Real (Kind=nag_wp) array Output

On exit: $\mathbf{f}\left(\mathit{i}\right)$ must contain the value $\frac{\partial f_{\mathit{i}}}{\partial \epsilon }$ at the point $(x,y)$, for $\mathit{i}=1,2,\dots ,n$.

5: $\mathbf{n}$ – Integer Input

On entry: $\mathit{n}$, the number of equations.

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

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

19: $\mathbf{jacgep}$ – Subroutine, supplied by the NAG Library or the user. External Procedure

jacgep evaluates the derivatives $\frac{\partial g_i}{\partial \epsilon }$ if continuation is being used.

If all Jacobians (derivatives) are to be approximated internally by numerical differentiation, or continuation is not being used, the routine d02gax may be substituted for this argument.

The specification of jacgep is:

Fortran Interface copy

Subroutine jacgep ( eps, ya, yb, bcep, n) Integer, Intent (In) :: n Real (Kind=nag_wp), Intent (In) :: eps, ya(n), yb(n) Real (Kind=nag_wp), Intent (Out) :: bcep(n)

C Header Interface copy

void  jacgep (const double *eps, const double ya[], const double yb[], double bcep[], const Integer *n)

C++ Header Interface copy

#include <nag.h> extern "C" { void  jacgep (const double &eps, const double ya[], const double yb[], double bcep[], const Integer &n) }

1: $\mathbf{eps}$ – Real (Kind=nag_wp) Input

On entry: $\epsilon$, the value of the continuation parameter.

2: $\mathbf{ya}\left(\mathbf{n}\right)$ – Real (Kind=nag_wp) array Input

On entry: the value of $y_{\mathit{i}}\left(a\right)$, for $\mathit{i}=1,2,\dots ,n$.

3: $\mathbf{yb}\left(\mathbf{n}\right)$ – Real (Kind=nag_wp) array Input

On entry: the value of $y_{\mathit{i}}\left(b\right)$, for $\mathit{i}=1,2,\dots ,n$.

4: $\mathbf{bcep}\left(\mathbf{n}\right)$ – Real (Kind=nag_wp) array Output

On exit: $\mathbf{bcep}\left(\mathit{i}\right)$ must contain the value of $\frac{\partial g_{\mathit{i}}}{\partial \epsilon }$, for $\mathit{i}=1,2,\dots ,n$.

5: $\mathbf{n}$ – Integer Input

On entry: $\mathit{n}$, the number of equations.

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

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

20: $\mathbf{work}\left(\mathbf{lwork}\right)$ – Real (Kind=nag_wp) array Workspace

21: $\mathbf{lwork}$ – Integer Input

On entry: the dimension of the array work as declared in the (sub)program from which d02raf is called.

Constraint: $\mathbf{lwork}\ge \mathbf{mnp}\times (3{\mathbf{n}}^2+6\mathbf{n}+2)+4{\mathbf{n}}^2+3\mathbf{n}$.

22: $\mathbf{iwork}\left(\mathbf{liwork}\right)$ – Integer array Workspace

23: $\mathbf{liwork}$ – Integer Input

On entry: the dimension of the array iwork as declared in the (sub)program from which d02raf is called.

Constraints:

• if $\mathbf{ijac}\ne 0$, $\mathbf{liwork}\ge \mathbf{mnp}\times (2\times \mathbf{n}+1)+\mathbf{n}$;
• if $\mathbf{ijac}=0$, $\mathbf{liwork}\ge \mathbf{mnp}\times (2\times \mathbf{n}+1)+{\mathbf{n}}^2+4\times \mathbf{n}+2$.

24: $\mathbf{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
$\phantom{00}0$	halted	No	No
$\phantom{00}1$	continue	No	No
$\phantom{0}10$	halted	Yes	No
$\phantom{0}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$ or $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 $\mathbf{1}$, $\mathbf{11}$, $\mathbf{101}$ or $\mathbf{111}$ is used it is essential to test the value of ifail on exit.

On exit: $\mathbf{ifail}=\mathbf{0}$ unless the routine detects an error or a warning has been flagged (see Section 6).

6 Error Indicators and Warnings

$\mathbf{ifail}=1$

On entry, $\mathbf{liwork}=⟨\mathit{\text{value}}⟩$.
Constraint: $\mathbf{liwork}\ge ⟨\mathit{\text{value}}⟩$.

On entry, $\mathbf{lwork}=⟨\mathit{\text{value}}⟩$.
Constraint: $\mathbf{lwork}\ge \max (\mathbf{np},32)\times (3\times {\mathbf{n}}^2+6\times \mathbf{n}+2)+4\times {\mathbf{n}}^2+3\times \mathbf{n}$; that is, $⟨\mathit{\text{value}}⟩$.

On entry, $\mathbf{mnp}=⟨\mathit{\text{value}}⟩$.
Constraint: $\mathbf{mnp}\ge 32$.

On entry, $\mathbf{n}=⟨\mathit{\text{value}}⟩$.
Constraint: $\mathbf{n}\ge 1$.

On entry, $\mathbf{np}=⟨\mathit{\text{value}}⟩$.
Constraint: $\mathbf{np}\ge 4$.

On entry, $\mathbf{np}=⟨\mathit{\text{value}}⟩$ and $\mathbf{mnp}=⟨\mathit{\text{value}}⟩$.
Constraint: $\mathbf{np}\le \mathbf{mnp}$.

On entry, $\mathbf{numbeg}=⟨\mathit{\text{value}}⟩$, $\mathbf{nummix}=⟨\mathit{\text{value}}⟩$ and $\mathbf{n}=⟨\mathit{\text{value}}⟩$.
Constraint: $\mathbf{numbeg}+\mathbf{nummix}\le \mathbf{n}$.

On entry, $\mathbf{numbeg}=⟨\mathit{\text{value}}⟩$.
Constraint: $\mathbf{numbeg}\ge 0$.

On entry, $\mathbf{numbeg}=⟨\mathit{\text{value}}⟩$ and $\mathbf{n}=⟨\mathit{\text{value}}⟩$.
Constraint: $\mathbf{numbeg}<\mathbf{n}$.

On entry, $\mathbf{nummix}=⟨\mathit{\text{value}}⟩$.
Constraint: $\mathbf{nummix}\ge 0$.

On entry, $\mathbf{tol}=⟨\mathit{\text{value}}⟩$.
Constraint: $\mathbf{tol}>0.0$.

On entry, $\mathbf{x}\left(1\right)=⟨\mathit{\text{value}}⟩$ and $\mathbf{x}\left(\mathbf{np}\right)=⟨\mathit{\text{value}}⟩$.
Constraint: $\mathbf{x}\left(1\right)<\mathbf{x}\left(\mathbf{np}\right)$.

On entry the mesh points are not in strictly ascending order.
For $i=⟨\mathit{\text{value}}⟩$, mesh point $i=⟨\mathit{\text{value}}⟩$, but mesh point $i+1=⟨\mathit{\text{value}}⟩$.

$\mathbf{ifail}=2$

A finer mesh is required for the accuracy requested; that is, $\mathbf{mnp}=⟨\mathit{\text{value}}⟩$ is not large enough.

$\mathbf{ifail}=3$

The Newton iteration has failed to converge.
This could be due to there being too few points in the initial mesh or to the initial approximate solution being too inaccurate.
If this latter reason is suspected or you cannot make changes to prevent this error, you should use the routine with a continuation facility instead.

$\mathbf{ifail}=4$

Newton iteration has reached round-off level.
If desired accuracy has not been reached, tol is too small for this problem and this machine precision.

$\mathbf{ifail}=5$

The Jacobian for the boundary conditions is singular.
This may occur due to faulty coding of the Jacobian or, in some circumstances, to a zero initial choice of approximate solution.

$\mathbf{ifail}=6$

There is no dependence on the continuation parameter when continuation is being used. This can be due to faulty coding of derivatives with respect to the continuation parameter or to a zero initial choice of approximate solution.

$\mathbf{ifail}=7$

The continuation step is required to be less than machine precision for continuation to proceed. It is likely that either the problem has no solution for some value of the continuation parameter near the current value or that the problem is so difficult that even with continuation it is unlikely to be solved using this routine. In the latter case using more mesh points initially may help.

$\mathbf{ifail}=8$

A serious error occurred in a call to the internal integrator.
The error code internally was $⟨\mathit{\text{value}}⟩$.
Please contact NAG.

$\mathbf{ifail}=9$

A continuation error occurred, but continuation is not being used.
Please contact NAG.

$\mathbf{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.

$\mathbf{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.

$\mathbf{ifail}=-999$

Dynamic memory allocation failed.

See Section 9 in the Introduction to the NAG Library FL Interface for further information.

7 Accuracy

8 Parallelism and Performance

9 Further Comments

10 Example

10.1 Program Text

10.2 Program Data

10.3 Program Results