d03psf integrates a system of linear or nonlinear convection-diffusion equations in one space dimension, with optional source terms and scope for coupled ordinary differential equations (ODEs). The system must be posed in conservative form. This routine also includes the option of automatic adaptive spatial remeshing. Convection terms are discretized using a sophisticated upwind scheme involving a user-supplied numerical flux function based on the solution of a Riemann problem at each mesh point. The method of lines is employed to reduce the partial differential equations (PDEs) to a system of ODEs, and the resulting system is solved using a backward differentiation formula (BDF) method or a Theta method.

2 Specification

Fortran Interface

Subroutine d03psf (

npde, ts, tout, pdedef, numflx, bndary, uvinit, u, npts, x, nv, odedef, nxi, xi, neqn, rtol, atol, itol, norm, laopt, algopt, remesh, nxfix, xfix, nrmesh, dxmesh, trmesh, ipminf, xratio, con, monitf, rsave, lrsave, isave, lisave, itask, itrace, ind, ifail)

Integer, Intent (In)	::	npde, npts, nv, nxi, neqn, itol, nxfix, nrmesh, ipminf, lrsave, lisave, itask, itrace
Integer, Intent (Inout)	::	isave(lisave), ind, ifail
Real (Kind=nag_wp), Intent (In)	::	tout, xi(nxi), rtol(), atol(), algopt(30), xfix(nxfix), dxmesh, trmesh, xratio, con
Real (Kind=nag_wp), Intent (Inout)	::	ts, u(neqn), x(npts), rsave(lrsave)
Logical, Intent (In)	::	remesh
Character (1), Intent (In)	::	norm, laopt
External	::	pdedef, numflx, bndary, uvinit, odedef, monitf

C Header Interface

#include <nag.h>

void

d03psf_ (const Integer *npde, double *ts, const double *tout,
void (NAG_CALL *pdedef)(const Integer *npde, const double *t, const double *x, const double u[], const double ux[], const Integer *nv, const double v[], const double vdot[], double p[], double c[], double d[], double s[], Integer *ires),
void (NAG_CALL *numflx)(const Integer *npde, const double *t, const double *x, const Integer *nv, const double v[], const double uleft[], const double uright[], double flux[], Integer *ires),
void (NAG_CALL *bndary)(const Integer *npde, const Integer *npts, const double *t, const double x[], const double u[], const Integer *nv, const double v[], const double vdot[], const Integer *ibnd, double g[], Integer *ires),
void (NAG_CALL *uvinit)(const Integer *npde, const Integer *npts, const Integer *nxi, const double x[], const double xi[], double u[], const Integer *nv, double v[]),
double u[], const Integer *npts, double x[], const Integer *nv,
void (NAG_CALL *odedef)(const Integer *npde, const double *t, const Integer *nv, const double v[], const double vdot[], const Integer *nxi, const double xi[], const double ucp[], const double ucpx[], const double ucpt[], double r[], Integer *ires),
const Integer *nxi, const double xi[], const Integer *neqn, const double rtol[], const double atol[], const Integer *itol, const char *norm, const char *laopt, const double algopt[], const logical *remesh, const Integer *nxfix, const double xfix[], const Integer *nrmesh, const double *dxmesh, const double *trmesh, const Integer *ipminf, const double *xratio, const double *con,
void (NAG_CALL *monitf)(const double *t, const Integer *npts, const Integer *npde, const double x[], const double u[], double fmon[]),
double rsave[], const Integer *lrsave, Integer isave[], const Integer *lisave, const Integer *itask, const Integer *itrace, Integer *ind, Integer *ifail, const Charlen length_norm, const Charlen length_laopt)

C++ Header Interface

#include <nag.h>

extern "C" {

void

d03psf_ (const Integer &npde, double &ts, const double &tout,
void (NAG_CALL *pdedef)(const Integer &npde, const double &t, const double &x, const double u[], const double ux[], const Integer &nv, const double v[], const double vdot[], double p[], double c[], double d[], double s[], Integer &ires),
void (NAG_CALL *numflx)(const Integer &npde, const double &t, const double &x, const Integer &nv, const double v[], const double uleft[], const double uright[], double flux[], Integer &ires),
void (NAG_CALL *bndary)(const Integer &npde, const Integer &npts, const double &t, const double x[], const double u[], const Integer &nv, const double v[], const double vdot[], const Integer &ibnd, double g[], Integer &ires),
void (NAG_CALL *uvinit)(const Integer &npde, const Integer &npts, const Integer &nxi, const double x[], const double xi[], double u[], const Integer &nv, double v[]),
double u[], const Integer &npts, double x[], const Integer &nv,
void (NAG_CALL *odedef)(const Integer &npde, const double &t, const Integer &nv, const double v[], const double vdot[], const Integer &nxi, const double xi[], const double ucp[], const double ucpx[], const double ucpt[], double r[], Integer &ires),
const Integer &nxi, const double xi[], const Integer &neqn, const double rtol[], const double atol[], const Integer &itol, const char *norm, const char *laopt, const double algopt[], const logical &remesh, const Integer &nxfix, const double xfix[], const Integer &nrmesh, const double &dxmesh, const double &trmesh, const Integer &ipminf, const double &xratio, const double &con,
void (NAG_CALL *monitf)(const double &t, const Integer &npts, const Integer &npde, const double x[], const double u[], double fmon[]),
double rsave[], const Integer &lrsave, Integer isave[], const Integer &lisave, const Integer &itask, const Integer &itrace, Integer &ind, Integer &ifail, const Charlen length_norm, const Charlen length_laopt)

}

The routine may be called by the names d03psf or nagf_pde_dim1_parab_convdiff_remesh.

3 Description

d03psf integrates the system of convection-diffusion equations in conservative form:

\sum_{j = 1}^{npde} P_{i, j} \frac{\partial U_{j}}{\partial t} + \frac{\partial F_{i}}{\partial x} = C_{i} \frac{\partial D_{i}}{\partial x} + S_{i},

(1)

or the hyperbolic convection-only system:

\frac{\partial U_{i}}{\partial t} + \frac{\partial F_{i}}{\partial x} = 0,

(2)

for

i = 1, 2, \dots, npde

a \leq x \leq b

t \geq t_{0}

, where the vector

U

is the set of PDE solution values

U (x, t) = {[U_{1} (x, t), \dots, U_{npde} (x, t)]}^{T} .

The optional coupled ODEs are of the general form

R_{i} (t, V, \dot{V}, ξ, U^{*}, U_{x}^{*}, U_{t}^{*}) = 0, i = 1, 2, \dots, nv,

(3)

where the vector

V

is the set of ODE solution values

V (t) = {[V_{1} (t), \dots, V_{nv} (t)]}^{T},

\dot{V}

denotes its derivative with respect to time, and

U_{x}

is the spatial derivative of

U

In (2),

P_{i, j}

F_{i}

and

C_{i}

depend on

x

t

U

and

V

;

D_{i}

depends on

x

t

U

U_{x}

and

V

; and

S_{i}

depends on

x

t

U

V

and linearly on

\dot{V}

. Note that

P_{i, j}

F_{i}

C_{i}

and

S_{i}

must not depend on any space derivatives, and

P_{i, j}

F_{i}

C_{i}

and

D_{i}

must not depend on any time derivatives. In terms of conservation laws,

F_{i}

\frac{C_{i} \partial D_{i}}{\partial x}

and

S_{i}

are the convective flux, diffusion and source terms respectively.

In (3),

ξ

represents a vector of

n_{ξ}

spatial coupling points at which the ODEs are coupled to the PDEs. These points may or may not be equal to PDE spatial mesh points.

U^{*}

U_{x}^{*}

and

U_{t}^{*}

are the functions

U

U_{x}

and

U_{t}

evaluated at these coupling points. Each

R_{i}

may depend only linearly on time derivatives. Hence (3) may be written more precisely as

R = L - M \dot{V} - N U_{t}^{*},

(4)

where

R = {[R_{1}, \dots, R_{nv}]}^{T}

L

is a vector of length nv,

M

is an nv by nv matrix,

N

is an nv by

(n_{ξ} \times npde)

matrix and the entries in

L

M

and

N

may depend on

t

ξ

U^{*}

U_{x}^{*}

and

V

. In practice you only need to supply a vector of information to define the ODEs and not the matrices

L

M

and

N

. (See Section 5 for the specification of odedef.)

The integration in time is from

t_{0}

t_{out}

, over the space interval

a \leq x \leq b

, where

a = x_{1}

and

b = x_{npts}

are the leftmost and rightmost points of a user-defined mesh

x_{1}, x_{2}, \dots, x_{npts}

defined initially by you and (possibly) adapted automatically during the integration according to user-specified criteria.

The initial

(t = t_{0})

values of the functions

U (x, t)

and

V (t)

must be specified in uvinit. Note that uvinit will be called again following any initial remeshing, and so

U (x, t_{0})

should be specified for all values of

x

in the interval

a \leq x \leq b

, and not just the initial mesh points.

The PDEs are approximated by a system of ODEs in time for the values of

U_{i}

at mesh points using a spatial discretization method similar to the central-difference scheme used in d03pcf/d03pca, d03phf/d03pha and d03ppf/d03ppa, but with the flux

F_{i}

replaced by a numerical flux, which is a representation of the flux taking into account the direction of the flow of information at that point (i.e., the direction of the characteristics). Simple central differencing of the numerical flux then becomes a sophisticated upwind scheme in which the correct direction of upwinding is automatically achieved.

The numerical flux,

{\hat{F}}_{i}

say, must be calculated by you in terms of the left and right values of the solution vector

U

(denoted by

U_{L}

and

U_{R}

respectively), at each mid-point of the mesh

x_{j - \frac{1}{2}} = (x_{j - 1} + x_{j}) / 2

, for

j = 2, 3, \dots, npts

. The left and right values are calculated by d03psf from two adjacent mesh points using a standard upwind technique combined with a Van Leer slope-limiter (see LeVeque (1990)). The physically correct value for

{\hat{F}}_{i}

is derived from the solution of the Riemann problem given by

\frac{\partial U_{i}}{\partial t} + \frac{\partial F_{i}}{\partial y} = 0,

(5)

where

y = x - x_{j - \frac{1}{2}}

, i.e.,

y = 0

corresponds to

x = x_{j - \frac{1}{2}}

, with discontinuous initial values

U = U_{L}

for

y < 0

and

U = U_{R}

for

y > 0

, using an approximate Riemann solver. This applies for either of the systems (1) or (2); the numerical flux is independent of the functions

P_{i, j}

C_{i}

D_{i}

and

S_{i}

. A description of several approximate Riemann solvers can be found in LeVeque (1990) and Berzins et al. (1989). Roe's scheme (see Roe (1981)) is perhaps the easiest to understand and use, and a brief summary follows. Consider the system of PDEs

U_{t} + F_{x} = 0

or equivalently

U_{t} + A U_{x} = 0

. Provided the system is linear in

U

, i.e., the Jacobian matrix

A

does not depend on

U

, the numerical flux

\hat{F}

is given by

\hat{F} = \frac{1}{2} (F_{L} + F_{R}) - \frac{1}{2} \sum_{k = 1}^{npde} α_{k} | λ_{k} | e_{k},

(6)

where

F_{L}

(

F_{R}

) is the flux

F

calculated at the left (right) value of

U

, denoted by

U_{L}

(

U_{R}

); the

λ_{k}

are the eigenvalues of

A

; the

e_{k}

are the right eigenvectors of

A

; and the

α_{k}

are defined by

U_{R} - U_{L} = \sum_{k = 1}^{npde} α_{k} e_{k} .

(7)

Examples are given in the documents for d03pff and d03plf.

If the system is nonlinear, Roe's scheme requires that a linearized Jacobian is found (see Roe (1981)).

The functions

P_{i, j}

C_{i}

D_{i}

and

S_{i}

(but not

F_{i}

) must be specified in pdedef. The numerical flux

{\hat{F}}_{i}

must be supplied in numflx. For problems in the form (2), the actual argument d03plp may be used for pdedef. d03plp is included in the NAG Library and sets the matrix with entries

P_{i, j}

to the identity matrix, and the functions

C_{i}

D_{i}

and

S_{i}

to zero.

For second-order problems, i.e., diffusion terms are present, a boundary condition is required for each PDE at both boundaries for the problem to be well-posed. If there are no diffusion terms present, then the continuous PDE problem generally requires exactly one boundary condition for each PDE, that is npde boundary conditions in total. However, in common with most discretization schemes for first-order problems, a numerical boundary condition is required at the other boundary for each PDE. In order to be consistent with the characteristic directions of the PDE system, the numerical boundary conditions must be derived from the solution inside the domain in some manner (see below). You must supply both types of boundary conditions, i.e., a total of npde conditions at each boundary point.

The position of each boundary condition should be chosen with care. In simple terms, if information is flowing into the domain then a physical boundary condition is required at that boundary, and a numerical boundary condition is required at the other boundary. In many cases the boundary conditions are simple, e.g., for the linear advection equation. In general you should calculate the characteristics of the PDE system and specify a physical boundary condition for each of the characteristic variables associated with incoming characteristics, and a numerical boundary condition for each outgoing characteristic.

A common way of providing numerical boundary conditions is to extrapolate the characteristic variables from the inside of the domain (note that when using banded matrix algebra the fixed bandwidth means that only linear extrapolation is allowed, i.e., using information at just two interior points adjacent to the boundary). For problems in which the solution is known to be uniform (in space) towards a boundary during the period of integration then extrapolation is unnecessary; the numerical boundary condition can be supplied as the known solution at the boundary. Another method of supplying numerical boundary conditions involves the solution of the characteristic equations associated with the outgoing characteristics. Examples of both methods can be found in the documents for d03pff and d03plf.

The boundary conditions must be specified in bndary in the form

G_{i}^{L} (x, t, U, V, \dot{V}) = 0 at ​ x = a, i = 1, 2, \dots, npde,

(8)

at the left-hand boundary, and

G_{i}^{R} (x, t, U, V, \dot{V}) = 0 at ​ x = b, i = 1, 2, \dots, npde,

(9)

at the right-hand boundary.

Note that spatial derivatives at the boundary are not passed explicitly to bndary, but they can be calculated using values of

U

at and adjacent to the boundaries if required. However, it should be noted that instabilities may occur if such one-sided differencing opposes the characteristic direction at the boundary.

The algebraic-differential equation system which is defined by the functions

R_{i}

must be specified in odedef. You must also specify the coupling points

ξ

(if any) in the array xi.

In total there are

npde \times npts + nv

ODEs in the time direction. This system is then integrated forwards in time using a BDF or Theta method, optionally switching between Newton's method and functional iteration (see Berzins et al. (1989) and the references therein).

The adaptive space remeshing can be used to generate meshes that automatically follow the changing time-dependent nature of the solution, generally resulting in a more efficient and accurate solution using fewer mesh points than may be necessary with a fixed uniform or non-uniform mesh. Problems with travelling wavefronts or variable-width boundary layers for example will benefit from using a moving adaptive mesh. The discrete time-step method used here (developed by Furzeland (1984)) automatically creates a new mesh based on the current solution profile at certain time-steps, and the solution is then interpolated onto the new mesh and the integration continues.

The method requires you to supply a monitf which specifies in an analytical or numerical form the particular aspect of the solution behaviour you wish to track. This so-called monitor function is used by the routine to choose a mesh which equally distributes the integral of the monitor function over the domain. A typical choice of monitor function is the second space derivative of the solution value at each point (or some combination of the second space derivatives if there is more than one solution component), which results in refinement in regions where the solution gradient is changing most rapidly.

You must specify the frequency of mesh updates together with certain other criteria such as adjacent mesh ratios. Remeshing can be expensive and you are encouraged to experiment with the different options in order to achieve an efficient solution which adequately tracks the desired features of the solution.

Note that unless the monitor function for the initial solution values is zero at all user-specified initial mesh points, a new initial mesh is calculated and adopted according to the user-specified remeshing criteria. uvinit will then be called again to determine the initial solution values at the new mesh points (there is no interpolation at this stage) and the integration proceeds.

The problem is subject to the following restrictions:

(i)In (1), ${\dot{V}}_{j} (t)$ , for $j = 1, 2, \dots, nv$ , may only appear linearly in the functions $S_{i}$ , for $i = 1, 2, \dots, npde$ , with a similar restriction for $G_{i}^{L}$ and $G_{i}^{R}$ ;
(ii) $P_{i, j}$ , $F_{i}$ , $C_{i}$ and $S_{i}$ must not depend on any space derivatives; and $P_{i, j}$ , $C_{i}$ , $D_{i}$ and $F_{i}$ must not depend on any time derivatives;
(iii) $t_{0} < t_{out}$ , so that integration is in the forward direction;
(iv)The evaluation of the terms $P_{i, j}$ , $C_{i}$ , $D_{i}$ and $S_{i}$ is done by calling the pdedef at a point approximately midway between each pair of mesh points in turn. Any discontinuities in these functions must, therefore, be at one or more of the fixed mesh points specified by xfix;
(v)At least one of the functions $P_{i, j}$ must be nonzero so that there is a time derivative present in the PDE problem.

For further details of the scheme, see Pennington and Berzins (1994) and the references therein.

4 References

Berzins M, Dew P M and Furzeland R M (1989) Developing software for time-dependent problems using the method of lines and differential-algebraic integrators Appl. Numer. Math. 5 375–397

Furzeland R M (1984) The construction of adaptive space meshes TNER.85.022 Thornton Research Centre, Chester

Hirsch C (1990) Numerical Computation of Internal and External Flows, Volume 2: Computational Methods for Inviscid and Viscous Flows John Wiley

LeVeque R J (1990) Numerical Methods for Conservation Laws Birkhäuser Verlag

Pennington S V and Berzins M (1994) New NAG Library software for first-order partial differential equations ACM Trans. Math. Softw. 20 63–99

Roe P L (1981) Approximate Riemann solvers, parameter vectors, and difference schemes J. Comput. Phys. 43 357–372

5 Arguments

1: $npde$ – Integer Input

On entry: the number of PDEs to be solved.

Constraint:

npde \geq 1

2: $ts$ – Real (Kind=nag_wp) Input/Output

On entry: the initial value of the independent variable

t

On exit: the value of

t

corresponding to the solution values in u. Normally

ts = tout

Constraint:

ts < tout

3: $tout$ – Real (Kind=nag_wp) Input

On entry: the final value of

t

to which the integration is to be carried out.

4: $pdedef$ – Subroutine, supplied by the NAG Library or the user. External Procedure

pdedef must evaluate the functions

P_{i, j}

C_{i}

D_{i}

and

S_{i}

which partially define the system of PDEs.

P_{i, j}

and

C_{i}

may depend on

x

t

U

and

V

;

D_{i}

may depend on

x

t

U

U_{x}

and

V

; and

S_{i}

may depend on

x

t

U

V

and linearly on

\dot{V}

. pdedef is called approximately midway between each pair of mesh points in turn by d03psf. The actual argument d03plp may be used for pdedef for problems in the form (2). (d03plp is included in the NAG Library.)

The specification of pdedef is:

Fortran Interface

Subroutine pdedef (

npde, t, x, u, ux, nv, v, vdot, p, c, d, s, ires)

Integer, Intent (In)	::	npde, nv
Integer, Intent (Inout)	::	ires
Real (Kind=nag_wp), Intent (In)	::	t, x, u(npde), ux(npde), v(nv), vdot(nv)
Real (Kind=nag_wp), Intent (Out)	::	p(npde,npde), c(npde), d(npde), s(npde)

C Header Interface

void	pdedef (const Integer npde, const double t, const double x, const double u[], const double ux[], const Integer nv, const double v[], const double vdot[], double p[], double c[], double d[], double s[], Integer *ires)

1: $npde$ – Integer Input

On entry: the number of PDEs in the system.

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

On entry: the current value of the independent variable

t

3: $x$ – Real (Kind=nag_wp) Input

On entry: the current value of the space variable

x

4: $u (npde)$ – Real (Kind=nag_wp) array Input

On entry:

u (i)

contains the value of the component

U_{i} (x, t)

, for

i = 1, 2, \dots, npde

5: $ux (npde)$ – Real (Kind=nag_wp) array Input

On entry:

ux (i)

contains the value of the component

\frac{\partial U_{i} (x, t)}{\partial x}

, for

i = 1, 2, \dots, npde

6: $nv$ – Integer Input

On entry: the number of coupled ODEs in the system.

7: $v (nv)$ – Real (Kind=nag_wp) array Input

On entry: if

nv > 0

v (i)

contains the value of the component

V_{i} (t)

, for

i = 1, 2, \dots, nv

8: $vdot (nv)$ – Real (Kind=nag_wp) array Input

On entry: if

nv > 0

vdot (i)

contains the value of component

{\dot{V}}_{i} (t)

, for

i = 1, 2, \dots, nv

Note:

{\dot{V}}_{i} (t)

, for

i = 1, 2, \dots, nv

, may only appear linearly in

S_{j}

, for

j = 1, 2, \dots, npde

9: $p (npde, npde)$ – Real (Kind=nag_wp) array Output

On exit:

p (i, j)

must be set to the value of

P_{i, j} (x, t, U, V)

, for

i = 1, 2, \dots, npde

and

j = 1, 2, \dots, npde

10: $c (npde)$ – Real (Kind=nag_wp) array Output

On exit:

c (i)

must be set to the value of

C_{i} (x, t, U, V)

, for

i = 1, 2, \dots, npde

11: $d (npde)$ – Real (Kind=nag_wp) array Output

On exit:

d (i)

must be set to the value of

D_{i} (x, t, U, U_{x}, V)

, for

i = 1, 2, \dots, npde

12: $s (npde)$ – Real (Kind=nag_wp) array Output

On exit:

s (i)

must be set to the value of

S_{i} (x, t, U, V, \dot{V})

, for

i = 1, 2, \dots, npde

13: $ires$ – Integer Input/Output

On entry: set to

−1

1

On exit: should usually remain unchanged. However, you may set ires to force the integration routine to take certain actions as described below:

$ires = 2$: Indicates to the integrator that control should be passed back immediately to the calling (sub)routine with the error indicator set to $ifail = 6$ .
$ires = 3$: Indicates to the integrator that the current time step should be abandoned and a smaller time step used instead. You may wish to set $ires = 3$ when a physically meaningless input or output value has been generated. If you consecutively set $ires = 3$ , d03psf returns to the calling subroutine with the error indicator set to $ifail = 4$ .

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

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

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

numflx must supply the numerical flux for each PDE given the left and right values of the solution vector

u

. numflx is called approximately midway between each pair of mesh points in turn by d03psf.

The specification of numflx is:

Fortran Interface

Subroutine numflx (

npde, t, x, nv, v, uleft, uright, flux, ires)

Integer, Intent (In)	::	npde, nv
Integer, Intent (Inout)	::	ires
Real (Kind=nag_wp), Intent (In)	::	t, x, v(nv), uleft(npde), uright(npde)
Real (Kind=nag_wp), Intent (Out)	::	flux(npde)

C Header Interface

void	numflx (const Integer npde, const double t, const double x, const Integer nv, const double v[], const double uleft[], const double uright[], double flux[], Integer *ires)

1: $npde$ – Integer Input

On entry: the number of PDEs in the system.

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

On entry: the current value of the independent variable

t

3: $x$ – Real (Kind=nag_wp) Input

On entry: the current value of the space variable

x

4: $nv$ – Integer Input

On entry: the number of coupled ODEs in the system.

5: $v (nv)$ – Real (Kind=nag_wp) array Input

On entry: if

nv > 0

v (i)

contains the value of the component

V_{i} (t)

, for

i = 1, 2, \dots, nv

6: $uleft (npde)$ – Real (Kind=nag_wp) array Input

On entry:

uleft (i)

contains the left value of the component

U_{i} (x)

, for

i = 1, 2, \dots, npde

7: $uright (npde)$ – Real (Kind=nag_wp) array Input

On entry:

uright (i)

contains the right value of the component

U_{i} (x)

, for

i = 1, 2, \dots, npde

8: $flux (npde)$ – Real (Kind=nag_wp) array Output

On exit:

flux (i)

must be set to the numerical flux

{\hat{F}}_{i}

, for

i = 1, 2, \dots, npde

9: $ires$ – Integer Input/Output

On entry: set to

−1

1

On exit: should usually remain unchanged. However, you may set ires to force the integration routine to take certain actions as described below:

$ires = 2$: Indicates to the integrator that control should be passed back immediately to the calling (sub)routine with the error indicator set to $ifail = 6$ .
$ires = 3$: Indicates to the integrator that the current time step should be abandoned and a smaller time step used instead. You may wish to set $ires = 3$ when a physically meaningless input or output value has been generated. If you consecutively set $ires = 3$ , d03psf returns to the calling subroutine with the error indicator set to $ifail = 4$ .

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

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

6: $bndary$ – Subroutine, supplied by the user. External Procedure

bndary must evaluate the functions

G_{i}^{L}

and

G_{i}^{R}

which describe the physical and numerical boundary conditions, as given by (8) and (9).

The specification of bndary is:

Fortran Interface

Subroutine bndary (

npde, npts, t, x, u, nv, v, vdot, ibnd, g, ires)

Integer, Intent (In)	::	npde, npts, nv, ibnd
Integer, Intent (Inout)	::	ires
Real (Kind=nag_wp), Intent (In)	::	t, x(npts), u(npde,npts), v(nv), vdot(nv)
Real (Kind=nag_wp), Intent (Out)	::	g(npde)

C Header Interface

void	bndary (const Integer npde, const Integer npts, const double t, const double x[], const double u[], const Integer nv, const double v[], const double vdot[], const Integer ibnd, double g[], Integer ires)

1: $npde$ – Integer Input

On entry: the number of PDEs in the system.

2: $npts$ – Integer Input

On entry: the number of mesh points in the interval

[a, b]

3: $t$ – Real (Kind=nag_wp) Input

On entry: the current value of the independent variable

t

4: $x (npts)$ – Real (Kind=nag_wp) array Input

On entry: the mesh points in the spatial direction.

x (1)

corresponds to the left-hand boundary,

a

, and

x (npts)

corresponds to the right-hand boundary,

b

5: $u (npde, npts)$ – Real (Kind=nag_wp) array Input

On entry:

u (i, j)

contains the value of the component

U_{i} (x, t)

x = x (j)

, for

i = 1, 2, \dots, npde

and

j = 1, 2, \dots, npts

Note: if banded matrix algebra is to be used then the functions

G_{i}^{L}

and

G_{i}^{R}

may depend on the value of

U_{i} (x, t)

at the boundary point and the two adjacent points only.

6: $nv$ – Integer Input

On entry: the number of coupled ODEs in the system.

7: $v (nv)$ – Real (Kind=nag_wp) array Input

On entry: if

nv > 0

v (i)

contains the value of the component

V_{i} (t)

, for

i = 1, 2, \dots, nv

8: $vdot (nv)$ – Real (Kind=nag_wp) array Input

On entry: if

nv > 0

vdot (i)

contains the value of component

{\dot{V}}_{i} (t)

, for

i = 1, 2, \dots, nv

Note:

{\dot{V}}_{i} (t)

, for

i = 1, 2, \dots, nv

, may only appear linearly in

G_{j}^{L}

and

G_{j}^{R}

, for

j = 1, 2, \dots, npde

9: $ibnd$ – Integer Input

On entry: specifies which boundary conditions are to be evaluated.

$ibnd = 0$: bndary must evaluate the left-hand boundary condition at $x = a$ .
$ibnd \neq 0$: bndary must evaluate the right-hand boundary condition at $x = b$ .

10: $g (npde)$ – Real (Kind=nag_wp) array Output

On exit:

g (i)

must contain the

i

th component of either

G_{i}^{L}

G_{i}^{R}

in (8) and (9), depending on the value of ibnd, for

i = 1, 2, \dots, npde

11: $ires$ – Integer Input/Output

On entry: set to

−1

1

On exit: should usually remain unchanged. However, you may set ires to force the integration routine to take certain actions as described below:

$ires = 2$: Indicates to the integrator that control should be passed back immediately to the calling (sub)routine with the error indicator set to $ifail = 6$ .
$ires = 3$: Indicates to the integrator that the current time step should be abandoned and a smaller time step used instead. You may wish to set $ires = 3$ when a physically meaningless input or output value has been generated. If you consecutively set $ires = 3$ , d03psf returns to the calling subroutine with the error indicator set to $ifail = 4$ .

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

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

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

uvinit must supply the initial

(t = t_{0})

values of

U (x, t)

and

V (t)

for all values of

x

in the interval

a \leq x \leq b

The specification of uvinit is:

Fortran Interface

Subroutine uvinit (

npde, npts, nxi, x, xi, u, nv, v)

Integer, Intent (In)	::	npde, npts, nxi, nv
Real (Kind=nag_wp), Intent (In)	::	x(npts), xi(nxi)
Real (Kind=nag_wp), Intent (Out)	::	u(npde,npts), v(nv)

C Header Interface

void	uvinit (const Integer npde, const Integer npts, const Integer nxi, const double x[], const double xi[], double u[], const Integer nv, double v[])

1: $npde$ – Integer Input: On entry: the number of PDEs in the system.
2: $npts$ – Integer Input: On entry: the number of mesh points in the interval [ $a, b$ ].
3: $nxi$ – Integer Input: On entry: the number of ODE/PDE coupling points.
4: $x (npts)$ – Real (Kind=nag_wp) array Input: On entry: the current mesh. $x (i)$ contains the value of $x_{i}$ , for $i = 1, 2, \dots, npts$ .
5: $xi (nxi)$ – Real (Kind=nag_wp) array Input: On entry: if $nxi > 0$ , $xi (i)$ contains the ODE/PDE coupling point, $ξ_{i}$ , for $i = 1, 2, \dots, nxi$ .
6: $u (npde, npts)$ – Real (Kind=nag_wp) array Output: On exit: $u (i, j)$ contains the value of the component $U_{i} (x_{j}, t_{0})$ , for $i = 1, 2, \dots, npde$ and $j = 1, 2, \dots, npts$ .
7: $nv$ – Integer Input: On entry: the number of coupled ODEs in the system.
8: $v (nv)$ – Real (Kind=nag_wp) array Output: On exit: if $nv > 0$ , $v (i)$ must contain the value of component $V_{i} (t_{0})$ , for $i = 1, 2, \dots, nv$ .

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

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

8: $u (neqn)$ – Real (Kind=nag_wp) array Input/Output

On entry: if

ind = 1

the value of u must be unchanged from the previous call.

On exit: the computed solution

U_{i} (x_{j}, t)

, for

i = 1, 2, \dots, npde

and

j = 1, 2, \dots, npts

, and

V_{k} (t)

, for

k = 1, 2, \dots, nv

, evaluated at

t = ts

, as follows:

$u (npde \times (j - 1) + i)$ contain $U_{i} (x_{j}, t)$ , for $i = 1, 2, \dots, npde$ and $j = 1, 2, \dots, npts$ , and
$u (npts \times npde + i)$ contain $V_{i} (t)$ , for $i = 1, 2, \dots, nv$ .

9: $npts$ – Integer Input

On entry: the number of mesh points in the interval

[a, b]

Constraint:

npts \geq 3

10: $x (npts)$ – Real (Kind=nag_wp) array Input/Output

On entry: the mesh points in the space direction.

x (1)

must specify the left-hand boundary,

a

, and

x (npts)

must specify the right-hand boundary,

b

Constraint:

x (1) < x (2) < \dots < x (npts)

On exit: the final values of the mesh points.

11: $nv$ – Integer Input

On entry: the number of coupled ODE components.

Constraint:

nv \geq 0

12: $odedef$ – Subroutine, supplied by the NAG Library or the user. External Procedure

odedef must evaluate the functions

R

, which define the system of ODEs, as given in (4).

If you wish to compute the solution of a system of PDEs only (i.e.,

nv = 0

), odedef must be the dummy routine d03pek. (d03pek is included in the NAG Library.)

The specification of odedef is:

Fortran Interface

Subroutine odedef (

npde, t, nv, v, vdot, nxi, xi, ucp, ucpx, ucpt, r, ires)

Integer, Intent (In)	::	npde, nv, nxi
Integer, Intent (Inout)	::	ires
Real (Kind=nag_wp), Intent (In)	::	t, v(nv), vdot(nv), xi(nxi), ucp(npde,nxi), ucpx(npde,nxi), ucpt(npde,nxi)
Real (Kind=nag_wp), Intent (Out)	::	r(nv)

C Header Interface

void	odedef (const Integer npde, const double t, const Integer nv, const double v[], const double vdot[], const Integer nxi, const double xi[], const double ucp[], const double ucpx[], const double ucpt[], double r[], Integer *ires)

1: $npde$ – Integer Input

On entry: the number of PDEs in the system.

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

On entry: the current value of the independent variable

t

3: $nv$ – Integer Input

On entry: the number of coupled ODEs in the system.

4: $v (nv)$ – Real (Kind=nag_wp) array Input

On entry: if

nv > 0

v (i)

contains the value of the component

V_{i} (t)

, for

i = 1, 2, \dots, nv

5: $vdot (nv)$ – Real (Kind=nag_wp) array Input

On entry: if

nv > 0

vdot (i)

contains the value of component

{\dot{V}}_{i} (t)

, for

i = 1, 2, \dots, nv

6: $nxi$ – Integer Input

On entry: the number of ODE/PDE coupling points.

7: $xi (nxi)$ – Real (Kind=nag_wp) array Input

On entry: if

nxi > 0

xi (i)

contains the ODE/PDE coupling point,

ξ_{i}

, for

i = 1, 2, \dots, nxi

8: $ucp (npde, nxi)$ – Real (Kind=nag_wp) array Input

On entry: if

nxi > 0

ucp (i, j)

contains the value of

U_{i} (x, t)

at the coupling point

x = ξ_{j}

, for

i = 1, 2, \dots, npde

and

j = 1, 2, \dots, nxi

9: $ucpx (npde, nxi)$ – Real (Kind=nag_wp) array Input

On entry: if

nxi > 0

ucpx (i, j)

contains the value of

\frac{\partial U_{i} (x, t)}{\partial x}

at the coupling point

x = ξ_{j}

, for

i = 1, 2, \dots, npde

and

j = 1, 2, \dots, nxi

10: $ucpt (npde, nxi)$ – Real (Kind=nag_wp) array Input

On entry: if

nxi > 0

ucpt (i, j)

contains the value of

\frac{\partial U_{i}}{\partial t}

at the coupling point

x = ξ_{j}

, for

i = 1, 2, \dots, npde

and

j = 1, 2, \dots, nxi

11: $r (nv)$ – Real (Kind=nag_wp) array Output

On exit:

r (i)

must contain the

i

th component of

R

, for

i = 1, 2, \dots, nv

, where

R

is defined as

R = L - M \dot{V} - N U_{t}^{*},

(10)

R = - M \dot{V} - N U_{t}^{*} .

(11)

The definition of

R

is determined by the input value of ires.

12: $ires$ – Integer Input/Output

On entry: the form of

R

that must be returned in the array r.

$ires = 1$: Equation (10) must be used.
$ires = −1$: Equation (11) must be used.

On exit: should usually remain unchanged. However, you may reset ires to force the integration routine to take certain actions, as described below:

$ires = 2$: Indicates to the integrator that control should be passed back immediately to the calling (sub)routine with the error indicator set to $ifail = 6$ .
$ires = 3$: Indicates to the integrator that the current time step should be abandoned and a smaller time step used instead. You may wish to set $ires = 3$ when a physically meaningless input or output value has been generated. If you consecutively set $ires = 3$ , d03psf returns to the calling subroutine with the error indicator set to $ifail = 4$ .

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

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

13: $nxi$ – Integer Input

On entry: the number of ODE/PDE coupling points.

Constraints:

if $nv = 0$ , $nxi = 0$ ;
if $nv > 0$ , $nxi \geq 0$ .

14: $xi (nxi)$ – Real (Kind=nag_wp) array Input

On entry: if

nxi > 0

xi (i)

, for

i = 1, 2, \dots, nxi

, must be set to the ODE/PDE coupling points.

Constraint:

x (1) \leq xi (1) < xi (2) < \dots < xi (nxi) \leq x (npts)

15: $neqn$ – Integer Input

On entry: the number of ODEs in the time direction.

Constraint:

neqn = npde \times npts + nv

16: $rtol (*)$ – Real (Kind=nag_wp) array Input

Note: the dimension of the array rtol must be at least

1

itol = 1

2

and at least

neqn

itol = 3

4

On entry: the relative local error tolerance.

Constraint:

rtol (i) \geq 0.0

for all relevant

i

17: $atol (*)$ – Real (Kind=nag_wp) array Input

Note: the dimension of the array atol must be at least

1

itol = 1

3

and at least

neqn

itol = 2

4

On entry: the absolute local error tolerance.

Constraint:

atol (i) \geq 0.0

for all relevant

i

Note: corresponding elements of rtol and atol cannot both be

0.0

18: $itol$ – Integer Input

On entry: a value to indicate the form of the local error test. If

e_{i}

is the estimated local error for

u (i)

, for

i = 1, 2, \dots, neqn

, and

‖ ‖

, denotes the norm, the error test to be satisfied is

‖ e_{i} ‖ < 1.0

. itol indicates to d03psf whether to interpret either or both of rtol and atol as a vector or scalar in the formation of the weights

w_{i}

used in the calculation of the norm (see the description of norm):

itol	rtol	atol	$w_{i}$
1	scalar	scalar	$rtol (1) \times \| u (i) \| + atol (1)$
2	scalar	vector	$rtol (1) \times \| u (i) \| + atol (i)$
3	vector	scalar	$rtol (i) \times \| u (i) \| + atol (1)$
4	vector	vector	$rtol (i) \times \| u (i) \| + atol (i)$

Constraint:

itol = 1

2

3

4

19: $norm$ – Character(1) Input

On entry: the type of norm to be used.

$norm ='1'$: Averaged $L_{1}$ norm.
$norm ='2'$: Averaged $L_{2}$ norm.

U_{norm}

denotes the norm of the vector u of length neqn, then for the averaged

L_{1}

norm

U_{norm} = \frac{1}{neqn} \sum_{i = 1}^{neqn} u (i) / w_{i},

and for the averaged

L_{2}

norm

U_{norm} = \sqrt{\frac{1}{neqn} \sum_{i = 1}^{neqn} {(u (i) / w_{i})}^{2}},

See the description of itol for the formulation of the weight vector

w

Constraint:

norm ='1'

'2'

20: $laopt$ – Character(1) Input

On entry: the type of matrix algebra required.

$laopt ='F'$: Full matrix methods to be used.
$laopt ='B'$: Banded matrix methods to be used.
$laopt ='S'$: Sparse matrix methods to be used.

Constraint:

laopt ='F'

'B'

'S'

Note: you are recommended to use the banded option when no coupled ODEs are present (

nv = 0

). Also, the banded option should not be used if the boundary conditions involve solution components at points other than the boundary and the immediately adjacent two points.

21: $algopt (30)$ – Real (Kind=nag_wp) array Input

On entry: may be set to control various options available in the integrator. If you wish to employ all the default options,

algopt (1)

should be set to

0.0

. Default values will also be used for any other elements of algopt set to zero. The permissible values, default values, and meanings are as follows:

$algopt (1)$: Selects the ODE integration method to be used. If $algopt (1) = 1.0$ , a BDF method is used and if $algopt (1) = 2.0$ , a Theta method is used. The default is $algopt (1) = 1.0$ .

algopt (1) = 2.0

, then

algopt (i)

, for

i = 2, 3, 4

, are not used.

$algopt (2)$: Specifies the maximum order of the BDF integration formula to be used. $algopt (2)$ may be $1.0$ , $2.0$ , $3.0$ , $4.0$ or $5.0$ . The default value is $algopt (2) = 5.0$ .
$algopt (3)$: Specifies what method is to be used to solve the system of nonlinear equations arising on each step of the BDF method. If $algopt (3) = 1.0$ a modified Newton iteration is used and if $algopt (3) = 2.0$ a functional iteration method is used. If functional iteration is selected and the integrator encounters difficulty, there is an automatic switch to the modified Newton iteration. The default value is $algopt (3) = 1.0$ .
$algopt (4)$: Specifies whether or not the Petzold error test is to be employed. The Petzold error test results in extra overhead but is more suitable when algebraic equations are present, such as $P_{i, j} = 0.0$ , for $j = 1, 2, \dots, npde$ , for some $i$ or when there is no ${\dot{V}}_{i} (t)$ dependence in the coupled ODE system. If $algopt (4) = 1.0$ , the Petzold test is used. If $algopt (4) = 2.0$ , the Petzold test is not used. The default value is $algopt (4) = 1.0$ .

algopt (1) = 1.0

algopt (i)

, for

i = 5, 6, 7

, are not used.

$algopt (5)$: Specifies the value of Theta to be used in the Theta integration method. $0.51 \leq algopt (5) \leq 0.99$ . The default value is $algopt (5) = 0.55$ .
$algopt (6)$: Specifies what method is to be used to solve the system of nonlinear equations arising on each step of the Theta method. If $algopt (6) = 1.0$ , a modified Newton iteration is used and if $algopt (6) = 2.0$ , a functional iteration method is used. The default value is $algopt (6) = 1.0$ .
$algopt (7)$: Specifies whether or not the integrator is allowed to switch automatically between modified Newton and functional iteration methods in order to be more efficient. If $algopt (7) = 1.0$ , switching is allowed and if $algopt (7) = 2.0$ , switching is not allowed. The default value is $algopt (7) = 1.0$ .
$algopt (11)$: Specifies a point in the time direction, $t_{crit}$ , beyond which integration must not be attempted. The use of $t_{crit}$ is described under the argument itask. If $algopt (1) \neq 0.0$ , a value of $0.0$ for $algopt (11)$ , say, should be specified even if itask subsequently specifies that $t_{crit}$ will not be used.
$algopt (12)$: Specifies the minimum absolute step size to be allowed in the time integration. If this option is not required, $algopt (12)$ should be set to $0.0$ .
$algopt (13)$: Specifies the maximum absolute step size to be allowed in the time integration. If this option is not required, $algopt (13)$ should be set to $0.0$ .
$algopt (14)$: Specifies the initial step size to be attempted by the integrator. If $algopt (14) = 0.0$ , the initial step size is calculated internally.
$algopt (15)$: Specifies the maximum number of steps to be attempted by the integrator in any one call. If $algopt (15) = 0.0$ , no limit is imposed.
$algopt (23)$: Specifies what method is to be used to solve the nonlinear equations at the initial point to initialize the values of $U$ , $U_{t}$ , $V$ and $\dot{V}$ . If $algopt (23) = 1.0$ , a modified Newton iteration is used and if $algopt (23) = 2.0$ , functional iteration is used. The default value is $algopt (23) = 1.0$ .

algopt (29)

and

algopt (30)

are used only for the sparse matrix algebra option, i.e.,

laopt ='S'

$algopt (29)$: Governs the choice of pivots during the decomposition of the first Jacobian matrix. It should lie in the range $0.0 < algopt (29) < 1.0$ , with smaller values biasing the algorithm towards maintaining sparsity at the expense of numerical stability. If $algopt (29)$ lies outside the range then the default value is used. If the routines regard the Jacobian matrix as numerically singular, increasing $algopt (29)$ towards $1.0$ may help, but at the cost of increased fill-in. The default value is $algopt (29) = 0.1$ .
$algopt (30)$: Used as the relative pivot threshold during subsequent Jacobian decompositions (see $algopt (29)$ ) below which an internal error is invoked. $algopt (30)$ must be greater than zero, otherwise the default value is used. If $algopt (30)$ is greater than $1.0$ no check is made on the pivot size, and this may be a necessary option if the Jacobian matrix is found to be numerically singular (see $algopt (29)$ ). The default value is $algopt (30) = 0.0001$ .

22: $remesh$ – Logical Input

On entry: indicates whether or not spatial remeshing should be performed.

$remesh = .TRUE.$: Indicates that spatial remeshing should be performed as specified.
$remesh = .FALSE.$: Indicates that spatial remeshing should be suppressed.

Note: remesh should not be changed between consecutive calls to d03psf. Remeshing can be switched off or on at specified times by using appropriate values for the arguments nrmesh and trmesh at each call.

23: $nxfix$ – Integer Input

On entry: the number of fixed mesh points.

Constraint:

0 \leq nxfix \leq npts - 2

Note: the end points

x (1)

and

x (npts)

are fixed automatically and hence should not be specified as fixed points.

24: $xfix (nxfix)$ – Real (Kind=nag_wp) array Input

On entry:

xfix (i)

, for

i = 1, 2, \dots, nxfix

, must contain the value of the

x

coordinate at the

i

th fixed mesh point.

Constraints:

$xfix (i) < xfix (i + 1)$ , for $i = 1, 2, \dots, nxfix - 1$ ;
each fixed mesh point must coincide with a user-supplied initial mesh point, that is $xfix (i) = x (j)$ for some $j$ , $2 \leq j \leq npts - 1$ ..

Note: the positions of the fixed mesh points in the array

x (npts)

remain fixed during remeshing, and so the number of mesh points between adjacent fixed points (or between fixed points and end points) does not change. You should take this into account when choosing the initial mesh distribution.

25: $nrmesh$ – Integer Input

On entry: specifies the spatial remeshing frequency and criteria for the calculation and adoption of a new mesh.

$nrmesh < 0$: Indicates that a new mesh is adopted according to the argument dxmesh. The mesh is tested every $| nrmesh |$ timesteps.
$nrmesh = 0$: Indicates that remeshing should take place just once at the end of the first time step reached when $t > trmesh$ .
$nrmesh > 0$: Indicates that remeshing will take place every nrmesh time steps, with no testing using dxmesh.

Note: nrmesh may be changed between consecutive calls to d03psf to give greater flexibility over the times of remeshing.

26: $dxmesh$ – Real (Kind=nag_wp) Input

On entry: determines whether a new mesh is adopted when nrmesh is set less than zero. A possible new mesh is calculated at the end of every

| nrmesh |

time steps, but is adopted only if

x_{i}^{new} > x_{i}^{old} + dxmesh \times (x_{i + 1}^{old} - x_{i}^{old})

x_{i}^{new} < x_{i}^{old} - dxmesh \times (x_{i}^{old} - x_{i - 1}^{old})

dxmesh thus imposes a lower limit on the difference between one mesh and the next.

Constraint:

dxmesh \geq 0.0

27: $trmesh$ – Real (Kind=nag_wp) Input

On entry: specifies when remeshing will take place when nrmesh is set to zero. Remeshing will occur just once at the end of the first time step reached when

t

is greater than trmesh.

Note: trmesh may be changed between consecutive calls to d03psf to force remeshing at several specified times.

28: $ipminf$ – Integer Input

On entry: the level of trace information regarding the adaptive remeshing. Details are directed to the current advisory message unit (see x04abf).

$ipminf = 0$: No trace information.
$ipminf = 1$: Brief summary of mesh characteristics.
$ipminf = 2$: More detailed information, including old and new mesh points, mesh sizes and monitor function values.

Constraint:

ipminf = 0

1

2

29: $xratio$ – Real (Kind=nag_wp) Input

On entry: an input bound on the adjacent mesh ratio (greater than

1.0

and typically in the range

1.5

3.0

). The remeshing routines will attempt to ensure that

(x_{i} - x_{i - 1}) / xratio < x_{i + 1} - x_{i} < xratio \times (x_{i} - x_{i - 1}) .

Suggested value:

xratio = 1.5

Constraint:

xratio > 1.0

30: $con$ – Real (Kind=nag_wp) Input

On entry: an input bound on the sub-integral of the monitor function

F^{mon} (x)

over each space step. The remeshing routines will attempt to ensure that

\int_{x_{i}}^{x_{i + 1}} F^{mon} (x) d x \leq con \int_{x_{1}}^{x_{npts}} F^{mon} (x) d x,

(see Furzeland (1984)). con gives you more control over the mesh distribution, e.g., decreasing con allows more clustering. A typical value is

2.0 / (npts - 1)

, but you are encouraged to experiment with different values. Its value is not critical and the mesh should be qualitatively correct for all values in the range given below.

Suggested value:

con = 2.0

/ (npts - 1)

Constraint:

0.1 / (npts - 1) \leq con \leq 10.0 / (npts - 1)

31: $monitf$ – Subroutine, supplied by the NAG Library or the user. External Procedure

monitf must supply and evaluate a remesh monitor function to indicate the solution behaviour of interest.

If you specify

remesh = .FALSE.

, i.e., no remeshing, monitf will not be called and the dummy routine d03pel may be used for monitf. (d03pel is included in the NAG Library.)

The specification of monitf is:

Fortran Interface

Subroutine monitf (

t, npts, npde, x, u, fmon)

Integer, Intent (In)	::	npts, npde
Real (Kind=nag_wp), Intent (In)	::	t, x(npts), u(npde,npts)
Real (Kind=nag_wp), Intent (Out)	::	fmon(npts)

C Header Interface

void	monitf (const double t, const Integer npts, const Integer *npde, const double x[], const double u[], double fmon[])

1: $t$ – Real (Kind=nag_wp) Input: On entry: the current value of the independent variable $t$ .
2: $npts$ – Integer Input: On entry: the number of mesh points in the interval $[a, b]$ .
3: $npde$ – Integer Input: On entry: the number of PDEs in the system.
4: $x (npts)$ – Real (Kind=nag_wp) array Input: On entry: the current mesh. $x (i)$ contains the value of $x_{i}$ , for $i = 1, 2, \dots, npts$ .
5: $u (npde, npts)$ – Real (Kind=nag_wp) array Input: On entry: $u (i, j)$ contains the value of $U_{i} (x, t)$ at $x = x (j)$ and time $t$ , for $i = 1, 2, \dots, npde$ and $j = 1, 2, \dots, npts$ .
6: $fmon (npts)$ – Real (Kind=nag_wp) array Output: On exit: $fmon (i)$ must contain the value of the monitor function $F^{mon} (x)$ at mesh point $x = x (i)$ .

Constraint: $fmon (i) \geq 0.0$ .

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

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

32: $rsave (lrsave)$ – Real (Kind=nag_wp) array Communication Array

ind = 0

, rsave need not be set on entry.

ind = 1

, rsave must be unchanged from the previous call to the routine because it contains required information about the iteration.

33: $lrsave$ – Integer Input

On entry: the dimension of the array rsave as declared in the (sub)program from which d03psf is called. Its size depends on the type of matrix algebra selected.

laopt ='F'

lrsave \geq neqn \times neqn + neqn + nwkres + lenode

laopt ='B'

lrsave \geq (3 mlu + 1) \times neqn + nwkres + lenode

laopt ='S'

lrsave \geq 4 neqn + 11 neqn / 2 + 1 + nwkres + lenode

Where

mlu

is the lower or upper half bandwidths such that

for PDE problems only (no coupled ODEs),: $mlu = 3 npde - 1;$
for coupled PDE/ODE problems,: $mlu = neqn - 1 .$

Where

nwkres

is defined by

if $nv > 0 and nxi > 0$ ,: $nwkres = npde (2 npts + 6 nxi + 3 npde + 26) + nxi + nv + 7 npts + nxfix + 1;$
if $nv > 0 and nxi = 0$ ,: $nwkres = npde (2 npts + 3 npde + 32) + nv + 7 npts + nxfix + 2;$
if $nv = 0$ ,: $nwkres = npde (2 npts + 3 npde + 32) + 7 npts + nxfix + 3 .$

Where

lenode

is defined by

if the BDF method is used,: $lenode = (6 + int (algopt (2))) \times neqn + 50;$
if the Theta method is used,: $lenode = 9 neqn + 50 .$

Note: when

laopt ='S'

, the value of lrsave may be too small when supplied to the integrator. An estimate of the minimum size of lrsave is printed on the current error message unit if

itrace > 0

and the routine returns with

ifail = 15

34: $isave (lisave)$ – Integer array Communication Array

ind = 0

, isave need not be set.

ind = 1

, isave must be unchanged from the previous call to the routine because it contains required information about the iteration. In particular the following components of the array isave concern the efficiency of the integration:

$isave (1)$: Contains the number of steps taken in time.
$isave (2)$: Contains the number of residual evaluations of the resulting ODE system used. One such evaluation involves evaluating the PDE functions at all the mesh points, as well as one evaluation of the functions in the boundary conditions.
$isave (3)$: Contains the number of Jacobian evaluations performed by the time integrator.
$isave (4)$: Contains the order of the BDF method last used in the time integration, if applicable. When the Theta method is used, $isave (4)$ contains no useful information.
$isave (5)$: Contains the number of Newton iterations performed by the time integrator. Each iteration involves residual evaluation of the resulting ODE system followed by a back-substitution using the $L U$ decomposition of the Jacobian matrix.

35: $lisave$ – Integer Input

On entry: the dimension of the array isave as declared in the (sub)program from which d03psf is called. Its size depends on the type of matrix algebra selected:

if $laopt ='F'$ , $lisave \geq 25$ ;
if $laopt ='B'$ , $lisave \geq neqn + nxfix + 25$ ;
if $laopt ='S'$ , $lisave \geq 25 \times neqn + nxfix + 25$ .

Note: when using the sparse option, the value of lisave may be too small when supplied to the integrator. An estimate of the minimum size of lisave is printed on the current error message unit if

itrace > 0

and the routine returns with

ifail = 15

36: $itask$ – Integer Input

On entry: the task to be performed by the ODE integrator.

$itask = 1$: Normal computation of output values u at $t = tout$ (by overshooting and interpolating).
$itask = 2$: Take one step in the time direction and return.
$itask = 3$: Stop at first internal integration point at or beyond $t = tout$ .
$itask = 4$: Normal computation of output values u at $t = tout$ but without overshooting $t = t_{crit}$ where $t_{crit}$ is described under the argument algopt.
$itask = 5$: Take one step in the time direction and return, without passing $t_{crit}$ , where $t_{crit}$ is described under the argument algopt.

Constraint:

itask = 1

2

3

4

5

37: $itrace$ – Integer Input

On entry: the level of trace information required from d03psf and the underlying ODE solver. itrace may take the value

−1

0

1

2

3

$itrace = −1$: No output is generated.
$itrace = 0$: Only warning messages from the PDE solver are printed on the current error message unit (see x04aaf).
$itrace > 0$: Output from the underlying ODE solver is printed on the current advisory message unit (see x04abf). This output contains details of Jacobian entries, the nonlinear iteration and the time integration during the computation of the ODE system.

itrace < −1

−1

is assumed and similarly if

itrace > 3

3

is assumed.

The advisory messages are given in greater detail as itrace increases. You are advised to set

itrace = 0

, unless you are experienced with Sub-chapter D02M–N.

38: $ind$ – Integer Input/Output

On entry: indicates whether this is a continuation call or a new integration.

$ind = 0$: Starts or restarts the integration in time.
$ind = 1$: Continues the integration after an earlier exit from the routine. In this case, only the arguments tout, ifail, nrmesh and trmesh may be reset between calls to d03psf.

Constraint:

ind = 0

1

On exit:

ind = 1

39: $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, at least one point in xi lies outside $[x (1), x (npts)]$ : $x (1) = ⟨ value ⟩$ and $x (npts) = ⟨ value ⟩$ .

On entry, $con = ⟨ value ⟩$ , $npts = ⟨ value ⟩$ .
Constraint: $con \leq 10.0 / (npts - 1)$ .

On entry, $con = ⟨ value ⟩$ , $npts = ⟨ value ⟩$ .
Constraint: $con \geq 0.1 / (npts - 1)$ .

On entry, $dxmesh = ⟨ value ⟩$ .
Constraint: $dxmesh \geq 0.0$ .

On entry, $i = ⟨ value ⟩$ , $xfix (i + 1) = ⟨ value ⟩$ and $xfix (i) = ⟨ value ⟩$ .
Constraint: $xfix (i + 1) > xfix (i)$ .

On entry, $i = ⟨ value ⟩$ , $x (i) = ⟨ value ⟩$ , $j = ⟨ value ⟩$ and $x (j) = ⟨ value ⟩$ .
Constraint: $x (1) < x (2) < \dots < x (npts)$ .

On entry, $i = ⟨ value ⟩$ , $xi (i + 1) = ⟨ value ⟩$ and $xi (i) = ⟨ value ⟩$ .
Constraint: $xi (i + 1) > xi (i)$ .

On entry, $i = ⟨ value ⟩$ and $atol (i) = ⟨ value ⟩$ .
Constraint: $atol (i) \geq 0.0$ .

On entry, $i = ⟨ value ⟩$ and $j = ⟨ value ⟩$ .
Constraint: corresponding elements $atol (i)$ and $rtol (j)$ cannot both be $0.0$ .

On entry, $i = ⟨ value ⟩$ and $rtol (i) = ⟨ value ⟩$ .
Constraint: $rtol (i) \geq 0.0$ .

On entry, $ind = ⟨ value ⟩$ .
Constraint: $ind = 0$ or $1$ .

On entry, $ipminf = ⟨ value ⟩$ .
Constraint: $ipminf = 0$ , $1$ or $2$ .

On entry, $itask = ⟨ value ⟩$ .
Constraint: $itask = 1$ , $2$ , $3$ , $4$ or $5$ .

On entry, $itol = ⟨ value ⟩$ .
Constraint: $itol = 1$ , $2$ , $3$ or $4$ .

On entry, $laopt = ⟨ value ⟩$ .
Constraint: $laopt ='F'$ , $'B'$ or $'S'$ .

On entry, $lisave = ⟨ value ⟩$ .
Constraint: $lisave \geq ⟨ value ⟩$ .

On entry, $lrsave = ⟨ value ⟩$ .
Constraint: $lrsave \geq ⟨ value ⟩$ .

On entry, $neqn = ⟨ value ⟩$ , $npde = ⟨ value ⟩$ , $npts = ⟨ value ⟩$ and $nv = ⟨ value ⟩$ .
Constraint: $neqn = npde \times npts + nv$ .

On entry, $norm = ⟨ value ⟩$ .
Constraint: $norm ='1'$ or $'2'$ .

On entry, $npde = ⟨ value ⟩$ .
Constraint: $npde \geq 1$ .

On entry, $npts = ⟨ value ⟩$ .
Constraint: $npts \geq 3$ .

On entry, $nv = ⟨ value ⟩$ .
Constraint: $nv \geq 0$ .

On entry, $nv = ⟨ value ⟩$ and $nxi = ⟨ value ⟩$ .
Constraint: $nxi = 0$ when $nv = 0$ .

On entry, $nv = ⟨ value ⟩$ and $nxi = ⟨ value ⟩$ .
Constraint: $nxi \geq 0$ when $nv > 0$ .

On entry, $nxfix = ⟨ value ⟩$ , $npts = ⟨ value ⟩$ .
Constraint: $nxfix \leq npts - 2$ .

On entry, $nxfix = ⟨ value ⟩$ .
Constraint: $nxfix \geq 0$ .

On entry, on initial entry $ind = 1$ .
Constraint: on initial entry $ind = 0$ .

On entry, the point $xfix (i)$ does not coincide with any $x (j)$ : $i = ⟨ value ⟩$ and $xfix (i) = ⟨ value ⟩$ .

On entry, $tout = ⟨ value ⟩$ and $ts = ⟨ value ⟩$ .
Constraint: $tout > ts$ .

On entry, $tout - ts$ is too small: $tout = ⟨ value ⟩$ and $ts = ⟨ value ⟩$ .

On entry, $xratio = ⟨ value ⟩$ .
Constraint: $xratio > 1.0$ .

$ifail = 2$: Underlying ODE solver cannot make further progress from the point ts with the supplied values of atol and rtol. $ts = ⟨ value ⟩$ .

$ifail = 3$: Repeated errors in an attempted step of underlying ODE solver. Integration was successful as far as ts: $ts = ⟨ value ⟩$ .
In the underlying ODE solver, there were repeated error test failures on an attempted step, before completing the requested task, but the integration was successful as far as $t = ts$ . The problem may have a singularity, or the error requirement may be inappropriate. Incorrect specification of boundary conditions may also result in this error.

$ifail = 4$: In setting up the ODE system an internal auxiliary was unable to initialize the derivative. This could be due to your setting $ires = 3$ in pdedef, numflx, bndary or odedef.

$ifail = 5$: Singular Jacobian of ODE system. Check problem formulation.

$ifail = 6$: In evaluating residual of ODE system, $ires = 2$ has been set in user-supplied subroutines pdedef, numflx, bndary or odedef. Integration is successful as far as ts: $ts = ⟨ value ⟩$ .

$ifail = 7$: atol and rtol were too small to start integration.

$ifail = 8$: ires set to an invalid value in a call to user-supplied subroutines pdedef, numflx, bndary or odedef.

$ifail = 9$: Serious error in internal call to an auxiliary. Increase itrace for further details.

$ifail = 10$: Integration completed, but small changes in atol or rtol are unlikely to result in a changed solution.
The required task has been completed, but it is estimated that a small change in atol and rtol is unlikely to produce any change in the computed solution. (Only applies when you are not operating in one step mode, that is when $itask \neq 2$ or $5$ .)

$ifail = 11$: Error during Jacobian formulation for ODE system. Increase itrace for further details.

$ifail = 12$: In solving ODE system, the maximum number of steps $algopt (15)$ has been exceeded. $algopt (15) = ⟨ value ⟩$ .

$ifail = 13$: Zero error weights encountered during time integration.
Some error weights $w_{i}$ became zero during the time integration (see the description of itol). Pure relative error control ( $atol (i) = 0.0$ ) was requested on a variable (the $i$ th) which has become zero. The integration was successful as far as $t = ts$ .

$ifail = 14$: The functions $P$ , $D$ , or $C$ appear to depend on time derivatives.

$ifail = 15$: When using the sparse option lisave or lrsave is too small: $lisave = ⟨ value ⟩$ , $lrsave = ⟨ value ⟩$ .

$ifail = 16$: remesh has been changed between calls to d03psf.

$ifail = 17$: fmon is negative at one or more mesh points, or zero mesh spacing has been obtained due to a poor monitor function.

$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

d03psf controls the accuracy of the integration in the time direction but not the accuracy of the approximation in space. The spatial accuracy depends on both the number of mesh points and on their distribution in space. In the time integration only the local error over a single step is controlled and so the accuracy over a number of steps cannot be guaranteed. You should, therefore, test the effect of varying the accuracy arguments, atol and rtol.

8 Parallelism and Performance

d03psf 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.

d03psf is threaded by NAG for parallel execution in multithreaded implementations of the NAG Library.

d03psf 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

d03psf is designed to solve systems of PDEs in conservative form, with optional source terms which are independent of space derivatives, and optional second-order diffusion terms. The use of the routine to solve systems which are not naturally in this form is discouraged, and you are advised to use one of the central-difference scheme routines for such problems.

You should be aware of the stability limitations for hyperbolic PDEs. For most problems with small error tolerances the ODE integrator does not attempt unstable time steps, but in some cases a maximum time step should be imposed using

algopt (13)

. It is worth experimenting with this argument, particularly if the integration appears to progress unrealistically fast (with large time steps). Setting the maximum time step to the minimum mesh size is a safe measure, although in some cases this may be too restrictive.

Problems with source terms should be treated with caution, as it is known that for large source terms stable and reasonable looking solutions can be obtained which are in fact incorrect, exhibiting non-physical speeds of propagation of discontinuities (typically one spatial mesh point per time step). It is essential to employ a very fine mesh for problems with source terms and discontinuities, and to check for non-physical propagation speeds by comparing results for different mesh sizes. Further details and an example can be found in Pennington and Berzins (1994).

The time taken depends on the complexity of the system, the accuracy requested, and the frequency of the mesh updates. For a given system with fixed accuracy and mesh-update frequency it is approximately proportional to neqn.

10 Example

For this routine two examples are presented, with a main program and two example problems given in Example 1 (EX1) and Example 2 (EX2).

Example 1 (EX1)

This example is a simple model of the advection and diffusion of a cloud of material:

\frac{\partial U}{\partial t} + W \frac{\partial U}{\partial x} = C \frac{\partial^{2} U}{\partial x^{2}},

for

x \in [0, 1]

and

t \leq 0 \leq 0.3

. In this example the constant wind speed

W = 1

and the diffusion coefficient

C = 0.002

The cloud does not reach the boundaries during the time of integration, and so the two (physical) boundary conditions are simply

U (0, t) = U (1, t) = 0.0

, and the initial condition is

U (x, 0) = \sin (π \frac{x - a}{b - a}), a \leq x \leq b,

and

U (x, 0) = 0

elsewhere, where

a = 0.2

and

b = 0.4

The numerical flux is simply

\hat{F} = W U_{L}

The monitor function for remeshing is taken to be the absolute value of the second derivative of

U

Example 2 (EX2)

This example is a linear advection equation with a nonlinear source term and discontinuous initial profile:

\frac{\partial u}{\partial t} + \frac{\partial u}{\partial x} = - p u (u - 1) (u - \frac{1}{2}),

for

0 \leq x \leq 1

and

t \geq 0

. The discontinuity is modelled by a ramp function of width

0.01

and gradient

100

, so that the exact solution at any time

t \geq 0

u (x, t) = 1.0 + \max (\min (δ, 0), −1),

where

δ = 100 (0.1 - x + t)

. The initial profile is given by the exact solution. The characteristic points into the domain at

x = 0

and out of the domain at

x = 1

, and so a physical boundary condition

u (0, t) = 1

is imposed at

x = 0

, with a numerical boundary condition at

x = 1

which can be specified as

u (1, t) = 0

since the discontinuity does not reach

x = 1

during the time of integration.

The numerical flux is simply

\hat{F} = U_{L}

at all times.

The remeshing monitor function (described below) is chosen to create an increasingly fine mesh towards the discontinuity in order to ensure good resolution of the discontinuity, but without loss of efficiency in the surrounding regions. However, refinement must be limited so that the time step required for stability does not become unrealistically small. The region of refinement must also keep up with the discontinuity as it moves across the domain, and hence it cannot be so small that the discontinuity moves out of the refined region between remeshing.

The above requirements mean that the use of the first or second spatial derivative of

U

for the monitor function is inappropriate; the large relative size of either derivative in the region of the discontinuity leads to extremely small mesh-spacing in a very limited region, and the solution is then far more expensive than for a very fine fixed mesh.

An alternative monitor function based on a cosine function proves very successful. It is only semi-automatic as it requires some knowledge of the solution (for problems without an exact solution an initial approximate solution can be obtained using a coarse fixed mesh). On each call to monitf the discontinuity is located by finding the maximum spatial derivative of the solution. On the first call the desired width of the region of nonzero monitor function is set (this can be changed at a later time if desired). Then on each call the monitor function is assigned using a cosine function so that it has a value of one at the discontinuity down to zero at the edges of the predetermined region of refinement, and zero outside the region. Thus the monitor function and the subsequent refinement are limited, and the region is large enough to ensure that there is always sufficient refinement at the discontinuity.

d03ps: FL CL CPP AD

NAG FL Interfaced03psf (dim1_​parab_​convdiff_​remesh)

▸▿ 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
d03psf (dim1_parab_convdiff_remesh)