Error propagation in an explicit and an implicit numerical method for
Volterra integro-differential equations
J. S. C. Prentice
Senior Research Officer
Mathsophical Ltd.
Johannesburg, South Africa
Email: jpmsro@mathsophical.com
Abstract
We study error propagation in both an explicit and an implicit method for
solving Volterra integro-differential equations. We determine the
relationship between local and global errors. We derive upper bounds for the
global error, and show that the global order for both methods is expected to
be first-order. A few numerical examples illustrate our results.
1 Introduction
Recently, we presented explicit and implicit numerical methods for solving
the Volterra integro-differential equation
|
|
|
(1) |
using numerous examples to demonstrate the performance of the methods, and
also studying the stability of the methods [1][2]. In this paper, we investigate the propagation of numerical error in these
methods. Not only is this an interesting study in its own right, it also
allows us to learn about upper bounds on the global error, and the order of
the error.
2 Notation and terminology
We deviate slightly form notation used in our previous work: here,
denotes the approximate solution, and denotes the true solution. The
nodes are labelled as
|
|
|
and is the uniform spacing between the nodes - the stepsize. We
focus our attention on the case of in (1). We note that
and are assumed to be suitably smooth so as to yield a unique solution
and, in particular, is not singular anywhere on the interval of
integration.
The explicit method is given by
|
|
|
|
(2) |
|
|
|
|
|
|
|
|
where we have implicitly defined
The implicit method is given by
|
|
|
|
(3) |
|
|
|
|
|
|
|
|
where we have implicitly defined
We also define and
as follows:
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
The global error at is defined as
|
|
|
|
|
|
|
|
and the local error at is defined as
|
|
|
|
|
|
|
|
The local error has the form
|
|
|
where is the error associated with the Euler
approximation to the derivative in the IDE, and is
the error associated with the composite Trapezium approximation to the
integral in the IDE. These are at worst, but on
multiplication by as required by the structure of the methods, these
errors acquire, at worst, an character. The precise
form of these errors will not concern us here; it is enough for our purposes
to simply accept that
Nevertheless, we discuss this matter to some extent in the Appendix.
3 Analysis - explicit case
We consider the explicit case first, and do so in detail. The parameters and denote values appropriate for the various Taylor residual
terms that arise.
3.1 Error propagation
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
At we have
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
and at we have
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
In general, for we have
|
|
|
|
|
|
|
|
|
|
|
|
(4) |
where
|
|
|
|
|
|
|
|
|
|
|
|
and
|
|
|
Note that is not a local error, but it is
convenient to combine the terms in this way, as we shall soon see. Also, we
can write
|
|
|
|
|
|
|
|
|
|
|
|
wherein the coefficients and
have been implicitly defined. Equation (4) is
the defining expression for the propagation of error in the explicit method.
In the remainder of this paper, we will assume
3.2 Upper bounds
Assume With
|
|
|
|
|
|
|
|
|
|
|
|
we find
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
(5) |
If we define We can then choose so that and we then find
|
|
|
(6) |
If we have and so
|
|
|
|
|
|
|
|
|
|
|
|
We see that all of these bounds exhibit a first-order character.
3.3 Order
Assume is sufficiently small so that
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Now, let and choose so that
|
|
|
Hence,
|
|
|
|
|
|
|
|
Now, choose and such that
|
|
|
Note that
|
|
|
Hence,
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
so that the global error at scales in the same way as the stepsize,
i.e. the global error is first-order. This aligns with the nature of the upper bounds considered earlier. Note that this implies that
the explicit method is convergent ( as
4 Analysis - implicit case
4.1 Error propagation
For the implicit method we have
|
|
|
which gives (with
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
wherein we have implicitly defined
At we find
|
|
|
and at we find
|
|
|
In general (for we have
|
|
|
|
|
|
|
|
(7) |
where
|
|
|
|
|
|
|
|
4.2 Upper bound
We are most likely to use the implicit method when the IDE is stiff (both and Hence, it is instructive to apply (7) to the test equation [2]
|
|
|
|
(8) |
|
|
|
|
(where and with solution
|
|
|
|
|
|
|
|
when and are real , and
|
|
|
when and are complex .
With and we define by
|
|
|
|
|
|
|
|
Since and are both negative, is negative, too. Also
|
|
|
|
|
|
|
|
With
|
|
|
|
|
|
|
|
we find
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Since we note that
|
|
|
if , and/or if becomes large (similar to the case
considered in (6)).
4.3 Order
To analyze the order of the implicit method, we assume that is small
enough so that
|
|
|
|
|
|
|
|
Similar reasoning to the explicit case can now be used to find that the
implicit method is expected to be first-order. Furthermore, this implies
that the implicit method is convergent.
5 Comments
For the explicit method, given that and given that all
subsequent global errors are written in terms of local errors and prior
global errors, we have that is a function of local errors and Jacobians and and
the stepsize . For example, we find
|
|
|
where
|
|
|
|
|
|
|
|
Similar expressions obtain for and so on, and also
for the case of the implicit method. It is interesting to note that, if the
global error is known and the Jacobians can be reliably
estimated (such as for the test equation), then the local errors (for the explicit method) can be estimated via the sequence
|
|
|
|
|
|
|
|
(9) |
|
|
|
|
|
|
|
|
and so on. A similar sequence can be found for the implicit method.
6 Numerical examples
A few simple examples, using the test equation, will serve to illustrate
some of the aspects of our analysis.
-
1.
Figure 1. Here, we solve (8) with and using the explicit method. The
stepsize is small enough to ensure a stable solution. We show (the solid red line, labelled E), and the quantity determined using (5), i.e.
|
|
|
We indicate with the
blue dots (labelled C) which appear to be superimposed on the curve for This is due to the fact that and so From this curve
we estimate and we plot as the upper bound (labelled U) on
-
2.
Figure 2. We solve (8) with and using the explicit method. The
stepsize is not small enough to ensure a stable solution. The
labelling follows that of Figure 1. We estimate As before, so that the curve for is superimposed on the curve for
-
3.
Figure 3. We use the explicit method with and We do not have and so curve C is different
to curve E. We estimate yielding the upper bound U.
-
4.
Figure 4. Here, we solve the test equation with and using the implicit method. We show
the signed global error and .
We see that when as we
would expect. We estimate yielding the upper and lower bounds (U and
-U). The oscillatory character of the error is due to the oscillatory nature
of the solution.
-
5.
Figure 5. We solve the test equation with and using the explicit method. The upper plot shows
the global error and the lower plot shows the local error determined using (9).
7 Conclusion
We have investigated error propagation in an explicit and implicit method
for solving integro-differential equations of the Volterra type. We have
derived upper bounds for the global error, and shown that the global order
for both methods is expected to be first-order. With respect to (1), we have considered the case . For we would need to
solve a system of IDEs, and future work would center around error
propagation in such systems - and in systems of IDEs, in general.
References
-
[1]
J.S.C. Prentice, An Euler-type method for Volterra
integro-differential equations, arXiv.org (Cornell University
Library), 2023, 11p, [arXiv:2306.02547]
-
[2]
J.S.C. Prentice, Stability analysis of an implicit and
explicit numerical method for Volterra integro-differential equations with
kernel arXiv.org (Cornell University Library), 2023,
10p, [arXiv:2306.12600]
8 Appendix
8.1 Local order
The implicit method
|
|
|
is derived from
|
|
|
where the LHS is the Euler approximation to the first derivative,
and the second term on the RHS is the composite Trapezium Rule, which models
the integral in (1). As is well-known, the approximation error
in the Euler approximation is and in the composite
Trapezium Rule it is In other words, we have
|
|
|
which gives
|
|
|
The sum of the term and the is the local error so that
|
|
|
for the implicit method.
For the explicit method
|
|
|
the composite Trapezium Rule is written
|
|
|
|
|
|
|
|
|
Consequently, the local error for the explicit method has the
form
|
|
|
It is worth noting that, for both methods,
as implying consistency.
8.2 Roundoff
For completeness’ sake, we can include a roundoff term in each
local error, as in
|
|
|
|
|
|
|
|
This will simply lead to terms of the form
|
|
|
|
|
|
in the upper bounds derived earlier. If
the roundoff component could be significant, but this is unlikely -
particularly in the context of modern computing, where numerical precision
can be controlled via the variable precision arithmetic (VPA)
capabilities of current software. In other words, we can effectively make as small as we need it to be. This may occur at the cost of
computational efficiency, but that is the way of things.