A note on Asymptotic mean-square stability of stochastic linear two-step methods for SDEs
Ioannis S. Stamatiou

TL;DR
This paper analyzes the asymptotic mean-square stability of various two-step stochastic numerical schemes for SDEs, providing conditions for stability and comparing their performance in scalar and multi-dimensional cases.
Contribution
It derives necessary and sufficient stability conditions for two-step schemes applied to SDEs, including scalar and systems, and compares stability properties of different methods.
Findings
BDF2 scheme is unconditionally stable for any step-size.
AB2 and AM2 methods are unconditionally stable.
Numerical experiments confirm theoretical stability conditions.
Abstract
In this note we study the asymptotic mean-square stability for two-step schemes applied to a scalar stochastic differential equation (sde) and applied to systems of sdes. We derive necessary and sufficient conditions for the asymptotic MS-stability of the methods in terms of the parameters of the schemes. The stochastic Backward Differentiation Formula (BDF2) scheme is asymptotically mean-square stable for any step-size whereas the two-step Adams-Bashforth (AB2) and Adams-Moulton (AM2) methods are unconditionally stable. The improved versions of the schemes do not perform better w.r.t their stability behavior in the scalar case, as expected, but the situation is different in more dimensions. Numerical experiments confirm theoretical results.
| Method | ||||||||
|---|---|---|---|---|---|---|---|---|
| AB2 | - | |||||||
| AB2I | - | |||||||
| AM2 | - | |||||||
| AM2I | - | |||||||
| BDF2 | ||||||||
| BDF2I |
| Method | ||||
|---|---|---|---|---|
| AB2 | ||||
| AB2I | ||||
| AM2 | 0 | |||
| AM2I | ||||
| BDF2 | ||||
| BDF2I |
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMatrix Theory and Algorithms · Optimization and Variational Analysis · Stability and Control of Uncertain Systems
A note on Asymptotic mean-square stability of stochastic linear two-step methods for SDEs
I. S. Stamatiou
Abstract.
In this note we study the asymptotic mean-square stability for two-step schemes applied to a scalar stochastic differential equation (sde) and applied to systems of sdes. We derive necessary and sufficient conditions for the asymptotic MS-stability of the methods in terms of the parameters of the schemes. The stochastic Backward Differentiation Formula (BDF2) scheme is asymptotically mean-square stable for any step-size whereas the two-step Adams-Bashforth (AB2) and Adams-Moulton (AM2) methods are unconditionally stable. The improved versions of the schemes do not perform better w.r.t their stability behavior in the scalar case, as expected, but the situation is different in more dimensions. Numerical experiments confirm theoretical results.
Key words and phrases:
Stochastic Differential Equations, Asymptotic Mean-Square Stability, Two-Step Maruyama Methods, Linear Stability Analysis, Stochastic Adams-Bashforth Method, Stochastic Adams-Moulton Method, Stochastic Backward Differentiation Formula
AMS subject classification 2010: 60H10, 65C20, 65L20
Contents
-
3 Stability conditions for two-step Maruyama methods to the scalar test equation.
-
3.1 Two-step Adams-Bashforth and Adams-Moulton Maruyama methods.
-
6.1 Stability of two-step methods for linear system of SDEs driven by multi-dimensional noise.
1. Introduction.
Consider the general type -dimensional Itô stochastic differential equation (sde)
[TABLE]
driven by the -dimensional Wiener process, where the coefficients are such that there exists a unique path-wise strong solution of (1.1), cf. [Mao07, Ch. 2.3]. We will also study complex-valued functions The two-step Maryuama method with an equidistant step-size for the approximations of the solution of (1.1) read
[TABLE]
and the improved two-step Maryuama method is given by
[TABLE]
for in the case of systems with commutative noise; here are sequences of i.i.d. standard normal r.v.s, and are appropriate parameters and denotes for appropriate functions as above. For convergence properties of (1.2) and (1.3) see [BW06], [BW07]. Here, we are interested in mean-square asymptotic properties of the above numerical approximations. We perform a linear stability analysis using linear time-invariant test equations; in [BHBW06] sufficient conditions are given for asymptotic mean-square stability of (1.2) applying appropriate Lyapunov-type functionals. We provide in our main result, Theorem 3, necessary and sufficient conditions for the asymptotic mean-square stability of (1.2) and (1.3) following a different approach.
In Section 2 we use the scalar linear test-equation to study the stability properties of the two-step Maruyama methods. The stability matrix of the two-step methods is analyzed. Section 3 provides our main result regarding stability conditions for two-step Maruyama methods and applications of it. The linear mean-square stability of the methods is studied in Section 4 and experiments are made in Section 5. Section 6 is devoted to systems of linear test equations with multi-dimensional noise.
2. Linear Test equation.
Consider the scalar linear test-equation with multiplicative noise
[TABLE]
where the coefficients and assume w.l.o.g. that is non-random. The two-step Maryuama method with an equidistant step-size for the approximations of the solution of (2.1) read, (apply (1.2) with )
[TABLE]
and the improved two-step Maryuama method is given by
[TABLE]
where is a sequence of i.i.d. standard normal r.v.s and and are appropriate parameters.
The recurrences (2.2) and (2.3) can be rewritten in the form
[TABLE]
where for (2.2) the complex coefficients and read
[TABLE]
and for (2.3) the complex coefficients are the same and read
[TABLE]
In Table 1 we list the coefficients for different two-step Maruyama methods.
The stability or transition matrix of the two-step method (2.4) reads
[TABLE]
where stands for the conjugate of The zero solution of the difference equations (2.4) is asymptotically mean-square stable iff the spectral radius of the mean-square stability matrix satisfies
[TABLE]
Recall that where are the eigenvalues of Computing the eigenvalues of amounts to finding the roots of its characteristic polynomial and verifying condition (2.8). Here the characteristic polynomial is a fourth-order polynomial given by
[TABLE]
where the real coefficients read
[TABLE]
[TABLE]
We can check avoiding the computation of the by verifying conditions on the parameters implied by the Schur-Cohn criterion. The strategy is the following (cf. [Jur88]): Define the transpose of as
[TABLE]
define the Schur-Cohn matrix associated to by
[TABLE]
where is the transpose of a matrix i.e. the matrix with entries ; the polynomial P has all the roots inside the unit disk iff is positive definite, which corresponds to
[TABLE]
In order to decide about (2.12) we can use the connection it has with the Schur coefficients of the pair in general for the pair we construct the sequence as and
[TABLE]
[TABLE]
and take
[TABLE]
Then
[TABLE]
therefore condition (2.12) holds iff the Schur coefficients of the pair satisfy
[TABLE]
In particular the Schur coefficients read
[TABLE]
[TABLE]
and thus (2.13) becomes
[TABLE]
and simplifying the last condition and using we get
[TABLE]
The Schur-Cohn criterion simplifies to (cf. [Jur91])
[TABLE]
An alternative condition for (SCJ3) reads [Ela05, Ex 5.1, p. 255]
[TABLE]
3. Stability conditions for two-step Maruyama methods to the scalar test equation.
Using the definition of the real coefficients (2.10) and (2.11) and the general conditions (2.17) we can argue when a two-step Maruyama method is asymptotically mean-square stable. In all the following we take and using (2.5) and (2.6) rewrite the complex coefficients for the standard schemes
[TABLE]
and for the improved ones
[TABLE]
where also we have used
[TABLE]
*Theorem 3.1 *** The two-step stochastic linear difference equation (2.4) is asymptotically mean-square stable iff
[TABLE]
[TABLE]
and
[TABLE]
Moreover, if (3.4) holds along with
[TABLE]
and
[TABLE]
then (3.5) is also true. For the improved version we take and in place of and respectively.
Proof of Theorem 3.
We rewrite the coefficients by (2.10) and (2.11)
[TABLE]
[TABLE]
We need to check conditions (2.17) to conclude about the stability of the method. Condition (SCJ1) implies Note that
[TABLE]
and
[TABLE]
which give
[TABLE]
We also have
[TABLE]
due to (3.9) and
[TABLE]
so (SCJ2) holds when (3.4) holds. Condition (SCJ3) is (3.5).
Furthermore, (3.4), (3.7) and (3.6) imply
[TABLE]
or
[TABLE]
which combined with (3.10) implies
[TABLE]
Denote the left-hand side of (3.5) by and the right side by thus we have to show that Using (SCJ2) and (3.10) we get
[TABLE]
by (3.12). Therefore It remains to prove
[TABLE]
by (3.8), (3.12) and (SCJ2). The above is negative if the last term is negative, or equivalently if We have
[TABLE]
where we used (3.6), (3.7) and (3.11). ∎
3.1. Two-step Adams-Bashforth and Adams-Moulton Maruyama methods.
In this case and thus so the recurrences (2.4) simplify to
[TABLE]
for the standard schemes and to
[TABLE]
for the improved ones.
*Proposition 3.2 *** The two-step stochastic linear difference equation (3.13) is asymptotically mean-square stable iff
[TABLE]
[TABLE]
and
[TABLE]
whereas the two-step stochastic linear difference equation (3.14) is asymptotically mean-square stable iff conditions (3.3),(3.4) and (3.5) hold or conditions (3.6),(3.4) and (3.7) hold where and are replacing and respectively.
Proof of Proposition 3.1.
We show the first case since the second one is a direct application of Theorem 3. In the case of (3.13) the coefficients read
[TABLE]
[TABLE]
We apply Theorem 3 when Conditions (3.3) or (3.6) are equivalent to Condition (3.4) is just the right-side of (3.15) and (3.16). Finally (3.7) shrinks to ∎
*Remark 3.3 *** Consider the case Then conditions (3.15), (3.16) and (3.17) read (see also [TS14, Cor. 6])
[TABLE]
[TABLE]
3.2. Schemes for hereditary systems.
Hereditary systems are used to model processes in a variety of fields such as physics, biology, economy, just to name a few, (cf. [KM92]). Due to their applications, we present them in a separate subsection. The following stochastic difference equation was proposed in [Sha97],
[TABLE]
where necessary and sufficient conditions were given concerning their asymptotic mean-square stability of the zero solution. By taking the trivial case of this delay system with this falls in our setting (2.4) with that is,
[TABLE]
for the standard schemes and to
[TABLE]
for the improved ones.
*Proposition 3.4 *** The two-step stochastic linear difference equation (3.23) is asymptotically mean-square stable iff
[TABLE]
and
[TABLE]
whereas the two-step stochastic linear difference equation (3.24) is asymptotically mean-square stable iff conditions (3.3),(3.4) and (3.5) hold or conditions (3.6),(3.4) and (3.7) hold where and are replacing and respectively.
Proof of Proposition 3.2.
We show the first case since the second one is a direct application of Theorem 3. In the case of (3.23) the coefficients read
[TABLE]
[TABLE]
We apply Theorem 3 when Conditions (3.3) or (3.6) are equivalent to Condition (3.4) is just the right-side of (3.25). Finally (3.7) shrinks to ∎
*Remark 3.5 *** Consider the case Then conditions (3.25) and (3.26) read (see also [TS14, Cor. 5])
[TABLE]
[TABLE]
4. Linear MS-stability.
Recall the scalar linear test-equation (2.1)
[TABLE]
where Its zero solution is asymptotically mean-square stable iff in the case the above condition reduces to the notion of A-stability. The set
[TABLE]
is called the mean-square (MS-)stability domain of the stochastic equation (2.1). In an analogous manner the MS-stability domain of a two-step stochastic method (SM) for a given step size is defined as
[TABLE]
In case we have the notions of the stability regions
[TABLE]
for the sde and
[TABLE]
for the method. A stochastic method is said to be MS-stable if
[TABLE]
The inverse relation
[TABLE]
means that the method is unstable whenever the test-equation is unstable. In this case the notion of conditional MS-stability comes to play, where one has to determine a step size such that for a given pair of in the stability domain or region of the sde the method is mean-square stable for all
4.1. MS-stability of Adams-Bashforth Maruyama scheme.
The coefficients of the AB2 scheme, see Table 2, read
[TABLE]
and for the improved AB2I
[TABLE]
First we take where
[TABLE]
Conditions (3.15) give
[TABLE]
Now, inspecting the second inequality further we conclude that
[TABLE]
when
[TABLE]
which implies that is when Conditions (3.16) give
[TABLE]
when
[TABLE]
which holds for any with Moreover, condition (3.17) reads,
[TABLE]
or equivalently
[TABLE]
which implies when Conditions (3.15), (3.16) and (3.17) hold when
[TABLE]
Therefore we get
[TABLE]
for any which means that AB2 is unstable whenever the test-equation is unstable. Now, given we want to find such that for any Since we chose the parameters in the stability domain we have that The relation gives
[TABLE]
Moreover, by (3.16) we need to show that
[TABLE]
which holds when
[TABLE]
or in terms of for
[TABLE]
So given the method AB2 is conditionally MS-stable for any where
[TABLE]
In case the parameters are real conditions (3.15), (3.16) and (3.17) shrink to (3.20) and (3.21) respectively by Remark 3.1. The asymptotic region reads
[TABLE]
and for any Given and the method AB2 is conditionally MS-stable for all where
[TABLE]
In Figure 1 we represent the stability regions of the AB2 and AB2I scheme respectively in the -plane where and where also the stability region of the SDE is shown (it corresponds to the region that is the light-shaded triangle.)
4.2. MS-stability of Adams-Moulton Maruyama scheme.
The coefficients of the AM2 scheme, see Table 2, read
[TABLE]
and for the improved AM2I
[TABLE]
First we take where
[TABLE]
Conditions (3.15) give
[TABLE]
The first inequality is satisfied by those with and the second inequality holds when Therefore (4.7) holds iff
[TABLE]
which imply Conditions (3.16) give
[TABLE]
which is smaller than for any Moreover, condition (3.17) reads,
[TABLE]
or equivalently
[TABLE]
which implies and Therefore we get
[TABLE]
for any which means that AM2 is unstable whenever the test-equation is unstable. Now, given we want to find such that for any Since we chose the parameters in the stability domain we have that Relation (4.8) implies
[TABLE]
Moreover, by (3.16) we need to show that
[TABLE]
which holds for sufficiently small implying that the method AM2 is conditionally MS-stable for any where
[TABLE]
In case the parameters are real we need to show (3.20) and (3.21) respectively. The asymptotic region reads
[TABLE]
and for any Given and the method AM2 is conditionally MS-stable for all where
[TABLE]
In Figure 2 we represent the stability regions of the AM2 and AM2I scheme respectively in the -plane where and where also the stability region of the SDE is shown (it corresponds to the region that is the light-shaded triangle.)
4.3. Two-step BDF Maruyama scheme.
The coefficients of the BDF2 scheme, see Table 2, read
[TABLE]
and for the improved BDF2I
[TABLE]
In Figure 3 we represent the stability regions of the BDF2 and BDF2I scheme respectively in the -plane where and where also the stability region of the SDE is shown (it corresponds to the region that is the light-shaded triangle.)
5. Experiments.
In this section we make some simple numerical experiments to complement the stability analysis presented in the previous section. We apply the AB2, AM2 and BDF2 two-step Maruyama schemes as well as their improved versions with constant step-size to solve the equation
[TABLE]
For the second initial condition in the two-step schemes we apply the Maruyama method which applied to the linear test equation (2.1) reads
[TABLE]
with and We also implement the method (with ) and the Euler method (with ) for further comparison. We plot the obtained values in a -scale against time The estimated mean-square norm of is point-wise estimated by each stochastic numerical method in the following way,
[TABLE]
where we have computed batches of simulation paths. The total number of paths in the experiments is For the first experiment, see Figure 4, we have applied all the methods with time-step size so that they are all stable. The considered time interval is In the second experiment, see Figure 5, we integrate over with In this case the and methods are not stable as well as the forward Euler method. The methods as well as the methods are asymptotically stable in the mean-square sense with the performing better. Another remark we can make in the one-dimensional case is about the performance of the proposed improved methods with respect to their stability behavior, which seems to follow the rule that we do not gain more w.r.t to stability performance by using higher order schemes (multiple integrals for the approximation of the diffusion coefficient), as one can see from both Figures 4 and 5. Nevertheless, the situation is different in more dimensions as shown n Section 6.
6. Linear system of SDEs and multi-dimensional noise.
Consider the -system of linear test-equations with -dimensional multiplicative noise
[TABLE]
where are real-valued matrices and assume w.l.o.g. that is non-random.
6.1. Stability of two-step methods for linear system of SDEs driven by multi-dimensional noise.
The two-step Maryuama method with an equidistant step-size and approximations of the solution of (6.1) read
[TABLE]
and can be represented as
[TABLE]
where the matrices and are given by
[TABLE]
[TABLE]
and for the improved versions
[TABLE]
for
Here, the stability or transition matrix of the two-step method (6.3) applied to linear system of the form (6.1) reads
[TABLE]
with
A result of the type of Theorem 3, that is a conclusion about the asymptotically zero mean-square stability of the two-step method (6.2) applied to the linear system (6.1), is again related with equivalent conditions for the relation Now the characteristic polynomial of the stability matrix is of order The computational effort of the Schur-Cohn test (SCJ) is now bigger, but one can reduce it by halving the dimensions of the matrix, whose positive-definite character needs to be checked at the expense of some easily checked inequalities on linear combinations of the coefficients of the polynomial (c.f. [AJ73]).
6.2. A linear system of SDEs driven by a single noise term.
Consider the system of linear test-equations (6.1) with and matrices of the following type
[TABLE]
that is
[TABLE]
with a single noise term. The mean-square stability matrix for (6.9) is
[TABLE]
and the zero solution of (6.9) is asymptotically MS-stable iff (cf. [BS12, Lemma 4.1])
[TABLE]
Below we make a simple experiment implementing the two-step Maruyama methods
[TABLE]
where in particular for the AB2/AB2I methods
[TABLE]
[TABLE]
for the AM2/AM2I methods
[TABLE]
[TABLE]
with and for the BDF2/BDF2I methods
[TABLE]
[TABLE]
with We choose the values of such that the spectral abscissa of the mean-square stability matrix is negative, that is , and the spectral radius or in other words such that the condition (6.11) holds. In this case, see Figure 6, the improved versions AM2I and BDF2I are stable whereas AM2 and BDF2 are not.
6.3. A linear system of SDEs driven by two noise terms.
Consider the system of linear test-equations (6.1) with and matrices of the following type
[TABLE]
that is
[TABLE]
with two commutative noise terms. The mean-square stability matrix for (6.20) is
[TABLE]
and the zero solution of (6.20) is asymptotically MS-stable iff (cf. [BS12, Lemma 4.1])
[TABLE]
Below we make a simple experiment implementing the two-step Maruyama methods
[TABLE]
where for all methods and are as in (6.23) and correspond now to the matrices for instance for the AB2/AB2I methods we have
[TABLE]
We choose the values of in a way that the condition (6.22) holds and compute the MS-norm of just as in [BS12], by
[TABLE]
In this case, see Figure 7, the improved versions AB2I, AM2I and BDF2I are stable whereas AB2, AM2 and BDF2 are not.
Of course, by lowering the step-size the numerical methods become more stable. In the following, we sequentially halve the step-size and confirm the conjecture above. In all cases though, we conclude again that AB2, AM2 and BDF2 are less stable than their improved counterparts, see Figures 8,9 and for a clearer view Figures 10,11 and 12.
Acknowledgments
The author would like to thank Prof. Evelyn Buckwar for fruitful discussions around the subject. It took place during the author’s visit at the Institute for Stochastics, in Linz, Austria in the last four months of 2016.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[AJ 73] B. D. O. Anderson and E. I. Jury. A simplified Schur-Cohn test. IEEE Trans. Automatic Control , AC-18(2):157–163, 1973.
- 2[BHBW 06] E. Buckwar, R. Horváth-Bokor, and R. Winkler. Asymptotic mean-square stability of two-step methods for stochastic ordinary differential equations. BIT Numerical Mathematics , 46(2):261–282, 2006.
- 3[BS 12] E. Buckwar and T. Sickenberger. A structural analysis of asymptotic mean-square stability for multi-dimensional linear stochastic differential systems. Appl. Numer. Math. , 62(7):842–859, 2012.
- 4[BW 06] Evelyn Buckwar and Renate Winkler. Multistep methods for sdes and their application to problems with small noise. SIAM journal on numerical analysis , 44(2):779–803, 2006.
- 5[BW 07] E. Buckwar and R. Winkler. Improved linear multi-step methods for stochastic ordinary differential equations. Journal of computational and applied mathematics , 205(2):912–922, 2007.
- 6[Ela 05] S. Elaydi. An introduction to difference equations . Undergraduate Texts in Mathematics. Springer, New York, third edition, 2005.
- 7[Jur 88] E.I. Jury. Modified stability table for 2-d digital filters. IEEE transactions on circuits and systems , 35(1):116–119, 1988.
- 8[Jur 91] E.I. Jury. A note on the modified stability table for linear discrete time systems. IEEE transactions on circuits and systems , 38(2):221–223, 1991.
