Abstract
The main purpose of this paper is to investigate the strong convergence and exponential stability in mean square of the exponential Euler method to semi-linear stochastic delay differential equations (SLSDDEs). It is proved that the exponential Euler approximation solution converges to the analytic solution with the strong order to SLSDDEs. On the one hand, the classical stability theorem to SLSDDEs is given by the Lyapunov functions. However, in this paper we study the exponential stability in mean square of the exact solution to SLSDDEs by using the definition of logarithmic norm. On the other hand, the implicit Euler scheme to SLSDDEs is known to be exponentially stable in mean square for any step size. However, in this article we propose an explicit method to show that the exponential Euler method to SLSDDEs is proved to share the same stability for any step size by the property of logarithmic norm.
Keywords: stochastic delay differential equation, exponential Euler method, Lipschitz condition, Itô formula, strong convergence
Introduction
Stochastic modeling has come to play an important role in many branches of science and industry. Such models have been used with great success in a variety of application areas, including biology, epidemiology, mechanics, economics and finance. Most stochastic differential equations (SDEs) are nonlinear and cannot be solved explicitly, whence numerical solutions are required in practice. Numerical solutions to SDEs have been discussed under the Lipschitz condition and the linear growth condition by many authors (see [1–7]). Higham et al. [2] gave almost sure and moment exponential stability in the numerical simulation of SDEs. Many authors have discussed numerical solutions to stochastic delay differential equations (SDDES) (see [8–12]). Cao et al. [8] obtained MS-stability of the Euler-Maruyama method for SDDEs. Mao [12] discussed exponential stability of equidistant Euler-Maruyama approximations of SDDES. The explicit Euler scheme is most commonly used for approximating SDEs with the global Lipschitz condition. Unfortunately, the step size of Euler method for SDEs has limits for research of stability. Therefore, the stability of the implicit Euler scheme to SDEs is known for any step size. However, in this article we propose an explicit method to show that the exponential Euler method to SLSDDEs is proved to share the stability for any step size by the property of logarithmic norm.
The paper is organized as follows. In Section 2, we introduce necessary notations and the exponential Euler method. In Section 3, we obtain the convergence of the exponential Euler method to SLSDDEs under Lipschitz condition and the linear growth condition. In Section 4, we obtain the exponential stability in mean square of the exponential Euler method to SLSDDEs. Finally, two examples are provided to illustrate our theory.
Preliminary notation and the exponential Euler method
In this paper, unless otherwise specified, let be the Euclidean norm in . If A is a vector or matrix, its transpose is denoted by . If A is a matrix, its trace norm is denoted by . For simplicity, we also denote , .
Let be a complete probability space with a filtration , satisfying the usual conditions. and denote the family of all real-valued -adapted processes such that for every , a.s. and a.s., respectively. For any with , denote by the family of continuous functions ϕ from to with the norm . Denote by the family of all bounded -measurable -valued random variables. Let be a d-dimensional Brownian motion defined on the probability space . Throughout this paper, we consider the following semi-linear stochastic delay differential equations:
2.1 |
where , , , , , is the matrix [13]. By the definition of stochastic differential, this equation is equivalent to the following stochastic integral equation:
2.2 |
Moreover, we also require the coefficients f and g to be sufficiently smooth.
To be precise, let us state the following conditions.
- (H1)
- (The Lipschitz condition) There exists a positive constant such that
for those . - (H2)
- (Linear growth condition) There exists a positive constant such that
for all . - (H3)
- f and g are supposed to satisfy the following property:
where is a constant and with .
Let be a given step size with integer , and let the gridpoints be defined by (). We consider the exponential Euler method to (2.1)
2.3 |
where , , is approximation to the exact solution . The continuous exponential Euler method approximate solution is defined by
2.4 |
where and denotes the largest integer which is smaller than x, with denoting the indicator function for the set . It is not difficult to see that for . That is, the step function and the continuous exponential Euler solution coincide with the discrete solution at the gridpoint. Let denote the family of all continuous nonnegative functions defined on such that they are continuously twice differentiable in x and once in t. Given , we define the operator by
where
Let us emphasize that is defined on , while V is only defined on .
Convergence of the exponential Euler method
We will show the strong convergence of the exponential Euler method (2.4) on equations (2.1).
Theorem 3.1
Under conditions (H1), (H2) and (H3), the exponential Euler method approximate solution converges to the exact solution of equations (2.1) in the sense that
3.1 |
In order to prove this theorem, we first prepare two lemmas.
Lemma 3.1
Under the linear growth condition (H2), there exists a positive constant such that the solution of equations (2.1) and the continuous exponential Euler method approximate solution (2.4) satisfy
3.2 |
where is a constant independent of h.
Proof
It follows from (2.4) that
3.3 |
By Hölder’s inequality, we obtain
3.4 |
This implies that for any ,
3.5 |
By Doob’s martingale inequality, it is not difficult to show that
3.6 |
Making use of (H2) yields
3.7 |
Thus
3.8 |
By Gronwall’s inequality, we get
3.9 |
where . In the same way, we obtain
3.10 |
where . The proof is completed. □
The following lemma shows that both and are close to each other.
Lemma 3.2
Under condition (H2). Then
3.11 |
where is a constant independent of h.
Proof
For , there is an integer k such that . We compute
3.12 |
where I is an identity matrix. Taking the expectation of both sides, we can see
3.13 |
Using the linear growth conditions, we have
3.14 |
Since , we have
3.15 |
where is a constant independent of h. The proof is completed. □
Proof of Theorem 3.1
3.16 |
By Hölder’s inequality, we obtain
3.17 |
This implies that for any , by Doob’s martingale inequality, we have
3.18 |
We compute the first item in (3.18)
3.19 |
We compute the following two formulas in (3.18):
3.20 |
and
3.21 |
In the same way, we can obtain
3.22 |
We compute the following two formulas in (3.18):
3.23 |
and
3.24 |
Substituting (3.19) - (3.24) into (3.18), we have
3.25 |
By Gronwall’s inequality, since , we can show
3.26 |
As a result,
3.27 |
The proof is completed. □
Exponential stability in mean square
In this section, we give the exponential stability in mean square of the exact solution and the exponential Euler method to semi-linear stochastic delay differential equations (2.1). For the purpose of stability study in this paper, assume that .
Stability of the exact solution
In this subsection, we will show the exponential stability in mean square of the exact solution to semi-linear stochastic delay differential equations (2.1)under the global Lipschitz condition. Next we will give the main content of this subsection.
Theorem 4.1
Under condition (H1), if , then the solution of equations (2.1) with the initial data is exponentially stable in mean square, that is,
4.1 |
where , , .
By Ito’s formula and the delay term of the equation, we give the proof of Theorem 4.1. The highlight of the proof is that we give the mean square boundedness of the solution to the equation by dividing the interval into . Then we give a proof of the conclusion by . In the process of dealing with the semi-linear matrix, we use the definition of the matrix norm.
Definition 4.1
[12]
SDDEs (2.1) are said to be exponentially stable in mean square if there is a pair of positive constants λ and μ such that for any initial data ,
4.2 |
We refer to λ as the rate constant and to μ as the growth constant.
Definition 4.2
[14]
The logarithmic norm of A is defined by
4.3 |
Especially, if is an inner product norm, can also be written as
4.4 |
Lemma 4.1
Let . If , and , then for all , and is decreasing.
Proof
It is known from , and that for all
and
For all , we compute
Thus is decreasing. The proof is complete. □
Proof of Theorem 4.1
By Itô’s formula and Definition 4.2, for all , we have
4.5 |
where , . Let , by Itô’s formula, we obtain
4.6 |
Integrating (4.6) from 0 to t yields
4.7 |
Taking expected values gives
4.8 |
For any , we have
4.9 |
Hence
4.10 |
For any , we obtain
4.11 |
Thus
4.12 |
Repeating this procedure, for all , we can show
4.13 |
Hence, for any , we have
4.14 |
On the other hand, for any , one can easily show that
4.15 |
Therefore,
4.16 |
Especially, we can see
4.17 |
For any , we have
4.18 |
Therefore,
4.19 |
Obviously, we can obtain
4.20 |
For any , we can see that
4.21 |
Therefore,
4.22 |
For any , there is an integer n such that ; repeating this procedure, we can show
4.23 |
By (4.23) and Lemma 4.1, we obtain
4.24 |
which proves the theorem. □
Stability of the exponential Euler method
In this subsection, under the same conditions as those in Theorem 4.1, we will obtain the exponential stability in mean square of the exponential Euler method (2.4) to SLSDDEs (2.1) in Theorem 4.2. It is shown that the stability region of the numerical solution to the equation is the same as that of the analytical solution, which means that our method is effective.
Definition 4.3
[12]
Given a step size for some positive integer m, the discrete exponential Euler method is said to be exponentially stable in mean square on SDDEs (2.1) if there is a pair of positive constants λ̄ and μ̄ such that for any initial data ,
4.25 |
Lemma 4.2
[14]
Let be the smallest possible one-sided Lipschitz constant of the matrix A for a given inner product. Then is the smallest element of the set
4.26 |
Theorem 4.2
Under condition (H1), if , then for all the numerical method to equations (2.1) is exponentially stable in mean square, that is,
4.27 |
where , .
Proof
Squaring and taking the conditional expectation on both sides of (2.3), noting that is independent of , and , we have
4.28 |
Taking expectations on both sides, we obtain that
4.29 |
By (H1) and the inequality , we have
4.30 |
Substituting (4.30) into (4.29), by (H1), we have
4.31 |
where , . In view of , we have and . Consequently, . Hence
4.32 |
for all , which implies
4.33 |
That is,
4.34 |
for all . From (4.31), we have
4.35 |
So we obtain
4.36 |
Thus, for all ,
4.37 |
The proof is completed. □
Numerical experiments
In this section, we give several numerical experiments in order to demonstrate the results about the strong convergence and the exponential stability in mean square of the numerical solution for equations (2.1). We consider the test equation
5.1 |
Example 5.1
When , , , , , . In Table 1, the convergence of the exponential Euler method to Example 5.1 is described. Here we focus on the error at the endpoint , and the error is given as , where denotes the value of (2.3) at the endpoint. The expectation is estimated by averaging random sample paths (, ) over the interval , that is,
In Table 1, we can see that the exponential Euler method to Example 5.1 is convergent, suggesting that (2.3) is valid.
Table 1.
Step size | ||
---|---|---|
0.11758788103726 | 0.05128510485760 | |
0.01076456781468 | 0.00178190502421 | |
4.226428624973588e − 004 | 2.606318250482847e − 004 | |
1.080022443102593e − 004 | 6.629709170569013e − 005 | |
1.325175503903862e − 005 | 1.152618733195335e − 005 | |
3.097379961005242e − 007 | 2.047860964726653e − 006 | |
8.055605114301942e − 009 | 5.371039941796389e − 007 |
Example 5.2
When , , , , , . We can show the stability of the exponential Euler method to (2.3). In Figure 1, all the curves decay toward to zero when , , , , , , , . So we can consider that our experiments are consistent with our proved results in Section 4.
Conclusions
In this paper, we study convergence and exponential stability in mean square of the numerical solution for the exponential Euler method to semi-linear stochastic delay differential equations under the global Lipschitz condition and the linear growth condition. Firstly, Theorem 3.1 gives the exponential Euler approximation solution converging to the analytic solution with the strong order to SLSDDEs. Secondly, we give the exponential stability in mean square of the exact solution to SLSDDEs by using the definition of logarithmic norm. Then we propose an explicit method to show that the exponential Euler method to SLSDDEs is proved to share the same stability for any step size. Finally, a numerical example is given to verify the method, the conclusion is correct. In Table 1, the convergence of the exponential Euler method to Example 5.1 is described. Here we focus on the error at the endpoint . In Figure 1, all the curves decay toward zero when , , , , , , , , and there is the same conclusion for any step size. So we can consider that our experiments are consistent with our proved results in Section 4.
Acknowledgements
I would like to thank the referees for their helpful comments and suggestions. The financial support from the Youth Science Foundations of Heilongjiang Province of P.R. China (No.QC2016001) is gratefully acknowledged.
Authors’ contributions
All authors read and approved the final manuscript.
Competing interests
The author declares that no competing interests exist.
Footnotes
Publisher’s Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
References
- 1.Friedman A. Stochastic Differential Equations and Applications, Vol. 1 and 2. New York: Academic Press; 1975. [Google Scholar]
- 2.Higham DJ, Mao X, Yuan C. Almost sure and moment exponential stability in the numerical simulation of stochastic differential equations. SIAM J. Numer. Anal. 2007;41:592–609. doi: 10.1137/060658138. [DOI] [Google Scholar]
- 3.Mao X. Stochastic Differential Equations and Applications. Chichester: Horwood; 1997. [Google Scholar]
- 4.Fuke W, Xuerong M. Convergence and stability of the semi-tamed Euler scheme for stochastic differential equations with non-Lipschitz continuous coefficients. Appl. Math. Comput. 2014;228:240–250. [Google Scholar]
- 5.Mao X. The truncated Euler Maruyama method for stochastic differential equations. J. Comput. Appl. Math. 2015;290:370–384. doi: 10.1016/j.cam.2015.06.002. [DOI] [Google Scholar]
- 6.Mao X. Convergence rates of the truncated Euler Maruyama method for stochastic differential equations. J. Comput. Appl. Math. 2016;296:362–375. doi: 10.1016/j.cam.2015.09.035. [DOI] [Google Scholar]
- 7.Mao X. Almost sure exponential stability in the numerical simulation of stochastic differential equations. SIAM J. Numer. Anal. 2015;53:370–389. doi: 10.1137/140966198. [DOI] [Google Scholar]
- 8.Cao WR, Liu MZ, Fan ZC. MS-stability of the Euler-Maruyama method for stochastic differential delay equations. Appl. Math. Comput. 2004;159:127–135. [Google Scholar]
- 9.Fan ZC, Liu MZ. The Pth moment exponential stability for the stochastic delay differential equation. J. Nat. Sci. Heilongjiang Univ. 2005;22:4. [Google Scholar]
- 10.Mao X. Numerical solutions of stochastic differential delay equations under the generalized Khasminskii-type conditions. Appl. Math. Comput. 2011;217:5512–5524. [Google Scholar]
- 11.Wu* K, Ding X. Convergence and stability of Euler method for impulsive stochastic delay differential equations. Appl. Math. Comput. 2014;229:151–158. [Google Scholar]
- 12.Mao X. Exponential stability of equidistant Euler-Maruyama approximations of stochastic differential delay equations. J. Comput. Appl. Math. 2007;200:297–316. doi: 10.1016/j.cam.2005.11.035. [DOI] [Google Scholar]
- 13.Kunze M, Neerven J. Approximating the coefficients in semilinear stochastic partial differential equations. J. Evol. Equ. 2011;11:577–604. doi: 10.1007/s00028-011-0102-6. [DOI] [Google Scholar]
- 14.Dekker K, Verwer JG. Stability of Runge-Kutta Methods for Stiff Nonlinear Differential Equations. 1983. [Google Scholar]