NAG Library Routine Document

d03pjf  (dim1_parab_dae_coll_old)
d03pja (dim1_parab_dae_coll)

 Contents

    1  Purpose
    7  Accuracy

1
Purpose

d03pjf/d03pja integrates a system of linear or nonlinear parabolic partial differential equations (PDEs), in one space variable with scope for coupled ordinary differential equations (ODEs). The spatial discretization is performed using a Chebyshev C0 collocation method, and the method of lines is employed to reduce the PDEs to a system of ODEs. The resulting system is solved using a backward differentiation formula (BDF) method or a Theta method (switching between Newton's method and functional iteration).
d03pja is a version of d03pjf that has additional arguments in order to make it safe for use in multithreaded applications (see Section 5).

2
Specification

2.1
Specification for d03pjf

Fortran Interface
Integer, Intent (In):: npde, m, nbkpts, npoly, npts, nv, nxi, neqn, itol, lrsave, lisave, itask, itrace
Integer, Intent (Inout):: isave(lisave), ind, ifail
Real (Kind=nag_wp), Intent (In):: tout, xbkpts(nbkpts), xi(nxi), rtol(*), atol(*), algopt(30)
Real (Kind=nag_wp), Intent (Inout):: ts, u(neqn), rsave(lrsave)
Real (Kind=nag_wp), Intent (Out):: x(npts)
Character (1), Intent (In):: norm, laopt
External:: pdedef, bndary, odedef, uvinit
C Header Interface
#include nagmk26.h
void  d03pjf_ ( const Integer *npde, const Integer *m, double *ts, const double *tout,
void (NAG_CALL *pdedef)( const Integer *npde, const double *t, const double x[], const Integer *nptl, const double u[], const double ux[], const Integer *nv, const double v[], const double vdot[], double p[], double q[], double r[], Integer *ires),
void (NAG_CALL *bndary)( const Integer *npde, const double *t, const double u[], const double ux[], const Integer *nv, const double v[], const double vdot[], const Integer *ibnd, double beta[], double gamma[], Integer *ires),
double u[], const Integer *nbkpts, const double xbkpts[], const Integer *npoly, 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 rcp[], const double ucpt[], const double ucptx[], double f[], Integer *ires),
const Integer *nxi, const double xi[], const Integer *neqn,
void (NAG_CALL *uvinit)( const Integer *npde, const Integer *npts, const double x[], double u[], const Integer *nv, double v[]),
const double rtol[], const double atol[], const Integer *itol, const char *norm, const char *laopt, const double algopt[], 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)

2.2
Specification for d03pja

Fortran Interface
Integer, Intent (In):: npde, m, nbkpts, npoly, npts, nv, nxi, neqn, itol, lrsave, lisave, itask, itrace
Integer, Intent (Inout):: isave(lisave), ind, iuser(*), iwsav(505), ifail
Real (Kind=nag_wp), Intent (In):: tout, xbkpts(nbkpts), xi(nxi), rtol(*), atol(*), algopt(30)
Real (Kind=nag_wp), Intent (Inout):: ts, u(neqn), rsave(lrsave), ruser(*), rwsav(1100)
Real (Kind=nag_wp), Intent (Out):: x(npts)
Logical, Intent (Inout):: lwsav(100)
Character (1), Intent (In):: norm, laopt
Character (80), Intent (Inout):: cwsav(10)
External:: pdedef, bndary, odedef, uvinit
C Header Interface
#include nagmk26.h
void  d03pja_ ( const Integer *npde, const Integer *m, double *ts, const double *tout,
void (NAG_CALL *pdedef)( const Integer *npde, const double *t, const double x[], const Integer *nptl, const double u[], const double ux[], const Integer *nv, const double v[], const double vdot[], double p[], double q[], double r[], Integer *ires, Integer iuser[], double ruser[]),
void (NAG_CALL *bndary)( const Integer *npde, const double *t, const double u[], const double ux[], const Integer *nv, const double v[], const double vdot[], const Integer *ibnd, double beta[], double gamma[], Integer *ires, Integer iuser[], double ruser[]),
double u[], const Integer *nbkpts, const double xbkpts[], const Integer *npoly, 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 rcp[], const double ucpt[], const double ucptx[], double f[], Integer *ires, Integer iuser[], double ruser[]),
const Integer *nxi, const double xi[], const Integer *neqn,
void (NAG_CALL *uvinit)( const Integer *npde, const Integer *npts, const double x[], double u[], const Integer *nv, double v[], Integer iuser[], double ruser[]),
const double rtol[], const double atol[], const Integer *itol, const char *norm, const char *laopt, const double algopt[], double rsave[], const Integer *lrsave, Integer isave[], const Integer *lisave, const Integer *itask, const Integer *itrace, Integer *ind, Integer iuser[], double ruser[], char cwsav[], logical lwsav[], Integer iwsav[], double rwsav[], Integer *ifail, const Charlen length_norm, const Charlen length_laopt, const Charlen length_cwsav)

3
Description

d03pjf/d03pja integrates the system of parabolic-elliptic equations and coupled ODEs
j=1npdePi,j Uj t +Qi=x-m x xmRi,  i=1,2,,npde,  axb,tt0, (1)
Fit,V,V.,ξ,U*,Ux*,R*,Ut*,Uxt*=0,  i=1,2,,nv, (2)
where (1) defines the PDE part and (2) generalizes the coupled ODE part of the problem.
In (1), Pi,j and Ri depend on x, t, U, Ux, and V; Qi depends on x, t, U, Ux, V and linearly on V.. The vector U is the set of PDE solution values
U x,t = U 1 x,t ,, U npde x,t T ,  
and the vector Ux is the partial derivative with respect to x. Note that Pi,j, Qi and Ri must not depend on U t . The vector V is the set of ODE solution values
Vt=V1t,,VnvtT,  
and V. denotes its derivative with respect to time.
In (2), ξ 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 some of the PDE spatial mesh points. U*, Ux*, R*, Ut* and Uxt* are the functions U, Ux, R, Ut and Uxt evaluated at these coupling points. Each Fi may only depend linearly on time derivatives. Hence the equation (2) may be written more precisely as
F=G-AV.-B Ut* Uxt* , (3)
where F = F1,,FnvT , G is a vector of length nv, A is an nv by nv matrix, B is an nv by nξ×npde matrix and the entries in G, A and B may depend on t, ξ, U*, Ux* and V. In practice you need only supply a vector of information to define the ODEs and not the matrices A and B. (See Section 5 for the specification of odedef.)
The integration in time is from t0 to tout, over the space interval axb, where a=x1 and b=xnbkpts are the leftmost and rightmost of a user-defined set of break-points x1,x2,,xnbkpts. The coordinate system in space is defined by the value of m; m=0 for Cartesian coordinates, m=1 for cylindrical polar coordinates and m=2 for spherical polar coordinates.
The PDE system which is defined by the functions Pi,j, Qi and Ri must be specified in pdedef.
The initial values of the functions Ux,t and Vt must be given at t=t0. These values are calculated in uvinit.
The functions Ri which may be thought of as fluxes, are also used in the definition of the boundary conditions. The boundary conditions must have the form
βix,tRix,t,U,Ux,V=γix,t,U,Ux,V,V.,  i=1,2,,npde, (4)
where x=a or x=b. The functions γi may only depend linearly on V..
The boundary conditions must be specified in bndary.
The algebraic-differential equation system which is defined by the functions Fi must be specified in odedef. You must also specify the coupling points ξ in the array xi. Thus, the problem is subject to the following restrictions:
(i) in (1), V.jt, for j=1,2,,nv, may only appear linearly in the functions Qi, for i=1,2,,npde, with a similar restriction for γ;
(ii) Pi,j and the flux Ri must not depend on any time derivatives;
(iii) t0<tout, so that integration is in the forward direction;
(iv) the evaluation of the functions Pi,j, Qi and Ri is done at both the break-points and internally selected points for each element in turn, that is Pi,j, Qi and Ri are evaluated twice at each break-point. Any discontinuities in these functions must therefore be at one or more of the mesh points;
(v) at least one of the functions Pi,j must be nonzero so that there is a time derivative present in the PDE problem;
(vi) if m>0 and x1=0.0, which is the left boundary point, then it must be ensured that the PDE solution is bounded at this point. This can be done either by specifying the solution at x=0.0 or by specifying a zero flux there, that is βi=1.0 and γi=0.0.
The parabolic equations are approximated by a system of ODEs in time for the values of Ui at the mesh points. This ODE system is obtained by approximating the PDE solution between each pair of break-points by a Chebyshev polynomial of degree npoly. The interval between each pair of break-points is treated by d03pjf/d03pja as an element, and on this element, a polynomial and its space and time derivatives are made to satisfy the system of PDEs at npoly-1 spatial points, which are chosen internally by the code and the break-points. The user-defined break-points and the internally selected points together define the mesh. The smallest value that npoly can take is one, in which case, the solution is approximated by piecewise linear polynomials between consecutive break-points and the method is similar to an ordinary finite element method.
In total there are nbkpts-1×npoly+1 mesh points in the spatial direction, and npde×nbkpts-1×npoly+1+nv ODEs in the time direction; one ODE at each break-point for each PDE component, npoly-1 ODEs for each PDE component between each pair of break-points, and nv coupled ODEs. The system is then integrated forwards in time using a Backward Differentiation Formula (BDF) method or a Theta method.

4
References

Berzins M (1990) Developments in the NAG Library software for parabolic equations Scientific Software Systems (eds J C Mason and M G Cox) 59–72 Chapman and Hall
Berzins M and Dew P M (1991) Algorithm 690: Chebyshev polynomial software for elliptic-parabolic systems of PDEs ACM Trans. Math. Software 17 178–206
Berzins M, Dew P M and Furzeland R M (1988) Software tools for time-dependent equations in simulation and optimization of large systems Proc. IMA Conf. Simulation and Optimization (ed A J Osiadcz) 35–50 Clarendon Press, Oxford
Berzins M and Furzeland R M (1992) An adaptive theta method for the solution of stiff and nonstiff differential equations Appl. Numer. Math. 9 1–19
Zaturska N B, Drazin P G and Banks W H H (1988) On the flow of a viscous fluid driven along a channel by a suction at porous walls Fluid Dynamics Research 4

5
Arguments

1:     npde – IntegerInput
On entry: the number of PDEs to be solved.
Constraint: npde1.
2:     m – IntegerInput
On entry: the coordinate system used:
m=0
Indicates Cartesian coordinates.
m=1
Indicates cylindrical polar coordinates.
m=2
Indicates spherical polar coordinates.
Constraint: m=0, 1 or 2.
3:     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.
4:     tout – Real (Kind=nag_wp)Input
On entry: the final value of t to which the integration is to be carried out.
5:     pdedef – Subroutine, supplied by the user.External Procedure
pdedef must compute the functions Pi,j, Qi and Ri which define the system of PDEs. The functions may depend on x, t, U, Ux and V; Qi may depend linearly on V.. The functions must be evaluated at a set of points.
The specification of pdedef for d03pjf is:
Fortran Interface
Subroutine pdedef ( npde, t, x, nptl, u, ux, nv, v, vdot, p, q, r, ires)
Integer, Intent (In):: npde, nptl, nv
Integer, Intent (Inout):: ires
Real (Kind=nag_wp), Intent (In):: t, x(nptl), u(npde,nptl), ux(npde,nptl), v(nv), vdot(nv)
Real (Kind=nag_wp), Intent (Out):: p(npde,npde,nptl), q(npde,nptl), r(npde,nptl)
C Header Interface
#include nagmk26.h
void  pdedef ( const Integer *npde, const double *t, const double x[], const Integer *nptl, const double u[], const double ux[], const Integer *nv, const double v[], const double vdot[], double p[], double q[], double r[], Integer *ires)
The specification of pdedef for d03pja is:
Fortran Interface
Subroutine pdedef ( npde, t, x, nptl, u, ux, nv, v, vdot, p, q, r, ires, iuser, ruser)
Integer, Intent (In):: npde, nptl, nv
Integer, Intent (Inout):: ires, iuser(*)
Real (Kind=nag_wp), Intent (In):: t, x(nptl), u(npde,nptl), ux(npde,nptl), v(nv), vdot(nv)
Real (Kind=nag_wp), Intent (Inout):: ruser(*)
Real (Kind=nag_wp), Intent (Out):: p(npde,npde,nptl), q(npde,nptl), r(npde,nptl)
C Header Interface
#include nagmk26.h
void  pdedef ( const Integer *npde, const double *t, const double x[], const Integer *nptl, const double u[], const double ux[], const Integer *nv, const double v[], const double vdot[], double p[], double q[], double r[], Integer *ires, Integer iuser[], double ruser[])
1:     npde – IntegerInput
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:     xnptl – Real (Kind=nag_wp) arrayInput
On entry: contains a set of mesh points at which Pi,j, Qi and Ri are to be evaluated. x1 and xnptl contain successive user-supplied break-points and the elements of the array will satisfy x1<x2<<xnptl.
4:     nptl – IntegerInput
On entry: the number of points at which evaluations are required (the value of npoly+1).
5:     unpdenptl – Real (Kind=nag_wp) arrayInput
On entry: uij contains the value of the component Uix,t where x=xj, for i=1,2,,npde and j=1,2,,nptl.
6:     uxnpdenptl – Real (Kind=nag_wp) arrayInput
On entry: uxij contains the value of the component Uix,t x  where x=xj, for i=1,2,,npde and j=1,2,,nptl.
7:     nv – IntegerInput
On entry: the number of coupled ODEs in the system.
8:     vnv – Real (Kind=nag_wp) arrayInput
On entry: if nv>0, vi contains the value of the component Vit, for i=1,2,,nv.
9:     vdotnv – Real (Kind=nag_wp) arrayInput
On entry: if nv>0, vdoti contains the value of component V.it, for i=1,2,,nv.
Note: V.it, for i=1,2,,nv, may only appear linearly in Qj, for j=1,2,,npde.
10:   pnpdenpdenptl – Real (Kind=nag_wp) arrayOutput
On exit: pijk must be set to the value of Pi,jx,t,U,Ux,V where x=xk, for i=1,2,,npde, j=1,2,,npde and k=1,2,,nptl.
11:   qnpdenptl – Real (Kind=nag_wp) arrayOutput
On exit: qij must be set to the value of Qix,t,U,Ux,V,V. where x=xj, for i=1,2,,npde and j=1,2,,nptl.
12:   rnpdenptl – Real (Kind=nag_wp) arrayOutput
On exit: rij must be set to the value of Rix,t,U,Ux,V where x=xi, for i=1,2,,npde and j=1,2,,nptl.
13:   ires – IntegerInput/Output
On entry: set to -1​ or ​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, d03pjf/d03pja returns to the calling subroutine with the error indicator set to ifail=4.
Note: the following are additional arguments for specific use with d03pja. Users of d03pjf therefore need not read the remainder of this description.
14:   iuser* – Integer arrayUser Workspace
15:   ruser* – Real (Kind=nag_wp) arrayUser Workspace
pdedef is called with the arguments iuser and ruser as supplied to d03pjf/d03pja. You should use the arrays iuser and ruser to supply information to pdedef.
pdedef must either be a module subprogram USEd by, or declared as EXTERNAL in, the (sub)program from which d03pjf/d03pja 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 d03pjf/d03pja. If your code inadvertently does return any NaNs or infinities, d03pjf/d03pja is likely to produce unexpected results.
6:     bndary – Subroutine, supplied by the user.External Procedure
bndary must compute the functions βi and γi which define the boundary conditions as in equation (4).
The specification of bndary for d03pjf is:
Fortran Interface
Subroutine bndary ( npde, t, u, ux, nv, v, vdot, ibnd, beta, gamma, ires)
Integer, Intent (In):: npde, nv, ibnd
Integer, Intent (Inout):: ires
Real (Kind=nag_wp), Intent (In):: t, u(npde), ux(npde), v(nv), vdot(nv)
Real (Kind=nag_wp), Intent (Out):: beta(npde), gamma(npde)
C Header Interface
#include nagmk26.h
void  bndary ( const Integer *npde, const double *t, const double u[], const double ux[], const Integer *nv, const double v[], const double vdot[], const Integer *ibnd, double beta[], double gamma[], Integer *ires)
The specification of bndary for d03pja is:
Fortran Interface
Subroutine bndary ( npde, t, u, ux, nv, v, vdot, ibnd, beta, gamma, ires, iuser, ruser)
Integer, Intent (In):: npde, nv, ibnd
Integer, Intent (Inout):: ires, iuser(*)
Real (Kind=nag_wp), Intent (In):: t, u(npde), ux(npde), v(nv), vdot(nv)
Real (Kind=nag_wp), Intent (Inout):: ruser(*)
Real (Kind=nag_wp), Intent (Out):: beta(npde), gamma(npde)
C Header Interface
#include nagmk26.h
void  bndary ( const Integer *npde, const double *t, const double u[], const double ux[], const Integer *nv, const double v[], const double vdot[], const Integer *ibnd, double beta[], double gamma[], Integer *ires, Integer iuser[], double ruser[])
1:     npde – IntegerInput
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:     unpde – Real (Kind=nag_wp) arrayInput
On entry: ui contains the value of the component Uix,t at the boundary specified by ibnd, for i=1,2,,npde.
4:     uxnpde – Real (Kind=nag_wp) arrayInput
On entry: uxi contains the value of the component Uix,t x  at the boundary specified by ibnd, for i=1,2,,npde.
5:     nv – IntegerInput
On entry: the number of coupled ODEs in the system.
6:     vnv – Real (Kind=nag_wp) arrayInput
On entry: if nv>0, vi contains the value of the component Vit, for i=1,2,,nv.
7:     vdotnv – Real (Kind=nag_wp) arrayInput
On entry: if nv>0, vdoti contains the value of component V.it, for i=1,2,,nv.
Note: V.it, for i=1,2,,nv, may only appear linearly in Qj, for j=1,2,,npde.
8:     ibnd – IntegerInput
On entry: specifies which boundary conditions are to be evaluated.
ibnd=0
bndary must set up the coefficients of the left-hand boundary, x=a.
ibnd0
bndary must set up the coefficients of the right-hand boundary, x=b.
9:     betanpde – Real (Kind=nag_wp) arrayOutput
On exit: betai must be set to the value of βix,t at the boundary specified by ibnd, for i=1,2,,npde.
10:   gammanpde – Real (Kind=nag_wp) arrayOutput
On exit: gammai must be set to the value of γix,t,U,Ux,V,V. at the boundary specified by ibnd, for i=1,2,,npde.
11:   ires – IntegerInput/Output
On entry: set to -1​ or ​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, d03pjf/d03pja returns to the calling subroutine with the error indicator set to ifail=4.
Note: the following are additional arguments for specific use with d03pja. Users of d03pjf therefore need not read the remainder of this description.
12:   iuser* – Integer arrayUser Workspace
13:   ruser* – Real (Kind=nag_wp) arrayUser Workspace
bndary is called with the arguments iuser and ruser as supplied to d03pjf/d03pja. You should use the arrays iuser and ruser to supply information to bndary.
bndary must either be a module subprogram USEd by, or declared as EXTERNAL in, the (sub)program from which d03pjf/d03pja 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 d03pjf/d03pja. If your code inadvertently does return any NaNs or infinities, d03pjf/d03pja is likely to produce unexpected results.
7:     uneqn – Real (Kind=nag_wp) arrayInput/Output
On entry: if ind=1 the value of u must be unchanged from the previous call.
On exit: the computed solution Uixj,t, for i=1,2,,npde and j=1,2,,npts, and Vkt, for k=1,2,,nv, evaluated at t=ts, as follows:
  • unpde×j-1+i contain Uixj,t, for i=1,2,,npde and j=1,2,,npts, and
  • unpts×npde+i contain Vit, for i=1,2,,nv.
8:     nbkpts – IntegerInput
On entry: the number of break-points in the interval a,b.
Constraint: nbkpts2.
9:     xbkptsnbkpts – Real (Kind=nag_wp) arrayInput
On entry: the values of the break-points in the space direction. xbkpts1 must specify the left-hand boundary, a, and xbkptsnbkpts must specify the right-hand boundary, b.
Constraint: xbkpts1<xbkpts2<<xbkptsnbkpts.
10:   npoly – IntegerInput
On entry: the degree of the Chebyshev polynomial to be used in approximating the PDE solution between each pair of break-points.
Constraint: 1npoly49.
11:   npts – IntegerInput
On entry: the number of mesh points in the interval a,b.
Constraint: npts=nbkpts-1×npoly+1.
12:   xnpts – Real (Kind=nag_wp) arrayOutput
On exit: the mesh points chosen by d03pjf/d03pja in the spatial direction. The values of x will satisfy x1<x2<<xnpts.
13:   nv – IntegerInput
On entry: the number of coupled ODE components.
Constraint: nv0.
14:   odedef – Subroutine, supplied by the NAG Library or the user.External Procedure
odedef must evaluate the functions F, which define the system of ODEs, as given in (3).
If you wish to compute the solution of a system of PDEs only (nv=0), odedef must be the dummy routine d03pck for d03pjf (or d53pck for d03pja). d03pck and d53pck are included in the NAG Library.
The specification of odedef for d03pjf is:
Fortran Interface
Subroutine odedef ( npde, t, nv, v, vdot, nxi, xi, ucp, ucpx, rcp, ucpt, ucptx, f, 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), rcp(npde,nxi), ucpt(npde,nxi), ucptx(npde,nxi)
Real (Kind=nag_wp), Intent (Out):: f(nv)
C Header Interface
#include nagmk26.h
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 rcp[], const double ucpt[], const double ucptx[], double f[], Integer *ires)
The specification of odedef for d03pja is:
Fortran Interface
Subroutine odedef ( npde, t, nv, v, vdot, nxi, xi, ucp, ucpx, rcp, ucpt, ucptx, f, ires, iuser, ruser)
Integer, Intent (In):: npde, nv, nxi
Integer, Intent (Inout):: ires, iuser(*)
Real (Kind=nag_wp), Intent (In):: t, v(nv), vdot(nv), xi(nxi), ucp(npde,nxi), ucpx(npde,nxi), rcp(npde,nxi), ucpt(npde,nxi), ucptx(npde,nxi)
Real (Kind=nag_wp), Intent (Inout):: ruser(*)
Real (Kind=nag_wp), Intent (Out):: f(nv)
C Header Interface
#include nagmk26.h
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 rcp[], const double ucpt[], const double ucptx[], double f[], Integer *ires, Integer iuser[], double ruser[])
1:     npde – IntegerInput
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 – IntegerInput
On entry: the number of coupled ODEs in the system.
4:     vnv – Real (Kind=nag_wp) arrayInput
On entry: if nv>0, vi contains the value of the component Vit, for i=1,2,,nv.
5:     vdotnv – Real (Kind=nag_wp) arrayInput
On entry: if nv>0, vdoti contains the value of component V.it, for i=1,2,,nv.
6:     nxi – IntegerInput
On entry: the number of ODE/PDE coupling points.
7:     xinxi – Real (Kind=nag_wp) arrayInput
On entry: if nxi>0, xii contains the ODE/PDE coupling points, ξi, for i=1,2,,nxi.
8:     ucpnpdenxi – Real (Kind=nag_wp) arrayInput
On entry: if nxi>0, ucpij contains the value of Uix,t at the coupling point x=ξj, for i=1,2,,npde and j=1,2,,nxi.
9:     ucpxnpdenxi – Real (Kind=nag_wp) arrayInput
On entry: if nxi>0, ucpxij contains the value of Uix,t x  at the coupling point x=ξj, for i=1,2,,npde and j=1,2,,nxi.
10:   rcpnpdenxi – Real (Kind=nag_wp) arrayInput
On entry: rcpij contains the value of the flux Ri at the coupling point x=ξj, for i=1,2,,npde and j=1,2,,nxi.
11:   ucptnpdenxi – Real (Kind=nag_wp) arrayInput
On entry: if nxi>0, ucptij contains the value of Ui t  at the coupling point x=ξj, for i=1,2,,npde and j=1,2,,nxi.
12:   ucptxnpdenxi – Real (Kind=nag_wp) arrayInput
On entry: ucptxij contains the value of 2Ui x t  at the coupling point x=ξj, for i=1,2,,npde and j=1,2,,nxi.
13:   fnv – Real (Kind=nag_wp) arrayOutput
On exit: fi must contain the ith component of F, for i=1,2,,nv, where F is defined as
F=G-AV.-B Ut* Uxt* , (5)
or
F=-AV.-B Ut* Uxt* . (6)
The definition of F is determined by the input value of ires.
14:   ires – IntegerInput/Output
On entry: the form of F that must be returned in the array f.
ires=1
Equation (5) must be used.
ires=-1
Equation (6) 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, d03pjf/d03pja returns to the calling subroutine with the error indicator set to ifail=4.
Note: the following are additional arguments for specific use with d03pja. Users of d03pjf therefore need not read the remainder of this description.
15:   iuser* – Integer arrayUser Workspace
16:   ruser* – Real (Kind=nag_wp) arrayUser Workspace
odedef is called with the arguments iuser and ruser as supplied to d03pjf/d03pja. You should use the arrays iuser and ruser to supply information to odedef.
odedef must either be a module subprogram USEd by, or declared as EXTERNAL in, the (sub)program from which d03pjf/d03pja 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 d03pjf/d03pja. If your code inadvertently does return any NaNs or infinities, d03pjf/d03pja is likely to produce unexpected results.
15:   nxi – IntegerInput
On entry: the number of ODE/PDE coupling points.
Constraints:
  • if nv=0, nxi=0;
  • if nv>0, nxi0.
16:   xinxi – Real (Kind=nag_wp) arrayInput
On entry: xii, for i=1,2,,nxi, must be set to the ODE/PDE coupling points.
Constraint: xbkpts1xi1<xi2<<xinxixbkptsnbkpts.
17:   neqn – IntegerInput
On entry: the number of ODEs in the time direction.
Constraint: neqn=npde×npts+nv.
18:   uvinit – Subroutine, supplied by the user.External Procedure
uvinit must compute the initial values of the PDE and the ODE components Uixj,t0, for i=1,2,,npde and j=1,2,,npts, and Vkt0, for k=1,2,,nv.
The specification of uvinit for d03pjf is:
Fortran Interface
Subroutine uvinit ( npde, npts, x, u, nv, v)
Integer, Intent (In):: npde, npts, nv
Real (Kind=nag_wp), Intent (In):: x(npts)
Real (Kind=nag_wp), Intent (Out):: u(npde,npts), v(nv)
C Header Interface
#include nagmk26.h
void  uvinit ( const Integer *npde, const Integer *npts, const double x[], double u[], const Integer *nv, double v[])
The specification of uvinit for d03pja is:
Fortran Interface
Subroutine uvinit ( npde, npts, x, u, nv, v, iuser, ruser)
Integer, Intent (In):: npde, npts, nv
Integer, Intent (Inout):: iuser(*)
Real (Kind=nag_wp), Intent (In):: x(npts)
Real (Kind=nag_wp), Intent (Inout):: ruser(*)
Real (Kind=nag_wp), Intent (Out):: u(npde,npts), v(nv)
C Header Interface
#include nagmk26.h
void  uvinit ( const Integer *npde, const Integer *npts, const double x[], double u[], const Integer *nv, double v[], Integer iuser[], double ruser[])
1:     npde – IntegerInput
On entry: the number of PDEs in the system.
2:     npts – IntegerInput
On entry: the number of mesh points in the interval a,b.
3:     xnpts – Real (Kind=nag_wp) arrayInput
On entry: xi, for i=1,2,,npts, contains the current values of the space variable xi.
4:     unpdenpts – Real (Kind=nag_wp) arrayOutput
On exit: uij contains the value of the component Uixj,t0, for i=1,2,,npde and j=1,2,,npts.
5:     nv – IntegerInput
On entry: the number of coupled ODEs in the system.
6:     vnv – Real (Kind=nag_wp) arrayOutput
On exit: vi contains the value of component Vit0, for i=1,2,,nv.
Note: the following are additional arguments for specific use with d03pja. Users of d03pjf therefore need not read the remainder of this description.
7:     iuser* – Integer arrayUser Workspace
8:     ruser* – Real (Kind=nag_wp) arrayUser Workspace
uvinit is called with the arguments iuser and ruser as supplied to d03pjf/d03pja. You should use the arrays iuser and ruser to supply information to uvinit.
uvinit must either be a module subprogram USEd by, or declared as EXTERNAL in, the (sub)program from which d03pjf/d03pja 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 d03pjf/d03pja. If your code inadvertently does return any NaNs or infinities, d03pjf/d03pja is likely to produce unexpected results.
19:   rtol* – Real (Kind=nag_wp) arrayInput
Note: the dimension of the array rtol must be at least 1 if itol=1 or 2 and at least neqn if itol=3 or 4.
On entry: the relative local error tolerance.
Constraint: rtoli0.0 for all relevant i.
20:   atol* – Real (Kind=nag_wp) arrayInput
Note: the dimension of the array atol must be at least 1 if itol=1 or 3 and at least neqn if itol=2 or 4.
On entry: the absolute local error tolerance.
Constraint: atoli0.0 for all relevant i.
Note: corresponding elements of rtol and atol cannot both be 0.0.
21:   itol – IntegerInput
On entry: a value to indicate the form of the local error test. itol indicates to d03pjf/d03pja whether to interpret either or both of rtol or atol as a vector or scalar. The error test to be satisfied is ei/wi<1.0, where wi is defined as follows:
itolrtolatolwi
1scalarscalarrtol1×Ui+atol1
2scalarvectorrtol1×Ui+atoli
3vectorscalarrtoli×Ui+atol1
4vectorvectorrtoli×Ui+atoli
In the above, ei denotes the estimated local error for the ith component of the coupled PDE/ODE system in time, ui, for i=1,2,,neqn.
The choice of norm used is defined by the argument norm.
Constraint: 1itol4.
22:   norm – Character(1)Input
On entry: the type of norm to be used.
norm='M'
Maximum norm.
norm='A'
Averaged L2 norm.
If unorm denotes the norm of the vector u of length neqn, then for the averaged L2 norm
unorm=1neqni=1neqnui/wi2,  
while for the maximum norm
u norm = maxi ui / wi .  
See the description of itol for the formulation of the weight vector w.
Constraint: norm='M' or 'A'.
23:   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' or 'S'.
Note: you are recommended to use the banded option when no coupled ODEs are present (i.e., nv=0).
24:   algopt30 – Real (Kind=nag_wp) arrayInput
On entry: may be set to control various options available in the integrator. If you wish to employ all the default options, algopt1 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:
algopt1
Selects the ODE integration method to be used. If algopt1=1.0, a BDF method is used and if algopt1=2.0, a Theta method is used. The default value is algopt1=1.0.
If algopt1=2.0, algopti, for i=2,3,4 are not used.
algopt2
Specifies the maximum order of the BDF integration formula to be used. algopt2 may be 1.0, 2.0, 3.0, 4.0 or 5.0. The default value is algopt2=5.0.
algopt3
Specifies what method is to be used to solve the system of nonlinear equations arising on each step of the BDF method. If algopt3=1.0 a modified Newton iteration is used and if algopt3=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 algopt3=1.0.
algopt4
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 Pi,j=0.0, for j=1,2,,npde, for some i or when there is no V.it dependence in the coupled ODE system. If algopt4=1.0, the Petzold test is used. If algopt4=2.0, the Petzold test is not used. The default value is algopt4=1.0.
If algopt1=1.0, algopti, for i=5,6,7, are not used.
algopt5
Specifies the value of Theta to be used in the Theta integration method. 0.51algopt50.99. The default value is algopt5=0.55.
algopt6
Specifies what method is to be used to solve the system of nonlinear equations arising on each step of the Theta method. If algopt6=1.0, a modified Newton iteration is used and if algopt6=2.0, a functional iteration method is used. The default value is algopt6=1.0.
algopt7
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 algopt7=1.0, switching is allowed and if algopt7=2.0, switching is not allowed. The default value is algopt7=1.0.
algopt11
Specifies a point in the time direction, tcrit, beyond which integration must not be attempted. The use of tcrit is described under the argument itask. If algopt10.0, a value of 0.0 for algopt11, say, should be specified even if itask subsequently specifies that tcrit will not be used.
algopt12
Specifies the minimum absolute step size to be allowed in the time integration. If this option is not required, algopt12 should be set to 0.0.
algopt13
Specifies the maximum absolute step size to be allowed in the time integration. If this option is not required, algopt13 should be set to 0.0.
algopt14
Specifies the initial step size to be attempted by the integrator. If algopt14=0.0, the initial step size is calculated internally.
algopt15
Specifies the maximum number of steps to be attempted by the integrator in any one call. If algopt15=0.0, no limit is imposed.
algopt23
Specifies what method is to be used to solve the nonlinear equations at the initial point to initialize the values of U, Ut, V and V.. If algopt23=1.0, a modified Newton iteration is used and if algopt23=2.0, functional iteration is used. The default value is algopt23=1.0.
algopt29 and algopt30 are used only for the sparse matrix algebra option, laopt='S'.
algopt29
Governs the choice of pivots during the decomposition of the first Jacobian matrix. It should lie in the range 0.0<algopt29<1.0, with smaller values biasing the algorithm towards maintaining sparsity at the expense of numerical stability. If algopt29 lies outside this range then the default value is used. If the routines regard the Jacobian matrix as numerically singular then increasing algopt29 towards 1.0 may help, but at the cost of increased fill-in. The default value is algopt29=0.1.
algopt30
Is used as a relative pivot threshold during subsequent Jacobian decompositions (see algopt29) below which an internal error is invoked. If algopt30 is greater than 1.0 no check is made on the pivot size, and this may be a necessary option if the Jacobian is found to be numerically singular (see algopt29). The default value is algopt30=0.0001.
25:   rsavelrsave – Real (Kind=nag_wp) arrayCommunication Array
If ind=0, rsave need not be set on entry.
If ind=1, rsave must be unchanged from the previous call to the routine because it contains required information about the iteration.
26:   lrsave – IntegerInput
On entry: the dimension of the array rsave as declared in the (sub)program from which d03pjf/d03pja is called. Its size depends on the type of matrix algebra selected.
If laopt='F', lrsaveneqn×neqn+neqn+nwkres+lenode.
If laopt='B', lrsave3×mlu+1×neqn+nwkres+lenode.
If laopt='S', lrsave4×neqn+11×neqn/2+1+nwkres+lenode.
Where
mlu is the lower or upper half bandwidths such that
mlu=3×npde-1, for PDE problems only (no coupled ODEs); or
mlu=neqn-1, for coupled PDE/ODE problems.
nwkres= 3×npoly+12+npoly+1×npde2+6×npde+nbkpts+1+8×npde+nxi×5×npde+1+nv+3, when ​nv>0​ and ​nxi>0; or 3×npoly+12+npoly+1×npde2+6×npde+nbkpts+1+13×npde+nv+4, when ​nv>0​ and ​nxi=0; or 3×npoly+12+npoly+1×npde2+6×npde+nbkpts+1+13×npde+5, when ​nv=0.  
lenode= 6+intalgopt2×neqn+50, when the BDF method is used; or 9×neqn+50, when the Theta method is used.  
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.
27:   isavelisave – Integer arrayCommunication Array
If ind=0, isave need not be set on entry.
If ind=1, isave must be unchanged from the previous call to the routine because it contains required information about the iteration required for subsequent calls. In particular:
isave1
Contains the number of steps taken in time.
isave2
Contains the number of residual evaluations of the resulting ODE system used. One such evaluation involves computing the PDE functions at all the mesh points, as well as one evaluation of the functions in the boundary conditions.
isave3
Contains the number of Jacobian evaluations performed by the time integrator.
isave4
Contains the order of the ODE method last used in the time integration.
isave5
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 LU decomposition of the Jacobian matrix.
28:   lisave – IntegerInput
On entry: the dimension of the array isave as declared in the (sub)program from which d03pjf/d03pja is called. Its size depends on the type of matrix algebra selected:
  • if laopt='F', lisave24;
  • if laopt='B', lisaveneqn+24;
  • if laopt='S', lisave25×neqn+24.
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.
29:   itask – IntegerInput
On entry: specifies the task to be performed by the ODE integrator.
itask=1
Normal computation of output values u at t=tout.
itask=2
One step 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=tcrit where tcrit is described under the argument algopt.
itask=5
Take one step in the time direction and return, without passing tcrit, where tcrit is described under the argument algopt.
Constraint: itask=1, 2, 3, 4 or 5.
30:   itrace – IntegerInput
On entry: the level of trace information required from d03pjf/d03pja and the underlying ODE solver. itrace may take the value -1, 0, 1, 2 or 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.
If 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.
31:   ind – IntegerInput/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 and ifail should be reset between calls to d03pjf/d03pja.
Constraint: ind=0 or 1.
On exit: ind=1.
32:   ifail – IntegerInput/Output
Note: for d03pja, ifail does not occur in this position in the argument list. See the additional arguments described below.
On entry: ifail must be set to 0, -1​ or ​1. If you are unfamiliar with this argument you should refer to Section 3.4 in How to Use the NAG Library and its Documentation for details.
For environments where it might be inappropriate to halt program execution when an error is detected, the value -1​ or ​1 is recommended. If the output of error messages is undesirable, then the value 1 is recommended. Otherwise, if you are not familiar with this argument, the recommended value is 0. When the value -1​ or ​1 is used it is essential to test the value of ifail on exit.
On exit: ifail=0 unless the routine detects an error or a warning has been flagged (see Section 6).
Note: the following are additional arguments for specific use with d03pja. Users of d03pjf therefore need not read the remainder of this description.
32:   iuser* – Integer arrayUser Workspace
33:   ruser* – Real (Kind=nag_wp) arrayUser Workspace
iuser and ruser are not used by d03pjf/d03pja, but are passed directly to pdedef, bndary, odedef and uvinit and may be used to pass information to these routines.
34:   cwsav10 – Character(80) arrayCommunication Array
35:   lwsav100 – Logical arrayCommunication Array
36:   iwsav505 – Integer arrayCommunication Array
37:   rwsav1100 – Real (Kind=nag_wp) arrayCommunication Array
38:   ifail – IntegerInput/Output
Note: see the argument description for ifail above.

6
Error Indicators and Warnings

If on entry ifail=0 or -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,tout-ts is too small,
oritask1, 2, 3, 4 or 5,
orm0, 1 or 2,
orat least one of the coupling point in array xi is outside the interval [xbkpts1,xbkptsnbkpts],
ornptsnbkpts-1×npoly+1,
ornbkpts<2,
ornpde0,
ornorm'A' or 'M',
oritol1, 2, 3 or 4,
ornpoly<1 or npoly>49,
ornv and nxi are incorrectly defined,
orneqnnpde×npts+nv,
orlaopt'F', 'B' or 'S',
orind0 or 1,
orbreak-points xbkptsi are badly ordered,
orlrsave is too small,
orlisave is too small,
orthe ODE integrator has not been correctly defined; check algopt argument,
oreither an element of rtol or atol<0.0,
orall the elements of rtol and atol are zero.
ifail=2
The underlying ODE solver cannot make any further progress, with the values of atol and rtol, across the integration range from the current point t=ts. The components of u contain the computed values at the current point t=ts.
ifail=3
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.
ifail=4
In setting up the ODE system, the internal initialization routine was unable to initialize the derivative of the ODE system. This could be due to the fact that ires was repeatedly set to 3 in at least pdedef, bndary or odedef, when the residual in the underlying ODE solver was being evaluated.
ifail=5
In solving the ODE system, a singular Jacobian has been encountered. You should check your problem formulation.
ifail=6
When evaluating the residual in solving the ODE system, ires was set to 2 in at least pdedef, bndary or odedef. Integration was successful as far as t=ts.
ifail=7
The values of atol and rtol are so small that the routine is unable to start the integration in time.
ifail=8
In one of pdedef, bndary or odedef, ires was set to an invalid value.
ifail=9 (d02nnf)
A serious error has occurred in an internal call to the specified routine. Check the problem specification and all arguments and array dimensions. Setting itrace=1 may provide more information. If the problem persists, contact NAG.
ifail=10
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 itask2 or 5.)
ifail=11
An error occurred during Jacobian formulation of the ODE system (a more detailed error description may be directed to the current error message unit).
ifail=12
In solving the ODE system, the maximum number of steps specified in algopt15 have been taken.
ifail=13
Some error weights wi became zero during the time integration (see the description of itol). Pure relative error control (atoli=0.0) was requested on a variable (the ith) which has become zero. The integration was successful as far as t=ts.
ifail=14
The flux function Ri was detected as depending on time derivatives, which is not permissible.
ifail=15
When using the sparse option, the value of lisave or lrsave was not sufficient (more detailed information may be directed to the current error message unit).
ifail=-99
An unexpected error has been triggered by this routine. Please contact NAG.
See Section 3.9 in How to Use the NAG Library and its Documentation for further information.
ifail=-399
Your licence key may have expired or may not have been installed correctly.
See Section 3.8 in How to Use the NAG Library and its Documentation for further information.
ifail=-999
Dynamic memory allocation failed.
See Section 3.7 in How to Use the NAG Library and its Documentation for further information.

7
Accuracy

d03pjf/d03pja 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 argument atol and rtol.

8
Parallelism and Performance

d03pjf/d03pja is threaded by NAG for parallel execution in multithreaded implementations of the NAG Library.
d03pjf/d03pja makes calls to BLAS and/or LAPACK routines, which may be threaded within the vendor library used by this implementation. Consult the documentation for the vendor library for further information.
Please consult the X06 Chapter Introduction for information on how to control and interrogate the OpenMP environment used within this routine. Please also consult the Users' Note for your implementation for any additional implementation-specific information.

9
Further Comments

The argument specification allows you to include equations with only first-order derivatives in the space direction but there is no guarantee that the method of integration will be satisfactory for such systems. The position and nature of the boundary conditions in particular are critical in defining a stable problem.
The time taken depends on the complexity of the parabolic system and on the accuracy requested.

10
Example

This example provides a simple coupled system of one PDE and one ODE.
V 1 2 U 1 t -x V 1 V . 1 U 1 x = 2 U 1 x 2 V . 1 = V 1 U 1 + U 1 x +1 +t ,  
for t10-4,0.1×2i,  i=1,2,,5,x0,1.
The left boundary condition at x=0 is
U1 x =-V1expt.  
The right boundary condition at x=1 is
U1=-V1V.1.  
The initial conditions at t=10-4 are defined by the exact solution:
V1=t,   and  U1x,t=expt1-x-1.0,  x0,1,  
and the coupling point is at ξ1=1.0.

10.1
Program Text

Note: the following programs illustrate the use of d03pjf and d03pja.

Program Text (d03pjfe.f90)

Program Text (d03pjae.f90)

10.2
Program Data

Program Data (d03pjfe.d)

Program Data (d03pjae.d)

10.3
Program Results

Program Results (d03pjfe.r)

Program Results (d03pjae.r)

GnuplotProduced by GNUPLOT 5.0 patchlevel 0 Example Program Parabolic PDE Coupled with ODE using Collocation and BDF U(x,t) gnuplot_plot_1 gnuplot_plot_2 0.1 0.5 1 2 3 Time (logscale) 0 0.2 0.4 0.6 0.8 1 x −5 0 5 10 15 20 25
© The Numerical Algorithms Group Ltd, Oxford, UK. 2017