Skip to main content
Springer logoLink to Springer
. 2017 Oct 6;2017(1):249. doi: 10.1186/s13660-017-1518-5

Convergence and stability of the exponential Euler method for semi-linear stochastic delay differential equations

Ling Zhang 1,
PMCID: PMC5630662  PMID: 29070932

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 12 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 [17]). 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 [812]). 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 |x| be the Euclidean norm in xRn. If A is a vector or matrix, its transpose is denoted by AT. If A is a matrix, its trace norm is denoted by |A|=trace(ATA). For simplicity, we also denote ab=min{a,b}, ab=max{a,b}.

Let (Ω,F,P) be a complete probability space with a filtration {Ft}t0, satisfying the usual conditions. L1([0,),Rn) and L2([0,),Rn) denote the family of all real-valued Ft-adapted processes f(t)t0 such that for every T>0, 0T|f(t)|dt< a.s. and 0T|f(t)|2dt< a.s., respectively. For any a,bR with a<b, denote by C([a,b];Rn) the family of continuous functions ϕ from [a,b] to Rn with the norm ϕ=supaθb|ϕ(θ)|. Denote by CFtb([a,b];Rn) the family of all bounded Ft-measurable C([a,b];Rn)-valued random variables. Let B(t)=(B1(t),,Bd(t))T be a d-dimensional Brownian motion defined on the probability space (Ω,F,P). Throughout this paper, we consider the following semi-linear stochastic delay differential equations:

{dx(t)=(Ax(t)+f(t,x(t),x(tτ)))dt+g(t,x(t),x(tτ))dB(t),t[0,T],x(t)=ξ(t),t[τ,0], 2.1

where T>0, τ>0, {ξ(t),t[τ,0]}=ξCF0b([τ,0];Rn), f:R+×Rn×RnRn, g:R+×Rn×RnRn×d, ARn×n is the matrix [13]. By the definition of stochastic differential, this equation is equivalent to the following stochastic integral equation:

x(t)=eAtξ+0teA(ts)f(s,x(s),x(sτ))ds+0teA(ts)g(s,x(s),x(sτ))dB(s)t0. 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 L1 such that
|f(t,x,y)f(t,x¯,y¯)|2|g(t,x,y)g(t,x¯,y¯)|2L1(|xx¯|2+|yy¯|2)
for those x,x¯,y,y¯Rn.
(H2)
(Linear growth condition) There exists a positive constant L2 such that
|f(t,x,y)|2|g(t,x,y)|2L2(1+|x|2+|y|2)
for all (t,x,y)R+×Rn×Rn.
(H3)
f and g are supposed to satisfy the following property:
|f(s,x,y)f(t,x,y)|2|g(s,x,y)g(t,x,y)|2K1(1+|x|2+|y|2)|st|,
where K1 is a constant and s,t[0,T] with t>s.

Let h=τm be a given step size with integer m1, and let the gridpoints tn be defined by tn=nh (n=0,1,2,). We consider the exponential Euler method to (2.1)

yn+1=eAhyn+eAhf(tn,yn,ynm)h+eAhg(tn,yn,ynm)ΔBn, 2.3

where ΔBn=B(tn)B(tn1), n=0,1,2,,yn, is approximation to the exact solution x(tn). The continuous exponential Euler method approximate solution is defined by

y(t)=eAtξ+0teA(ts_)f(s_,z(s),z(sτ))ds+0teA(ts_)g(s_,z(s),z(sτ))dB(s), 2.4

where s_=[sh]h and [x] denotes the largest integer which is smaller than x, z(t)=k=0yk1[kh,(k+1)h)(t) with 1A denoting the indicator function for the set A. It is not difficult to see that y(tn)=z(tn)=yn for n=0,1,2, . That is, the step function z(t) and the continuous exponential Euler solution y(t) coincide with the discrete solution at the gridpoint. Let C2,1(Rn×R+;R) denote the family of all continuous nonnegative functions V(x,t) defined on Rn×R+ such that they are continuously twice differentiable in x and once in t. Given VC2,1(Rn×R+;R), we define the operator LV:Rn×Rn×R+R by

LV(x,y,t)=Vt(x,t)+Vx(x,t)f(x,y,t)+12trace[gT(x,y,t)Vxx(x)g(x,y,t)],

where

Vt(x,t)=V(x,t)t,Vx(x,t)=(V(x,t)x1,,V(x,t)xn),Vxx(x,t)=(2V(x,t)xixj)n×n.

Let us emphasize that LV is defined on Rn×Rn×R+, while V is only defined on Rn×R+.

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

limh0E[sup0tT|y(t)x(t)|2]=0. 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 C1 such that the solution of equations (2.1) and the continuous exponential Euler method approximate solution (2.4) satisfy

EsupτtT|y(t)|2EsupτtT|x(t)|2C1(1+E|ξ|2), 3.2

where C1=max{3e2|A|Te6e2|A|TT(T+4)L2,e2|A|TT(T+4)L2e6e2|A|TT(T+4)L2} is a constant independent of h.

Proof

It follows from (2.4) that

|y(t)|2=|eAtξ+0teA(ts_)f(s_,z(s),z(sτ))ds+0teA(ts_)g(s_,z(s),z(sτ))dB(s)|23[|eAtξ|2+|0teA(ts_)f(s_,z(s),z(sτ))ds|2+|0teA(ts_)g(s_,z(s),z(sτ))dB(s)|2]. 3.3

By Hölder’s inequality, we obtain

|y(t)|23[|eAtξ|2+T0t|eA(ts_)f(s_,z(s),z(sτ))|2ds+|0teA(ts_)g(s_,z(s),z(sτ))dB(s)|2]. 3.4

This implies that for any 0t1T,

Esup0tt1|y(t)|23[Esup0tt1|eAtξ|2+TEsup0tt10t|eA(ts_)f(s_,z1(s),z2(s))|2ds+Esup0tt1|0teA(ts_)g(s_,z(s),z(sτ))dB(s)|2]3[Esup0tt1|eAt|2|ξ|2+TEsup0tt10t|eA(ts_)|2|f(s_,z(s),z(sτ))|2ds+Esup0tt1|eAt|2|0teAs_g(s_,z(s),z(sτ))dB(s)|2]. 3.5

By Doob’s martingale inequality, it is not difficult to show that

Esup0tt1|y(t)|23[e2|A|TE|ξ|2+Te2|A|TE0t1|f(s_,z(s),z(sτ))|2ds+4e2|A|TE0t1|eAs_g(s_,z(s),z(sτ))|2ds]3e2|A|T[E|ξ|2+TE0t1|f(s_,z(s),z(sτ))|2ds+4e2|A|TE0t1|g(s_,z(s),z(sτ))|2ds]. 3.6

Making use of (H2) yields

Esup0tt1|y(t)|23e2|A|T[Eξ2+(T+4e2|A|T)L2E0t1(1+|z(s)|2+|z(sτ)|2)ds]3e2|A|TEξ2+3e2|A|TT(T+4e2|A|T)L2+6e2|A|T(T+4e2|A|T)L20t1Esupτus|y(u)|2ds. 3.7

Thus

Esupτtt1|y(t)|23e2|A|TEξ2+3e2|A|TT(T+4e2|A|T)L2+6e2|A|T(T+4e2|A|T)L20t1Esupτus|y(u)|2ds. 3.8

By Gronwall’s inequality, we get

EsupτtT|y(t)|2C1, 3.9

where C1=(3e2|A|TEξ2+3e2|A|TT(T+4e2|A|T)L2)e6e2|A|TT(T+4e2|A|T)L2. In the same way, we obtain

EsupτtT|x(t)|2C1, 3.10

where C1=(3e2|A|TEξ2+3e2|A|TT(T+4e2|A|T)L2)e6e2|A|TT(T+4e2|A|T)L2. The proof is completed. □

The following lemma shows that both y(t) and z(t) are close to each other.

Lemma 3.2

Under condition (H2). Then

E|y(t)z(t)|2C2(ξ)h,t[0,T], 3.11

where C2(ξ) is a constant independent of h.

Proof

For t[0,T], there is an integer k such that t[tk,tk+1). We compute

|y(t)z(t)|23[|eA(ttk)I|2|yk|2+|eA(ttk)f(tk,yk,ykm)(ttk)|2+|eA(ttk)g(tk,yk,ykm)(B(t)B(tk))|2]3[|eA(ttk)I|2|yk|2+|eA(ttk)|2|f(tk,yk,ykm)|2|(ttk)|2+|eA(ttk)|2|g(tk,yk,ykm)|2|(B(t)B(tk))|2], 3.12

where I is an identity matrix. Taking the expectation of both sides, we can see

E|y(t)z(t)|23[|eA(ttk)I|2E|yk|2+h2e2|A|TE|f(tk,yk,ykm)|2+he2|A|TE|g(tk,yk,ykm)|2]. 3.13

Using the linear growth conditions, we have

E|y(t)z(t)|23[|eA(ttk)I|2E|yk|2+h2e2|A|TL2E(1+|yk|2+|ykm|2)+he2|A|TL2E(1+|yk|2+|ykm|2)]3[|eA(ttk)I|2C1+(h2+h)e2|A|TL2(1+2C1)]. 3.14

Since |eA(ttk)Ik|e|A|h1|A|he|A|h|A|he|A|T, we have

E|y(t)z(t)|2C2(ξ)h, 3.15

where C2(ξ)=3|A|2Te2|A|TC1+3(T+1)e2|A|TL2(1+2C1) is a constant independent of h. The proof is completed. □

Proof of Theorem 3.1

By (2.2) and (2.4), we have

|x(t)y(t)|22|0t[eA(ts)f(s,x(s),x(sτ))eA(ts_)f(s_,z(s),z(sτ))]ds|2+2|0t[eA(ts)g(s,x(s),x(sτ))eA(ts_)g(s_,z(s),z(sτ))]dB(s)|2. 3.16

By Hölder’s inequality, we obtain

|x(t)y(t)|26T0t|eA(ts)f(s,x(s),x(sτ))eA(ts_)f(s,x(s),x(sτ))|2ds+6T0t|eA(ts_)f(s,x(s),x(sτ))eA(ts_)f(s,z(s),z(sτ))|2ds+6T0t|eA(ts_)f(s,z(s),z(sτ))eA(ts_)f(s_,z(s),z(sτ))|2ds+6|0t[eA(ts)g(s,x(s),x(sτ))eA(ts_)g(s,x(s),x(sτ))]dB(s)|2+6|0t[eA(ts_)g(s,x(s),x(sτ))eA(ts_)g(s,z(s),z(sτ))]dB(s)|2+6|0t[eA(ts_)g(s,z(s),z(sτ))eA(ts_)g(s_,z(s),z(sτ))]dB(s)|2. 3.17

This implies that for any 0t1T, by Doob’s martingale inequality, we have

Esup0tt1|x(t)y(t)|26TEsup0tt10t|eA(ts)f(s,x(s),x(sτ))eA(ts_)f(s,x(s),x(sτ))|2ds+6TEsup0tt10tE|eA(ts_)f(s,x(s),x(sτ))eA(ts_)f(s,z(s),z(sτ))|2ds+6TEsup0tt10tE|eA(ts_)f(s,z(s),z(sτ))eA(ts_)f(s_,z(s),z(sτ))|2ds+6Esup0tt1|eAt|2|0teAsg(s,x(s),x(sτ))eAs_g(s,x(s),x(sτ))dB(s)|2+6Esup0tt1|eAt|2|0teAs_g(s,x(s),x(sτ))eAs_g(s,z(s),z(sτ))dB(s)|2+6Esup0tt1|eAt|2|0teAs_g(s,z(s),z(sτ))eAs_g(s_,z(s),z(sτ))dB(s)|2. 3.18

We compute the first item in (3.18)

Esup0tt10tE|eA(ts)f(s,x(s),x(sτ))eA(ts_)f(s,x(s),x(sτ))|2dsEsup0tt10t|eA(ts)eA(ts_)|2E|f(s,x(s),x(sτ))|2dsL2Esup0tt10t|eA(ts_)|2|eA(s_s)I|2E(1+|x(s)|2+|x(sτ)|2)dsL2e2|A|TT|eA(s_s)I|2(1+2C1). 3.19

We compute the following two formulas in (3.18):

Esup0tt10tE|eA(ts_)f(s,x(s),x(sτ))eA(ts_)f(s,z(s),z(sτ))|2dsL1e2|A|T0t1E(|x(s)z(s)|2+|x(sτ)z2(s)|2)ds2L1e2|A|T0t1E(|x(s)y(s)|2+|y(s)z(s)|2+|x(sτ)y(sτ)|2+|y(sτ)z(sτ)|2)ds4L1e2|A|TTC2(ξ)h+2L1e2|A|T0t1E(|x(s)y(s)|2+|x(sτ)y(sτ)|2)ds 3.20

and

Esup0tt10tE|eA(ts_)f(s,z(s),z(sτ))eA(ts_)f(s_,z(s),z(sτ))|2dsK1e2|A|TTE(1+|z(s)|2+|z(sτ)|2)hK1e2|A|TT(1+2C1)h. 3.21

In the same way, we can obtain

Esup0tt1|eAt|2|0teAsg(s,x(s),x(sτ))eAs_g(s,x(s),x(sτ))dB(s)|24e2|A|TE0t1|eAsg(s,x(s),x(sτ))eAs_g(s,x(s),x(sτ))|2ds4L2e4|A|TT|eA(s_s)I|2(1+2C1). 3.22

We compute the following two formulas in (3.18):

Esup0tt1|eAt|2|0teAs_g(s,x(s),x(sτ))eAs_g(s,z(s),z(sτ))dB(s)|24e2|A|TE0t1|eAs_g(s,x(s),x(sτ))eAs_g(s,z(s),z(sτ))|2ds16L1e4|A|TTC2(ξ)h+8L1e4|A|T0t1E(|x(s)y(s)|2+|x(sτ)y(sτ)|2)ds 3.23

and

Esup0tt1|eAt|2|0teAs_g(s,z(s),z(sτ))eAs_g(s_,z(s),z(sτ))dB(s)|24e2|A|TE0t|eAs_g(s,z(s),z(sτ))eAs_g(s_,z(s),z(sτ))|2ds4K1e4|A|TT(1+2C1)h. 3.24

Substituting (3.19) - (3.24) into (3.18), we have

Esup0tt1|x(t)y(t)|26T(T+4e2|A|T)L2e2|A|T|eA(s_s)I|2(1+2C1)+12(T+4e2|A|T)L1e2|A|T0t1Esup0νs|x(ν)y(ν)|2ds+6T(T+4e2|A|T)K1e2|A|T(1+2C1)h+24T(T+4e2|A|T)L1e2|A|TTC2(ξ)h. 3.25

By Gronwall’s inequality, since |eA(s_s)I||A|he|A|T, we can show

Esup0tT|x(t)y(t)|2[6e2|A|TT(T+4)(L2|A|2h2e2|A|T+K1h)(1+2C1)+24T(T+4)L1e2|A|TT(C2(ξ)h]e12T(T+4)L1e2|A|T. 3.26

As a result,

limh0E[sup0tT|y(t)x(t)|2]=0. 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 f(t,0,0)=g(t,0,0)=0.

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 1+2μ[A]+4L1<0, then the solution of equations (2.1) with the initial data ξCF0b([τ,0];Rn) is exponentially stable in mean square, that is,

E|x(t)|2B˜1(τ)E|ξ|2etln(B˜(τ))12τ,t0, 4.1

where B˜(τ)=eB1τB2B1(1eB1τ), B1=1+2μ[A]+2L1, B2=2L1.

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 [0,π],[π,2π],,[kπ,(k+1)π]. Then we give a proof of the conclusion by t0,t2π,t4π,,t2nπ. 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 ξCF0b([τ,0];Rn),

E|x(t)|2μE|ξ|2eλt,t0. 4.2

We refer to λ as the rate constant and to μ as the growth constant.

Definition 4.2

[14]

The logarithmic norm μ[A] of A is defined by

μ[A]=limΔ0+I+ΔA1Δ. 4.3

Especially, if is an inner product norm, μ[A] can also be written as

μ[A]=maxξ0Aξ,ξξ2. 4.4

Lemma 4.1

Let B˜(t)=eB1tB2B1(1eB1t). If B1<0, B2>0 and B1+B2<0, then for all t0, 0<B˜(t)1 and B˜(t) is decreasing.

Proof

It is known from B1<0, B2>0 and B1+B2<0 that for all t0

B˜(t)=B1+B2B1eB1tB2B1>0

and

B˜(t)=eB1t1+B2B1(eB1t1)+1=(B1+B2)(eB1t1)B1+11.

For all t0, we compute

B˜(t)=(B1+B2)eB1t<0.

Thus B˜(t) is decreasing. The proof is complete. □

Proof of Theorem 4.1

By Itô’s formula and Definition 4.2, for all t0, we have

d|x(t)|2=[2x(t),Ax(t)+f(t,x(t),x(tτ))+|g(t,x(t),x(tτ))|2]dt+2xT(t)g(t,x(t),x(tτ))dB(t)[2x(t),Ax(t)+2x(t),f(t,x(t),x(tτ))+|g(t,x(t),x(tτ))|2]dt+2xT(t)g(t,x(t),x(tτ))dB(t)[B1|x(t)|2+B2|x(tτ)|2]dt+2xT(t)g(t,x(t),x(tτ))dB(t), 4.5

where B1=1+2μ[A]+2L1, B2=2L1. Let V(x,t)=eB1t|x(t)|2, by Itô’s formula, we obtain

d(eB1t|x(t)|2)=B1eB1t|x(t)|2dt+eB1td|x(t)|2B1eB1t|x(t)|2dt+eB1t[B1|x(t)|2+B2|x(tτ)|2]dt+2eB1txT(t)g(t,x(t),x(tτ))dB(t)eB1tB2|x(tτ)|2dt+2eB1txT(t)g(t,x(t),x(tτ))dB(t). 4.6

Integrating (4.6) from 0 to t yields

eB1t|x(t)|2|x(0)|2+B20teB1s|x(sτ)|2ds+20teB1sxT(s)g(s,x(s),x(sτ))dB(s). 4.7

Taking expected values gives

eB1tE|x(t)|2E|x(0)|2+B20teB1sE|x(sτ)|2ds. 4.8

For any t[0,τ], we have

eB1tE|x(t)|2E|ξ|2+E|ξ|2B20teB1sds[1B2B1(eB1t1)]E|ξ|2. 4.9

Hence

E|x(t)|2[eB1tB2B1(1eB1t)]E|ξ|2=B˜(t)E|ξ|2. 4.10

For any t[τ,2τ], we obtain

eB1tE|x(t)|2eB1τE|x(τ)|2+B2τteB1sE|x(sτ)|2dseB1τB˜(τ)E|ξ|2+E|ξ|2B2τteB1sds=eB1τB˜(τ)E|ξ|2+E|ξ|2[B2B1(eB1teB1τ)]. 4.11

Thus

E|x(t)|2eB1(tτ)B˜(τ)E|ξ|2+E|ξ|2[B2B1(1eB1(tτ))]E|ξ|2[eB1(tτ)B2B1(1eB1(tτ))]=B˜(tτ)E|ξ|2. 4.12

Repeating this procedure, for all t[kτ,(k+1)τ], we can show

E|x(t)|2B˜(tkτ)E|ξ|2. 4.13

Hence, for any t>0, we have

E|x(t)|2E|ξ|2. 4.14

On the other hand, for any t0, one can easily show that

eB1tE|x(t)|2E|x(0)|2+B20teB1sE|x(sτ)|2dsE|ξ|2+E|ξ|2B20teB1sds=E|ξ|2[1B2B1(eB1t1)]. 4.15

Therefore,

E|x(t)|2E|ξ|2[eB1tB2B1(1eB1t)]=B˜(t)E|ξ|2. 4.16

Especially, we can see

E|x(2τ)|2B˜(2τ)E|ξ|2. 4.17

For any t2τ, we have

eB1tE|x(t)|2e2B1τE|x(2τ)|2+B22τteB1sE|x(sτ)|2dse2B1τB˜(2τ)E|ξ|2+B22τteB1sB(sτ)E|ξ|2dse2B1τB˜(2τ)E|ξ|2+B˜(τ)E|ξ|2B22τteB1sdse2B1τB˜(τ)E|ξ|2+B˜(τ)E|ξ|2[B2B1(eB1te2B1τ)]B˜(τ)E|ξ|2[e2B1τB2B1(eB1te2B1τ)]. 4.18

Therefore,

E|x(t)|2B˜(τ)E|ξ|2[eB1(t2τ)B2B1(1eB1(t2τ))]=B˜(τ)B˜(t2τ)E|ξ|2. 4.19

Obviously, we can obtain

E|x(4τ)|2B˜(τ)B˜(2τ)E|ξ|2B˜2(τ)E|ξ|2. 4.20

For any t4τ, we can see that

eB1tE|x(t)|2e4B1τE|x(4τ)|2+B24τteB1sE|x(sτ)|2dse4B1τB˜(4τ)E|ξ|2+B24τteB1sB˜(τ)B˜(s3τ)E|ξ|2dse4B1τB˜2(τ)E|ξ|2+B˜2(τ)E|ξ|2B24τteB1sdse4B1τB˜2(τ)E|ξ|2+B˜2(τ)E|ξ|2[B2B1(eB1te4B1τ)]B˜2(τ)E|ξ|2[e4B1τB2B1(eB1te4B1τ)]. 4.21

Therefore,

E|x(t)|2B˜2(τ)E|ξ|2[eB1(t4τ)B2B1(1eB1(t4τ))]=B˜2(τ)B˜(t4τ)E|ξ|2. 4.22

For any t0, there is an integer n such that t2nτ; repeating this procedure, we can show

E|x(t)|2B˜n(τ)B˜(tnτ)E|ξ|2B˜n(τ)E|ξ|2. 4.23

By (4.23) and Lemma 4.1, we obtain

E|x(t)|2B˜n(τ)E|ξ|2=e2nτln(B˜(τ))12τE|ξ|2=e(2nτt)ln(B˜(τ))12τE|ξ|2etln(B˜(τ))12τe2τln(B˜(τ))12τE|ξ|2etln(B˜(τ))12τ=B˜1(τ)E|ξ|2etln(B˜(τ))12τ, 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 h=τ/m 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 ξCF0b([τ,0];Rn),

E|yn|2μ¯E|ξ|2eλ¯nh,n0. 4.25

Lemma 4.2

[14]

Let μ[A] be the smallest possible one-sided Lipschitz constant of the matrix A for a given inner product. Then μ[A] is the smallest element of the set

M={θ:exp(At)exp(θt),t0}. 4.26

Theorem 4.2

Under condition (H1), if 1+2μ[A]+4L1<0, then for all h>0 the numerical method to equations (2.1) is exponentially stable in mean square, that is,

E|yn|2(A1+A2)1E|y0|2enhln(A1+A2)12τ, 4.27

where A1=e2μ[A]h(1+L1h2+2L1h+h), A2=e2μ[A]h(L1h2+2L1h).

Proof

Squaring and taking the conditional expectation on both sides of (2.3), noting that ΔBn is independent of Fnh, E(ΔBn|Fnh)=E(ΔBn)=0 and E((ΔBn)2|Fnh)=E(ΔBn)2=h, we have

E(|yn+1|2|Fnh)=e2μ[A]hE|yn|2+e2μ[A]hE(|f(tn,yn,ynm)|2|Fnh)h2+e2μ[A]hE(|g(tn,yn,ynm)|2|Fnh)h+2e2μ[A]hE(yn,f(tn,yn,ynm)|Fnh)h. 4.28

Taking expectations on both sides, we obtain that

E|yn+1|2=e2μ[A]hE|yn|2+e2μ[A]hE|f(tn,yn,ynm)|2h2+e2μ[A]hE|g(tn,yn,ynm)|2h+2e2μ[A]hEyn,f(tn,yn,ynm)h. 4.29

By (H1) and the inequality 2aba2+b2, we have

2Eyn,f(tn,yn,ynm)E|yn|2+E|f(tn,yn,ynm)|2(1+L1)E|yn|2+L1E|ynm)|2. 4.30

Substituting (4.30) into (4.29), by (H1), we have

E|yn+1|2e2μ[A]h[(1+L1h2+2L1h+h)E|yn|2+(L1h2+2L1h)E|ynm|2]=A1E|yn|2+A2E|ynm|2, 4.31

where A1=e2μ[A]h(1+L1h2+2L1h+h), A2=e2μ[A]h(L1h2+2L1h). In view of 1+2μ[A]+4L1<0, we have μ[A]<0 and μ[A]>max{1,L1}. Consequently, L1μ2[A]<0. Hence

2(L1μ2[A])h+1+2μ[A]+4L1<0 4.32

for all h>0, which implies

1+h+4L1h+2L1h2<12μ[A]h+(2μ[A]h)22!<e2μ[A]h. 4.33

That is,

A1+A2=e2μ[A]h(1+h+4L1h+2L1h2)<1 4.34

for all h>0. From (4.31), we have

E|yn|2(A1+A2)[nm+1]+1E|y0|2. 4.35

So we obtain

E|yn|2(A1+A2)[nm+1]+1E|y0|2=e([nm+1]+1)ln(A1+A2)E|y0|2e[nm+1](m+1)hln(A1+A2)1(m+1)hE|y0|2e{nm+1}(m+1)hln(A1+A2)1(m+1)hE|y0|2enhln(A1+A2)1(m+1)he(m+1)hln(A1+A2)1(m+1)hE|y0|2enhln(A1+A2)1(m+1)h=(A1+A2)1E|y0|2enhln(A1+A2)1(m+1)h=(A1+A2)1E|y0|2enhln(A1+A2)12τ. 4.36

Thus, for all n=1,2 ,

E|yn|2(A1+A2)1E|y0|2enhln(A1+A2)12τ. 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

dx(t)=[a1x(t)+a2x(tτ)]dt+[b1x(t)+b2x(tτ)]dB(t)t0. 5.1

Example 5.1

When a1=4, a2=1.5, b1=1, b2=0.05, ξ=1+t, τ=1. 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 T=2,4, and the error is given as E|yn(ω)x(T,ω)|2, where yn(ω) denotes the value of (2.3) at the endpoint. The expectation is estimated by averaging random sample paths (ωi, 1i1,000) over the interval [0,10], that is,

e(h)=11,000i=111,000|yn(ωi)x(T,ωi)|2.

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.

The global error of numerical solutions for the exponential Euler method

Step size ϵ2 ϵ4
h=12 0.11758788103726 0.05128510485760
h=14 0.01076456781468 0.00178190502421
h=18 4.226428624973588e − 004 2.606318250482847e − 004
h=116 1.080022443102593e − 004 6.629709170569013e − 005
h=132 1.325175503903862e − 005 1.152618733195335e − 005
h=164 3.097379961005242e − 007 2.047860964726653e − 006
h=1128 8.055605114301942e − 009 5.371039941796389e − 007

Example 5.2

When a1=5, a2=1, b1=2, b2=0.5, ξ=1+t, τ=1. We can show the stability of the exponential Euler method to (2.3). In Figure 1, all the curves decay toward to zero when h=1/2, h=1/4, h=1/8, h=1/16, h=1/32, h=1/64, h=1/128, h=1/256. So we can consider that our experiments are consistent with our proved results in Section 4.

Figure 1.

Figure 1

The numerical solutions with h=1/2,1/4,1/8,1/16,1/32,1/64,1/128,1/256 for EEM.

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 12 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 T=2,4. In Figure 1, all the curves decay toward zero when h=1/2, h=1/4, h=1/8, h=1/16, h=1/32, h=1/64, h=1/128, h=1/256, 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]

Articles from Journal of Inequalities and Applications are provided here courtesy of Springer

RESOURCES