D02 Chapter Contents
D02 Chapter Introduction
NAG Library Manual

# NAG Library Routine DocumentD02PFF

Note:  before using this routine, please read the Users' Note for your implementation to check the interpretation of bold italicised terms and other implementation-dependent details.

## 1  Purpose

D02PFF is a one-step routine for solving an initial value problem for a first-order system of ordinary differential equations using Runge–Kutta methods.

## 2  Specification

 SUBROUTINE D02PFF ( F, N, TNOW, YNOW, YPNOW, IUSER, RUSER, IWSAV, RWSAV, IFAIL)
 INTEGER N, IUSER(*), IWSAV(130), IFAIL REAL (KIND=nag_wp) TNOW, YNOW(N), YPNOW(N), RUSER(*), RWSAV(32*N+350) EXTERNAL F

## 3  Description

D02PFF and its associated routines (D02PQF, D02PRF, D02PSF, D02PTF and D02PUF) solve an initial value problem for a first-order system of ordinary differential equations. The routines, based on Runge–Kutta methods and derived from RKSUITE (see Brankin et al. (1991)), integrate
 $y′=ft,y given yt0=y0$
where $y$ is the vector of $\mathit{n}$ solution components and $t$ is the independent variable.
D02PFF is designed to be used in complicated tasks when solving systems of ordinary differential equations. You must first call D02PQF to specify the problem and how it is to be solved. Thereafter you (repeatedly) call D02PFF to take one integration step at a time from TSTART in the direction of TEND (as specified in D02PQF). In this manner D02PFF returns an approximation to the solution YNOW and its derivative YPNOW at successive points TNOW. If D02PFF encounters some difficulty in taking a step, the integration is not advanced and the routine returns with the same values of TNOW, YNOW and YPNOW as returned on the previous successful step. D02PFF tries to advance the integration as far as possible subject to passing the test on the local error and not going past TEND.
In the call to D02PQF you can specify either the first step size for D02PFF to attempt or that it computes automatically an appropriate value. Thereafter D02PFF estimates an appropriate step size for its next step. This value and other details of the integration can be obtained after any call to D02PFF by a call to D02PTF. The local error is controlled at every step as specified in D02PQF. If you wish to assess the true error, you must set METHOD to a positive value in the call to D02PQF. This assessment can be obtained after any call to D02PFF by a call to D02PUF.
If you want answers at specific points there are two ways to proceed:
 (i) The more efficient way is to step past the point where a solution is desired, and then call D02PSF to get an answer there. Within the span of the current step, you can get all the answers you want at very little cost by repeated calls to D02PSF. This is very valuable when you want to find where something happens, e.g., where a particular solution component vanishes. You cannot proceed in this way with ${\mathbf{METHOD}}=3$ or $-3$. (ii) The other way to get an answer at a specific point is to set TEND to this value and integrate to TEND. D02PFF will not step past TEND, so when a step would carry it past, it will reduce the step size so as to produce an answer at TEND exactly. After getting an answer there (${\mathbf{TNOW}}={\mathbf{TEND}}$), you can reset TEND to the next point where you want an answer, and repeat. TEND could be reset by a call to D02PQF, but you should not do this. You should use D02PRF instead because it is both easier to use and much more efficient. This way of getting answers at specific points can be used with any of the available methods, but it is the only way with ${\mathbf{METHOD}}=3$ or $-3$. It can be inefficient. Should this be the case, the code will bring the matter to your attention.

## 4  References

Brankin R W, Gladwell I and Shampine L F (1991) RKSUITE: A suite of Runge–Kutta codes for the initial value problems for ODEs SoftReport 91-S1 Southern Methodist University

## 5  Parameters

1:     F – SUBROUTINE, supplied by the user.External Procedure
F must evaluate the functions ${f}_{i}$ (that is the first derivatives ${y}_{i}^{\prime }$) for given values of the arguments $t$, ${y}_{i}$.
The specification of F is:
 SUBROUTINE F ( T, N, Y, YP, IUSER, RUSER)
 INTEGER N, IUSER(*) REAL (KIND=nag_wp) T, Y(N), YP(N), RUSER(*)
1:     T – REAL (KIND=nag_wp)Input
On entry: $t$, the current value of the independent variable.
2:     N – INTEGERInput
On entry: $\mathit{n}$, the number of ordinary differential equations in the system to be solved.
3:     Y(N) – REAL (KIND=nag_wp) arrayInput
On entry: the current values of the dependent variables, ${y}_{\mathit{i}}$, for $\mathit{i}=1,2,\dots ,\mathit{n}$.
4:     YP(N) – REAL (KIND=nag_wp) arrayOutput
On exit: the values of ${f}_{\mathit{i}}$, for $\mathit{i}=1,2,\dots ,\mathit{n}$.
5:     IUSER($*$) – INTEGER arrayUser Workspace
6:     RUSER($*$) – REAL (KIND=nag_wp) arrayUser Workspace
F is called with the parameters IUSER and RUSER as supplied to D02PFF. You are free to use the arrays IUSER and RUSER to supply information to F as an alternative to using COMMON global variables.
F must either be a module subprogram USEd by, or declared as EXTERNAL in, the (sub)program from which D02PFF is called. Parameters denoted as Input must not be changed by this procedure.
2:     N – INTEGERInput
On entry: $n$, the number of ordinary differential equations in the system to be solved.
Constraint: ${\mathbf{N}}\ge 1$.
3:     TNOW – REAL (KIND=nag_wp)Output
On exit: $t$, the value of the independent variable at which a solution has been computed.
4:     YNOW(N) – REAL (KIND=nag_wp) arrayOutput
On exit: an approximation to the solution at TNOW. The local error of the step to TNOW was no greater than permitted by the specified tolerances (see D02PQF).
5:     YPNOW(N) – REAL (KIND=nag_wp) arrayOutput
On exit: an approximation to the first derivative of the solution at TNOW.
6:     IUSER($*$) – INTEGER arrayUser Workspace
7:     RUSER($*$) – REAL (KIND=nag_wp) arrayUser Workspace
IUSER and RUSER are not used by D02PFF, but are passed directly to F and may be used to pass information to this routine as an alternative to using COMMON global variables.
8:     IWSAV($130$) – INTEGER arrayCommunication Array
9:     RWSAV($32×{\mathbf{N}}+350$) – REAL (KIND=nag_wp) arrayCommunication Array
On entry: these must be the same arrays supplied in a previous call to D02PQF. They must remain unchanged between calls.
On exit: information about the integration for use on subsequent calls to D02PFF or other associated routines.
10:   IFAIL – INTEGERInput/Output
On entry: IFAIL must be set to $0$, $-1\text{​ or ​}1$. If you are unfamiliar with this parameter you should refer to Section 3.3 in the Essential Introduction for details.
For environments where it might be inappropriate to halt program execution when an error is detected, the value $-1\text{​ or ​}1$ is recommended. If the output of error messages is undesirable, then the value $1$ is recommended. Otherwise, because for this routine the values of the output parameters may be useful even if ${\mathbf{IFAIL}}\ne {\mathbf{0}}$ on exit, the recommended value is $-1$. When the value $-\mathbf{1}\text{​ or ​}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).

## 6  Error Indicators and Warnings

If on entry ${\mathbf{IFAIL}}={\mathbf{0}}$ or $-{\mathbf{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$
A call to this routine cannot be made after it has returned an error.
The setup routine must be called to start another problem.
On entry, a previous call to the setup routine has not been made or the communication arrays have become corrupted, or a catastrophic error has already been detected elsewhere.
You cannot continue integrating the problem.
On entry, a previous call to the setup routine has not been made or the communication arrays have become corrupted.
On entry, ${\mathbf{N}}=⟨\mathit{\text{value}}⟩$, but the value passed to the setup routine was ${\mathbf{N}}=⟨\mathit{\text{value}}⟩$.
TEND, as specified in the setup routine, has already been reached.
To start a new problem, you will need to call the setup routine.
${\mathbf{IFAIL}}=2$
More than $100$ output points have been obtained by integrating to TEND (as specified in the setup routine). They have been so clustered that it would probably be (much) more efficient to use the interpolation routine (if $\left|{\mathbf{METHOD}}\right|=3$, switch to $\left|{\mathbf{METHOD}}\right|=2$ at setup).
However, you can continue integrating the problem.
${\mathbf{IFAIL}}=3$
Approximately $⟨\mathit{\text{value}}⟩$ function evaluations have been used to compute the solution since the integration started or since this message was last printed.
However, you can continue integrating the problem.
${\mathbf{IFAIL}}=4$
Approximately $⟨\mathit{\text{value}}⟩$ function evaluations have been used to compute the solution since the integration started or since this message was last printed. Your problem has been diagnosed as stiff. If the situation persists, it will cost roughly $⟨\mathit{\text{value}}⟩$ times as much to reach TEND (setup) as it has cost to reach the current time. You should probably call routines intended for stiff problems.
However, you can continue integrating the problem.
Your problem has been diagnosed as stiff. If the situation persists, it will cost roughly $⟨\mathit{\text{value}}⟩$ times as much to reach TEND (setup) as it has cost to reach the current time. You should probably call routines intended for stiff problems.
However, you can continue integrating the problem.
${\mathbf{IFAIL}}=5$
In order to satisfy your error requirements the solver has to use a step size of $⟨\mathit{\text{value}}⟩$ at the current time, $⟨\mathit{\text{value}}⟩$.
This step size is too small for the machine precision, and is smaller than $⟨\mathit{\text{value}}⟩$.
${\mathbf{IFAIL}}=6$
The global error assessment algorithm failed at start of integration.
The integration is being terminated.
The global error assessment may not be reliable for times beyond $⟨\mathit{\text{value}}⟩$.
The integration is being terminated.

## 7  Accuracy

The accuracy of integration is determined by the parameters TOL and THRESH in a prior call to D02PQF (see the routine document for D02PQF for further details and advice). Note that only the local error at each step is controlled by these parameters. The error estimates obtained are not strict bounds but are usually reliable over one step. Over a number of steps the overall error may accumulate in various ways, depending on the properties of the differential system.

If D02PFF returns with ${\mathbf{IFAIL}}={\mathbf{5}}$ and the accuracy specified by TOL and THRESH is really required then you should consider whether there is a more fundamental difficulty. For example, the solution may contain a singularity. In such a region the solution components will usually be large in magnitude. Successive output values of YNOW should be monitored with the aim of trapping the solution before the singularity. In any case numerical integration cannot be continued through a singularity, and analytical treatment may be necessary.
Performance statistics are available after any return from D02PFF (except when ${\mathbf{IFAIL}}={\mathbf{1}}$) by a call to D02PTF. If ${\mathbf{METHOD}}>0$ in the call to D02PQF, global error assessment is available after any return from D02PFF (except when ${\mathbf{IFAIL}}={\mathbf{1}}$) by a call to D02PUF.
After a failure with ${\mathbf{IFAIL}}={\mathbf{5}}$ or ${\mathbf{6}}$ each of the diagnostic routines D02PTF and D02PUF may be called only once.
If D02PFF returns with ${\mathbf{IFAIL}}={\mathbf{4}}$ then it is advisable to change to another code more suited to the solution of stiff problems. D02PFF will not return with ${\mathbf{IFAIL}}={\mathbf{4}}$ if the problem is actually stiff but it is estimated that integration can be completed using less function evaluations than already computed.

## 9  Example

This example solves the equation
 $y′′ = -y , y0 = 0 , y′0 = 1$
reposed as
 $y1′ = y2$
 $y2′ = -y1$
over the range $\left[0,2\pi \right]$ with initial conditions ${y}_{1}=0.0$ and ${y}_{2}=1.0$. We use relative error control with threshold values of $\text{1.0E−8}$ for each solution component and print the solution at each integration step across the range. We use a medium order Runge–Kutta method (${\mathbf{METHOD}}=2$) with tolerances ${\mathbf{TOL}}=\text{1.0E−4}$ and ${\mathbf{TOL}}=\text{1.0E−5}$ in turn so that we may compare the solutions.

### 9.1  Program Text

Program Text (d02pffe.f90)

### 9.2  Program Data

Program Data (d02pffe.d)

### 9.3  Program Results

Program Results (d02pffe.r)