Next Article in Journal
A New Dynamic and Perspective Parsimonious AHP Model for Improving Industrial Frameworks
Previous Article in Journal
Novel Authentication Protocols Based on Quadratic Diophantine Equations
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Almost Sure Exponential Stability of Numerical Solutions for Stochastic Pantograph Differential Equations with Poisson Jumps

1
Department of Mathematics, Harbin Institute of Technology, Harbin 150001, China
2
Department of Mathematics, Faculty of Engineering at Shoubra, Benha University, Banha 13511, Egypt
*
Author to whom correspondence should be addressed.
These authors contributed equally to this work.
Mathematics 2022, 10(17), 3137; https://doi.org/10.3390/math10173137
Submission received: 16 July 2022 / Revised: 10 August 2022 / Accepted: 16 August 2022 / Published: 1 September 2022

Abstract

:
The stability analysis of the numerical solutions of stochastic models has gained great interest, but there is not much research about the stability of stochastic pantograph differential equations. This paper deals with the almost sure exponential stability of numerical solutions for stochastic pantograph differential equations interspersed with the Poisson jumps by using the discrete semimartingale convergence theorem. It is shown that the Euler–Maruyama method can reproduce the almost sure exponential stability under the linear growth condition. It is also shown that the backward Euler method can reproduce the almost sure exponential stability of the exact solution under the polynomial growth condition and the one-sided Lipschitz condition. Additionally, numerical examples are performed to validate our theoretical result.

1. Introduction

Stochastic differential equations (SDEs) have been widely used in a variety of fields, such as physics, chemistry, engineering, biology and mathematical finance, to describe models of dynamical systems affected by uncertain factors. In order to have more realistic simulations for random systems, it is more desirable and efficient to study SDEs with delay. SDEs with delay are named stochastic functional differential equations [1] and they act better than SDEs. Hobson and Rogers [2] gave a new non-constant volatility model with past dependency in finance. Arriojas et al. [3] assumed that the stock price follows a stochastic model with delay. Recently, stochastic models with variable delay have received intensive attention [4,5,6,7,8] and have been used in many applications in finance, biology, control and stochastic neural networks [9,10,11,12]. These types of models are called stochastic pantograph differential equations (SPDEs), and they have received great concern and have been used in different fields of science. The pantograph model was used by Ockendon and Tayler [13] to know how the electric current is gathered by the pantograph of an electric locomotive, from where it gets the name.
On the other hand, it is desirable to incorporate jumps into stochastic models for more realistic simulations and data fitting. Thus, jump models are important and play a vital role in describing a sudden change in the system [14,15]. It is often better to use jump–diffusion models when the stochastic systems are interspersed with some randomly occurring impulses to describe them [16,17,18]. It is also preferable to study SDEs with delay and jump [19,20]. In this paper, we deal with the stochastic pantograph differential model interspersed with Poisson jumps.
Most of the stochastic pantograph differential equations with jumps have difficulties in their analytical solutions; therefore, numerical schemes have to be used to solve them. There is much research that focuses on the convergence of these numerical methods. For example, Fan et al. [21] presented numerical algorithms for solving SPDEs via the Razumikhin technique. Fan et al. [8] applied Euler methods on SPDEs and proved the existence, uniqueness and convergence of these numerical schemes. Moreover, Li et al. [22] applied the Euler technique on SPDEs and proved the convergence of that scheme.
The stability analysis is another important factor in the numerical analysis. There are two common concepts, namely the mean square stability and asymptotic stability. Guo and Li [23] formulated the global mean square stability of the Euler–Maruyama method. Higham et al. [24,25,26,27] studied the stability of the numerical techniques for SDEs. Mao [28,29,30] studied the almost sure asymptotic stability of stochastic differential equations with and without delay based on the continuous semimartingale convergence theorem. Rodkina and Schurz [31] studied the almost sure asymptotic stability of numerical solutions for linear SDEs based on the discrete semimartingale convergence theorem. Recently, Wu et al. [32] studied the almost sure exponential stability of Euler-type techniques for the nonlinear stochastic delay differential equations based on using the semimartingale convergence theorem. Zhou et al. [33] investigated the exponential stability for stochastic functional differential equations using the polynomial growth condition. Zhou [33] studied the almost sure exponential stability of numerical solutions for SPDEs. This paper extends the previous work which was concerned with the almost sure exponential stability of SPDEs and discusses the almost sure exponential stability of numerical solutions for SPDEs interspersed with Poisson jumps with the help of the discrete semimartingale convergence theorem.
The structure of this paper is arranged as follows. Section 2 gives some important notations and discusses the global and almost sure exponential stability of the analytical solution. The almost sure exponential stability of the Euler–Maruyama method is presented in Section 3. Then, Section 4 discusses the almost sure exponential stability of the backward Euler method when imposing the one-sided Lipschitz condition. Numerical examples are given in Section 5 to validate our theoretical results. Finally, the conclusions are given in Section 6.

2. Almost Sure Exponential Stability of the Analytical Solution

Throughout this paper, let ( Ω , F , F t t 0 , P ) be a complete probability space with filtration F t t 0 , satisfying the usual conditions (i.e., it is increasing and right continuous while F 0 contains all P-null sets). Let W ( t ) be a d dimension Brownian motion defined on the probability space and N ( t ) be a scalar Poisson process independent of W ( t ) with parameter λ > 0 defined on the same probability space. Let | · | denote the Euclidean vector norm or Frobenius matrix norm and let x , y be the inner product of x, y in R m and for a R , [ a ] denotes the integer part of a. a b represents max( a , b ) and a b represents min( a , b ).
Consider the following m dimensional stochastic pantograph differential equation interspersed with Poisson jumps of the form
d x ( t ) = f ( x ( t ) , x ( q t ) ) d t + g ( x ( t ) , x ( q t ) ) d W ( t ) + h ( x ( t ) , x ( q t ) ) d N ( t ) , t > 0 ,
with initial data x ( 0 ) = x 0 , where 0 < q < 1 , x ( t ) is m dimensional state process, x ( t ) : = l i m s t x ( s ) , x ( q t ) : = l i m s q t x ( s ) , f : R m × R m R m , g : R m × R m R m × d and h : R m × R m R m are Borel-measurable functions. Let the initial data x 0 be a bounded F 0 measurable random variable and E | x 0 | 2 < and f ( 0 , 0 ) = g ( 0 , 0 ) = h ( 0 , 0 ) = 0 which indicate that Equation (1) has a trivial solution. An important thing in our analysis is the compensated Poisson process
N ˜ ( t ) : = N ( t ) λ t ,
which is considered as a martingale.
Proof. 
Let s < t , then we have
E N ˜ t | F s = E N t λ t | F s = E N ˜ s + ( N t N s ) λ ( t s ) | F s = N ˜ s + E ( N t N s ) λ ( t s ) = N ˜ s + λ ( t s ) λ ( t s ) = N ˜ s .
It is also clear that N ˜ t is a function of N t and it is integrable as N t has a Poisson distribution. Therefore, we conclude that (2) is a martingale. By defining
f λ ( x , y ) = f ( x , y ) + λ h ( x , y )
it can be easily seen that Equation (1) may be written in the form
d x ( t ) = f λ ( x ( t ) , x ( q t ) ) d t + g ( x ( t ) , x ( q t ) ) d W ( t ) + h ( x ( t ) , x ( q t ) ) d N ˜ ( t ) .
Assumption 1.
The functions f, g and h satisfy the local Lipschitz condition, that is, for each integer j 1 , there exists a positive constant L j such that
| υ ( x 1 , y 1 ) υ ( x 2 , y 2 ) | 2 L j ( | x 1 x 2 | 2 + | y 1 y 2 | 2 ) ,
for all t 0 , υ = f , g , or h, and x k , y k R m with | x k | | y k | j ( k = 1 , 2 )
Assumption 2.
The polynomial growth conditions. For all x R m , there exist positive constants α , β , γ , δ , a , a ¯ , a ˜ , b , b ¯ , b ˜ , c , c ¯ , c ˜ such that
x ( s ) , f ( x ( s ) , x ( q s ) ) a | x ( s ) | α + 2 + a ¯ ( | x ( q s ) | β + 2 + | x ( s ) | β + 2 ) a ˜ | x ( s ) | 2 ,
| g ( x ( s ) , x ( q s ) ) | 2 b | x ( s ) | γ + 2 + b ¯ ( | x ( q s ) | γ + 2 + b ˜ | x ( s ) | 2 ,
| h ( x ( s ) , x ( q s ) ) | 2 c | x ( s ) | δ + 2 + c ¯ ( | x ( q s ) | δ + 2 + c ˜ | x ( s ) | 2 .
Theorem 1.
Let Assumptions 1 and 2 hold with 2 a ˜ > b ˜ + λ ( c ˜ + 1 ) , 2 a > 2 a ¯ ( 1 + 1 q ) + b + b ¯ q + λ ( c + c ¯ q ) and α β γ δ . Then, for any initial data x 0 , there almost surely exists unique global solution x ( t ) to Equation (1) on t 0 .
Proof. 
Under Assumption 1, applying the standing truncation technique to Equation (1) for any initial data x 0 , there exists a unique maximal local strong solution 0 < t < τ e , where τ e is the explosion time. In order to show that the solution is global, it is only needed to show that τ e = a.s. Let n 0 be sufficiently large such that n 0 > | x 0 | . For each integer n n 0 , define the stopping time
τ n = inf { t [ 0 , τ e ) : | x ( t ) | n } , n N
where, throughout this paper, we set inf ϕ = ( ϕ is the empty set). It is clear that τ n , n n 0 is an increasing sequence; therefore, τ n τ τ e ( n ) a . s . If it can be shown that τ = a . s . , then τ e = a . s . which indicates that x ( t ) is global. In other words, our target is to prove that P ( τ n t ) 0 ( n , t > 0 ) .
Define V ( x ) = | x | 2 . Because of P ( τ n t ) V ( x ( τ n ) ) E V ( x ( t τ n ) ) , our objective will be to prove that E V ( x ( t τ n ) ) < + because V ( x ( τ n ) ) = | x ( τ n ) | 2 = n 2 . Applying the Itô formula [34], we obtain
V ( x ( t τ n ) ) = V ( x ( 0 ) ) + 2 0 t τ n x ( s ) , f λ ( x ( s ) , x ( q s ) ) d s + 0 t τ n | g ( x ( s ) , x ( q s ) ) | 2 d s + M ( t ) ,
where
M ( t ) = 0 t τ n 2 x ( s ) , g ( x ( s ) , x ( q s ) ) d W ( s ) + 0 t τ n 2 x ( s ) , h ( x ( s ) , x ( q s ) ) d N ˜ ( s ) + 0 t τ n | h ( x ( s ) , x ( q s ) ) | 2 d N ˜ ( s )
is a local martingale with M ( 0 ) = 0 . Using Assumption 2, we may compute
2 x ( s ) , f λ ( x ( s ) , x ( q s ) ) + | g ( x ( s ) , x ( q s ) ) | 2 = 2 x ( s ) , f ( x ( s ) , x ( q s ) ) + 2 λ x ( s ) , h ( x ( s ) , x ( q s ) ) + | g ( x ( s ) , x ( q s ) ) | 2 ,
therefore,
2 x ( s ) , f λ ( x ( s ) , x ( q s ) ) + | g ( x ( s ) , x ( q s ) ) | 2 2 a | x ( s ) | α + 2 2 a ˜ | x ( s ) | 2 + 2 a ¯ ( | x ( q s ) | β + 2 + | x ( s ) | β + 2 ) + λ | x ( s ) | 2 + λ c | x ( s ) | δ + 2 + λ c ¯ | x ( s ) | δ + 2 + λ c ˜ | x ( s ) | 2 + b | x ( s ) | γ + 2 + λ b ¯ | x ( s ) | δ + 2 + λ b ˜ | x ( s ) | 2 ,
which equals to
2 x ( s ) , f λ ( x ( s ) , x ( q s ) ) + | g ( x ( s ) , x ( q s ) ) | 2 2 a | x ( s ) | α + 2 + 2 a ¯ q ( q | x ( q s ) | β + 2 | x ( s ) | β + 2 ) + λ c ¯ q ( q | x ( q s ) | δ + 2 | x ( s ) | δ + 2 ) + b ¯ q ( q | x ( q s ) | γ + 2 | x ( s ) | γ + 2 ) ( 2 a ˜ b ˜ λ ( c ˜ + 1 ) ) | x ( s ) | 2 + 2 a ¯ ( 1 + 1 q ) | x ( s ) | β + 2 + ( b + b ¯ q ) | x ( s ) | γ + 2 + λ ( c + c ¯ q ) | x ( s ) | δ + 2 .
Let
I ( x ( s ) ) = ( 2 a ˜ b ˜ λ ( c ˜ + 1 ) ) | x ( s ) | 2 2 a ¯ ( 1 + 1 q ) | x ( s ) | β + 2 + 2 a | x ( s ) | α + 2 ( b + b ¯ q ) | x ( s ) | γ + 2 λ ( c + c ¯ q ) | x ( s ) | δ + 2
Recall that 2 a ˜ > b ˜ + λ ( c ˜ + 1 ) , 2 a > 2 a ¯ ( 1 + 1 q ) + b + b ¯ q + λ ( c + c ¯ q ) , α β γ δ . By Lemma 1, in [33], there exists a positive constant ξ 0 such that I ( x ( s ) ) ξ 0 | x ( s ) | 2 . Substituting (14) and (15) into (10) yields
V ( x ( t τ n ) ) V ( x ( 0 ) ) + 2 a ¯ q 0 t τ n ( q | x ( q s ) | β + 2 | x ( s ) | β + 2 ) d s + b ¯ q 0 t τ n ( q | X ( q s ) | γ + 2 | x ( s ) | γ + 2 ) d s + λ c ¯ q 0 t τ n ( q | x ( q s ) | δ + 2 | x ( s ) | δ + 2 ) d s ξ 0 0 t τ n | x ( s ) | 2 d s + M ( t ) .
Using the property of integral, we may estimate
0 t ( q | x ( q s ) | β + 2 | x ( s ) | β + 2 ) d s = 0 t q | x ( q s ) | β + 2 d s 0 t | x ( s ) | β + 2 d s .
Letting z = q s and d s = ( 1 / q ) d z in the first integral of the right hand side of (17) lead to
0 t ( q | x ( q s ) | β + 2 | x ( s ) | β + 2 ) d s = 0 q t | x ( z ) | β + 2 d z 0 t | x ( s ) | β + 2 d s .
By making change of variable for the dummy variable z in the first integral of right hand side of (18) and making it equal to s, we obtain the following
0 t ( q | x ( q s ) | β + 2 | x ( s ) | β + 2 ) d s = 0 q t | x ( s ) | β + 2 d s 0 t | x ( s ) | β + 2 d s = q t t | x ( s ) | β + 2 d s
By the same analogy, we obtain
0 t ( q | x ( q s ) | γ + 2 | x ( s ) | γ + 2 ) d s q t t | x ( s ) | γ + 2 d s ,
and
0 t ( q | x ( q s ) | δ + 2 | x ( s ) | δ + 2 ) d s q t t | x ( s ) | δ + 2 d s .
By plugging (19)–(21) into (16) and taking expectation, we obtain
E V ( x ( t τ n ) ) V ( x ( 0 ) ) 2 a ¯ q E q ( t τ n ) t τ n | x ( s ) | β + 2 d s b ¯ q E q ( t τ n ) t τ n | x ( s ) | γ + 2 d s λ c ¯ q E q ( t ν k ) t τ n | x ( s ) | δ + 2 d s ξ 0 E 0 t τ n | x ( s ) | 2 d s ,
which indicates that there exists a positive constant D such that E V ( x ( t τ n ) ) D . As mentioned before, P ( τ n t ) V ( x ( τ n ) ) E V ( x ( t τ n ) ) and V ( x ( τ n ) ) = | x ( τ n ) | 2 = n 2 , allowing n leads to
lim sup n P ( τ n t ) = 0 .
This indicates that Equation (1) has a unique global solution. □
Assumption 3.
The polynomial growth conditions. For all x R m , there exist positive constants α , β , γ , δ , a , a ¯ , a ˜ , b , b ¯ , b ˜ , c , c ¯ , c ˜ such that
x ( s ) , f ( x ( s ) , x ( q s ) ) a | x ( s ) | α + 2 + a ¯ ( e ( 1 q ) ε s | x ( q s ) | β + 2 + | x ( s ) | β + 2 ) a ˜ | x ( s ) | 2 ,
| g ( x ( s ) , x ( q s ) ) | 2 b | x ( s ) | γ + 2 + b ¯ e ( 1 q ) ε s | x ( q s ) | γ + 2 + b ˜ | x ( s ) | 2 ,
| h ( x ( s ) , x ( q s ) ) | 2 c | x ( s ) | δ + 2 + c ¯ e ( 1 q ) ε s | x ( q s ) | δ + 2 + c ˜ | x ( s ) | 2 .
Theorem 2.
Let Assumptions 1–3 hold with 2 a ˜ > b ˜ + λ ( c ˜ + 1 ) , 2 a > 2 a ¯ ( 1 + 1 q ) + b + b ¯ q + λ ( c + c ¯ q ) and α β γ δ . Then, for any initial data x 0 , the solution x ( t ) to Equation (1) is almost sure exponentially stable, that is,
lim sup t 1 t log | x ( t ) | ε 2 ,
where ε 2 a ˜ b ˜ λ ( c ˜ + 1 ) .
Proof. 
Let V ( x ) = | x | 2 and for any ε > 0 , we obtain the following by applying the Itô formula
e ε t V ( x ( t ) ) = V ( x ( 0 ) ) + 0 t e ε s ( ε V ( x ( s ) ) + 2 x ( s ) , f λ ( x ( s ) , x ( q s ) ) + | g ( x ( s ) , x ( q s ) ) | 2 ) d s + M ¯ ( t ) ,
where
M ¯ ( t ) = 0 t 2 e ε s x ( s ) , g ( x ( s ) , x ( q s ) ) d W ( s ) + 0 t 2 e ε s x ( s ) , h ( x ( s ) , x ( q s ) ) d N ˜ ( s ) + 0 t e ε s | h ( x ( s ) , x ( q s ) ) | 2 d N ˜ ( s )
is a local martingale with M ¯ ( 0 ) = 0 . Using Assumption 3, we obtain
ε V ( x ( s ) ) + 2 x ( s ) , f λ ( x ( s ) , x ( q s ) ) + | g ( x ( s ) , x ( q s ) ) | 2 ε | x ( s ) | 2 2 a | x ( s ) | α + 2 2 a ˜ | x ( s ) | 2 + 2 a ¯ ( e ( 1 q ) ε s | x ( q s ) | β + 2 + | x ( s ) | β + 2 ) + λ | x ( s ) | 2 + λ c | x ( s ) | δ + 2 + λ c ¯ e ( 1 q ) ε s | x ( q s ) | δ + 2 + λ c ˜ | x ( s ) | 2 + b | x ( s ) | γ + 2 + b ¯ e ( 1 q ) ε s | x ( q s ) | δ + 2 + b ˜ | x ( s ) | 2 ,
which equals to
ε V ( x ( s ) ) + 2 x ( s ) , f λ ( x ( s ) , x ( q s ) ) + | g ( x ( s ) , x ( q s ) ) | 2 2 a ¯ q ( q e ( 1 q ) ε s | x ( q s ) | β + 2 | x ( s ) | β + 2 ) + 2 a ¯ q ( q e ( 1 q ) ε s | x ( q s ) | β + 2 | x ( s ) | β + 2 ) + b ¯ q ( q e ( 1 q ) ε s | x ( q s ) | γ + 2 | x ( s ) | γ + 2 ) + λ c ¯ q ( q e ( 1 q ) ε s | x ( q s ) | δ + 2 | x ( s ) | δ + 2 ) 2 a | x ( s ) | α + 2 ( 2 a ˜ b ˜ λ ( c ˜ + 1 ) ε ) | x ( s ) | 2 + 2 a ¯ ( 1 + 1 q ) | x ( s ) | β + 2 + ( b + b ¯ q ) | x ( s ) | γ + 2 + λ ( c + c ¯ q ) | x ( s ) | δ + 2 .
Let
I ( x ( s ) ) = ( 2 a ˜ b ˜ λ ( c ˜ + 1 ) ε ) | x ( s ) | 2 2 a ¯ ( 1 + 1 q ) | x ( s ) | β + 2 + 2 a | x ( s ) | α + 2 ( b + b ¯ q ) | x ( s ) | γ + 2 λ ( c + c ¯ q ) | x ( s ) | δ + 2 .
Recall that 2 a ˜ > b ˜ + λ ( c ˜ + 1 ) , 2 a > 2 a ¯ ( 1 + 1 q ) + b + b ¯ q + λ ( c + c ¯ q ) , ε < 2 a ˜ b ˜ λ ( c ˜ + 1 ) , α β γ δ . By Lemma 1, in [33], there exists a positive constant ξ ¯ 0 such that I ( x ( s ) ) ξ ¯ 0 | x ( s ) | 2 . Substituting (31) and (32) into (28) yields
e ε t V ( x ( t ) ) V ( x ( 0 ) ) + 2 a ¯ q 0 t e ε s ( q e ( 1 q ) ε s | x ( q s ) | β + 2 | x ( s ) | β + 2 ) d s + b ¯ q 0 t e ε s ( q e ( 1 q ) ε s | x ( q s ) | γ + 2 | x ( s ) | γ + 2 ) d s + λ c ¯ q 0 t e ε s ( q e ( 1 q ) ε s | x ( q s ) | δ + 2 | x ( s ) | δ + 2 ) d s ξ ¯ 0 0 t e ε s | X ( s ) | 2 d s + M ¯ ( t ) .
Using the property of the integral, the following is obtained
0 t e ε s ( q e ( 1 q ) ε s | x ( q s ) | β + 2 | x ( s ) | β + 2 ) d s 0 q t e ε s | x ( s ) | β + 2 d s 0 t | x ( s ) | β + 2 d s = q t t e ε s | x ( s ) | β + 2 d s ,
by the same analogy, the following are obtained
0 t e ε s ( q e ( 1 q ) ε s | x ( q s ) | γ + 2 | x ( s ) | γ + 2 ) d s q t t e ε s | x ( s ) | γ + 2 d s ,
and
0 t e ε s ( q e ( 1 q ) ε s | x ( q s ) | δ + 2 | x ( s ) | δ + 2 ) d s q t t e ε s | x ( s ) | δ + 2 d s .
By plugging (34)–(36) into (33), we obtain
e ε t V ( x ( t ) ) V ( x ( 0 ) ) 2 a ¯ q q t t e ε s | x ( s ) | β + 2 d s b ¯ q q t t e ε s | x ( s ) | γ + 2 d s λ c ¯ q q t t e ε s | x ( s ) | δ + 2 d s ξ ¯ 0 0 t e ε s | x ( s ) | 2 d s + M ¯ ( t )
Applying the nonnegative semimartingale convergence theorem [33], we obtain
lim sup t e ε t V ( X ( t ) ) < a . s .
That is, there exists a finite positive random variable C 0 such that
sup 0 t < e ε t V ( x t ) C 0 a . s .
Which implies
sup 0 t < 1 t log | x ( t ) | ε 2 a . s .
The proof is completed. □
Remark 1. 
1. 
The solution x ( t ) to Equation (1) is said to be almost sure exponential stable if there exists a constant c > 0 such that
lim sup t 1 t log | x ( t ) | c a . s .
for any initial data x 0 .
2. 
The solution x ( t ) to Equation (1) is said to be mean square stable if for every ϵ > 0 there exists a constant c > 0 such that
sup t 0 t < E x ( t ) 2 ϵ
for any initial data x 0 such that x 0 c .

3. Almost Sure Stability of Euler–Maruyama Method

For a given step-size Δ t ( 0 , 1 ) , the Euler–Maruyama method for (4) is defined as follows
X n + 1 = X n + f λ ( X n , X [ q n ] ) Δ t + g ( X n , X [ q n ] ) Δ W n + h ( X n , X [ q n ] ) Δ N ˜ n , n = 0 , 1 , 2 , . . .
where X n is an approximation value of x ( t n ) , t n = n Δ t , 0 < q < 1 and X 0 = x 0 . Δ W n = W ( t n + 1 ) W ( t n ) represents the Brownian motion increments and Δ N ˜ n = N ˜ n + 1 N ˜ n represents the increments of the compensated Poisson process. The delay argument may not hit the previous time step which appears in the numerical method while dealing with the pantograph delay. This problem is tackled by interpolating the unknown approximate values of the solution to the closet grid point on the left endpoint of the interval containing the delay argument using piecewise constant polynomials.
Assumption 4.
The Linear Growth Conditions. For any x R m , there exist positive constants a , a ¯ , b , b ¯ , c , c ¯ , d , d ¯ such that
x ( s ) , f ( x ( s ) , x ( q s ) ) a | x ( s ) | 2 + a ¯ e ( 1 q ) ε s | x ( q s ) | 2 ,
| f ( x ( s ) , x ( q s ) ) | 2 c | x ( s ) | 2 + c ¯ e ( 1 q ) ε s | x ( q s ) | 2
| g ( x ( s ) , X ( q s ) ) | 2 b | x ( s ) | 2 + b ¯ e ( 1 q ) ε s | x ( q s ) | 2
| h ( x ( s ) , x ( q s ) ) | 2 d | x ( s ) | 2 + d ¯ e ( 1 q ) ε s | x ( q s ) | 2
Theorem 3.
Let Assumption 4 hold. Then, for any given ε > 0 , there exists a small Δ t ( 0 , 1 ) such that if Δ t < Δ t , then the approximate solution { X n } defined by (41) has the property
lim sup n 1 n Δ t log | X n | ε 2 a . s .
Proof. 
Using Assumption 4 and Euler–Maruyama technique (41), we may calculate
| X n + 1 | 2 = | X n | 2 + 2 X n , f λ ( X n , X [ q n ] ) Δ t + | f λ ( X n , X [ q n ] ) | 2 Δ t 2 + | g ( X n , X [ q n ] ) Δ W n | 2 + | h ( X n , X [ q n ] ) Δ N ˜ n | 2 + 2 X n + f λ ( X n , X [ q n ] , g ( X n , X [ q n ] ) Δ W n ) + 2 X n + f λ ( X n , X [ q n ] , h ( X n , X [ q n ] ) Δ N ˜ n ) + 2 g ( X n , X [ q n ] ) Δ W n , h ( X n , X [ q n ] ) Δ N ˜ n ,
| X n + 1 | 2 | X n | 2 + 2 X n , f ( X n , X [ q n ] ) Δ t + λ Δ t | h ( X n , X [ q n ] ) | 2 + λ Δ t | X n | 2 + 2 Δ t 2 | f ( X n , X [ q n ] ) | 2 + 2 ( λ Δ t ) 2 | h ( X n , X [ q n ] ) | 2 + | g ( X n , X [ q n ] ) | 2 Δ t + | g ( X n , X [ q n ] ) | 2 ( Δ W n 2 Δ t ) + | h ( X n , X [ q n ] ) | 2 λ Δ t + | h ( X n , X [ q n ] ) | 2 ( N ˜ n 2 λ Δ t ) + 2 X n + f λ ( X n , X [ q n ] , g ( X n , X [ q n ] ) Δ W n ) + 2 X n + f λ ( X n , X [ q n ] , h ( X n , X [ q n ] ) Δ N ˜ n ) + 2 g ( X n , X [ q n ] ) Δ W n , h ( X n , X [ q n ] ) Δ N ˜ n ,
| X n + 1 | 2 ( 1 2 a Δ t + b Δ t + 2 c Δ t 2 + λ Δ t ( 1 + 2 d ( 1 + λ Δ t ) ) | X n | 2 + ( 2 a ¯ + 2 c ¯ Δ t + b ¯ + 2 λ d ¯ ( 1 + λ Δ t ) ) e ( 1 q ) ε n Δ t | X [ q n ] | 2 Δ t + S n ,
where
S n = | g ( X n , X [ q n ] ) | 2 ( Δ W n 2 Δ t ) + | h ( X n , X [ q n ] ) | 2 ( N ˜ n 2 λ Δ t ) + 2 X n + f λ ( X n , X [ q n ] , g ( X n , X [ q n ] ) Δ W n ) + 2 X n + f λ ( X n , X [ q n ] , h ( X n , X [ q n ] ) Δ N ˜ n ) + 2 g ( X n , X [ q n ] ) Δ W n , h ( X n , X [ q n ] ) Δ N ˜ n ,
after obtaining (50), it is easy to have
e ε ( n + 1 ) Δ t | X n + 1 | 2 e ε n Δ t | X n | 2 ( A e ε Δ t ) e ε ( n + 1 ) Δ t | X n | 2 + B e ε ( q n + 1 ) Δ t | X [ q n ] | 2 Δ t + e ε ( n + 1 ) Δ t S n ,
where
A = 1 2 a Δ t + b Δ t + 2 c Δ t 2 + λ Δ t ( 1 + 2 d ( λ Δ t ) ) ,
and
B = 2 a ¯ + 2 c ¯ Δ t + b ¯ + 2 λ d ¯ ( 1 + λ Δ t ) .
By applying the recursive method, it is easy to obtain
e ε n Δ t | X n | 2 | X 0 | 2 + ( A e ε Δ t ) i = 0 n 1 e ε ( i + 1 ) Δ t | X i | 2 + B i = 0 n 1 e ε ( i + 1 ) Δ t ( e ( 1 q ) ε i Δ t | X [ q i ] | 2 e ε Δ t | X i | 2 ) Δ t + B e ε Δ t i = 0 n 1 e ε ( i + 1 ) Δ t | X i | 2 Δ t + i = 0 n 1 e ε ( i + 1 ) Δ t S i
e ε n Δ t | X n | 2 | X 0 | 2 ( e ε Δ t A Δ t B e ε Δ t ) i = 0 n 1 e ε ( i + 1 ) Δ t | X i | 2 Δ t + B i = 0 n 1 e ε ( i + 1 ) Δ t ( e ( 1 q ) ε i Δ t | X [ q i ] | 2 e ε Δ t | X i | 2 ) Δ t + i = 0 n 1 e ε ( i + 1 ) Δ t S i ,
where i = 0 n 1 e ε ( i + 1 ) Δ t S i is a martingale. Assume that [ q i ] = j ; then j q i < j + 1 ; therefore, q i 1 < j q i . If 0 i n 1 , then 1 < j q ( n 1 ) [ q n ] + 1 q [ q n ] + 1 . This leads to
i = 0 n 1 e ε ( i + 1 ) Δ t ( e ε ( 1 q ) i Δ t | X [ q i ] | 2 e ε Δ t | X i | 2 ) = i = 0 n 1 e ε ( 1 + q i ) Δ t | X [ q i ] | 2 i = 0 n 1 e ε ( i + 2 ) Δ t | X i | 2 = i = 0 [ q n ] + 1 e ε ( i + 2 ) Δ t | X i | 2 i = 0 n 1 e ε ( i + 2 ) Δ t | X i | 2 i = [ q n ] + 2 n 1 e ε ( i + 2 ) Δ t | X i | 2 .
Let
f ( Δ t ) = 2 a b Δ t 2 c Δ t λ ( 1 + 2 d ( λ Δ t ) ) + e ε Δ t 1 Δ t B e ε Δ t .
Using the Taylor series, we obtain
e ε Δ t = 1 ε Δ + ( ε Δ t ) 2 2 ( ε Δ t ) 3 3 ! + · · · > 1 ε Δ t ,
which leads to
e ε Δ t 1 Δ t > ε .
Thus,
f ( Δ t ) > 2 a b Δ t 2 c Δ t λ ( 1 + 2 d ( λ Δ t ) ) ε B e ε Δ t .
For a given ε , pick up a very small Δ t such that for all Δ t < Δ t ,
2 a b Δ t 2 c Δ t λ ( 1 + 2 d ( λ Δ t ) ) ε B e ε Δ t > 0 .
After plugging (56) and (60) into (55), the discrete semimartingale theorem which was stated in [33] implies that there exists a positive constant C 0 such that
e ε n Δ t | X n | 2 C 0 .
Which implies
lim sup n 1 n Δ t log | X n | ε 2 a . s .
The proof is completed. □

4. Almost Sure Stability of Backward Euler–Maruyama Method

In this section, it will be shown that the backward Euler–Maruyama technique can reproduce the almost sure exponential stability of the exact solution of SPDE interspersed with Poisson jumps.
Assumption 5.
The Polynomial Growth Conditions. For any x R m , there exist positive constants α, a , a ¯ , a ˜ , b , b ¯ , b ˜ , c , c ¯ , c ˜ such that
x ( s ) , f ( x ( s ) , x ( q s ) ) a | x ( s ) | α + 2 + a ¯ e ( 1 q ) ε s | x ( q s ) | α + 2 a ˜ | x ( s ) | 2 ,
| g ( x ( s ) , x ( q s ) ) | 2 b | x ( s ) | α + 2 + b ¯ e ( 1 q ) ε s | x ( q s ) | α + 2 + b ˜ | x ( s ) | 2 ,
| h ( x ( s ) , x ( q s ) ) | 2 c | x ( s ) | α + 2 + c ¯ e ( 1 q ) ε s | x ( q s ) | α + 2 + c ˜ | x ( s ) | 2 .
Given a step-size Δ t ( 0 , 1 ) and for t [ 0 , T ] , let N Δ t = T for some positive integer N and t n = n Δ t ( n 0 ) . Then, the backward Euler–Maruyama technique is defined as follows
X n + 1 = X n + f ( X n + 1 , X [ q ( n + 1 ) ] ) Δ t + g ( X n , X [ q n ] ) Δ W n + h ( X n , X [ q n ] ) Δ N n .
To ensure that this scheme is well-defined, the following one-sided Lipschitz condition is imposed on the drift coefficient f ( x , y ) in x.
Assumption 6.
One-sided Lipschitz condition. There exists a constant ζ such that for any x 1 , x 2 , y R m and t 0
x 1 x 2 , f ( x 1 , y ) f ( x 2 , y ) ζ | x 1 x 2 | 2 .
Under this condition, if ζ Δ t < 1 , then the backward Euler scheme (66) is well-defined (see, e.g., [35]). The following theorem shows the almost sure exponential stability of the backward Euler scheme.
Theorem 4.
Let Assumptions 5 and 6 hold. Then, there exists a small Δ t ( 0 , 1 ) such that if Δ t < Δ t , then the approximate solution { X n } defined by (66) has the property
lim sup n 1 n Δ t log | X n | ε 2 a . s .
where ε < 2 a ˜ m b ˜ λ m c ˜ .
Proof. 
Using Assumption A5 and Equation (66), we may calculate
| X n + 1 | 2 = X n + 1 , X n + f ( X n + 1 , X [ q ( n + 1 ) ] ) Δ t + g ( X n , X [ q n ] ) Δ W n + h ( X n , X [ q n ] ) Δ N ˜ n + λ h ( X n , X [ q n ] ) Δ t ,
which equals to
| X n + 1 | 2 = X n + 1 , f ( X n + 1 , X [ q ( n + 1 ) ] ) Δ t + X n + 1 , X n + g ( X n , X [ q n ] ) Δ W n + h ( X n , X [ q n ] ) Δ N ˜ n + λ h ( X n , X [ q n ] ) Δ t ,
then
| X n + 1 | 2 ( a | X n + 1 | α + 2 + a ¯ e ε ( 1 q ) ( n + 1 ) | X [ q ( n + 1 ) ] | α + 2 a ˜ | X n + 1 | 2 ) Δ t + 1 2 | X n + 1 | 2 + | X n | 2 + 1 2 ( b | X n | α + 2 + b ¯ e ε ( 1 q ) n Δ t | X [ q n ] | α + 2 + b ˜ | X n | 2 ) | Δ W n | 2 + 1 2 ( c | X n | α + 2 + c ¯ e ε ( 1 q ) n Δ t | X [ q n ] | α + 2 + c ˜ | X n | 2 ) | Δ N ˜ n | 2 + ( c | X n | α + 2 + c ¯ e ε ( 1 q ) n Δ t | X [ q n ] | α + 2 + c ˜ | X n | 2 ) | λ Δ t | 2 + X n , g ( X n , X [ q n ] ) Δ W n + g ( X n , X [ q n ] ) Δ W n , h ( X n , X [ q n ] ) Δ N ˜ n + g ( X n , X [ q n ] ) Δ W n , λ h ( X n , X [ q n ] ) Δ t + h ( X n , X [ q n ] ) Δ N ˜ , λ h ( X n , X [ q n ] ) Δ t + X n , h ( X n , X [ q n ] ) Δ N ˜ n .
This leads to the following
( 1 + 2 a ˜ Δ t ) | X n + 1 | 2 ( 2 + m b ˜ Δ t + λ c ˜ ( m + 2 λ Δ t ) Δ t ) | X n | 2 2 ( a | X n + 1 | α + 2 a ¯ e ε ( 1 q ) n Δ t | X [ q ( n + 1 ) ] | α + 2 ) Δ t + ( m b | X n | α + 2 + m b ¯ e ε ( 1 q ) n Δ t | X [ q n ] | α + 2 ) Δ t + λ ( m c | X n | α + 2 + m c ¯ e ε ( 1 q ) n Δ t | X [ q n ] | α + 2 ) Δ t + 2 λ 2 ( c | X n | α + 2 + c ¯ e ε ( 1 q ) n Δ t | X [ q n ] | α + 2 ) Δ t 2 + S n ,
where
S n = ( b | X n | α + 2 + b ¯ e ε ( 1 q ) n Δ t | X [ q n ] | α + 2 + b ˜ | X n | 2 ) ( | Δ W n | 2 m Δ t ) + ( c | X n | α + 2 + c ¯ e ε ( 1 q ) n Δ t | X [ q n ] | α + 2 + c ˜ | X n | 2 ) ( | Δ N ˜ n | 2 λ m Δ t ) + 2 X n , g ( X n , X [ q n ] ) Δ W n + 2 g ( X n , X [ q n ] ) Δ W n , h ( X n , X [ q n ] ) Δ N ˜ n + 2 g ( X n , X [ q n ] ) Δ W n , λ h ( X n , X [ q n ] ) Δ t + 2 h ( X n , X [ q n ] ) Δ N ˜ , λ h ( X n , X [ q n ] ) Δ t + 2 X n , h ( X n , X [ q n ] ) Δ N ˜ n .
Then, we may obtain
( 1 + 2 a ˜ Δ t ) ( e ε ( n + 1 ) Δ t | X n + 1 | 2 e ε n Δ t | X n | 2 ) ( 2 + m b ˜ Δ t + λ c ˜ ( m + 2 λ Δ t ) Δ t ( 1 + 2 a ˜ Δ t ) e ε Δ t ) e ε ( n + 1 ) Δ t | X n | 2 2 a e ε ( n + 1 ) Δ t | X n + 1 | α + 2 Δ t + 2 a ¯ e ε q ( n + 1 ) Δ t | X [ q ( n + 1 ) ] | α + 2 Δ t + m b e ε ( n + 1 ) Δ t | X n | α + 2 Δ t + m b ¯ e ε ( q n + 1 ) Δ t | X [ q n ] | α + 2 Δ t + λ ( m c e ε ( n + 1 ) Δ t | X n | α + 2 + m c ¯ e ε ( q n + 1 ) Δ t | X [ q n ] | α + 2 ) Δ t + 2 λ 2 ( c e ε ( n + 1 ) Δ t | X n | α + 2 + c ¯ e ε ( q n + 1 ) Δ t | X [ q n ] | α + 2 ) Δ t 2 + e ε ( n + 1 ) Δ t S n .
By using the recursive method, we obtain
( 1 + 2 a ˜ Δ t ) e ε n Δ t | X n | 2 ( 1 + 2 a ˜ Δ t ) | X 0 | 2 + ( 2 + m b ˜ Δ t + λ c ˜ ( m + 2 λ Δ t ) Δ t ( 1 + 2 a ˜ Δ t ) e ε Δ t ) i = 0 n 1 e ε ( i + 1 ) Δ t | X i | 2 2 a i = 0 n 1 e ε ( i + 1 ) Δ t | X i + 1 | α + 2 Δ t + 2 a ¯ i = 0 n 1 e ε q ( i + 1 ) Δ t | X [ q ( i + 1 ) ] | α + 2 Δ t + m b i = 0 n 1 e ε ( i + 1 ) Δ t | X i | α + 2 Δ t + m b ¯ i = 0 n 1 e ε ( q i + 1 ) Δ t | X [ q i ] | α + 2 Δ t + λ c ( m + 2 λ Δ t ) i = 0 n 1 e ε ( i + 1 ) Δ t | X i | α + 2 Δ t + λ c ¯ ( m + 2 λ Δ t ) i = 0 n 1 e ε ( q i + 1 ) Δ t | X [ q i ] | α + 2 Δ t + i = 0 n 1 e ε ( i + 1 ) Δ t S i ,
which equals to
( 1 + 2 a ˜ Δ t ) ( e ε n Δ t | X n | 2 ( 1 + 2 a ˜ Δ t ) | X 0 | 2 + ( ( 2 + m b ˜ Δ t + λ c ˜ ( m + 2 λ Δ t ) Δ t ) e ε Δ t ( 1 + 2 a ˜ Δ t ) ) i = 0 n 1 e ε i Δ t | X i | 2 2 a i = 1 n e ε i Δ t | X i | α + 2 Δ t + m b i = 0 n 1 e ε ( i + 1 ) Δ t | X i | α + 2 Δ t + λ c ( m + 2 λ Δ t ) i = 0 n 1 e ε ( i + 1 ) Δ t | X i | α + 2 Δ t + 2 a ¯ i = 0 n 1 e ε ( i + 1 ) Δ t | X i | α + 2 Δ t + m b ¯ i = 0 n 1 e ε ( i + 2 ) Δ t | X i | α + 2 Δ t + λ c ¯ ( m + 2 λ Δ t ) i = 0 n 1 e ε ( i + 2 ) Δ t | X i | α + 2 Δ t + 2 a ¯ i = 0 n 1 e ε ( i + 1 ) Δ t ( e ε ( 1 q ) ( i + 1 ) Δ t | X [ q ( i + 1 ) ] | α + 2 | X i | α + 2 ) Δ t + m b ¯ i = 0 n 1 e ε ( i + 1 ) Δ t ( e ε ( 1 q ) i Δ t | X [ q i ] | α + 2 e ε Δ t | X i | α + 2 ) Δ t + λ c ¯ ( m + 2 λ Δ t ) i = 0 n 1 e ε ( i + 1 ) Δ t ( e ε ( 1 q ) i Δ t | X [ q i ] | α + 2 e ε Δ t | X i | α + 2 ) Δ t + i = 0 n 1 e ε ( i + 1 ) Δ t S i ,
where i = 0 n 1 e ε ( i + 1 ) Δ t S i is a martingale. Then, we could proceed as we did before in (56) and obtain the following
i = 0 n 1 e ε ( i + 1 ) Δ t ( e ε ( 1 q ) i Δ t | X [ q i ] | α + 2 e ε Δ t | X i | α + 2 ) = i = 0 n 1 e ε ( 1 + q i ) Δ t | X [ q i ] | α + 2 i = 0 n 1 e ε ( i + 2 ) Δ t | X i | α + 2 = i = 0 [ q n ] + 1 e ε ( i + 2 ) Δ t | X i | α + 2 i = 0 n 1 e ε ( i + 2 ) Δ t | X i | α + 2 i = [ q n ] + 2 n 1 e ε ( i + 2 ) Δ t | X i | α + 2 .
By the same analogy, we obtain
i = 0 n 1 e ε ( i + 1 ) Δ t ( e ε ( 1 q ) ( i + 1 ) Δ t | X [ q ( i + 1 ) ] | α + 2 | X i | α + 2 ) i = [ q n ] + 2 n 1 e ε ( i + 1 ) Δ t | X i | α + 2 .
After plugging (77) and (78) into (76), we obtain the following
( 1 + 2 a ˜ Δ t ) e ε n Δ t | X n | 2 ( 1 + 2 a ˜ Δ t ) | X 0 | 2 + i = 1 n 1 e ε ( i + 1 ) Δ t | X i | 2 2 a e ε n Δ t | X n | α + 2 Δ t ( 1 + 2 a ˜ Δ t ( 1 + m b ˜ Δ t + λ c ˜ ( m + 2 λ Δ t ) Δ t ) e ε Δ t ) i = 0 n 1 e ε i Δ t | X i | 2 + ( 2 a + m b e ε Δ t + 2 a ¯ e ε Δ t + m b ¯ e 2 ε Δ t ) i = 1 n 1 e ε i Δ t | X i | α + 2 Δ t + λ e ε Δ t ( m + 2 λ Δ t ) ( c + c ¯ e ε Δ t ) i = 1 n 1 e ε i Δ t | X i | α + 2 Δ t + ( 2 a ¯ + m b + m b ¯ e ε Δ t + λ ( m + 2 λ Δ t ) ( c + c ¯ e ε Δ t ) ) e ε Δ t | X 0 | α + 2 Δ t 2 a ¯ [ q i ] + 2 n 1 e ε ( i + 1 ) Δ t | X i | α + 2 Δ t m b ¯ [ q i ] + 2 n 1 e ε ( i + 2 ) Δ t | X i | α + 2 Δ t λ c ¯ ( m + 2 λ Δ t ) [ q i ] + 2 n 1 e ε ( i + 2 ) Δ t | X i | α + 2 Δ t + i = 0 n 1 e ε ( i + 1 ) Δ t S i .
We follow the same procedures as in [33] and denote
f ( Δ t ) = 1 + 2 a ˜ Δ t ( 1 + m b ˜ Δ t + λ c ˜ ( m + 2 λ Δ t ) Δ t ) e ε Δ t .
Upon differentiating with respect to Δ t yields
f ( Δ t ) = 2 a ˜ ( m b ˜ + λ c ˜ ( m + 4 λ Δ t ) ) e ε Δ t ( 1 + m b ˜ Δ t + λ c ˜ ( m + 2 λ Δ t ) Δ t ) ε e ε Δ t ,
and
f ( Δ t ) = ( 1 + m b ˜ Δ t + λ c ˜ ( m + 2 λ Δ t ) Δ t ) ε 2 e ε Δ t ( 4 λ 2 c ˜ ) e ε Δ t 2 ( m b ˜ + λ c ˜ ( m + 4 λ Δ t ) ) ε e ε Δ t .
Clearly, f ( 0 ) = 2 a ˜ m b ˜ λ m c ˜ ε > 0 , f ( 0 ) < 0 , then there exists a Δ t ¯ such that f ( Δ t ¯ ) = 0 . f ( Δ t ) is non-decreasing function for values of Δ t less than Δ t ¯ and noting that f ( 0 ) = 0 ; therefore, there exists a small Δ t less than Δ t ¯ such that for all Δ t < Δ t
1 + 2 a ˜ Δ t ( 1 + m b ˜ Δ t + λ c ˜ ( m + 2 λ Δ t ) Δ t ) e ε Δ t > 0 .
On the other hand, because 2 a > ( 2 a ¯ + m b ¯ + λ m c ¯ ) q + b + λ c , then there exists a small Δ t < Δ t such that
2 a 2 a ¯ e ε Δ t m ( b + b ¯ e ε Δ t ) e ε Δ t λ ( m + 2 λ Δ t ) ( c + c ¯ e ε Δ t ) e ε Δ t > 0 .
Then, after plugging (83) and (84) into (79), the discrete semimartingale theorem which was stated in [33] implies that there exists a positive constant C 0 such that
( 1 + 2 a ˜ Δ t ) e ε n Δ t | X n | 2 C 0 .
Which implies
lim sup n 1 n Δ t log | X n | ε 2 a . s .
The proof is completed. □

5. Numerical Examples

In this section, we will present examples to illustrate our theory.
Example 1.
Consider the following nonlinear SPDE with Poisson jumps
d x ( t ) = [ 0.5 x ( t ) 4 x 5 ( t ) + 2 x 5 ( q t ) ] d t + x 3 ( t ) d W ( t ) + x 3 ( t ) d N ( t ) ,
where W ( t ) is Brownian motion and N ( t ) is Poisson process. Define f ( x , y ) = 0.5 x 4 x 5 + 2 y 5 and g ( x , y ) = h ( x , y ) = x 3 . Then, we compute the following
f ( x 1 , y ) f ( x 2 , y ) = 0.5 ( x 1 x 2 ) 4 ( x 1 5 x 2 5 ) 0.5 ( x 1 x 2 ) [ 1 + 8 ( x 1 4 + x 1 3 x 2 + x 1 2 x 2 2 + x 1 x 2 3 + x 2 4 ) ] .
Noting that A 2 + B 2 ( A + B ) 2 2 , calculate
x 1 4 + x 1 3 x 2 + x 1 2 x 2 2 + x 1 x 2 3 + x 2 4 ( x 1 2 + x 2 2 ) 2 2 + x 1 x 2 ( x 1 2 + x 2 2 ) + ( x 1 x 2 ) 2 ( x 1 2 + x 2 2 ) 2 4 + x 1 x 2 ( x 1 2 + x 2 2 ) + ( x 1 x 2 ) 2 = [ x 1 2 + x 2 2 2 + x 1 x 2 ] 2 ,
which implies
x 1 x 2 , f ( x 1 , y ) f ( x 2 , y ) 0.5 ( x 1 x 2 ) 2 .
This indicates that f ( x , y ) satisfies the one-sided Lipschitz condition, and upon using the inequality A p B q p p + q A p + q + q p + q B p + q , it is easy to calculate
x , f ( x , y ) 0.5 x 2 4 x 6 + 2 y 5 x 0.5 x 2 11 3 x 6 + 5 3 y 6 ,
and | g ( x ( t ) , y ( t ) ) | 2 = | h ( x ( t ) , y ( t ) ) | 2 x 6 . By Theorems 1, 2 and 4, Equation (87) has a unique global solution and the solution is almost surely exponentially stable.
Example 2.
Consider the following nonlinear SPDE with Poisson jumps
d x ( t ) = [ 0.4 x ( t ) 5 x 3 ( t ) + x 3 ( q t ) ] d t + x 2 ( t ) d W ( t ) + x 2 ( t ) d N ( t ) .
Define f ( x , y ) = 0.4 x 5 x 3 + y 3 , g ( x , y ) = x 2 and h ( x , y ) = x 2 . Then, we compute the following
f ( x 1 , y ) f ( x 2 , y ) = 0.4 ( x 1 x 2 ) 5 ( x 1 3 x 2 3 ) = 0.4 ( x 1 x 2 ) [ 1 + 12.5 ( x 1 2 + x 1 x 2 + x 2 2 ) ] .
Now, we test the one-sided Lipschitz condition
x 1 x 2 , f ( x 1 , y ) f ( x 2 , y ) = 0.4 ( x 1 x 2 ) 2 [ 1 + 12.5 ( x 1 2 + x 1 x 2 + x 2 2 ) ] 0.4 ( x 1 x 2 ) 2 .
This indicates that f ( x , y ) satisfies the one-sided Lipschitz condition and it is easy to calculate
x , f ( x , y ) 0.4 x 2 5 x 4 + x y 3 0.4 x 2 4.75 x 4 + 0.75 y 4 ,
and | g ( x ( t ) , y ( t ) ) | 2 x 4 and | h ( x ( t ) , y ( t ) ) | 2 x 4 . By Theorems 1, 2 and 4, Equation (88) has a unique global solution and the solution is almost surely exponentially stable, and the backward Euler technique can reproduce the almost sure exponential stability.
Example 3.
Consider the following nonlinear SPDE with Poisson jumps
d x ( t ) = [ x ( t ) 2 x 5 ( t ) + 10 x 5 ( q t ) ] d t + x 3 ( t ) s i n ( x ( q t ) ) d W ( t ) + x 3 ( t ) c o s ( x ( q t ) ) d N ( t ) .
Define f ( x , y ) = x 2 x 5 + 10 y 5 , g ( x , y ) = x 3 s i n ( y ) and h ( x , y ) = x 3 c o s ( y ) . Then, we compute the following
f ( x 1 , y ) f ( x 2 , y ) = ( x 1 x 2 ) 2 ( x 1 5 x 2 5 ) = ( x 1 x 2 ) [ 1 + 2 ( x 1 4 + x 1 3 x 2 + x 1 2 x 2 2 + x 1 x 2 3 + x 2 4 ) ] .
Now, we test the one-sided Lipschitz condition
x 1 x 2 , f ( x 1 , y ) f ( x 2 , y ) = ( x 1 x 2 ) 2 [ 1 + 2 ( x 1 4 + x 1 3 x 2 + x 1 2 x 2 2 + x 1 x 2 3 + x 2 4 ) ] ( x 1 x 2 ) 2 .
This indicates that f ( x , y ) satisfies the one-sided Lipschitz condition and it is easy to calculate
x , f ( x , y ) x 2 2 x 6 + 10 x y 5 x 2 1 3 x 6 + 25 3 y 6 ,
and | g ( x , y ) | 2 = | x 3 s i n ( y ) | 2 x 6 and | h ( x , y ) | 2 = | x 3 c o s ( y ) | 2 x 6 . By Theorems 1, 2 and 4, Equation (89) has a unique global solution and the solution is almost surely exponentially stable, and the backward Euler technique can reproduce the almost sure exponential stability.

6. Conclusions

The conclusions of this paper can be summarized as follows:
  • The almost sure exponential stability of the analytical solution of SPDEs interspersed with the Poisson jumps has been proved with the help of the continuous semimartingale convergence theorem.
  • The existence and the uniqueness of the global solution of the exact solution have also been proven.
  • In using the discrete semimartingale convergence theorem, it has been shown that the explicit Euler–Maruyama technique reproduces the almost sure exponential stability of the exact solution under the assumption of the linear growth condition.
  • By replacing the linear growth condition with the polynomial growth condition, imposing the one-sided Lipschitz condition on the drift coefficient and using the discrete semimartingale convergence theorem, it has been demonstrated that the backward Euler technique is capable of reproducing the almost sure exponential stability.

Author Contributions

Conceptualization, B.T.; methodology, B.T. and A.A.-S.; validation, A.A.-S.; formal analysis, A.A.-S.; investigation, A.A.-S. and B.T.; resources, A.A.-S.; writing—original draft preparation, A.A.-S.; writing—review and editing, A.A.-S.; supervision, B.T.; funding acquisition, B.T. All authors have read and agreed to the published version of the manuscript.

Funding

This work is financed by the National Natural Science Foundation of China under grant number (No.91646106). Additionally, this work is supported by the Ministry of Higher Education of the Arab Republic of Egypt.

Institutional Review Board Statement

Not applicable.

Informed Consent Statement

Not applicable.

Data Availability Statement

Not applicable.

Acknowledgments

The authors would like to thank the editor and the referees for their careful reading of the manuscript and for the constructive comments which have led to an improvement of the manuscript.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Li, G.; Yang, Q. Stability analysis of the θ-method for hybrid neutral stochastic functional differential equations with jumps. Chaos Solitons Fractals 2021, 150, 111062. [Google Scholar] [CrossRef]
  2. Hobson, D.G.; Rogers, L.C. Complete models with stochastic volatility. Math. Financ. 1998, 8, 27–48. [Google Scholar] [CrossRef]
  3. Arriojas, M.; Hu, Y.; Mohammed, S.E.; Pap, G. A delayed Black and Scholes formula. Stoch. Anal. Appl. 2007, 25, 471–492. [Google Scholar] [CrossRef]
  4. Zhou, S.; Wang, Z.; Feng, D. Stochastic functional differential equations with infinite delay. J. Math. Anal. Appl. 2009, 357, 416–426. [Google Scholar] [CrossRef]
  5. Appleby, J.A. Decay and growth rates of solutions of scalar stochastic delay differential equations with unbounded delay and state dependent noise. Stochastics Dyn. 2005, 5, 133–147. [Google Scholar] [CrossRef]
  6. Baker, C.T.; Buckwar, E. Continuous θ-methods for the stochastic pantograph equation. Electron. Trans. Numer. Anal. 2000, 11, 131–151. [Google Scholar]
  7. Balasubramaniam, P.; Ntouyas, S. Controllability for neutral stochastic functional differential inclusions with infinite delay in abstract space. J. Math. Anal. Appl. 2006, 324, 161–176. [Google Scholar] [CrossRef]
  8. Fan, Z.; Liu, M.; Cao, W. Existence and uniqueness of the solutions and convergence of semi-implicit Euler methods for stochastic pantograph equations. J. Math. Anal. Appl. 2007, 325, 1142–1159. [Google Scholar] [CrossRef]
  9. Huang, C.; Cao, J. Almost sure exponential stability of stochastic cellular neural networks with unbounded distributed delays. Neurocomputing 2009, 72, 3352–3356. [Google Scholar] [CrossRef]
  10. Li, X.; Fu, X. Stability analysis of stochastic functional differential equations with infinite delay and its application to recurrent neural networks. J. Comput. Appl. Math. 2010, 234, 407–417. [Google Scholar] [CrossRef]
  11. Meng, X.; Hu, S.; Wu, P. Pathwise estimation of stochastic differential equations with unbounded delay and its application to stochastic pantograph equations. Acta Appl. Math. 2011, 113, 231–246. [Google Scholar] [CrossRef]
  12. Meng, X.; Tian, M.; Hu, S. Stability analysis of stochastic recurrent neural networks with unbounded time-varying delays. Neurocomputing 2011, 74, 949–953. [Google Scholar] [CrossRef]
  13. Ockendon, J.R.; Tayler, A.B. The dynamics of a current collection system for an electric locomotive. Proc. R. Soc. Lond. Math. Phys. Sci. 1971, 322, 447–468. [Google Scholar]
  14. Kou, S.G. A jump-diffusion model for option pricing. Manag. Sci. 2002, 48, 1086–1101. [Google Scholar] [CrossRef]
  15. Svishchuk, A.; Kalemanova, A. The stochastic stability of interest rates with jump changes. Theory Probab. Math. Stat. 2000, 61, 1–12. [Google Scholar]
  16. Tankov, P. Financial Modelling with Jump Processes; Chapman and Hall/CRC: Boca Raton, FL, USA, 2003. [Google Scholar]
  17. Bruti-Liberati, N.; Platen, E. Strong approximations of stochastic differential equations with jumps. J. Comput. Appl. Math. 2007, 205, 982–1001. [Google Scholar] [CrossRef]
  18. Kim, N.; Lee, Y. Estimation and prediction under local volatility jump–diffusion model. Phys. A Stat. Mech. Its Appl. 2018, 491, 729–740. [Google Scholar] [CrossRef]
  19. Agrawal, N.; Hu, Y. Jump Models with Delay—Option Pricing and Logarithmic Euler–Maruyama Scheme. Mathematics 2020, 8, 1932. [Google Scholar] [CrossRef]
  20. Ahmadian, D.; Farkhondeh Rouz, O. Exponential mean-square stability of numerical solutions for stochastic delay integro-differential equations with Poisson jump. J. Inequalities Appl. 2020, 2020, 1–33. [Google Scholar] [CrossRef]
  21. Fan, Z.; Song, M.; Liu, M. The αth moment stability for the stochastic pantograph equation. J. Comput. Appl. Math. 2009, 233, 109–120. [Google Scholar] [CrossRef]
  22. Ronghua, L.; Min, L.; Wan-Kai, P. Convergence of numerical solutions to stochastic pantograph equations with Markovian switching. Appl. Math. Comput. 2009, 215, 414–422. [Google Scholar] [CrossRef]
  23. Guo, P.; Li, C.J. Razumikhin-type technique on stability of exact and numerical solutions for the nonlinear stochastic pantograph differential equations. BIT Numer. Math. 2019, 59, 77–96. [Google Scholar] [CrossRef]
  24. Higham, D.J.; Mao, X.; Yuan, C. Almost sure and moment exponential stability in the numerical simulation of stochastic differential equations. SIAM J. Numer. Anal. 2007, 45, 592–609. [Google Scholar] [CrossRef] [Green Version]
  25. Higham, D.J.; Mao, X.; Yuan, C. Preserving exponential mean-square stability in the simulation of hybrid stochastic differential equations. Numer. Math. 2007, 108, 295–325. [Google Scholar] [CrossRef]
  26. Higham, D.J.; Mao, X.; Stuart, A.M. Exponential mean-square stability of numerical solutions to stochastic differential equations. LMS J. Comput. Math. 2003, 6, 297–313. [Google Scholar] [CrossRef]
  27. Higham, D.J. Mean-square and asymptotic stability of the stochastic theta method. SIAM J. Numer. Anal. 2000, 38, 753–769. [Google Scholar] [CrossRef]
  28. Mao, X. Stochastic Differential Equations and Applications; Elsevier: Amsterdam, The Netherlands, 2007. [Google Scholar]
  29. Mao, X. LaSalle-type theorems for stochastic differential delay equations. J. Math. Anal. Appl. 1999, 236, 350–369. [Google Scholar] [CrossRef]
  30. Mao, X. A note on the LaSalle-type theorems for stochastic differential delay equations. J. Math. Anal. Appl. 2002, 268, 125–142. [Google Scholar] [CrossRef]
  31. Rodkina, A.; Schurz, H. Almost sure asymptotic stability of drift-implicit θ-methods for bilinear ordinary stochastic differential equations in R1. J. Comput. Appl. Math. 2005, 180, 13–31. [Google Scholar] [CrossRef]
  32. Wu, F.; Mao, X.; Szpruch, L. Almost sure exponential stability of numerical solutions for stochastic delay differential equations. Numer. Math. 2010, 115, 681–697. [Google Scholar] [CrossRef]
  33. Zhou, S. Almost surely exponential stability of numerical solutions for stochastic pantograph equations. Abstr. Appl. Anal. 2014, 2014, 751209. [Google Scholar] [CrossRef]
  34. Gardoń, A. The order of approximations for solutions of Itô-type stochastic differential equations with jumps. Stoch. Anal. Appl. 2004, 22, 679–699. [Google Scholar] [CrossRef]
  35. Mao, X.; Shen, Y.; Gray, A. Almost sure exponential stability of backward Euler–Maruyama discretizations for hybrid stochastic differential equations. J. Comput. Appl. Math. 2011, 235, 1213–1226. [Google Scholar] [CrossRef] [Green Version]
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Share and Cite

MDPI and ACS Style

Abou-Senna, A.; Tian, B. Almost Sure Exponential Stability of Numerical Solutions for Stochastic Pantograph Differential Equations with Poisson Jumps. Mathematics 2022, 10, 3137. https://doi.org/10.3390/math10173137

AMA Style

Abou-Senna A, Tian B. Almost Sure Exponential Stability of Numerical Solutions for Stochastic Pantograph Differential Equations with Poisson Jumps. Mathematics. 2022; 10(17):3137. https://doi.org/10.3390/math10173137

Chicago/Turabian Style

Abou-Senna, Amr, and Boping Tian. 2022. "Almost Sure Exponential Stability of Numerical Solutions for Stochastic Pantograph Differential Equations with Poisson Jumps" Mathematics 10, no. 17: 3137. https://doi.org/10.3390/math10173137

APA Style

Abou-Senna, A., & Tian, B. (2022). Almost Sure Exponential Stability of Numerical Solutions for Stochastic Pantograph Differential Equations with Poisson Jumps. Mathematics, 10(17), 3137. https://doi.org/10.3390/math10173137

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop