# NAG Library Chapter Introduction

## 1Scope of the Chapter

This chapter is concerned with the numerical solution of partial differential equations.

## 2Background to the Problems

The definition of a partial differential equation problem includes not only the equation itself but also the domain of interest and appropriate subsidiary conditions. Indeed, partial differential equations are usually classified as elliptic, hyperbolic or parabolic according to the form of the equation and the form of the subsidiary conditions which must be assigned to produce a well-posed problem. The routines in this chapter will often call upon routines from other chapters, such as Chapter F04 (Simultaneous Linear Equations) and Chapter D02 (Ordinary Differential Equations). Other chapters also contain relevant routines, in particular Chapter D06 (Mesh Generation) and Chapter F11 (Large Scale Linear Systems).
The classification of partial differential equations is easily described in the case of linear equations of the second order in two independent variables, i.e., equations of the form
 $auxx+2buxy+cuyy+dux+euy+fu+g=0,$ (1)
where $a$, $b$, $c$, $d$, $e$, $f$ and $g$ are functions of $x$ and $y$ only. Equation (1) is called elliptic, hyperbolic or parabolic according to whether $ac-{b}^{2}$ is positive, negative or zero, respectively. Useful definitions of the concepts of elliptic, hyperbolic and parabolic character can also be given for differential equations in more than two independent variables, for systems and for nonlinear differential equations.
For elliptic equations, of which Laplace's equation
 $uxx+uyy=0$ (2)
is the simplest example of second order, the subsidiary conditions take the form of boundary conditions, i.e., conditions which provide information about the solution at all points of a closed boundary. For example, if equation (2) holds in a plane domain $D$ bounded by a contour $C$, a solution $u$ may be sought subject to the condition
 $u=f on C,$ (3)
where $f$ is a given function. The condition (3) is known as a Dirichlet boundary condition. Equally common is the Neumann boundary condition
 $u′=g on C,$ (4)
which is one form of a more general condition
 $u′+fu=g on C,$ (5)
where ${u}^{\prime }$ denotes the derivative of $u$ normal to the contour $C$, and $f$ and $g$ are given functions. Provided that $f$ and $g$ satisfy certain restrictions, condition (5) yields a well-posed boundary value problem for Laplace's equation. In the case of the Neumann problem, one further piece of information, e.g., the value of $u$ at a particular point, is necessary for uniqueness of the solution. Boundary conditions similar to the above are applicable to more general second-order elliptic equations, whilst two such conditions are required for equations of fourth order.
For hyperbolic equations, the wave equation
 $utt-uxx=0$ (6)
is the simplest example of second order. It is equivalent to a first-order system
 $ut-vx=0, vt-ux=0.$ (7)
The subsidiary conditions may take the form of initial conditions, i.e., conditions which provide information about the solution at points on a suitable open boundary. For example, if equation (6) is satisfied for $t>0$, a solution $u$ may be sought such that
 $u x,0 = f x , u t x,0 = g x ,$ (8)
where $f$ and $g$ are given functions. This is an example of an initial value problem, sometimes known as Cauchy's problem.
For parabolic equations, of which the heat conduction equation
 $ut-uxx=0$ (9)
is the simplest example, the subsidiary conditions always include some of initial type and may also include some of boundary type. For example, if equation (9) is satisfied for $t>0$ and $0, a solution $u$ may be sought such that
 $u x,0 = f x , 0 < x < 1 ,$ (10)
and
 $u 0,t = 0 , u 1,t = 1 , t > 0 .$ (11)
This is an example of a mixed initial/boundary value problem.
For all types of partial differential equations, finite difference methods (see Mitchell and Griffiths (1980)) and finite element methods (see Wait and Mitchell (1985)) are the most common means of solution. The use of finite difference methods features prominently in this chapter, however, the use of finite element methods is sufficiently large in scope to warrant a separate library of routines for their implementation. NAG no longer provides a companion finite element library, but there are several such specialist libraries available, including ParaFEM. Some of the utility routines in this chapter are concerned with the solution of the large sparse systems of equations which arise from finite difference and finite element methods. Further routines for this purpose are provided in Chapter F11.
Alternative methods of solution are often suitable for special classes of problems. For example, the method of characteristics is the most common for hyperbolic equations involving time and one space dimension (see Smith (1985)). The method of lines (see Mikhlin and Smolitsky (1967)) may be used to reduce a parabolic equation to a (stiff) system of ordinary differential equations, which may be solved by means of routines from Chapter D02 (Ordinary Differential Equations). Similarly, integral equation or boundary element methods (see Jaswon and Symm (1977)) are frequently used for elliptic equations. Typically, in the latter case, the solution of a boundary value problem is represented in terms of certain boundary functions by an integral expression which satisfies the differential equation throughout the relevant domain. The boundary functions are obtained by applying the given boundary conditions to this representation. Implementation of this method necessitates discretization of only the boundary of the domain, the dimensionality of the problem thus being effectively reduced by one. The boundary conditions yield a full system of simultaneous equations, as opposed to the sparse systems yielded by finite difference and finite element methods, but the full system is usually of much lower order. Solution of this system yields the boundary functions, from which the solution of the problem may be obtained, by quadrature, as and where required.

## 3Recommendations on Choice and Use of Available Routines

The choice of routine will depend first of all upon the type of partial differential equation to be solved. At present no special allowances are made for problems with boundary singularities such as may arise at corners of domains or at points where boundary conditions change. For such problems results should be treated with caution. The choice of routine may also depend on whether or not it is to be used in a multithreaded environment.
You may wish to construct your own partial differential equation solution software for problems not solvable by the routines described in Section 3.2 to Section 3.8 below. In such cases you can employ appropriate routines from the Linear Algebra Chapters to solve the resulting linear systems; see Section 3.10 for further details.

Some of the routines in this chapter come in pairs, with each routine in the pair having exactly the same functionality, except that one of them has additional arguments in order to make it safe for use in multithreaded applications. The routine that is safe for use in multithreaded applications has an ‘a’ as the last character in the name, in place of the usual ‘f’. An example of such a pair is d03pca and d03pcf.
For some routines there is no thread safe alternative and if this is the case it is clearly stated in the routine document.

### 3.2Elliptic Equations

The routine d03eaf solves Laplace's equation in two dimensions, equation (2), by an integral equation method. This routine is applicable to an arbitrary domain bounded internally or externally by one or more closed contours, when the value of either the unknown function $u$ or its normal derivative ${u}^{\prime }$ is given at each point of the boundary.
The routines d03ebf and d03ecf solve a system of simultaneous algebraic equations of five-point and seven-point molecule form (see Mikhlin and Smolitsky (1967)) on two-dimensional and three-dimensional topologically-rectangular meshes respectively, using Stone's Strongly Implicit Procedure (SIP). These routines, which make repeated calls of the utility routines d03uaf and d03ubf respectively, may be used to solve any boundary value problem whose finite difference representation takes the appropriate form.
The routine d03edf solves a system of seven-point difference equations in a rectangular grid (in two dimensions), using the multigrid iterative method. The equations are supplied by you, and the seven-point form allows cross-derivative terms to be represented (see Mitchell and Griffiths (1980)). The method is particularly efficient for large systems of equations with diagonal dominance and should be preferred to d03ebf whenever it is appropriate for the solution of the problem.
The routine d03eef discretizes a second-order equation on a two-dimensional rectangular region using finite differences and a seven-point molecule. The routine allows for cross-derivative terms, Dirichlet, Neumann or mixed boundary conditions, and either central or upwind differences. The resulting seven-diagonal difference equations are in a form suitable for passing directly to the multigrid routine d03edf, although other solution methods could just as easily be used.
The routine d03faf, based on the routine HW3CRT from FISHPACK (see Swarztrauber and Sweet (1979)), solves the Helmholtz equation in a three-dimensional cuboidal region, with any combination of Dirichlet, Neumann or periodic boundary conditions. The method used is based on the fast Fourier transform algorithm, and is likely to be particularly efficient on vector-processing machines.

See Section 3.8.

### 3.4Parabolic Equations

There are five routines available for solving general parabolic equations in one space dimension:
Equations may include nonlinear terms but the true derivative ${u}_{t}$ should occur linearly and equations should usually contain a second-order space derivative ${u}_{xx}$. There are certain restrictions on the coefficients to try to ensure that the problems posed can be solved by the above routines.
The method of solution is to discretize the space derivatives using finite differences or collocation, and to solve the resulting system of ordinary differential equations using a ‘stiff’ solver.
d03pcf/d03pca and d03pdf/d03pda can solve a system of parabolic equations of the form
 $∑ j = 1 n P i j x,t,U, U x ∂ U j ∂ t + Q i x,t,U, U x = x - m ∂ ∂ x x m R i x,t,U, U x ,$
where $i=1,2,\dots ,n$, $a\le x\le b$, $t\ge {t}_{0}$.
The parameter $m$ allows the routine to handle different coordinate systems easily (Cartesian, cylindrical polars and spherical polars). d03pcf/d03pca uses a finite differences spatial discretization and d03pdf/d03pda uses a collocation spatial discretization.
d03phf/d03pha and d03pjf/d03pja are similar to d03pcf/d03pca and d03pdf/d03pda respectively, except that they provide scope for coupled differential-algebraic systems. This extended functionality allows for the solution of more complex and more general problems, e.g., periodic boundary conditions and integro-differential equations.
d03ppf/d03ppa is similar to d03phf/d03pha but allows remeshing to take place in the spatial direction. This facility can be very useful when the nature of the solution in the spatial direction varies considerably over time.
For parabolic systems in two space dimensions see Section 3.7.

### 3.5Black–Scholes Equations

d03ncf solves the Black–Scholes equation
 $∂f ∂t +r-qS ∂f ∂S +σ2S22 ∂2f ∂S2 =rf$
 $Smin
for the value $f$ of a European or American, put or call stock option. The parameters $r$, $q$ and $\sigma$ may each be either constant or time-dependent. The values of the Greeks are also returned.
In certain cases an analytic solution of the Black–Scholes equation is available. In these cases the solution may be computed by d03ndf. More generally, Chapter S contains a set of option pricing routines that evaluate the closed form solutions or approximations to the equations that define mathematical models for the prices of selected financial option contracts, including the Black–Scholes equation (s30aaf).

### 3.6First-order Systems in One Space Dimension

There are three routines available for solving systems of first-order partial differential equations:
Equations may include nonlinear terms but the time derivative should occur linearly. There are certain restrictions on the coefficients to ensure that the problems posed can be solved by the above routines.
The method of solution is to discretize the space derivatives using the Keller box scheme and to solve the resulting system of ordinary differential equations using a ‘stiff’ solver.
d03pef is designed to solve a system of the form
 $∑ j = 1 n P i j x,t,U, U x ∂ U j ∂ t + Q i x,t,U, U x = 0 ,$
where $i=1,2,\dots ,n$, $a\le x\le b$, $t\ge {t}_{0}$.
d03pkf is similar to d03pef except that it provides scope for coupled differential algebraic systems. This extended functionality allows for the solution of more complex problems.
d03prf is similar to d03pkf but allows remeshing to take place in the spatial direction. This facility can be very useful when the nature of the solution in the spatial direction varies considerably over time.
d03pef, d03pkf or d03prf may also be used to solve systems of higher or mixed order partial differential equations which have been reduced to first-order. Note that in general these routines are unsuitable for hyperbolic first-order equations, for which an appropriate upwind discretization scheme should be used (see Section 3.8 for example).

### 3.7Second-order Systems in Two Space Dimensions

There are two routines available for solving nonlinear second-order time-dependent systems in two space dimensions:
These routines are formally applicable to the general nonlinear system
 $F j t,x,y,u, u t , u x , u y , u x x , u x y , u y y = 0 ,$
where $j=1,2,\dots ,\mathbf{npde}$, $\left(x,y\right)\in \Omega$, ${t}_{0}\le t\le {t}_{\mathrm{out}}$. However, they should not be used to solve purely hyperbolic systems, or time-independent problems.
d03raf solves the nonlinear system in a rectangular domain, while d03rbf solves in a rectilinear region, i.e., a domain bounded by perpendicular straight lines.
Both routines use the method of lines and solve the resulting system of ordinary differential equations using a backward differentiation formula (BDF) method, modified Newton method, and BiCGSTAB iterative linear solver. Local uniform grid refinement is used to improve accuracy.
Utility routine d03rzf may be used in conjunction with d03rbf to check the user-supplied initial mesh, and extract mesh coordinate data.

### 3.8Convection-diffusion Systems

There are three routines available for solving systems of convection-diffusion equations with optional source terms:
Equations may include nonlinear terms but the time derivative should occur linearly. There are certain restrictions on the coefficients to ensure that the problems posed can be solved by the above routines, in particular the system must be posed in conservative form (see below). The routines may also be used to solve hyperbolic convection-only systems.
Convection terms are discretized using an upwind scheme involving a numerical flux function based on the solution of a Riemann problem at each mesh point (see LeVeque (1990)); and diffusion and source terms are discretized using central differences. The resulting system of ordinary differential equations is solved using a ‘stiff’ solver. In the case of Euler equations for a perfect gas various approximate and exact Riemann solvers are provided in d03puf, d03pvf, d03pwf and d03pxf. These routines may be used in conjunction with d03pff, d03plf and d03psf.
d03pff is designed to solve systems of the form
 $∑ j = 1 n P i j x,t,U ∂ U j ∂ t + ∂ ∂ x F i x,t,U = C i x,t,U ∂ ∂ x D i x,t,U, U x + S i x,t,U ,$
or hyperbolic convection-only systems of the form
 $∑ j = 1 n P i j x,t,U ∂ U j ∂ t + ∂ F i x,t,U ∂ x = 0 ,$
where $i=1,2,\dots ,n$, $a\le x\le b$, $t\ge {t}_{0}$.
d03plf is similar to d03pff except that it provides scope for coupled differential algebraic systems. This extended functionality allows for the solution of more complex problems.
d03psf is similar to d03plf but allows remeshing to take place in the spatial direction. This facility can be very useful when the nature of the solution in the spatial direction varies considerably over time.

### 3.9Automatic Mesh Generation

The routine d03maf places a triangular mesh over a given two-dimensional region. The region may have any shape and may include holes. It may also be used in conjunction with routines from the NAG Finite Element Library. A wider range of mesh generation routines are available in Chapter D06.

### 3.10Utility Routines

d03uaf (d03ubf) calculates, by the Strongly Implicit Procedure, an approximate correction to a current estimate of the solution of a system of simultaneous algebraic equations for which the iterative update matrix is of five (seven) point molecule form on a two- (three-) dimensional topologically-rectangular mesh.
Routines are available in the Linear Algebra Chapters for the direct and iterative solution of linear equations. Here we point to some of the routines that may be of use in solving the linear systems that arise from finite difference or finite element approximations to partial differential equation solutions. Chapters F01, F04, F07, F08 and F11 should be consulted for further information and for the appropriate routine documents. Decision trees for the solution of linear systems are given in Section 4 in the F04 Chapter Introduction.
The following routines allow the direct solution of symmetric positive definite systems:
 Band f07hdf (dpbtrf) and f07hef (dpbtrs) Variable band (skyline) f01mcf and f04mcf Tridiagonal f07jaf (dptsv), f07jdf (dpttrf) and f07jef (dpttrs) Sparse ${\mathbf{f11jaf}}{}^{*}$ and f11jbf
(${}^{*}$ the description of f11jbf explains how f11jaf should be called to obtain a direct method) and the following routines allow the iterative solution of symmetric positive definite and symmetric-indefinite systems:
 Sparse f11gdf, f11gef, f11gff, f11jaf, f11jcf and f11jef.
The latter two routines above are black box routines which include Incomplete Cholesky, SSOR or Jacobi preconditioning.
The following routines allow the direct solution of nonsymmetric systems:
 Band f07bdf (dgbtrf) and f07bef (dgbtrs) Almost block-diagonal f01lhf and f04lhf Tridiagonal f01lef, f04lef or f07caf (dgtsv) Sparse f01brf (and f01bsf) and f04axf
and the following routines allow the iterative solution of nonsymmetric systems:
 Sparse f11bdf, f11bef, f11bff, f11daf, f11dcf and f11def.
The latter two routines above are black box routines which include incomplete $LU$, SSOR and Jacobi preconditioning.
The routines d03pyf and d03pzf use linear interpolation to compute the solution to a parabolic problem and its first derivative at the user-specified points. d03pzf may be used in conjunction with d03pcf/d03pca, d03pef, d03phf/d03pha, d03pkf, d03ppf/d03ppa and d03prf. d03pyf may be used in conjunction with d03pdf/d03pda and d03pjf/d03pja.
d03rzf is a utility routine for use in conjunction with d03rbf. They can be called to check the user-specified initial mesh and to extract mesh coordinate data.

## 4Decision Trees

### Tree 1

 Does PDE have a time derivative? Does PDE have second derivatives? see Tree 4 Parabolic branch yes yes no no Is PDE hyperbolic? see Tree 3 Hyperbolic branch yes no 1 space dimension? Does PDE have coupled ODEs? Is a remeshing process required? d03prf yes yes yes no no no d03pkf d03pef N/A see Tree 2 Elliptic branch

### Tree 2: Elliptic branch

 2 space dimensions? Is the domain arbitrary? d03eaf yes yes no no Is the domain topologically rectangular? Do you want to use a multigrid scheme? d03edf with d03eef yes yes no no d03ebf or d03uaf d03eaf 3 space dimensions? Is the domain topologically equivalent to a brick? Is the PDE the Helmholtz equation? d03faf yes yes yes no no no d03ecf or d03ubf N/A N/A

### Tree 3: Hyperbolic branch

 1 space dimension? Does PDE have coupled ODEs? Is a remeshing process required? d03psf yes yes yes no no no d03plf d03pff N/A

### Tree 4: Parabolic branch

 1 space dimension? Is PDE the Black–Scholes equations? d03ncf or d03ndf yes yes no no Is PDE in conservative form? Does PDE have coupled ODEs? Is a remeshing process required? d03psf yes yes yes no no no d03plf d03pff see Tree 5 Branch for parabolic PDE in non-conservative form 2 space dimensions? Is the domain rectangular? d03raf yes yes no no Is the domain rectilinear? d03rbf yes no N/A N/A

### Tree 5: Branch for parabolic PDE in non-conservative form

 Do you want to use finite differences? Does PDE have coupled ODEs? Is a remeshing process required? d03ppf yes yes yes no no no d03phf d03pcf Do you want to use Chebyshev collocation? Does PDE have coupled ODEs? d03pjf yes yes no no d03pdf N/A

## 5Functionality Index

 Automatic mesh generation,
 triangles over a plane domain d03maf
 Black–Scholes equation,
 analytic d03ndf
 finite difference d03ncf
 Convection-diffusion system(s),
 nonlinear,
 one space dimension,
 using upwind difference scheme based on Riemann solvers d03pff
 using upwind difference scheme based on Riemann solvers,
 with coupled differential algebraic system d03plf
 with remeshing d03psf
 Elliptic equations,
 discretization on rectangular grid (seven-point two-dimensional molecule) d03eef
 equations on rectangular grid (seven-point two-dimensional molecule) d03edf
 finite difference equations (five-point two-dimensional molecule) d03ebf
 finite difference equations (seven-point three-dimensional molecule) d03ecf
 Helmholtz's equation in three dimensions d03faf
 Laplace's equation in two dimensions d03eaf
 First-order system(s),
 nonlinear,
 one space dimension,
 using Keller box scheme d03pef
 using Keller box scheme,
 with coupled differential algebraic system d03pkf
 with remeshing d03prf
 PDEs, general system, one space variable, method of lines,
 parabolic,
 collocation spatial discretization,
 coupled DAEs, comprehensive d03pjf
 easy-to-use d03pdf
 finite differences spatial discretization,
 coupled DAEs, comprehensive d03phf
 coupled DAEs, remeshing, comprehensive d03ppf
 easy-to-use d03pcf
 Second order system(s),
 nonlinear,
 two space dimensions,
 in rectangular domain d03raf
 in rectilinear domain d03rbf
 Utility routine,
 average values for d03ndf d03nef
 basic SIP for five-point two-dimensional molecule d03uaf
 basic SIP for seven-point three-dimensional molecule d03ubf
 exact Riemann solver for Euler equations d03pxf
 HLL Riemann solver for Euler equations d03pwf
 interpolation routine for collocation scheme d03pyf
 interpolation routine for finite difference,
 Keller box and upwind scheme d03pzf
 Osher's Riemann solver for Euler equations d03pvf
 return coordinates of grid points for d03rbf d03rzf
 Roe's Riemann solver for Euler equations d03puf

## 6Auxiliary Routines Associated with Library Routine Arguments

 d53pck nagf_pde_1d_parab_remesh_fd_dummy_odedefSee the description of the argument odedef in d03phf/d03pha, d03pjf/d03pja and d03ppf/d03ppa. d03pck nagf_pde_1d_parab_remesh_fd_dummy_odedef_oldSee the description of the argument odedef in d03phf/d03pha, d03pjf/d03pja and d03ppf/d03ppa. d53pcl nagf_pde_1d_parab_remesh_fd_dummy_monitfSee the description of the argument monitf in d03ppf/d03ppa. d03pcl nagf_pde_1d_parab_remesh_fd_dummy_monitf_oldSee the description of the argument monitf in d03ppf/d03ppa. d03pek nagf_pde_1d_parab_dae_keller_remesh_fd_dummy_odedefSee the description of the argument odedef in d03pkf, d03plf, d03prf and d03psf. d03pel nagf_pde_1d_parab_dae_keller_remesh_fd_dummy_monitfSee the description of the argument monitf in d03prf and d03psf. d03pfp nagf_pde_1d_parab_convdiff_sample_pdedefSee the description of the argument pdedef in d03pff. d03plp nagf_pde_1d_parab_convdiff_dae_sample_pdedefSee the description of the argument pdedef in d03plf and d03psf.

## 7Routines Withdrawn or Scheduled for Withdrawal

The following lists all those routines that have been withdrawn since Mark 19 of the Library or are scheduled for withdrawal at one of the next two marks.
 WithdrawnRoutine Mark ofWithdrawal Replacement Routine(s) d03ryf 27 No replacement required
Ames W F (1977) Nonlinear Partial Differential Equations in Engineering (2nd Edition) Academic Press
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
Jaswon M A and Symm G T (1977) Integral Equation Methods in Potential Theory and Elastostatics Academic Press
LeVeque R J (1990) Numerical Methods for Conservation Laws Birkhäuser Verlag
Mikhlin S G and Smolitsky K L (1967) Approximate Methods for the Solution of Differential and Integral Equations Elsevier
Mitchell A R and Griffiths D F (1980) The Finite Difference Method in Partial Differential Equations Wiley
Pennington S V and Berzins M (1994) New NAG Library software for first-order partial differential equations ACM Trans. Math. Softw. 20 63–99
Richtmyer R D and Morton K W (1967) Difference Methods for Initial-value Problems (2nd Edition) Interscience
Smith G D (1985) Numerical Solution of Partial Differential Equations: Finite Difference Methods (3rd Edition) Oxford University Press
Swarztrauber P N and Sweet R A (1979) Efficient Fortran subprograms for the solution of separable elliptic partial differential equations ACM Trans. Math. Software 5 352–364
Wait R and Mitchell A R (1985) Finite Element Analysis and Application Wiley
© The Numerical Algorithms Group Ltd, Oxford, UK. 2017