# NAG FL Interfaced03ebf (dim2_​ellip_​fd)

## 1Purpose

d03ebf uses the Strongly Implicit Procedure to calculate the solution to a system of simultaneous algebraic equations of five-point molecule form on a two-dimensional topologically-rectangular mesh. (‘Topological’ means that a polar grid, for example $\left(r,\theta \right)$, can be used, being equivalent to a rectangular box.)

## 2Specification

Fortran Interface
 Subroutine d03ebf ( n1, n2, lda, a, b, c, d, e, q, t, ndir, ixn, iyn,
 Integer, Intent (In) :: n1, n2, lda, itmax, ndir, ixn, iyn Integer, Intent (Inout) :: itcoun, ifail Integer, Intent (Out) :: itused Real (Kind=nag_wp), Intent (In) :: a(lda,n2), b(lda,n2), c(lda,n2), d(lda,n2), e(lda,n2), q(lda,n2), aparam, conres, conchn Real (Kind=nag_wp), Intent (Inout) :: t(lda,n2), wrksp1(lda,n2), wrksp2(lda,n2), wrksp3(lda,n2) Real (Kind=nag_wp), Intent (Out) :: resids(itmax), chngs(itmax)
#include <nag.h>
 void d03ebf_ (const Integer *n1, const Integer *n2, const Integer *lda, const double a[], const double b[], const double c[], const double d[], const double e[], const double q[], double t[], const double *aparam, const Integer *itmax, Integer *itcoun, Integer *itused, const Integer *ndir, const Integer *ixn, const Integer *iyn, const double *conres, const double *conchn, double resids[], double chngs[], double wrksp1[], double wrksp2[], double wrksp3[], Integer *ifail)
The routine may be called by the names d03ebf or nagf_pde_dim2_ellip_fd.

## 3Description

Given a set of simultaneous equations
 $Mt=q$ (1)
(which could be nonlinear) derived, for example, from a finite difference representation of a two-dimensional elliptic partial differential equation and its boundary conditions, the routine determines the values of the dependent variable $t$. $q$ is a known vector of length ${n}_{1}×{n}_{2}$ and $M$ is a square $\left({n}_{1}×{n}_{2}\right)$ by $\left({n}_{1}×{n}_{2}\right)$ matrix.
The equations must be of five-diagonal form:
 $aijti,j-1+bijti-1,j+cijtij+dijti+1,j+eijti,j+1=qij$
for $i=1,2,\dots ,{n}_{1}$ and $j=1,2,\dots ,{n}_{2}$, provided ${c}_{ij}\ne 0.0$. Indeed, if ${c}_{ij}=0.0$, then the equation is assumed to be
 $tij=qij.$
For example, if ${n}_{1}=3$ and ${n}_{2}=2$, the equations take the form:
 $c11 d11 e11 b21 c21 d21 e21 b31 c31 e31 a12 c12 d12 a22 b22 c22 d22 a32 b32 c32 t11 t21 t31 t12 t22 t32 = q11 q21 q31 q12 q22 q32 .$
The system is solved iteratively, from a starting approximation ${t}^{\left(1\right)}$, by the formulae
 $r n =q-Mtn Msn =r n t n+1 =t n +s n .$
Thus ${r}^{\left(n\right)}$ is the residual of the $n$th approximate solution ${t}^{\left(n\right)}$, and ${s}^{\left(n\right)}$ is the update change vector. The calling program supplies an initial approximation for the values of the dependent variable in the array t, the coefficients of the five-point molecule system of equations in the arrays a, b, c, d and e, and the source terms in the array q. The routine derives the residual of the latest approximate solution and then uses the approximate $LU$ factorization of the Strongly Implicit Procedure with the necessary acceleration argument adjustment by calling d03uaf at each iteration. d03ebf combines the newly derived change with the old approximation to obtain the new approximate solution for $t$. The new solution is checked for convergence against the user-supplied convergence criteria and if these have not been achieved the iterative cycle is repeated. Convergence is based on both the maximum absolute normalized residuals (calculated with reference to the previous approximate solution as these are calculated at the commencement of each iteration) and on the maximum absolute change made to the values of $t$.
Problems in topologically non-rectangular regions can be solved using the routine by surrounding the region by a circumscribing topological rectangle. The equations for the nodal values external to the region of interest are set to zero (i.e., ${c}_{ij}={t}_{ij}=0$) and the boundary conditions are incorporated into the equations for the appropriate nodes.
If there is no better initial approximation when starting the iterative cycle, an array of all zeros can be used as the initial approximation.
The routine can be used to solve linear elliptic equations in which case the arrays a, b, c, d, e and q are constants and for which a single call provides the required solution. It can also be used to solve nonlinear elliptic equations in which case some or all of these arrays may require updating during the progress of the iterations as more accurate solutions are derived. The routine will then have to be called repeatedly in an outer iterative cycle. Dependent on the nonlinearity, some under relaxation of the coefficients and/or source terms may be needed during their recalculation using the new estimates of the solution.
The routine can also be used to solve each step of a time-dependent parabolic equation in two space dimensions. The solution at each time step can be expressed in terms of an elliptic equation if the Crank–Nicolson or other form of implicit time integration is used.
Neither diagonal dominance, nor positive-definiteness, of the matrix $M$ formed from the arrays a, b, c, d, e is necessary to ensure convergence.
For problems in which the solution is not unique in the sense that an arbitrary constant can be added to the solution, for example Laplace's equation with all Neumann boundary conditions, an argument is incorporated so that the solution can be rescaled by subtracting a specified nodal value from the whole solution $t$ after the completion of every iteration to keep rounding errors to a minimum for those cases when the convergence is slow.

## 4References

Jacobs D A H (1972) The strongly implicit procedure for the numerical solution of parabolic and elliptic partial differential equations Note RD/L/N66/72 Central Electricity Research Laboratory
Stone H L (1968) Iterative solution of implicit approximations of multi-dimensional partial differential equations SIAM J. Numer. Anal. 5 530–558

## 5Arguments

1: $\mathbf{n1}$Integer Input
On entry: the number of nodes in the first coordinate direction, ${n}_{1}$.
Constraint: ${\mathbf{n1}}>1$.
2: $\mathbf{n2}$Integer Input
On entry: the number of nodes in the second coordinate direction, ${n}_{2}$.
Constraint: ${\mathbf{n2}}>1$.
3: $\mathbf{lda}$Integer Input
On entry: the first dimension of the arrays a, b, c, d, e, q, t, wrksp1, wrksp2 and wrksp3 as declared in the (sub)program from which d03ebf is called.
Constraint: ${\mathbf{lda}}\ge {\mathbf{n1}}$.
4: $\mathbf{a}\left({\mathbf{lda}},{\mathbf{n2}}\right)$Real (Kind=nag_wp) array Input
On entry: ${\mathbf{a}}\left(\mathit{i},\mathit{j}\right)$ must contain the coefficient of the ‘southerly’ term involving ${t}_{\mathit{i},\mathit{j}-1}$ in the $\left(\mathit{i},\mathit{j}\right)$th equation of the system (1), for $\mathit{i}=1,2,\dots ,{\mathbf{n1}}$ and $\mathit{j}=1,2,\dots ,{\mathbf{n2}}$. The elements of a, for $j=1$, must be zero after incorporating the boundary conditions, since they involve nodal values from outside the rectangle.
5: $\mathbf{b}\left({\mathbf{lda}},{\mathbf{n2}}\right)$Real (Kind=nag_wp) array Input
On entry: ${\mathbf{b}}\left(\mathit{i},\mathit{j}\right)$ must contain the coefficient of the ‘westerly’ term involving ${t}_{i-1,j}$ in the $\left(i,j\right)$th equation of the system (1), for $\mathit{i}=1,2,\dots ,{\mathbf{n1}}$ and $\mathit{j}=1,2,\dots ,{\mathbf{n2}}$. The elements of b, for $i=1$, must be zero after incorporating the boundary conditions, since they involve nodal values from outside the rectangle.
6: $\mathbf{c}\left({\mathbf{lda}},{\mathbf{n2}}\right)$Real (Kind=nag_wp) array Input
On entry: ${\mathbf{c}}\left(\mathit{i},\mathit{j}\right)$ must contain the coefficient of the ‘central’ term involving ${t}_{\mathit{i}\mathit{j}}$ in the $\left(\mathit{i},\mathit{j}\right)$th equation of the system (1), for $\mathit{i}=1,2,\dots ,{\mathbf{n1}}$ and $\mathit{j}=1,2,\dots ,{\mathbf{n2}}$. The elements of c are checked to ensure that they are nonzero. If any element is found to be zero, the corresponding algebraic equation is assumed to be ${t}_{\mathit{i}\mathit{j}}={q}_{\mathit{i}\mathit{j}}$. This feature can be used to define the equations for nodes at which, for example, Dirichlet boundary conditions are applied, or for nodes external to the problem of interest, by setting ${\mathbf{c}}\left(\mathit{i},\mathit{j}\right)=0.0$ at appropriate points, and the corresponding value of ${\mathbf{q}}\left(\mathit{i},\mathit{j}\right)$ to the appropriate value, namely the prescribed value of ${\mathbf{t}}\left(\mathit{i},\mathit{j}\right)$ in the Dirichlet case or zero at an external point.
7: $\mathbf{d}\left({\mathbf{lda}},{\mathbf{n2}}\right)$Real (Kind=nag_wp) array Input
On entry: ${\mathbf{d}}\left(\mathit{i},\mathit{j}\right)$ must contain the coefficient of the ‘easterly’ term involving ${t}_{\mathit{i}+1,\mathit{j}}$ in the $\left(\mathit{i},\mathit{j}\right)$th equation of the system (1), for $\mathit{i}=1,2,\dots ,{\mathbf{n1}}$ and $\mathit{j}=1,2,\dots ,{\mathbf{n2}}$. The elements of d, for $i={\mathbf{n1}}$, must be zero after incorporating the boundary conditions, since they involve nodal values from outside the rectangle.
8: $\mathbf{e}\left({\mathbf{lda}},{\mathbf{n2}}\right)$Real (Kind=nag_wp) array Input
On entry: ${\mathbf{e}}\left(\mathit{i},\mathit{j}\right)$ must contain the coefficient of the ‘northerly’ term involving ${t}_{\mathit{i},\mathit{j}+1}$ in the $\left(\mathit{i},\mathit{j}\right)$th equation of the system (1), for $\mathit{i}=1,2,\dots ,{\mathbf{n1}}$ and $\mathit{j}=1,2,\dots ,{\mathbf{n2}}$. The elements of e, for $j={\mathbf{n2}}$ must be zero after incorporating the boundary conditions, since they involve nodal values from outside the rectangle.
9: $\mathbf{q}\left({\mathbf{lda}},{\mathbf{n2}}\right)$Real (Kind=nag_wp) array Input
On entry: ${\mathbf{q}}\left(\mathit{i},\mathit{j}\right)$ must contain ${q}_{\mathit{i}\mathit{j}}$, for $\mathit{i}=1,2,\dots ,{\mathbf{n1}}$ and $\mathit{j}=1,2,\dots ,{\mathbf{n2}}$, i.e., the source term values at the nodal points for the system (1).
10: $\mathbf{t}\left({\mathbf{lda}},{\mathbf{n2}}\right)$Real (Kind=nag_wp) array Input/Output
On entry: ${\mathbf{t}}\left(\mathit{i},\mathit{j}\right)$ must contain the element ${t}_{\mathit{i}\mathit{j}}$ of the approximate solution to the equations supplied by the calling program as an initial starting value, for $\mathit{i}=1,2,\dots ,{\mathbf{n1}}$ and $\mathit{j}=1,2,\dots ,{\mathbf{n2}}$.
If no better approximation is known, an array of zeros can be used.
On exit: the solution derived by the routine.
11: $\mathbf{aparam}$Real (Kind=nag_wp) Input
On entry: the iteration acceleration factor. A value of $1.0$ is adequate for most typical problems. However, if convergence is slow, the value can be reduced, typically to $0.2$ or $0.1$. If divergence is obtained, the value can be increased, typically to $2.0$, $5.0$ or $10.0$.
Constraint: $0.0<{\mathbf{aparam}}\le \left({\left({\mathbf{n1}}-1\right)}^{2}+{\left({\mathbf{n2}}-1\right)}^{2}\right)/2.0$.
12: $\mathbf{itmax}$Integer Input
On entry: the maximum number of iterations to be used by the routine in seeking the solution. A reasonable value might be $30$ if ${\mathbf{n1}}={\mathbf{n2}}=10$ or $100$ if ${\mathbf{n1}}={\mathbf{n2}}=50$.
13: $\mathbf{itcoun}$Integer Input/Output
On entry: on the first call of d03ebf, itcoun must be set to $0$. On subsequent entries, its value must be unchanged from the previous call.
On exit: its value is increased by the number of iterations used on this call (namely itused). It therefore stores the accumulated number of iterations actually used. For subsequent calls for the same problem, i.e., with the same n1 and n2 but possibly different coefficients and/or source terms, as occur with nonlinear systems or with time-dependent systems, itcoun is the accumulated number of iterations. This applies to the second and subsequent calls to d03ebf. In this way a suitable cycling of the sequence of iteration arguments is obtained in the calls to d03uaf.
14: $\mathbf{itused}$Integer Output
On exit: the number of iterations actually used on that call.
15: $\mathbf{ndir}$Integer Input
On entry: indicates whether or not the system of equations has a unique solution. For systems which have a unique solution, ndir must be set to any nonzero value. For systems derived from, for example, Laplace's equation with all Neumann boundary conditions, i.e., problems in which an arbitrary constant can be added to the solution, ndir should be set to $0$ and the values of the next two arguments must be specified. For such problems the routine subtracts the value of the function derived at the node (ixn, iyn) from the whole solution after each iteration to reduce the possibility of large rounding errors. You must also ensure that for such problems the appropriate consistency condition on the source terms q is satisfied.
16: $\mathbf{ixn}$Integer Input
On entry: is ignored unless ndir is equal to zero, in which case it must specify the first index of the nodal point at which the solution is to be set to zero. The node should not correspond to a corner node, or to a node external to the region of interest.
17: $\mathbf{iyn}$Integer Input
On entry: is ignored unless ndir is equal to zero, in which case it must specify the second index of the nodal point at which the solution is to be set to zero. The node should not correspond to a corner node, or to a node external to the region of interest.
18: $\mathbf{conres}$Real (Kind=nag_wp) Input
On entry: the convergence criterion to be used on the maximum absolute value of the normalized residual vector components. The latter is defined as the residual of the algebraic equation divided by the central coefficient when the latter is not equal to $0.0$, and defined as the residual when the central coefficient is zero.
Clearly conres should not be less than a reasonable multiple of the machine precision.
19: $\mathbf{conchn}$Real (Kind=nag_wp) Input
On entry: the convergence criterion to be used on the maximum absolute value of the change made at each iteration to the elements of the array t, namely the dependent variable. Clearly conchn should not be less than a reasonable multiple of the machine precision multiplied by the maximum value of t attained.
Convergence is achieved when both the convergence criteria are satisfied. You can therefore set convergence on either the residual or on the change, or (as is recommended) on a requirement that both are below prescribed limits.
20: $\mathbf{resids}\left({\mathbf{itmax}}\right)$Real (Kind=nag_wp) array Output
On exit: the maximum absolute value of the residuals calculated at the $\mathit{i}$th iteration, for $\mathit{i}=1,2,\dots ,{\mathbf{itused}}$. If you want to know the maximum absolute residual of the solution which is returned you must calculate this in the calling program. The sequence of values resids indicates the rate of convergence.
21: $\mathbf{chngs}\left({\mathbf{itmax}}\right)$Real (Kind=nag_wp) array Output
On exit: the maximum absolute value of the changes made to the components of the dependent variable t at the $\mathit{i}$th iteration, for $\mathit{i}=1,2,\dots ,{\mathbf{itused}}$. The sequence of values chngs indicates the rate of convergence.
22: $\mathbf{wrksp1}\left({\mathbf{lda}},{\mathbf{n2}}\right)$Real (Kind=nag_wp) array Workspace
23: $\mathbf{wrksp2}\left({\mathbf{lda}},{\mathbf{n2}}\right)$Real (Kind=nag_wp) array Workspace
24: $\mathbf{wrksp3}\left({\mathbf{lda}},{\mathbf{n2}}\right)$Real (Kind=nag_wp) array Workspace
25: $\mathbf{ifail}$Integer Input/Output
On entry: ifail must be set to $0$, $-1$ or $1$ to set behaviour on detection of an error; these values have no effect when no error is detected.
A value of $0$ causes the printing of an error message and program execution will be halted; otherwise program execution continues. A value of $-1$ means that an error message is printed while a value of $1$ means that it is not.
If halting is not appropriate, the value $-1$ or $1$ is recommended. If message printing is undesirable, then the value $1$ is recommended. Otherwise, the value $0$ is recommended. When the value $-\mathbf{1}$ or $\mathbf{1}$ is used it is essential to test the value of ifail on exit.
On exit: ${\mathbf{ifail}}={\mathbf{0}}$ unless the routine detects an error or a warning has been flagged (see Section 6).

## 6Error Indicators and Warnings

If on entry ${\mathbf{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:
${\mathbf{ifail}}=1$
On entry, ${\mathbf{n1}}=〈\mathit{\text{value}}〉$.
Constraint: ${\mathbf{n1}}>1$.
On entry, ${\mathbf{n2}}=〈\mathit{\text{value}}〉$.
Constraint: ${\mathbf{n2}}>1$.
${\mathbf{ifail}}=2$
On entry, ${\mathbf{lda}}=〈\mathit{\text{value}}〉$ and ${\mathbf{n1}}=〈\mathit{\text{value}}〉$.
Constraint: ${\mathbf{lda}}\ge {\mathbf{n1}}$.
${\mathbf{ifail}}=3$
On entry, ${\mathbf{aparam}}=〈\mathit{\text{value}}〉$.
Constraint: ${\mathbf{aparam}}>0.0$.
${\mathbf{ifail}}=4$
On entry, ${\mathbf{aparam}}=〈\mathit{\text{value}}〉$, ${\mathbf{n1}}=〈\mathit{\text{value}}〉$ and ${\mathbf{n2}}=〈\mathit{\text{value}}〉$.
Constraint: ${\mathbf{aparam}}\le \left({\left({\mathbf{n1}}-1\right)}^{2}+{\left({\mathbf{n2}}-1\right)}^{2}\right)/2$.
${\mathbf{ifail}}=5$
Convergence not achieved in itmax iterations: ${\mathbf{itmax}}=〈\mathit{\text{value}}〉$.
${\mathbf{ifail}}=-99$
See Section 7 in the Introduction to the NAG Library FL Interface for further information.
${\mathbf{ifail}}=-399$
Your licence key may have expired or may not have been installed correctly.
See Section 8 in the Introduction to the NAG Library FL Interface for further information.
${\mathbf{ifail}}=-999$
Dynamic memory allocation failed.
See Section 9 in the Introduction to the NAG Library FL Interface for further information.

## 7Accuracy

The improvement in accuracy for each iteration depends on the size of the system and on the condition of the update matrix characterised by the five-diagonal coefficient arrays. The ultimate accuracy obtainable depends on the above factors and on the machine precision. The rate of convergence obtained with the Strongly Implicit Procedure is not always smooth because of the cyclic use of nine acceleration arguments. The convergence may become slow with very large problems, for example when ${\mathbf{n1}}={\mathbf{n2}}=60$. The final accuracy may be judged approximately from the rate of convergence determined from the sequence of values returned in chngs and the magnitude of the maximum absolute value of the change vector on the last iteration stored in ${\mathbf{chngs}}\left({\mathbf{itused}}\right)$.

## 8Parallelism and Performance

d03ebf is not threaded in any implementation.

The time taken per iteration is approximately proportional to ${\mathbf{n1}}×{\mathbf{n2}}$.
Convergence may not always be obtained when the problem is very large and/or the coefficients of the equations have widely disparate values. The latter case is often associated with a near ill-conditioned matrix.

## 10Example

This example solves Laplace's equation in a rectangle with a non-uniform grid spacing in the $x$ and $y$ coordinate directions and with Dirichlet boundary conditions specifying the function on the perimeter of the rectangle equal to
 $e1.0+x/yn2×cosy/yn2.$

### 10.1Program Text

Program Text (d03ebfe.f90)

### 10.2Program Data

Program Data (d03ebfe.d)

### 10.3Program Results

Program Results (d03ebfe.r)