NAG Library Function Document

nag_inteq_volterra2 (d05bac)

+− Contents

1 Purpose

2 Specification

3 Description

4 References

5 Arguments

6 Error Indicators and Warnings

7 Accuracy

8 Parallelism and Performance

9 Further Comments

+− 10 Example

10.1 Program Text

10.2 Program Data

10.3 Program Results

1 Purpose

nag_inteq_volterra2 (d05bac) computes the solution of a nonlinear convolution Volterra integral equation of the second kind using a reducible linear multi-step method.

2 Specification

#include <nag.h>

#include <nagd05.h>

void

nag_inteq_volterra2 (

double

(*ck)(double t, Nag_Comm *comm),

double

(*cg)(double s, double y, Nag_Comm *comm),

double

(*cf)(double t, Nag_Comm *comm),

Nag_ODEMethod method, Integer iorder, double alim, double tlim, double tol, Integer nmesh, double thresh, double work[], Integer lwk, double yn[], double errest[], Nag_Comm *comm, NagError *fail)

3 Description

nag_inteq_volterra2 (d05bac) computes the numerical solution of the nonlinear convolution Volterra integral equation of the second kind

y (t) = f (t) + \int_{a}^{t} k (t - s) g (s, y (s)) d s, a \leq t \leq T .

(1)

It is assumed that the functions involved in (1) are sufficiently smooth. The function uses a reducible linear multi-step formula selected by you to generate a family of quadrature rules. The reducible formulae available in nag_inteq_volterra2 (d05bac) are the Adams–Moulton formulae of orders

3

6

, and the backward differentiation formulae (BDF) of orders

2

5

. For more information about the behaviour and the construction of these rules we refer to Lubich (1983) and Wolkenfelt (1982).

The algorithm is based on computing the solution in a step-by-step fashion on a mesh of equispaced points. The initial step size which is given by

(T - a) / N

N

being the number of points at which the solution is sought, is halved and another approximation to the solution is computed. This extrapolation procedure is repeated until successive approximations satisfy a user-specified error requirement.

The above methods require some starting values. For the Adams' formula of order greater than

3

and the BDF of order greater than

2

we employ an explicit Dormand–Prince–Shampine Runge–Kutta method (see Shampine (1986)). The above scheme avoids the calculation of the kernel,

k (t)

, on the negative real line.

4 References

Lubich Ch (1983) On the stability of linear multi-step methods for Volterra convolution equations IMA J. Numer. Anal. 3 439–465

Shampine L F (1986) Some practical Runge–Kutta formulas Math. Comput. 46(173) 135–150

Wolkenfelt P H M (1982) The construction of reducible quadrature rules for Volterra integral and integro-differential equations IMA J. Numer. Anal. 2 131–152

5 Arguments

1: ck – function, supplied by the userExternal Function

ck must evaluate the kernel

k (t)

of the integral equation (1).

The specification of ck is:

double

ck (double t, Nag_Comm *comm)

1: t – doubleInput

On entry:

t

, the value of the independent variable.

2: comm – Nag_Comm *

Pointer to structure of type Nag_Comm; the following members are relevant to ck.

user – double *
iuser – Integer *
p – Pointer: The type Pointer will be void *. Before calling nag_inteq_volterra2 (d05bac) you may allocate memory and initialize these pointers with various quantities for use by ck when called from nag_inteq_volterra2 (d05bac) (see Section 3.2.1.1 in the Essential Introduction).

2: cg – function, supplied by the userExternal Function

cg must evaluate the function

g (s, y (s))

in (1).

The specification of cg is:

double

cg (double s, double y, Nag_Comm *comm)

1: s – doubleInput

On entry:

s

, the value of the independent variable.

2: y – doubleInput

On entry: the value of the solution

y

at the point s.

3: comm – Nag_Comm *

Pointer to structure of type Nag_Comm; the following members are relevant to cg.

user – double *
iuser – Integer *
p – Pointer: The type Pointer will be void *. Before calling nag_inteq_volterra2 (d05bac) you may allocate memory and initialize these pointers with various quantities for use by cg when called from nag_inteq_volterra2 (d05bac) (see Section 3.2.1.1 in the Essential Introduction).

3: cf – function, supplied by the userExternal Function

cf must evaluate the function

f (t)

in (1).

The specification of cf is:

double

cf (double t, Nag_Comm *comm)

1: t – doubleInput

On entry:

t

, the value of the independent variable.

2: comm – Nag_Comm *

Pointer to structure of type Nag_Comm; the following members are relevant to cf.

user – double *
iuser – Integer *
p – Pointer: The type Pointer will be void *. Before calling nag_inteq_volterra2 (d05bac) you may allocate memory and initialize these pointers with various quantities for use by cf when called from nag_inteq_volterra2 (d05bac) (see Section 3.2.1.1 in the Essential Introduction).

4: method – Nag_ODEMethodInput

On entry: the type of method which you wish to employ.

$method = Nag_Adams$: For Adams' type formulae.
$method = Nag_BDF$: For backward differentiation formulae.

Constraint:

method = Nag_Adams

Nag_BDF

5: iorder – IntegerInput

On entry: the order of the method to be used.

Constraints:

if $method = Nag_Adams$ , $3 \leq iorder \leq 6$ ;
if $method = Nag_BDF$ , $2 \leq iorder \leq 5$ .

6: alim – doubleInput

On entry:

a

, the lower limit of the integration interval.

Constraint:

alim \geq 0.0

7: tlim – doubleInput

On entry: the final point of the integration interval,

T

Constraint:

tlim > alim

8: tol – doubleInput

On entry: the relative accuracy required in the computed values of the solution.

Constraint:

\sqrt{ε} \leq tol \leq 1.0

, where

ε

is the machine precision.

9: nmesh – IntegerInput

On entry: the number of equidistant points at which the solution is sought.

Constraints:

if $method = Nag_Adams$ , $nmesh \geq iorder - 1$ ;
if $method = Nag_BDF$ , $nmesh \geq iorder$ .

10: thresh – doubleInput

On entry: the threshold value for use in the evaluation of the estimated relative errors. For two successive meshes the following condition must hold at each point of the coarser mesh

\frac{|Y_{1} - Y_{2}|}{\max (|Y_{1}|, |Y_{2}|, |thresh|)} \leq tol,

where

Y_{1}

is the computed solution on the coarser mesh and

Y_{2}

is the computed solution at the corresponding point in the finer mesh. If this condition is not satisfied then the step size is halved and the solution is recomputed.

Note: thresh can be used to effect a relative, absolute or mixed error test. If

thresh = 0.0

then pure relative error is measured and, if the computed solution is small and

thresh = 1.0

, absolute error is measured.

11: work[lwk] – doubleOutput

12: lwk – IntegerInput

On entry: the dimension of the array work.

Constraint:

lwk \geq 10 \times nmesh + 6

Note: the above value of lwk is sufficient for nag_inteq_volterra2 (d05bac) to perform only one extrapolation on the initial mesh as defined by nmesh. In general much more workspace is required and in the case when a large step size is supplied (i.e., nmesh is small), you must provide a considerably larger workspace.

On exit: if

fail . code =

NW_OUT_OF_WORKSPACE,

work [0]

contains the size of lwk required for the algorithm to proceed further.

13: yn[nmesh] – doubleOutput

On exit:

yn [i - 1]

contains the most recent approximation of the true solution

y (t)

at the specified point

t = alim + i \times H

, for

i = 1, 2, \dots, nmesh

, where

H = (tlim - alim) / nmesh

14: errest[nmesh] – doubleOutput

On exit:

errest [i - 1]

contains the most recent approximation of the relative error in the computed solution at the point

t = alim + i \times H

, for

i = 1, 2, \dots, nmesh

, where

H = (tlim - alim) / nmesh

15: comm – Nag_Comm *Communication Structure

The NAG communication argument (see Section 3.2.1.1 in the Essential Introduction).

16: fail – NagError *Input/Output

The NAG error argument (see Section 3.6 in the Essential Introduction).

6 Error Indicators and Warnings

NE_BAD_PARAM: On entry, argument $⟨value⟩$ had an illegal value.
NE_CONVERGENCE: The solution is not converging. See Section 9.
NE_ENUM_INT: On entry, $method = Nag_Adams$ and $iorder = 2$ .
Constraint: if $method = Nag_Adams$ , $3 \leq iorder \leq 6$ .
On entry, $method = Nag_BDF$ and $iorder = 6$ .
Constraint: if $method = Nag_BDF$ , $2 \leq iorder \leq 5$ .
NE_ENUM_INT_2: On entry, $method = Nag_Adams$ , $iorder = ⟨value⟩$ and $nmesh = ⟨value⟩$ .
Constraint: if $method = Nag_Adams$ , $nmesh \geq iorder - 1$ .
On entry, $method = Nag_BDF$ , $iorder = ⟨value⟩$ and $nmesh = ⟨value⟩$ .
Constraint: if $method = Nag_BDF$ , $nmesh \geq iorder$ .
NE_INT: On entry, $iorder = ⟨value⟩$ .
Constraint: $2 \leq iorder \leq 6$ .
On entry, $lwk = ⟨value⟩$ .
Constraint: $lwk \geq 10 \times nmesh + 6$ ; that is, $⟨value⟩$ .
NE_INTERNAL_ERROR: An internal error has occurred in this function. Check the function call and any array sizes. If the call is correct then please contact NAG for assistance.
NE_REAL: On entry, $alim = ⟨value⟩$ .
Constraint: $alim \geq 0.0$ .
On entry, $tol = ⟨value⟩$ .
Constraint: $\sqrt{machine precision} \leq tol \leq 1.0$ .
NE_REAL_2: On entry, $alim = ⟨value⟩$ and $tlim = ⟨value⟩$ .
Constraint: $tlim > alim$ .
NW_OUT_OF_WORKSPACE: The workspace which has been supplied is too small for the required accuracy. The number of extrapolations, so far, is $⟨value⟩$ . If you require one more extrapolation extend the size of workspace to: $lwk = ⟨value⟩$ .

7 Accuracy

The accuracy depends on tol, the theoretical behaviour of the solution of the integral equation, the interval of integration and on the method being used. It can be controlled by varying tol and thresh; you are recommended to choose a smaller value for tol, the larger the value of iorder.

You are warned not to supply a very small tol, because the required accuracy may never be achieved. This will usually force an error exit with

fail . code =

NW_OUT_OF_WORKSPACE.

In general, the higher the order of the method, the faster the required accuracy is achieved with less workspace. For non-stiff problems (see Section 9) you are recommended to use the Adams' method (

method = Nag_Adams

) of order greater than

4

(

iorder > 4

8 Parallelism and Performance

Not applicable.

9 Further Comments

When solving (1), the solution of a nonlinear equation of the form

Y_{n} - α g (t_{n}, Y_{n}) - Ψ_{n} = 0,

(2)

is required, where

Ψ_{n}

and

α

are constants. nag_inteq_volterra2 (d05bac) calls nag_interval_zero_cont_func (c05avc) to find an interval for the zero of this equation followed by nag_zero_cont_func_brent_rcomm (c05azc) to find its zero.

There is an initial phase of the algorithm where the solution is computed only for the first few points of the mesh. The exact number of these points depends on iorder and method. The step size is halved until the accuracy requirements are satisfied on these points and only then the solution on the whole mesh is computed. During this initial phase, if lwk is too small, nag_inteq_volterra2 (d05bac) will exit with

fail . code =

NW_OUT_OF_WORKSPACE.

In the case

fail . code =

NE_CONVERGENCE or NW_OUT_OF_WORKSPACE, you may be dealing with a ‘stiff’ equation; an equation where the Lipschitz constant

L

of the function

g (t, y)

in (1) with respect to its second argument is large, viz,

|g (t, u) - g (t, v)| \leq L |u - v| .

(3)

In this case, if a BDF method (

method = Nag_BDF

) has been used, you are recommended to choose a smaller step size by increasing the value of nmesh, or provide a larger workspace. But, if an Adams' method (

method = Nag_Adams

) has been selected, you are recommended to switch to a BDF method instead.

In the case

fail . code =

NW_OUT_OF_WORKSPACE, then if

fail . errnum = 6

, the specified accuracy has not been attained but yn and errest contain the most recent approximation to the computed solution and the corresponding error estimate. In this case, the error message informs you of the number of extrapolations performed and the size of lwk required for the algorithm to proceed further. The latter quantity will also be available in