Integer type:  int32  int64  nag_int  show int32  show int32  show int64  show int64  show nag_int  show nag_int

Chapter Contents
Chapter Introduction
NAG Toolbox

# NAG Toolbox: nag_pde_1d_parab_convdiff_dae (d03pl)

## Purpose

nag_pde_1d_parab_convdiff_dae (d03pl) 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. 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.

## Syntax

[ts, u, rsave, isave, ind, ifail] = d03pl(npde, ts, tout, pdedef, numflx, bndary, u, x, ncode, odedef, xi, rtol, atol, itol, norm_p, laopt, algopt, rsave, isave, itask, itrace, ind, 'npts', npts, 'nxi', nxi, 'neqn', neqn)
[ts, u, rsave, isave, ind, ifail] = nag_pde_1d_parab_convdiff_dae(npde, ts, tout, pdedef, numflx, bndary, u, x, ncode, odedef, xi, rtol, atol, itol, norm_p, laopt, algopt, rsave, isave, itask, itrace, ind, 'npts', npts, 'nxi', nxi, 'neqn', neqn)
Note: the interface to this routine has changed since earlier releases of the toolbox:
Mark 22: lrsave, lisave have been removed from the interface
.

## Description

nag_pde_1d_parab_convdiff_dae (d03pl) integrates the system of convection-diffusion equations in conservative form:
 npde ∑ Pi,j( ∂ Uj)/( ∂ t) + ( ∂ Fi)/( ∂ x) = Ci( ∂ Di)/( ∂ x) + Si, j = 1
$∑j=1npdePi,j ∂Uj ∂t + ∂Fi ∂x =Ci ∂Di ∂x +Si,$
(1)
or the hyperbolic convection-only system:
 ( ∂ Ui)/( ∂ t) + ( ∂ Fi)/( ∂ x) = 0, $∂Ui ∂t + ∂Fi ∂x =0,$ (2)
for i = 1,2,,npde,  axb,  tt0$i=1,2,\dots ,{\mathbf{npde}}\text{, }a\le x\le b\text{, }t\ge {t}_{0}$, where the vector U$U$ is the set of PDE solution values
 U(x,t) = [U1(x,t), … ,Unpde(x,t)]T. $U(x,t)=[U1(x,t),…,Unpde(x,t)]T.$
The optional coupled ODEs are of the general form
 Ri(t,V,V.,ξ,U*,Ux * ,Ut * ) = 0,  i = 1,2, … ,ncode, $Ri(t,V,V.,ξ,U*,Ux*,Ut*)=0, i=1,2,…,ncode,$ (3)
where the vector V$V$ is the set of ODE solution values
 V(t) = [V1(t), … ,(t)]T, $V(t)=[V1(t),…,Vncode(t)]T,$
V.$\stackrel{.}{V}$ denotes its derivative with respect to time, and Ux${U}_{x}$ is the spatial derivative of U$U$.
In (1), Pi,j${P}_{i,j}$, Fi${F}_{i}$ and Ci${C}_{i}$ depend on x$x$, t$t$, U$U$ and V$V$; Di${D}_{i}$ depends on x$x$, t$t$, U$U$, Ux${U}_{x}$ and V$V$; and Si${S}_{i}$ depends on x$x$, t$t$, U$U$, V$V$ and linearly on V.$\stackrel{.}{V}$. Note that Pi,j${P}_{i,j}$, Fi${F}_{i}$, Ci${C}_{i}$ and Si${S}_{i}$ must not depend on any space derivatives, and Pi,j${P}_{i,j}$, Fi${F}_{i}$, Ci${C}_{i}$ and Di${D}_{i}$ must not depend on any time derivatives. In terms of conservation laws, Fi${F}_{i}$, (CiDi)/(x) $\frac{{C}_{i}\partial {D}_{i}}{\partial x}$ and Si${S}_{i}$ are the convective flux, diffusion and source terms respectively.
In (3), ξ$\xi$ represents a vector of nξ${n}_{\xi }$ 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}^{*}$, Ux * ${U}_{x}^{*}$ and Ut * ${U}_{t}^{*}$ are the functions U$U$, Ux${U}_{x}$ and Ut${U}_{t}$ evaluated at these coupling points. Each Ri${R}_{i}$ may depend only linearly on time derivatives. Hence (3) may be written more precisely as
 R = L − MV. − NUt * , $R=L-MV.-NUt*,$ (4)
where R = [R1,,]T$R={\left[{R}_{1},\dots ,{R}_{{\mathbf{ncode}}}\right]}^{\mathrm{T}}$, L$L$ is a vector of length ncode, M$M$ is an ncode by ncode matrix, N$N$ is an ncode by (nξ × npde)$\left({n}_{\xi }×{\mathbf{npde}}\right)$ matrix and the entries in L$L$, M$M$ and N$N$ may depend on t$t$, ξ$\xi$, U*${U}^{*}$, Ux * ${U}_{x}^{*}$ and V$V$. In practice you only need to supply a vector of information to define the ODEs and not the matrices L$L$, M$M$ and N$N$. (See Section [Parameters] for the specification of odedef.)
The integration in time is from t0${t}_{0}$ to tout${t}_{\mathrm{out}}$, over the space interval axb$a\le x\le b$, where a = x1$a={x}_{1}$ and b = xnpts$b={x}_{{\mathbf{npts}}}$ are the leftmost and rightmost points of a user-defined mesh x1,x2,,xnpts${x}_{1},{x}_{2},\dots ,{x}_{{\mathbf{npts}}}$. The initial values of the functions U(x,t)$U\left(x,t\right)$ and V(t)$V\left(t\right)$ must be given at t = t0$t={t}_{0}$.
The PDEs are approximated by a system of ODEs in time for the values of Ui${U}_{i}$ at mesh points using a spatial discretization method similar to the central-difference scheme used in nag_pde_1d_parab_fd (d03pc), nag_pde_1d_parab_dae_fd (d03ph) and nag_pde_1d_parab_remesh_fd (d03pp), but with the flux Fi${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 vector, i${\stackrel{^}{F}}_{i}$ say, must be calculated by you in terms of the left and right values of the solution vector U$U$ (denoted by UL${U}_{L}$ and UR${U}_{R}$ respectively), at each mid-point of the mesh xj(1/2) = (xj1 + xj) / 2${x}_{\mathit{j}-\frac{1}{2}}=\left({x}_{\mathit{j}-1}+{x}_{\mathit{j}}\right)/2$, for j = 2,3,,npts$\mathit{j}=2,3,\dots ,{\mathbf{npts}}$. The left and right values are calculated by nag_pde_1d_parab_convdiff_dae (d03pl) 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 i${\stackrel{^}{F}}_{i}$ is derived from the solution of the Riemann problem given by
 ( ∂ Ui)/( ∂ t) + ( ∂ Fi)/( ∂ y) = 0, $∂Ui ∂t + ∂Fi ∂y =0,$ (5)
where y = xxj(1/2)$y=x-{x}_{j-\frac{1}{2}}$, i.e., y = 0$y=0$ corresponds to x = xj(1/2)$x={x}_{j-\frac{1}{2}}$, with discontinuous initial values U = UL$U={U}_{L}$ for y < 0$y<0$ and U = UR$U={U}_{R}$ for y > 0$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 Pi,j${P}_{i,j}$, Ci${C}_{i}$, Di${D}_{i}$ and Si${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 Ut + Fx = 0${U}_{t}+{F}_{x}=0$ or equivalently Ut + AUx = 0${U}_{t}+A{U}_{x}=0$. Provided the system is linear in U$U$, i.e., the Jacobian matrix A$A$ does not depend on U$U$, the numerical flux $\stackrel{^}{F}$ is given by
 npde F̂ = (1/2)(FL + FR) − (1/2) ∑ αk|λk|ek, k = 1
$F^=12 (FL+FR)-12∑k=1npdeαk|λk|ek,$
(6)
where FL${F}_{L}$ (FR${F}_{R}$) is the flux F$F$ calculated at the left (right) value of U$U$, denoted by UL${U}_{L}$ (UR${U}_{R}$); the λk${\lambda }_{k}$ are the eigenvalues of A$A$; the ek${e}_{k}$ are the right eigenvectors of A$A$; and the αk${\alpha }_{k}$ are defined by
 npde UR − UL = ∑ αkek. k = 1
$UR - UL = ∑ k=1 npde αk ek .$
(7)
An example is given in Section [Example] and in the nag_pde_1d_parab_convdiff (d03pf) documentation.
If the system is nonlinear, Roe's scheme requires that a linearized Jacobian is found (see Roe (1981)).
The functions Pi,j${P}_{i,j}$, Ci${C}_{i}$, Di${D}_{i}$ and Si${S}_{i}$ (but not Fi${F}_{i}$) must be specified in pdedef. The numerical flux i${\stackrel{^}{F}}_{i}$ must be supplied in a separate numflx. For problems in the form (2), the actual argument nag_pde_1d_parab_convdiff_dae_sample_pdedef (d03plp) may be used for pdedef. nag_pde_1d_parab_convdiff_dae_sample_pdedef (d03plp) is included in the NAG Toolbox and sets the matrix with entries Pi,j${P}_{i,j}$ to the identity matrix, and the functions Ci${C}_{i}$, Di${D}_{i}$ and Si${S}_{i}$ to zero.
The boundary condition specification has sufficient flexibility to allow for different types of problems. For second-order problems, i.e., Di${D}_{i}$ depending on Ux${U}_{x}$, a boundary condition is required for each PDE at both boundaries for the problem to be well-posed. If there are no second-order 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 condition, 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 Section [Example] and in the nag_pde_1d_parab_convdiff (d03pf) documentation.
The boundary conditions must be specified in bndary in the form
 GiL(x,t,U,V,V.) = 0  at ​x = a,  i = 1,2, … ,npde, $GiL(x,t,U,V,V.)=0 at ​x=a, i=1,2,…,npde,$ (8)
at the left-hand boundary, and
 GiR(x,t,U,V,V.) = 0  at ​x = b,  i = 1,2, … ,npde, $GiR(x,t,U,V,V.)=0 at ​x=b, i=1,2,…,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$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 Ri${R}_{i}$ must be specified in odedef. You must also specify the coupling points ξ$\xi$ (if any) in the array xi.
The problem is subject to the following restrictions:
 (i) In (1), V.j(t)${\stackrel{.}{V}}_{j}\left(t\right)$, for j = 1,2, … ,ncode$j=1,2,\dots ,{\mathbf{ncode}}$, may only appear linearly in the functions Si${S}_{i}$, for i = 1,2, … ,npde$i=1,2,\dots ,{\mathbf{npde}}$, with a similar restriction for GiL${G}_{i}^{L}$ and GiR${G}_{i}^{R}$; (ii) Pi,j${P}_{i,j}$, Fi${F}_{i}$, Ci${C}_{i}$ and Si${S}_{i}$ must not depend on any space derivatives; and Pi,j${P}_{i,j}$, Fi${F}_{i}$, Ci${C}_{i}$ and Di${D}_{i}$ must not depend on any time derivatives; (iii) t0 < tout${t}_{0}<{t}_{\mathrm{out}}$, so that integration is in the forward direction; (iv) The evaluation of the terms Pi,j${P}_{i,j}$, Ci${C}_{i}$, Di${D}_{i}$ and Si${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 mesh points x1,x2, … ,xnpts${x}_{1},{x}_{2},\dots ,{x}_{{\mathbf{npts}}}$; (v) At least one of the functions Pi,j${P}_{i,j}$ must be nonzero so that there is a time derivative present in the PDE problem.
In total there are ${\mathbf{npde}}×{\mathbf{npts}}+{\mathbf{ncode}}$ 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)).
For further details of the scheme, see Pennington and Berzins (1994) and the references therein.

## 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
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
Sod G A (1978) A survey of several finite difference methods for systems of nonlinear hyperbolic conservation laws J. Comput. Phys. 27 1–31

## Parameters

### Compulsory Input Parameters

1:     npde – int64int32nag_int scalar
The number of PDEs to be solved.
Constraint: npde1${\mathbf{npde}}\ge 1$.
2:     ts – double scalar
The initial value of the independent variable t$t$.
Constraint: ${\mathbf{ts}}<{\mathbf{tout}}$.
3:     tout – double scalar
The final value of t$t$ to which the integration is to be carried out.
4:     pdedef – function handle or string containing name of m-file
pdedef must evaluate the functions Pi,j${P}_{i,j}$, Ci${C}_{i}$, Di${D}_{i}$ and Si${S}_{i}$ which partially define the system of PDEs. Pi,j${P}_{i,j}$ and Ci${C}_{i}$ may depend on x$x$, t$t$, U$U$ and V$V$; Di${D}_{i}$ may depend on x$x$, t$t$, U$U$, Ux${U}_{x}$ and V$V$; and Si${S}_{i}$ may depend on x$x$, t$t$, U$U$, V$V$ and linearly on V.$\stackrel{.}{V}$. pdedef is called approximately midway between each pair of mesh points in turn by nag_pde_1d_parab_convdiff_dae (d03pl). The actual argument nag_pde_1d_parab_convdiff_dae_sample_pdedef (d03plp) may be used for pdedef for problems in the form (2). (nag_pde_1d_parab_convdiff_dae_sample_pdedef (d03plp) is included in the NAG Toolbox.)
[p, c, d, s, ires] = pdedef(npde, t, x, u, ux, ncode, v, vdot, ires)

Input Parameters

1:     npde – int64int32nag_int scalar
The number of PDEs in the system.
2:     t – double scalar
The current value of the independent variable t$t$.
3:     x – double scalar
The current value of the space variable x$x$.
4:     u(npde) – double array
u(i)${\mathbf{u}}\left(\mathit{i}\right)$ contains the value of the component Ui(x,t)${U}_{\mathit{i}}\left(x,t\right)$, for i = 1,2,,npde$\mathit{i}=1,2,\dots ,{\mathbf{npde}}$.
5:     ux(npde) – double array
ux(i)${\mathbf{ux}}\left(\mathit{i}\right)$ contains the value of the component (Ui(x,t))/(x) $\frac{\partial {U}_{\mathit{i}}\left(x,t\right)}{\partial x}$, for i = 1,2,,npde$\mathit{i}=1,2,\dots ,{\mathbf{npde}}$.
6:     ncode – int64int32nag_int scalar
The number of coupled ODEs in the system.
7:     v(ncode) – double array
If ncode > 0${\mathbf{ncode}}>0$, v(i)${\mathbf{v}}\left(\mathit{i}\right)$ contains the value of the component Vi(t)${V}_{\mathit{i}}\left(t\right)$, for i = 1,2,,ncode$\mathit{i}=1,2,\dots ,{\mathbf{ncode}}$.
8:     vdot(ncode) – double array
If ncode > 0${\mathbf{ncode}}>0$, vdot(i)${\mathbf{vdot}}\left(\mathit{i}\right)$ contains the value of component V.i(t)${\stackrel{.}{V}}_{\mathit{i}}\left(t\right)$, for i = 1,2,,ncode$\mathit{i}=1,2,\dots ,{\mathbf{ncode}}$.
Note: V.i(t)${\stackrel{.}{V}}_{\mathit{i}}\left(t\right)$, for i = 1,2,,ncode$\mathit{i}=1,2,\dots ,{\mathbf{ncode}}$, may only appear linearly in Sj${S}_{\mathit{j}}$, for j = 1,2,,npde$\mathit{j}=1,2,\dots ,{\mathbf{npde}}$.
9:     ires – int64int32nag_int scalar
Set to 1​ or ​1$-1\text{​ or ​}1$.

Output Parameters

1:     p(npde,npde) – double array
p(i,j)${\mathbf{p}}\left(\mathit{i},\mathit{j}\right)$ must be set to the value of Pi,j(x,t,U,V)${P}_{\mathit{i},\mathit{j}}\left(x,t,U,V\right)$, for i = 1,2,,npde$\mathit{i}=1,2,\dots ,{\mathbf{npde}}$ and j = 1,2,,npde$\mathit{j}=1,2,\dots ,{\mathbf{npde}}$.
2:     c(npde) – double array
c(i)${\mathbf{c}}\left(\mathit{i}\right)$ must be set to the value of Ci(x,t,U,V)${C}_{\mathit{i}}\left(x,t,U,V\right)$, for i = 1,2,,npde$\mathit{i}=1,2,\dots ,{\mathbf{npde}}$.
3:     d(npde) – double array
d(i)${\mathbf{d}}\left(\mathit{i}\right)$ must be set to the value of Di(x,t,U,Ux,V)${D}_{\mathit{i}}\left(x,t,U,{U}_{x},V\right)$, for i = 1,2,,npde$\mathit{i}=1,2,\dots ,{\mathbf{npde}}$.
4:     s(npde) – double array
s(i)${\mathbf{s}}\left(\mathit{i}\right)$ must be set to the value of Si(x,t,U,V,V.)${S}_{\mathit{i}}\left(x,t,U,V,\stackrel{.}{V}\right)$, for i = 1,2,,npde$\mathit{i}=1,2,\dots ,{\mathbf{npde}}$.
5:     ires – int64int32nag_int scalar
Should usually remain unchanged. However, you may set ires to force the integration function to take certain actions as described below:
ires = 2${\mathbf{ires}}=2$
Indicates to the integrator that control should be passed back immediately to the calling function with the error indicator set to ${\mathbf{ifail}}={\mathbf{6}}$.
ires = 3${\mathbf{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${\mathbf{ires}}=3$ when a physically meaningless input or output value has been generated. If you consecutively set ires = 3${\mathbf{ires}}=3$, then nag_pde_1d_parab_convdiff_dae (d03pl) returns to the calling function with the error indicator set to ${\mathbf{ifail}}={\mathbf{4}}$.
5:     numflx – function handle or string containing name of m-file
numflx must supply the numerical flux for each PDE given the left and right values of the solution vector u${\mathbf{u}}$. numflx is called approximately midway between each pair of mesh points in turn by nag_pde_1d_parab_convdiff_dae (d03pl).
[flux, ires] = numflx(npde, t, x, ncode, v, uleft, uright, ires)

Input Parameters

1:     npde – int64int32nag_int scalar
The number of PDEs in the system.
2:     t – double scalar
The current value of the independent variable t$t$.
3:     x – double scalar
The current value of the space variable x$x$.
4:     ncode – int64int32nag_int scalar
The number of coupled ODEs in the system.
5:     v(ncode) – double array
If ncode > 0${\mathbf{ncode}}>0$, v(i)${\mathbf{v}}\left(\mathit{i}\right)$ contains the value of the component Vi(t)${V}_{\mathit{i}}\left(t\right)$, for i = 1,2,,ncode$\mathit{i}=1,2,\dots ,{\mathbf{ncode}}$.
6:     uleft(npde) – double array
uleft(i)${\mathbf{uleft}}\left(\mathit{i}\right)$ contains the left value of the component Ui(x)${U}_{\mathit{i}}\left(x\right)$, for i = 1,2,,npde$\mathit{i}=1,2,\dots ,{\mathbf{npde}}$.
7:     uright(npde) – double array
uright(i)${\mathbf{uright}}\left(\mathit{i}\right)$ contains the right value of the component Ui(x)${U}_{\mathit{i}}\left(x\right)$, for i = 1,2,,npde$\mathit{i}=1,2,\dots ,{\mathbf{npde}}$.
8:     ires – int64int32nag_int scalar
Set to 1​ or ​1$-1\text{​ or ​}1$.

Output Parameters

1:     flux(npde) – double array
flux(i)${\mathbf{flux}}\left(\mathit{i}\right)$ must be set to the numerical flux i${\stackrel{^}{F}}_{\mathit{i}}$, for i = 1,2,,npde$\mathit{i}=1,2,\dots ,{\mathbf{npde}}$.
2:     ires – int64int32nag_int scalar
Should usually remain unchanged. However, you may set ires to force the integration function to take certain actions as described below:
ires = 2${\mathbf{ires}}=2$
Indicates to the integrator that control should be passed back immediately to the calling function with the error indicator set to ${\mathbf{ifail}}={\mathbf{6}}$.
ires = 3${\mathbf{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${\mathbf{ires}}=3$ when a physically meaningless input or output value has been generated. If you consecutively set ires = 3${\mathbf{ires}}=3$, then nag_pde_1d_parab_convdiff_dae (d03pl) returns to the calling function with the error indicator set to ${\mathbf{ifail}}={\mathbf{4}}$.
6:     bndary – function handle or string containing name of m-file
bndary must evaluate the functions GiL${G}_{i}^{L}$ and GiR${G}_{i}^{R}$ which describe the physical and numerical boundary conditions, as given by (8) and (9).
[g, ires] = bndary(npde, npts, t, x, u, ncode, v, vdot, ibnd, ires)

Input Parameters

1:     npde – int64int32nag_int scalar
The number of PDEs in the system.
2:     npts – int64int32nag_int scalar
The number of mesh points in the interval [a,b]$\left[a,b\right]$.
3:     t – double scalar
The current value of the independent variable t$t$.
4:     x(npts) – double array
The mesh points in the spatial direction. x(1)${\mathbf{x}}\left(1\right)$ corresponds to the left-hand boundary, a$a$, and x(npts)${\mathbf{x}}\left({\mathbf{npts}}\right)$ corresponds to the right-hand boundary, b$b$.
5:     u(npde,npts) – double array
u(i,j)${\mathbf{u}}\left(\mathit{i},\mathit{j}\right)$ contains the value of the component Ui(x,t)${U}_{\mathit{i}}\left(x,t\right)$ at x = x(j)$x={\mathbf{x}}\left(\mathit{j}\right)$, for i = 1,2,,npde$\mathit{i}=1,2,\dots ,{\mathbf{npde}}$ and j = 1,2,,npts$\mathit{j}=1,2,\dots ,{\mathbf{npts}}$.
Note:  if banded matrix algebra is to be used then the functions GiL${G}_{\mathit{i}}^{L}$ and GiR${G}_{\mathit{i}}^{R}$ may depend on the value of Ui(x,t)${U}_{\mathit{i}}\left(x,t\right)$ at the boundary point and the two adjacent points only.
6:     ncode – int64int32nag_int scalar
The number of coupled ODEs in the system.
7:     v(ncode) – double array
If ncode > 0${\mathbf{ncode}}>0$, v(i)${\mathbf{v}}\left(\mathit{i}\right)$ contains the value of the component Vi(t)${V}_{\mathit{i}}\left(t\right)$, for i = 1,2,,ncode$\mathit{i}=1,2,\dots ,{\mathbf{ncode}}$.
8:     vdot(ncode) – double array
If ncode > 0${\mathbf{ncode}}>0$, vdot(i)${\mathbf{vdot}}\left(\mathit{i}\right)$ contains the value of component V.i(t)${\stackrel{.}{V}}_{\mathit{i}}\left(t\right)$, for i = 1,2,,ncode$\mathit{i}=1,2,\dots ,{\mathbf{ncode}}$.
Note: V.i(t)${\stackrel{.}{V}}_{\mathit{i}}\left(t\right)$, for i = 1,2,,ncode$\mathit{i}=1,2,\dots ,{\mathbf{ncode}}$, may only appear linearly in GjL${G}_{\mathit{j}}^{L}$ and GjR${G}_{\mathit{j}}^{R}$, for j = 1,2,,npde$\mathit{j}=1,2,\dots ,{\mathbf{npde}}$.
9:     ibnd – int64int32nag_int scalar
Specifies which boundary conditions are to be evaluated.
ibnd = 0${\mathbf{ibnd}}=0$
bndary must evaluate the left-hand boundary condition at x = a$x=a$.
ibnd0${\mathbf{ibnd}}\ne 0$
bndary must evaluate the right-hand boundary condition at x = b$x=b$.
10:   ires – int64int32nag_int scalar
Set to 1​ or ​1$-1\text{​ or ​}1$.

Output Parameters

1:     g(npde) – double array
g(i)${\mathbf{g}}\left(\mathit{i}\right)$ must contain the i$\mathit{i}$th component of either GiL${G}_{\mathit{i}}^{L}$ or GiR${G}_{\mathit{i}}^{R}$ in (8) and (9), depending on the value of ibnd, for i = 1,2,,npde$\mathit{i}=1,2,\dots ,{\mathbf{npde}}$.
2:     ires – int64int32nag_int scalar
Should usually remain unchanged. However, you may set ires to force the integration function to take certain actions as described below:
ires = 2${\mathbf{ires}}=2$
Indicates to the integrator that control should be passed back immediately to the calling function with the error indicator set to ${\mathbf{ifail}}={\mathbf{6}}$.
ires = 3${\mathbf{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${\mathbf{ires}}=3$ when a physically meaningless input or output value has been generated. If you consecutively set ires = 3${\mathbf{ires}}=3$, then nag_pde_1d_parab_convdiff_dae (d03pl) returns to the calling function with the error indicator set to ${\mathbf{ifail}}={\mathbf{4}}$.
7:     u(neqn) – double array
neqn, the dimension of the array, must satisfy the constraint ${\mathbf{neqn}}={\mathbf{npde}}×{\mathbf{npts}}+{\mathbf{ncode}}$.
The initial values of the dependent variables defined as follows:
• u(npde × (j1) + i)${\mathbf{u}}\left({\mathbf{npde}}×\left(\mathit{j}-1\right)+\mathit{i}\right)$ contain Ui(xj,t0)${U}_{\mathit{i}}\left({x}_{\mathit{j}},{t}_{0}\right)$, for i = 1,2,,npde$\mathit{i}=1,2,\dots ,{\mathbf{npde}}$ and j = 1,2,,npts$\mathit{j}=1,2,\dots ,{\mathbf{npts}}$, and
• u(npts × npde + k)${\mathbf{u}}\left({\mathbf{npts}}×{\mathbf{npde}}+\mathit{k}\right)$ contain Vk(t0)${V}_{\mathit{k}}\left({t}_{0}\right)$, for k = 1,2,,ncode$\mathit{k}=1,2,\dots ,{\mathbf{ncode}}$.
8:     x(npts) – double array
npts, the dimension of the array, must satisfy the constraint npts3${\mathbf{npts}}\ge 3$.
The mesh points in the space direction. x(1)${\mathbf{x}}\left(1\right)$ must specify the left-hand boundary, a$a$, and x(npts)${\mathbf{x}}\left({\mathbf{npts}}\right)$ must specify the right-hand boundary, b$b$.
Constraint: x(1) < x(2) < < x(npts)${\mathbf{x}}\left(1\right)<{\mathbf{x}}\left(2\right)<\cdots <{\mathbf{x}}\left({\mathbf{npts}}\right)$.
9:     ncode – int64int32nag_int scalar
The number of coupled ODE components.
Constraint: ncode0${\mathbf{ncode}}\ge 0$.
10:   odedef – function handle or string containing name of m-file
odedef must evaluate the functions R$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., ncode = 0${\mathbf{ncode}}=0$), odedef must be the string 'd03pek'. (nag_pde_1d_parab_dae_keller_remesh_fd_dummy_odedef (d03pek) is included in the NAG Toolbox.)
[r, ires] = odedef(npde, t, ncode, v, vdot, nxi, xi, ucp, ucpx, ucpt, ires)

Input Parameters

1:     npde – int64int32nag_int scalar
The number of PDEs in the system.
2:     t – double scalar
The current value of the independent variable t$t$.
3:     ncode – int64int32nag_int scalar
The number of coupled ODEs in the system.
4:     v(ncode) – double array
If ncode > 0${\mathbf{ncode}}>0$, v(i)${\mathbf{v}}\left(\mathit{i}\right)$ contains the value of the component Vi(t)${V}_{\mathit{i}}\left(t\right)$, for i = 1,2,,ncode$\mathit{i}=1,2,\dots ,{\mathbf{ncode}}$.
5:     vdot(ncode) – double array
If ncode > 0${\mathbf{ncode}}>0$, vdot(i)${\mathbf{vdot}}\left(\mathit{i}\right)$ contains the value of component V.i(t)${\stackrel{.}{V}}_{\mathit{i}}\left(t\right)$, for i = 1,2,,ncode$\mathit{i}=1,2,\dots ,{\mathbf{ncode}}$.
6:     nxi – int64int32nag_int scalar
The number of ODE/PDE coupling points.
7:     xi(nxi) – double array
If nxi > 0${\mathbf{nxi}}>0$, xi(i)${\mathbf{xi}}\left(\mathit{i}\right)$ contains the ODE/PDE coupling point, ξi${\xi }_{\mathit{i}}$, for i = 1,2,,nxi$\mathit{i}=1,2,\dots ,{\mathbf{nxi}}$.
8:     ucp(npde, : $:$) – double array
The second dimension of the array must be at least max (1,nxi)$\mathrm{max}\phantom{\rule{0.125em}{0ex}}\left(1,{\mathbf{nxi}}\right)$
If nxi > 0${\mathbf{nxi}}>0$, ucp(i,j)${\mathbf{ucp}}\left(\mathit{i},\mathit{j}\right)$ contains the value of Ui(x,t)${U}_{\mathit{i}}\left(x,t\right)$ at the coupling point x = ξj$x={\xi }_{\mathit{j}}$, for i = 1,2,,npde$\mathit{i}=1,2,\dots ,{\mathbf{npde}}$ and j = 1,2,,nxi$\mathit{j}=1,2,\dots ,{\mathbf{nxi}}$.
9:     ucpx(npde, : $:$) – double array
The second dimension of the array must be at least max (1,nxi)$\mathrm{max}\phantom{\rule{0.125em}{0ex}}\left(1,{\mathbf{nxi}}\right)$
If nxi > 0${\mathbf{nxi}}>0$, ucpx(i,j)${\mathbf{ucpx}}\left(\mathit{i},\mathit{j}\right)$ contains the value of (Ui(x,t))/(x) $\frac{\partial {U}_{\mathit{i}}\left(x,t\right)}{\partial x}$ at the coupling point x = ξj$x={\xi }_{\mathit{j}}$, for i = 1,2,,npde$\mathit{i}=1,2,\dots ,{\mathbf{npde}}$ and j = 1,2,,nxi$\mathit{j}=1,2,\dots ,{\mathbf{nxi}}$.
10:   ucpt(npde, : $:$) – double array
The second dimension of the array must be at least max (1,nxi)$\mathrm{max}\phantom{\rule{0.125em}{0ex}}\left(1,{\mathbf{nxi}}\right)$
If nxi > 0${\mathbf{nxi}}>0$, ucpt(i,j)${\mathbf{ucpt}}\left(\mathit{i},\mathit{j}\right)$ contains the value of (Ui)/(t) $\frac{\partial {U}_{\mathit{i}}}{\partial t}$ at the coupling point x = ξj$x={\xi }_{\mathit{j}}$, for i = 1,2,,npde$\mathit{i}=1,2,\dots ,{\mathbf{npde}}$ and j = 1,2,,nxi$\mathit{j}=1,2,\dots ,{\mathbf{nxi}}$.
11:   ires – int64int32nag_int scalar
The form of R$R$ that must be returned in the array r.
ires = 1${\mathbf{ires}}=1$
Equation (10) must be used.
ires = 1${\mathbf{ires}}=-1$
Equation (11) must be used.

Output Parameters

1:     r(ncode) – double array
r(i)${\mathbf{r}}\left(\mathit{i}\right)$ must contain the i$\mathit{i}$th component of R$R$, for i = 1,2,,ncode$\mathit{i}=1,2,\dots ,{\mathbf{ncode}}$, where R$R$ is defined as
 R = L − MV. − NUt * , $R=L-MV.-NUt*,$ (10)
or
 R = − MV. − NUt * . $R=-MV.-NUt*.$ (11)
The definition of R$R$ is determined by the input value of ires.
2:     ires – int64int32nag_int scalar
Should usually remain unchanged. However, you may reset ires to force the integration function to take certain actions, as described below:
ires = 2${\mathbf{ires}}=2$
Indicates to the integrator that control should be passed back immediately to the calling (sub)routine with the error indicator set to ${\mathbf{ifail}}={\mathbf{6}}$.
ires = 3${\mathbf{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${\mathbf{ires}}=3$ when a physically meaningless input or output value has been generated. If you consecutively set ires = 3${\mathbf{ires}}=3$, then nag_pde_1d_parab_convdiff_dae (d03pl) returns to the calling function with the error indicator set to ${\mathbf{ifail}}={\mathbf{4}}$.
11:   xi( : $:$) – double array
Note: the dimension of the array xi must be at least max (1,nxi)$\mathrm{max}\phantom{\rule{0.125em}{0ex}}\left(1,{\mathbf{nxi}}\right)$.
xi(i)${\mathbf{xi}}\left(\mathit{i}\right)$, for i = 1,2,,nxi$\mathit{i}=1,2,\dots ,{\mathbf{nxi}}$, must be set to the ODE/PDE coupling points.
Constraint: x(1)xi(1) < xi(2) < < xi(nxi)x(npts)${\mathbf{x}}\left(1\right)\le {\mathbf{xi}}\left(1\right)<{\mathbf{xi}}\left(2\right)<\cdots <{\mathbf{xi}}\left({\mathbf{nxi}}\right)\le {\mathbf{x}}\left({\mathbf{npts}}\right)$.
12:   rtol( : $:$) – double array
Note: the dimension of the array rtol must be at least 1$1$ if itol = 1${\mathbf{itol}}=1$ or 2$2$ and at least neqn${\mathbf{neqn}}$ if itol = 3${\mathbf{itol}}=3$ or 4$4$.
The relative local error tolerance.
Constraint: rtol(i)0.0${\mathbf{rtol}}\left(i\right)\ge 0.0$ for all relevant i$i$.
13:   atol( : $:$) – double array
Note: the dimension of the array atol must be at least 1$1$ if itol = 1${\mathbf{itol}}=1$ or 3$3$ and at least neqn${\mathbf{neqn}}$ if itol = 2${\mathbf{itol}}=2$ or 4$4$.
The absolute local error tolerance.
Constraint: atol(i)0.0${\mathbf{atol}}\left(i\right)\ge 0.0$ for all relevant i$i$.
Note: corresponding elements of rtol and atol cannot both be 0.0$0.0$.
14:   itol – int64int32nag_int scalar
A value to indicate the form of the local error test. If ei${e}_{\mathit{i}}$ is the estimated local error for u(i)${\mathbf{u}}\left(\mathit{i}\right)$, for i = 1,2,,neqn$\mathit{i}=1,2,\dots ,{\mathbf{neqn}}$, and $‖\text{ }‖$ denotes the norm, then the error test to be satisfied is ei < 1.0$‖{e}_{\mathit{i}}‖<1.0$. itol indicates to nag_pde_1d_parab_convdiff_dae (d03pl) whether to interpret either or both of rtol and atol as a vector or scalar in the formation of the weights wi${w}_{\mathit{i}}$ used in the calculation of the norm (see the description of norm_p):
 itol rtol atol wi${w}_{\mathit{i}}$ 1 scalar scalar rtol(1) × |u(i)| + atol(1)${\mathbf{rtol}}\left(1\right)×|{\mathbf{u}}\left(\mathit{i}\right)|+{\mathbf{atol}}\left(1\right)$ 2 scalar vector rtol(1) × |u(i)| + atol(i)${\mathbf{rtol}}\left(1\right)×|{\mathbf{u}}\left(\mathit{i}\right)|+{\mathbf{atol}}\left(\mathit{i}\right)$ 3 vector scalar rtol(i) × |u(i)| + atol(1)${\mathbf{rtol}}\left(\mathit{i}\right)×|{\mathbf{u}}\left(\mathit{i}\right)|+{\mathbf{atol}}\left(1\right)$ 4 vector vector rtol(i) × |u(i)| + atol(i)${\mathbf{rtol}}\left(\mathit{i}\right)×|{\mathbf{u}}\left(\mathit{i}\right)|+{\mathbf{atol}}\left(\mathit{i}\right)$
Constraint: 1itol4$1\le {\mathbf{itol}}\le 4$.
15:   norm_p – string (length ≥ 1)
The type of norm to be used.
norm = '1'${\mathbf{norm}}=\text{'1'}$
Averaged L1${L}_{1}$ norm.
norm = '2'${\mathbf{norm}}=\text{'2'}$
Averaged L2${L}_{2}$ norm.
If Unorm${U}_{\mathrm{norm}}$ denotes the norm of the vector u of length neqn, then for the averaged L1${L}_{1}$ norm
 neqn Unorm = 1/(neqn) ∑ u(i) / wi, i = 1
$Unorm=1neqn∑i=1neqnui/wi,$
and for the averaged L2${L}_{2}$ norm
 Unorm = sqrt(1/(neqn) ∑ i = 1neqn(u(i) / wi)2). $Unorm=1neqn∑i=1neqn(ui/wi)2.$
See the description of itol for the formulation of the weight vector w$w$.
Constraint: norm = '1'${\mathbf{norm}}=\text{'1'}$ or '2'$\text{'2'}$.
16:   laopt – string (length ≥ 1)
The type of matrix algebra required.
laopt = 'F'${\mathbf{laopt}}=\text{'F'}$
Full matrix methods to be used.
laopt = 'B'${\mathbf{laopt}}=\text{'B'}$
Banded matrix methods to be used.
laopt = 'S'${\mathbf{laopt}}=\text{'S'}$
Sparse matrix methods to be used.
Constraint: laopt = 'F'${\mathbf{laopt}}=\text{'F'}$, 'B'$\text{'B'}$ or 'S'$\text{'S'}$.
Note: you are recommended to use the banded option when no coupled ODEs are present (ncode = 0${\mathbf{ncode}}=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.
17:   algopt(30$30$) – double array
May be set to control various options available in the integrator. If you wish to employ all the default options, then algopt(1)${\mathbf{algopt}}\left(1\right)$ should be set to 0.0$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)${\mathbf{algopt}}\left(1\right)$
Selects the ODE integration method to be used. If algopt(1) = 1.0${\mathbf{algopt}}\left(1\right)=1.0$, a BDF method is used and if algopt(1) = 2.0${\mathbf{algopt}}\left(1\right)=2.0$, a Theta method is used. The default is algopt(1) = 1.0${\mathbf{algopt}}\left(1\right)=1.0$.
If algopt(1) = 2.0${\mathbf{algopt}}\left(1\right)=2.0$, then algopt(i)${\mathbf{algopt}}\left(\mathit{i}\right)$, for i = 2,3,4$\mathit{i}=2,3,4$, are not used.
algopt(2)${\mathbf{algopt}}\left(2\right)$
Specifies the maximum order of the BDF integration formula to be used. algopt(2)${\mathbf{algopt}}\left(2\right)$ may be 1.0$1.0$, 2.0$2.0$, 3.0$3.0$, 4.0$4.0$ or 5.0$5.0$. The default value is algopt(2) = 5.0${\mathbf{algopt}}\left(2\right)=5.0$.
algopt(3)${\mathbf{algopt}}\left(3\right)$
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${\mathbf{algopt}}\left(3\right)=1.0$ a modified Newton iteration is used and if algopt(3) = 2.0${\mathbf{algopt}}\left(3\right)=2.0$ a functional iteration method is used. If functional iteration is selected and the integrator encounters difficulty, then there is an automatic switch to the modified Newton iteration. The default value is algopt(3) = 1.0${\mathbf{algopt}}\left(3\right)=1.0$.
algopt(4)${\mathbf{algopt}}\left(4\right)$
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${P}_{i,\mathit{j}}=0.0$, for j = 1,2,,npde$\mathit{j}=1,2,\dots ,{\mathbf{npde}}$, for some i$i$ or when there is no V.i(t)${\stackrel{.}{V}}_{i}\left(t\right)$ dependence in the coupled ODE system. If algopt(4) = 1.0${\mathbf{algopt}}\left(4\right)=1.0$, then the Petzold test is used. If algopt(4) = 2.0${\mathbf{algopt}}\left(4\right)=2.0$, then the Petzold test is not used. The default value is algopt(4) = 1.0${\mathbf{algopt}}\left(4\right)=1.0$.
If algopt(1) = 1.0${\mathbf{algopt}}\left(1\right)=1.0$, then algopt(i)${\mathbf{algopt}}\left(\mathit{i}\right)$, for i = 5,6,7$\mathit{i}=5,6,7$, are not used.
algopt(5)${\mathbf{algopt}}\left(5\right)$
Specifies the value of Theta to be used in the Theta integration method. 0.51algopt(5)0.99$0.51\le {\mathbf{algopt}}\left(5\right)\le 0.99$. The default value is algopt(5) = 0.55${\mathbf{algopt}}\left(5\right)=0.55$.
algopt(6)${\mathbf{algopt}}\left(6\right)$
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${\mathbf{algopt}}\left(6\right)=1.0$, a modified Newton iteration is used and if algopt(6) = 2.0${\mathbf{algopt}}\left(6\right)=2.0$, a functional iteration method is used. The default value is algopt(6) = 1.0${\mathbf{algopt}}\left(6\right)=1.0$.
algopt(7)${\mathbf{algopt}}\left(7\right)$
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${\mathbf{algopt}}\left(7\right)=1.0$, then switching is allowed and if algopt(7) = 2.0${\mathbf{algopt}}\left(7\right)=2.0$, then switching is not allowed. The default value is algopt(7) = 1.0${\mathbf{algopt}}\left(7\right)=1.0$.
algopt(11)${\mathbf{algopt}}\left(11\right)$
Specifies a point in the time direction, tcrit${t}_{\mathrm{crit}}$, beyond which integration must not be attempted. The use of tcrit${t}_{\mathrm{crit}}$ is described under the parameter itask. If algopt(1)0.0${\mathbf{algopt}}\left(1\right)\ne 0.0$, a value of 0.0$0.0$ for algopt(11)${\mathbf{algopt}}\left(11\right)$, say, should be specified even if itask subsequently specifies that tcrit${t}_{\mathrm{crit}}$ will not be used.
algopt(12)${\mathbf{algopt}}\left(12\right)$
Specifies the minimum absolute step size to be allowed in the time integration. If this option is not required, algopt(12)${\mathbf{algopt}}\left(12\right)$ should be set to 0.0$0.0$.
algopt(13)${\mathbf{algopt}}\left(13\right)$
Specifies the maximum absolute step size to be allowed in the time integration. If this option is not required, algopt(13)${\mathbf{algopt}}\left(13\right)$ should be set to 0.0$0.0$.
algopt(14)${\mathbf{algopt}}\left(14\right)$
Specifies the initial step size to be attempted by the integrator. If algopt(14) = 0.0${\mathbf{algopt}}\left(14\right)=0.0$, then the initial step size is calculated internally.
algopt(15)${\mathbf{algopt}}\left(15\right)$
Specifies the maximum number of steps to be attempted by the integrator in any one call. If algopt(15) = 0.0${\mathbf{algopt}}\left(15\right)=0.0$, then no limit is imposed.
algopt(23)${\mathbf{algopt}}\left(23\right)$
Specifies what method is to be used to solve the nonlinear equations at the initial point to initialize the values of U$U$, Ut${U}_{t}$, V$V$ and V.$\stackrel{.}{V}$. If algopt(23) = 1.0${\mathbf{algopt}}\left(23\right)=1.0$, a modified Newton iteration is used and if algopt(23) = 2.0${\mathbf{algopt}}\left(23\right)=2.0$, functional iteration is used. The default value is algopt(23) = 1.0${\mathbf{algopt}}\left(23\right)=1.0$.
algopt(29)${\mathbf{algopt}}\left(29\right)$ and algopt(30)${\mathbf{algopt}}\left(30\right)$ are used only for the sparse matrix algebra option, i.e., laopt = 'S'${\mathbf{laopt}}=\text{'S'}$.
algopt(29)${\mathbf{algopt}}\left(29\right)$
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$0.0<{\mathbf{algopt}}\left(29\right)<1.0$, with smaller values biasing the algorithm towards maintaining sparsity at the expense of numerical stability. If algopt(29)${\mathbf{algopt}}\left(29\right)$ lies outside the range then the default value is used. If the functions regard the Jacobian matrix as numerically singular, then increasing algopt(29)${\mathbf{algopt}}\left(29\right)$ towards 1.0$1.0$ may help, but at the cost of increased fill-in. The default value is algopt(29) = 0.1${\mathbf{algopt}}\left(29\right)=0.1$.
algopt(30)${\mathbf{algopt}}\left(30\right)$
Used as the relative pivot threshold during subsequent Jacobian decompositions (see algopt(29)${\mathbf{algopt}}\left(29\right)$) below which an internal error is invoked. algopt(30)${\mathbf{algopt}}\left(30\right)$ must be greater than zero, otherwise the default value is used. If algopt(30)${\mathbf{algopt}}\left(30\right)$ is greater than 1.0$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)${\mathbf{algopt}}\left(29\right)$). The default value is algopt(30) = 0.0001${\mathbf{algopt}}\left(30\right)=0.0001$.
18:   rsave(lrsave) – double array
If ind = 0${\mathbf{ind}}=0$, rsave need not be set on entry.
If ind = 1${\mathbf{ind}}=1$, rsave must be unchanged from the previous call to the function because it contains required information about the iteration.
19:   isave(lisave) – int64int32nag_int array
If ind = 0${\mathbf{ind}}=0$, isave need not be set.
If ind = 1${\mathbf{ind}}=1$, isave must be unchanged from the previous call to the function 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)${\mathbf{isave}}\left(1\right)$
Contains the number of steps taken in time.
isave(2)${\mathbf{isave}}\left(2\right)$
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)${\mathbf{isave}}\left(3\right)$
Contains the number of Jacobian evaluations performed by the time integrator.
isave(4)${\mathbf{isave}}\left(4\right)$
Contains the order of the BDF method last used in the time integration, if applicable. When the Theta method is used, isave(4)${\mathbf{isave}}\left(4\right)$ contains no useful information.
isave(5)${\mathbf{isave}}\left(5\right)$
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$LU$ decomposition of the Jacobian matrix.
The task to be performed by the ODE integrator.
itask = 1${\mathbf{itask}}=1$
Normal computation of output values u at t = tout$t={\mathbf{tout}}$ (by overshooting and interpolating).
itask = 2${\mathbf{itask}}=2$
Take one step in the time direction and return.
itask = 3${\mathbf{itask}}=3$
Stop at first internal integration point at or beyond t = tout$t={\mathbf{tout}}$.
itask = 4${\mathbf{itask}}=4$
Normal computation of output values u at t = tout$t={\mathbf{tout}}$ but without overshooting t = tcrit$t={t}_{\mathrm{crit}}$ where tcrit${t}_{\mathrm{crit}}$ is described under the parameter algopt.
itask = 5${\mathbf{itask}}=5$
Take one step in the time direction and return, without passing tcrit${t}_{\mathrm{crit}}$, where tcrit${t}_{\mathrm{crit}}$ is described under the parameter algopt.
Constraint: itask = 1${\mathbf{itask}}=1$, 2$2$, 3$3$, 4$4$ or 5$5$.
21:   itrace – int64int32nag_int scalar
The level of trace information required from nag_pde_1d_parab_convdiff_dae (d03pl) and the underlying ODE solver. itrace may take the value 1$-1$, 0$0$, 1$1$, 2$2$ or 3$3$.
itrace = 1${\mathbf{itrace}}=-1$
No output is generated.
itrace = 0${\mathbf{itrace}}=0$
Only warning messages from the PDE solver are printed on the current error message unit (see nag_file_set_unit_error (x04aa)).
itrace > 0${\mathbf{itrace}}>0$
Output from the underlying ODE solver is printed on the current advisory message unit (see nag_file_set_unit_advisory (x04ab)). This output contains details of Jacobian entries, the nonlinear iteration and the time integration during the computation of the ODE system.
If itrace < 1${\mathbf{itrace}}<-1$, then 1$-1$ is assumed and similarly if itrace > 3${\mathbf{itrace}}>3$, then 3$3$ is assumed.
The advisory messages are given in greater detail as itrace increases. You are advised to set itrace = 0${\mathbf{itrace}}=0$, unless you are experienced with sub-chapter D02M–N.
22:   ind – int64int32nag_int scalar
Indicates whether this is a continuation call or a new integration.
ind = 0${\mathbf{ind}}=0$
Starts or restarts the integration in time.
ind = 1${\mathbf{ind}}=1$
Continues the integration after an earlier exit from the function. In this case, only the parameters tout and ifail should be reset between calls to nag_pde_1d_parab_convdiff_dae (d03pl).
Constraint: ind = 0${\mathbf{ind}}=0$ or 1$1$.

### Optional Input Parameters

1:     npts – int64int32nag_int scalar
Default: The dimension of the array x.
The number of mesh points in the interval [a,b]$\left[a,b\right]$.
Constraint: npts3${\mathbf{npts}}\ge 3$.
2:     nxi – int64int32nag_int scalar
Default: The dimension of the array xi.
The number of ODE/PDE coupling points.
Constraints:
• if ncode = 0${\mathbf{ncode}}=0$, nxi = 0${\mathbf{nxi}}=0$;
• if ncode > 0${\mathbf{ncode}}>0$, nxi0${\mathbf{nxi}}\ge 0$.
3:     neqn – int64int32nag_int scalar
Default: The dimension of the array u.
The number of ODEs in the time direction.
Constraint: ${\mathbf{neqn}}={\mathbf{npde}}×{\mathbf{npts}}+{\mathbf{ncode}}$.

lrsave lisave

### Output Parameters

1:     ts – double scalar
The value of t$t$ corresponding to the solution values in u. Normally ${\mathbf{ts}}={\mathbf{tout}}$.
2:     u(neqn) – double array
The computed solution Ui(xj,t)${U}_{\mathit{i}}\left({x}_{\mathit{j}},t\right)$, for i = 1,2,,npde$\mathit{i}=1,2,\dots ,{\mathbf{npde}}$ and j = 1,2,,npts$\mathit{j}=1,2,\dots ,{\mathbf{npts}}$, and Vk(t)${V}_{\mathit{k}}\left(t\right)$, for k = 1,2,,ncode$\mathit{k}=1,2,\dots ,{\mathbf{ncode}}$, all evaluated at t = ts$t={\mathbf{ts}}$.
3:     rsave(lrsave) – double array
If ind = 1${\mathbf{ind}}=1$, rsave must be unchanged from the previous call to the function because it contains required information about the iteration.
4:     isave(lisave) – int64int32nag_int array
If ind = 1${\mathbf{ind}}=1$, isave must be unchanged from the previous call to the function 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)${\mathbf{isave}}\left(1\right)$
Contains the number of steps taken in time.
isave(2)${\mathbf{isave}}\left(2\right)$
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)${\mathbf{isave}}\left(3\right)$
Contains the number of Jacobian evaluations performed by the time integrator.
isave(4)${\mathbf{isave}}\left(4\right)$
Contains the order of the BDF method last used in the time integration, if applicable. When the Theta method is used, isave(4)${\mathbf{isave}}\left(4\right)$ contains no useful information.
isave(5)${\mathbf{isave}}\left(5\right)$
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$LU$ decomposition of the Jacobian matrix.
5:     ind – int64int32nag_int scalar
ind = 1${\mathbf{ind}}=1$.
6:     ifail – int64int32nag_int scalar
${\mathrm{ifail}}={\mathbf{0}}$ unless the function detects an error (see [Error Indicators and Warnings]).

## Error Indicators and Warnings

Errors or warnings detected by the function:

Cases prefixed with W are classified as warnings and do not generate an error of type NAG:error_n. See nag_issue_warnings.

ifail = 1${\mathbf{ifail}}=1$
 On entry, ${\mathbf{ts}}\ge {\mathbf{tout}}$, or ${\mathbf{tout}}-{\mathbf{ts}}$ is too small, or itask ≠ 1${\mathbf{itask}}\ne 1$, 2$2$, 3$3$, 4$4$ or 5$5$, or at least one of the coupling points defined in array xi is outside the interval [x(1),x(npts)${\mathbf{x}}\left(1\right),{\mathbf{x}}\left({\mathbf{npts}}\right)$], or the coupling points are not in strictly increasing order, or npts < 3${\mathbf{npts}}<3$, or npde < 1${\mathbf{npde}}<1$, or laopt ≠ 'F'${\mathbf{laopt}}\ne \text{'F'}$, 'B' or 'S', or itol ≠ 1${\mathbf{itol}}\ne 1$, 2$2$, 3$3$ or 4$4$, or ind ≠ 0${\mathbf{ind}}\ne 0$ or 1$1$, or mesh points x(i)${\mathbf{x}}\left(i\right)$ are badly ordered, or lrsave or lisave are too small, or ncode and nxi are incorrectly defined, or ind = 1${\mathbf{ind}}=1$ on initial entry to nag_pde_1d_parab_convdiff_dae (d03pl), or ${\mathbf{neqn}}\ne {\mathbf{npde}}×{\mathbf{npts}}+{\mathbf{ncode}}$, or an element of rtol or atol < 0.0${\mathbf{atol}}<0.0$, or corresponding elements of rtol and atol are both 0.0$0.0$, or norm ≠ 1${\mathbf{norm}}\ne 1$ or 2$2$.
W ifail = 2${\mathbf{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$t={\mathbf{ts}}$. The components of u contain the computed values at the current point t = ts$t={\mathbf{ts}}$.
W ifail = 3${\mathbf{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$t={\mathbf{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${\mathbf{ifail}}=4$
In setting up the ODE system, the internal initialization function was unable to initialize the derivative of the ODE system. This could be due to the fact that ires was repeatedly set to 3$3$ in one of pdedef, numflx, bndary or odedef, when the residual in the underlying ODE solver was being evaluated. Incorrect specification of boundary conditions may also result in this error.
ifail = 5${\mathbf{ifail}}=5$
In solving the ODE system, a singular Jacobian has been encountered. Check the problem formulation.
W ifail = 6${\mathbf{ifail}}=6$
When evaluating the residual in solving the ODE system, ires was set to 2$2$ in at least one of pdedef, numflx, bndary or odedef. Integration was successful as far as t = ts$t={\mathbf{ts}}$.
ifail = 7${\mathbf{ifail}}=7$
The values of atol and rtol are so small that the function is unable to start the integration in time.
ifail = 8${\mathbf{ifail}}=8$
In either, pdedef, numflx, bndary or odedef, ires was set to an invalid value.
ifail = 9${\mathbf{ifail}}=9$ (nag_ode_ivp_stiff_imp_revcom (d02nn))
A serious error has occurred in an internal call to the specified function. Check the problem specification and all parameters and array dimensions. Setting itrace = 1${\mathbf{itrace}}=1$ may provide more information. If the problem persists, contact NAG.
W ifail = 10${\mathbf{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${\mathbf{itask}}\ne 2$ or 5$5$.)
ifail = 11${\mathbf{ifail}}=11$
An error occurred during Jacobian formulation of the ODE system (a more detailed error description may be directed to the current advisory message unit when itrace1${\mathbf{itrace}}\ge 1$). If using the sparse matrix algebra option, the values of algopt(29)${\mathbf{algopt}}\left(29\right)$ and algopt(30)${\mathbf{algopt}}\left(30\right)$ may be inappropriate.
ifail = 12${\mathbf{ifail}}=12$
In solving the ODE system, the maximum number of steps specified in algopt(15)${\mathbf{algopt}}\left(15\right)$ has been taken.
W ifail = 13${\mathbf{ifail}}=13$
Some error weights wi${w}_{i}$ became zero during the time integration (see the description of itol). Pure relative error control (atol(i) = 0.0${\mathbf{atol}}\left(i\right)=0.0$) was requested on a variable (the i$i$th) which has become zero. The integration was successful as far as t = ts$t={\mathbf{ts}}$.
ifail = 14${\mathbf{ifail}}=14$
One or more of the functions Pi,j${P}_{i,j}$, Di${D}_{i}$ or Ci${C}_{i}$ was detected as depending on time derivatives, which is not permissible.
ifail = 15${\mathbf{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).

## Accuracy

nag_pde_1d_parab_convdiff_dae (d03pl) 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 parameters, atol and rtol.

nag_pde_1d_parab_convdiff_dae (d03pl) 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 function to solve systems which are not naturally in this form is discouraged, and you are advised to use one of the central-difference schemes 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)${\mathbf{algopt}}\left(13\right)$. It is worth experimenting with this parameter, 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 and on the accuracy requested. For a given system and a fixed accuracy it is approximately proportional to neqn.

## Example

```function nag_pde_1d_parab_convdiff_dae_example
npde = int64(2);
npts = int64(141);
ncode = int64(2);
neqn = 2*141+2;
ts = 0;
tout = 0.5;
x = zeros(npts,1);
xi = [0; 1];
rtol = [0.00025];
atol = [1e-05];
itol = int64(1);
norm_p = '1';
laopt = 'S';
algopt = [1;
0;
0;
0;
0;
0;
0;
0;
0;
0;
0;
0;
0;
0;
0;
0;
0;
0;
0;
0;
0;
0;
0;
0;
0;
0;
0;
0;
0.1;
1.1];
rsave = zeros(11000, 1);
isave = zeros(15700, 1, 'int64');
itrace = int64(0);
ind = int64(0);

% Initialise mesh
for i=1:double(npts)
x(i) = (i-1)/(double(npts)-1);
end

u = exact(ts, npde, x, npts);
u = reshape(u, [282,1]);
u(neqn-1) = u(1) - u(2);
u(neqn) = u(neqn-2) + u(neqn - 3);

[tsOut, uOut, rsaveOut, isaveOut, indOut, ifail] = ...
nag_pde_1d_parab_convdiff_dae(npde, ts, tout, @pdedef, @numflx, @bndary, ...
u, x, ncode, @odedef, xi, rtol, atol, itol, norm_p, laopt, ...
algopt, rsave, isave, itask, itrace, ind);

nop = 0;
xout = zeros(8,1);
for i=1:20:double(npts)
nop = nop+1;
xout(nop) = x(i);
end

uout=zeros(npde, 8);
for i = 1:nop
ii = 1 + 20*(i-1);
jj = double(npde)*(ii-1);
uout(1, i) = uOut(jj+1);
uout(2, i) = uOut(jj+2);
end

ue = exact(tout, npde, xout, nop);

output = zeros(nop, 5);
fprintf('\n        X        Approx U1   Exact U1    Approx U2   Exact U2\n');
for i=1:nop
fprintf('   %9.4f   %9.4f   %9.4f   %9.4f   %9.4f\n', ...
xout(i), uout(1,i), ue(1,i), uout(2,i), ue(2,i));
output(i,:) = [xout(i), uout(1,i), ue(1,i), uout(2,i), ue(2,i)];
end

function [g, ires] = bndary(npde, npts, t, x, u, ncode, v, vdot, ibnd, ires)
g = zeros(npde, 1);
np1 = double(npts)-1; % npts is int64
if (ibnd == 0)
ue = exact(t,npde,x(1),1);
g(1) = u(1,1) + u(2,1) - ue(1,1) - ue(2,1);
dudx = (u(1,2)-u(2,2)-u(1,1)+u(2,1))/(x(2)-x(1));
g(2) = vdot(1) - dudx;
else
ue = exact(t,npde,x(npts),1);
g(1) = u(1,npts) - u(2,npts) - ue(1,1) + ue(2,1);
dudx = (u(1,npts)+u(2,npts)-u(1,np1)-u(2,np1))/(x(npts)-x(np1));
g(2) = vdot(2) + 3*dudx;
end

function [u] = exact(t,npde,x,npts)
u = zeros(npde,npts);
pi2 = 2*pi;
for i = 1:double(npts)
f = exp(pi*(x(i)-3*t))*sin(pi2*(x(i)-3*t));
g = exp(-pi2*(x(i)+t))*cos(pi2*(x(i)+t));
u(1,i) = f + g;
u(2,i) = f - g;
end

function [flux, ires] = numflx(npde, t, x, ncode, v, uleft, uright, ires)
flux = zeros(npde, 1);
flux(1) = 0.5*(3.0*uleft(1)-uright(1)+3.0*uleft(2)+uright(2));
flux(2) = 0.5*(3.0*uleft(1)+uright(1)+3.0*uleft(2)-uright(2));

function [r, ires] = odedef(npde, t, ncode, v, vdot, nxi, xi, ucp, ucpx, ucpt, ires)
r = zeros(ncode, 1);
if (ires ~= -1)
r(1) = v(1) - ucp(1,1) + ucp(2,1);
r(2) = v(2) - ucp(1,2) - ucp(2,2);
end
function [p, c, d, s, ires] = pdedef(npde, t, x, u, ux, ncode, v, vdot, ires)
p = zeros(npde, npde);
c = zeros(npde, 1);
d = zeros(npde, 1);
s = zeros(npde, 1);
for i = 1:double(npde)
c(i) = 1;
for j = 1:double(npde)
if (i == j)
p(i,j) = 1;
end
end
end
```
```

X        Approx U1   Exact U1    Approx U2   Exact U2
0.0000     -0.0432     -0.0432      0.0432      0.0432
0.1429     -0.0221     -0.0220      0.0001     -0.0000
0.2857     -0.0199     -0.0199     -0.0231     -0.0231
0.4286     -0.0123     -0.0123     -0.0175     -0.0176
0.5714      0.0247      0.0245      0.0224      0.0224
0.7143      0.0829      0.0827      0.0827      0.0825
0.8571      0.1038      0.1036      0.1041      0.1039
1.0000     -0.0006     -0.0001     -0.0004      0.0001

```
```function d03pl_example
npde = int64(2);
npts = int64(141);
ncode = int64(2);
neqn = 2*141+2;
ts = 0;
tout = 0.5;
x = zeros(npts,1);
xi = [0; 1];
rtol = [0.00025];
atol = [1e-05];
itol = int64(1);
norm_p = '1';
laopt = 'S';
algopt = [1;
0;
0;
0;
0;
0;
0;
0;
0;
0;
0;
0;
0;
0;
0;
0;
0;
0;
0;
0;
0;
0;
0;
0;
0;
0;
0;
0;
0.1;
1.1];
rsave = zeros(11000, 1);
isave = zeros(15700, 1, 'int64');
itrace = int64(0);
ind = int64(0);

% Initialise mesh
for i=1:double(npts)
x(i) = (i-1)/(double(npts)-1);
end

u = exact(ts, npde, x, npts);
u = reshape(u, [282,1]);
u(neqn-1) = u(1) - u(2);
u(neqn) = u(neqn-2) + u(neqn - 3);

[tsOut, uOut, rsaveOut, isaveOut, indOut, ifail] = ...
d03pl(npde, ts, tout, @pdedef, @numflx, @bndary, ...
u, x, ncode, @odedef, xi, rtol, atol, itol, norm_p, laopt, ...
algopt, rsave, isave, itask, itrace, ind);

nop = 0;
xout = zeros(8,1);
for i=1:20:double(npts)
nop = nop+1;
xout(nop) = x(i);
end

uout=zeros(npde, 8);
for i = 1:nop
ii = 1 + 20*(i-1);
jj = double(npde)*(ii-1);
uout(1, i) = uOut(jj+1);
uout(2, i) = uOut(jj+2);
end

ue = exact(tout, npde, xout, nop);

output = zeros(nop, 5);
fprintf('\n        X        Approx U1   Exact U1    Approx U2   Exact U2\n');
for i=1:nop
fprintf('   %9.4f   %9.4f   %9.4f   %9.4f   %9.4f\n', ...
xout(i), uout(1,i), ue(1,i), uout(2,i), ue(2,i));
output(i,:) = [xout(i), uout(1,i), ue(1,i), uout(2,i), ue(2,i)];
end

function [g, ires] = bndary(npde, npts, t, x, u, ncode, v, vdot, ibnd, ires)
g = zeros(npde, 1);
np1 = double(npts)-1; % npts is int64
if (ibnd == 0)
ue = exact(t,npde,x(1),1);
g(1) = u(1,1) + u(2,1) - ue(1,1) - ue(2,1);
dudx = (u(1,2)-u(2,2)-u(1,1)+u(2,1))/(x(2)-x(1));
g(2) = vdot(1) - dudx;
else
ue = exact(t,npde,x(npts),1);
g(1) = u(1,npts) - u(2,npts) - ue(1,1) + ue(2,1);
dudx = (u(1,npts)+u(2,npts)-u(1,np1)-u(2,np1))/(x(npts)-x(np1));
g(2) = vdot(2) + 3*dudx;
end

function [u] = exact(t,npde,x,npts)
u = zeros(npde,npts);
pi2 = 2*pi;
for i = 1:double(npts)
f = exp(pi*(x(i)-3*t))*sin(pi2*(x(i)-3*t));
g = exp(-pi2*(x(i)+t))*cos(pi2*(x(i)+t));
u(1,i) = f + g;
u(2,i) = f - g;
end

function [flux, ires] = numflx(npde, t, x, ncode, v, uleft, uright, ires)
flux = zeros(npde, 1);
flux(1) = 0.5*(3.0*uleft(1)-uright(1)+3.0*uleft(2)+uright(2));
flux(2) = 0.5*(3.0*uleft(1)+uright(1)+3.0*uleft(2)-uright(2));

function [r, ires] = odedef(npde, t, ncode, v, vdot, nxi, xi, ucp, ucpx, ucpt, ires)
r = zeros(ncode, 1);
if (ires ~= -1)
r(1) = v(1) - ucp(1,1) + ucp(2,1);
r(2) = v(2) - ucp(1,2) - ucp(2,2);
end
function [p, c, d, s, ires] = pdedef(npde, t, x, u, ux, ncode, v, vdot, ires)
p = zeros(npde, npde);
c = zeros(npde, 1);
d = zeros(npde, 1);
s = zeros(npde, 1);
for i = 1:double(npde)
c(i) = 1;
for j = 1:double(npde)
if (i == j)
p(i,j) = 1;
end
end
end
```
```

X        Approx U1   Exact U1    Approx U2   Exact U2
0.0000     -0.0432     -0.0432      0.0432      0.0432
0.1429     -0.0221     -0.0220      0.0001     -0.0000
0.2857     -0.0199     -0.0199     -0.0231     -0.0231
0.4286     -0.0123     -0.0123     -0.0175     -0.0176
0.5714      0.0247      0.0245      0.0224      0.0224
0.7143      0.0829      0.0827      0.0827      0.0825
0.8571      0.1038      0.1036      0.1041      0.1039
1.0000     -0.0006     -0.0001     -0.0004      0.0001

```