Next Article in Journal
Nash’s Existence Theorem for Non-Compact Strategy Sets
Previous Article in Journal
Cyclic Codes over a Non-Commutative Non-Unital Ring
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Convergence and Almost Sure Polynomial Stability of Partially Truncated Split-Step Theta Method for Stochastic Pantograph Models with Lévy Jumps

1
School of Mathematics, Harbin Institute of Technology, Harbin 150001, China
2
Department of Mathematics, Faculty of Engineering at Shoubra, Benha University, Benha 13511, Egypt
3
Department of Mathematical Sciences, College of Science, Princess Nourah bint Abdulrahman University, P.O. Box 84428, Riyadh 11671, Saudi Arabia
*
Author to whom correspondence should be addressed.
Mathematics 2024, 12(13), 2016; https://doi.org/10.3390/math12132016
Submission received: 24 May 2024 / Revised: 16 June 2024 / Accepted: 19 June 2024 / Published: 28 June 2024

Abstract

:
This paper addresses a stochastic pantograph model with Lévy leaps where non-jump coefficients exceed linearity. The partially truncated split-step theta method is introduced and applied to the proposed model. The finite time  L ϱ ^ ( ϱ ^ 2 )  convergence rate of the numerical scheme is obtained. Furthermore, the almost sure polynomial stability of the numerical scheme is investigated and numerical examples are presented to endorse the addressed theorems.

1. Introduction

Stochastic pantograph models are much more substantial, and they have been harnessed to describe dynamical behaviours with haphazard manners. They are used in many majors such as finance and quantum mechanics [1,2]. Also, the Weiner process is not always the optimal direction for modelling dynamical cases that have sudden changes and bizarre events. In these scenarios, jump models are much more convenient for handling these situations [3,4]. Merton [5] updated the Black–Scholes model [6] by augmenting the Poisson process. In this paper, we want to take into account history data [7,8,9] and also try to apply a more generic and wide jump process, such as a Lévy process [10]. Therefore, we shine light on the stochastic pantograph model with Lévy jumps. Stochastic pantograph models with Lévy jumps can be applied in real-life applications such as financial markets, where the partially truncated split-step theta method can be applied for capturing stock price behaviour, allowing for better pricing and risk management in financial markets. Furthermore, in some financial situations we need to approximate the variance or the higher moment of the solution. In these cases, we need to have the convergence in  L ϱ ^ ( ϱ ^ 2 )  sense. Also, stochastic pantograph models can be employed to study the spread of infectious diseases and to analyse the effectiveness of control strategies, where the applicability of the proposed scheme can be utilized to simulate an epidemic’s progression accurately, capturing the impact of delays and sudden changes in the infection rate, and aiding in designing effective intervention strategies.
Also, it is not always an easy task to figure out the exact solution of stochastic models. Therefore, numerical schemes [11,12,13] are indispensable. Mao [14] addressed the truncated Euler–Maruyama algorithm and studied its convergence rate and stability. In recent years, great attention has been paid to split-step theta methods because of their abilities to possess desirable stability characteristics and rates of convergence [15,16,17,18,19,20,21]. Higham et al. [22] introduced the implicit split-step variant of the Euler–Maruyama technique for stochastic models, where the drift and diffusion coefficients satisfy the one-sided Lipschitz and the global Lipschitz conditions, respectively. Wang and Liu [23] discussed the split-step backward balanced Milstein techniques for stiff Itô stochastic models. Moreover, these attempts were further updated and evolved by Wang and Li [24], who introduced the fully explicit split-step forward techniques for solving Itô stochastic models under the global Lipschitz and linear growth conditions. According to some authors [25,26,27], the split-step theta scheme has the ability of attaining the stability of a system with a free choice of the step size. Furthermore, inclusion of the Euler–Maruyama scheme and split-step backward Euler scheme inside it by adjusting the value of theta to  θ = 0  or  θ = 1 , respectively, can also be considered as an advantage. The split-step backward Euler technique applied to linear stochastic delay models was investigated by Zhang et al. [28]. Cao et al. [29] applied the split-step theta scheme to stochastic delay models and showed that the numerical scheme has an order of convergence of half, and an exponential mean square stability. Bao and Hu [30] focused their research on stochastic variable delay models; they applied the split-step theta scheme to the model and studied its convergence and mean square stability. Wang et al. [23] showed the drifting split-step backward Milstein technique. The split-step Adams–Moulton Milstein technique was discussed by Voss et al. [31]. A multi-step Maruyama technique for stochastic delay models was discussed by Bauckwar et al. [32]. Lu et al. [33] applied a split-step composite theta method to stochastic delay models and studied the convergence and stability of them. The stability of a split-step composite theta technique for stochastic models with non-variable delay was discussed in [34].
To the best of our knowledge, there are not many studies on split-step theta schemes applied to stochastic models that take into consideration history data and are interspersed with the Lévy process where coefficients act super linearly. In this paper, following the approach of the partially truncated technique [35], we address the partially truncated split-step theta algorithm and apply it to our aforementioned model, where coefficients could exceed linearity. Then, we study the convergence rate in  L ϱ ^ ( ϱ ^ 2 )  and the almost sure polynomial stability of the proposed scheme.
The set up of the upcoming parts will be as follows. The model structure, the partially truncated SS θ -method, and its properties will be presented in Section 2. Section 3 addresses the convergence rate. The almost sure polynomial stability of the numerical algorithm will be depicted in Section 4. Section 5 will present some examples. Finally, we will wrap up Section 6 with some conclusions.

2. Partially Truncated Split-Step Theta Method

Let C be a real positive constant changing throughout the analysis and  ϵ  represent the expectation operator. Then, consider the following o-dimensional stochastic model
d s ( g ) = u ( s ( g ) , s ( η g ) ) d g + r ( s ( g ) , s ( η g ) ) d B ( g ) + M w ( s ( g ) , s ( η g ) , m ) J ˜ ( d g , d m ) ,
defined on  0 g G  with  0 < η < 1  and  s ( 0 ) = s 0 . Here,  B ( g )  is d-dimensional Brownian motion and  J ˜ ( d g , d m ) = J ( d g , d m ) π ( d m ) d g  is the compensated Poisson random measure independent of  B ( g )  with Lévy measure  π  defined on set  M R o { 0 }  with  π ( M ) = λ u : R o × R o R o r : R o × R o R o × d  and  w : R o × R o × M R o , o , d N + . It is assumed that the coefficients u and r can be factored as  u ( ι 1 , ι 1 ¯ ) = u 1 ( ι 1 , ι 1 ¯ ) + u ( ι 1 , ι 1 ¯ )  and  r ( ι 1 , ι 1 ¯ ) = r 1 ( ι 1 , ι 1 ¯ ) + r ( ι 1 , ι 1 ¯ ) , where  u 1 , u : R o × R o R o  and  r 1 , r : R o × R o R o × d .
Assumption 1.
There exist constants  p 2 k 2 > 0  and  k 3 > 0 , such that
| Υ ( ι , ι ¯ ) Υ ( ι 2 , ι 2 ¯ ) | 2 k 2 ( | ι 1 ι 2 | 2 + | ι 1 ¯ ι 2 ¯ | 2 ) ,
and
M | w ( ι 1 , ι 1 ¯ , m ) w ( ι 2 , ι 2 ¯ , m ) | p π ( d m ) k 3 ( | ι 1 ι 2 | p + | ι 1 ¯ ι 2 ¯ | p ) ,
for all  ι 1 , ι 2 , ι 1 ¯ , ι 2 ¯ R o m M  and  Υ = u 1  or  r 1 .
Assumption 2
(Khasminiskii-type condition). There exists a constant  ϱ ¯ > 2 , such that
ι , u ( ι , ι ¯ ) + ϱ ¯ 1 2 | r ( ι , ι ¯ ) | 2 C ( 1 + | ι | 2 + | ι ¯ | 2 ) ,
for all  ι , ι ¯ R o .
By utilizing Assumptions 1 and 2, it can be concluded that
ι , u ( ι , ι ¯ ) + ϱ ^ 1 2 | r ( ι , ι ¯ ) | 2 C ( 1 + | ι | 2 + | ι ¯ | 2 ) ,
for all  ι , ι ¯ R o  and  ϱ ^ [ 2 , ϱ ¯ ) . Under Assumptions 1 and 2, there exists a unique solution to Equation (1) (see, e.g., [36,37]). To define the partially truncated split-step theta (PTSS θ ) scheme, we utilize the truncation technique discussed in [14], where we pick up  Δ ( 0 , 1 ] , increasing function  Γ : R + R +  and decreasing function  ε : ( 0 , Δ ] ( 0 , ) , such that
sup | ι | | ι ¯ | r | Φ ( ι , ι ¯ ) | Γ ( r ) , r 1 ,
( Δ 1 / ϱ ¯ Δ 1 / 4 ) ε ( Δ ) 1 , Δ ( 0 , Δ ] ,
where  Φ = u  or  r . Then, our partially truncated coefficients are given by
u Δ ( ι , ι ¯ ) = u ( T Δ ( ι ) , T Δ ( ι ¯ ) ) , r Δ ( ι , ι ¯ ) = r ( T Δ ( ι ) , T Δ ( ι ¯ ) ) ,
where  ι , ι ¯ R o , step size  Δ ( 0 , Δ ] , and  T Δ ( ι ) = ( | ι | Γ 1 ( ε ( Δ ) ) ) ι | ι |  is the truncation mapping from  R o  to the closed ball  { ι R o : | ι | Γ 1 ( ε ( Δ ) ) } .
Lemma 1.
Under Assumption 2,
ι , u Δ ( ι , ι ¯ ) + ϱ ¯ 1 2 | r Δ ( ι , ι ¯ ) | 2 C ( 1 + | ι | 2 + | ι ¯ | 2 ) , ι , ι ¯ R o
Proof. 
The concept of the proof is similar to that discussed in [38]. □
Now, the partially truncated split-step theta (PTSS θ ) scheme applied to Equation (1) is defined by  Q 0 = s 0  and for  n = 0 , 1 ,
v n = Q n + θ Δ u Δ ( v n , v [ η n ] ) ,
Q n + 1 = Q n + Δ u Δ ( v n , v [ η n ] ) + r Δ ( v n , v [ η n ] ) Δ B n + M w ( v n , v [ η n ] , m ) Δ J ˜ ( d m ) ,
where  θ [ 0 , 1 ] [ ι ]  takes the integer part of  ι  and  Q n s ( g n )  at  g n = n Δ Δ B n : = B ( g n + 1 ) B ( g n )  and  Δ J ˜ ( d m ) = J ˜ ( ( 0 , ( n + 1 ) Δ ] , d m ) J ˜ ( ( 0 , n Δ ] , d m )  . Here,
u Δ ( v n , v [ η n ] ) = u 1 ( v n , v [ η n ] ) + u Δ ( v n , v [ η n ] ) ,
r Δ ( v n , v [ η n ] ) = r 1 ( v n , v [ η n ] ) + r Δ ( v n , v [ η n ] ) .
By utilizing Assumptions 1 and 2 and proceeding the same as in [39], it can be concluded that for all  Δ ( 0 , Δ ]  and  ϱ ^ [ 2 , ϱ ¯ ) ,
ι , u Δ ( ι , ι ¯ ) + ϱ ^ 1 2 | r Δ ( ι , ι ¯ ) | 2 C ( 1 + | ι | 2 + | ι ¯ | 2 ) , ι , ι ¯ R o .
For all  t [ g n , g n + 1 )  and  Δ ( 0 , Δ ] , we define continuous time approximation
ϑ Δ ( g ) : = Q n + ( g g n ) u Δ ( v n , v [ η n ] ) + r Δ ( v n , v [ η n ] ) ( B ( g ) B ( g n ) ) + g n g M w ( v n , v [ η n ] , m ) J ˜ ( d g , d m ) ,
and denote  l 1 ( g ) = r ¯ = 0 v r ¯ 1 [ g r ¯ , g r ¯ + 1 ) ( g )  and  l 2 ( g ) = r ¯ = 0 v [ η r ¯ ] 1 [ g r ¯ , g r ¯ + 1 ) ( g ) . Therefore, Equation (12) can be defined in an integral form as follows
ϑ Δ ( g ) = s 0 + 0 g u Δ ( l 1 ( s ) , l 2 ( s ) ) d s + 0 g r Δ ( l 1 ( s ) , l 2 ( s ) ) d B ( s ) + 0 g M w ( l 1 ( s ) , l 2 ( s ) , m ) J ˜ ( d s , d m ) ,

3. Convergence Rate of Partially Truncated Split-Step Theta Method in  L ϱ ^ ( ϱ ^ 2 )

In this section, we address how quickly  s ( g )  and  ϑ Δ ( g )  come close to each other in the presence of non-linear coefficients.
Assumption 3.
s ( g )  and  ϑ ( g )  have  ϱ ^ th moment bounds for  ϱ ^ 2  and up to  ϱ ¯ , i.e., for  ϱ ^ [ 2 , ϱ ¯ )
sup 0 g G ϵ | s ( g ) | ϱ ^ sup 0 < Δ Δ sup 0 g G ϵ | ϑ Δ ( g ) | ϱ ^ C , G > 0 .
Assumption 4.
There exists a constant  m ¯ > 2 , such that
( ι 1 ι 2 ) , ( u ( ι 1 , ι 1 ¯ ) u ( ι 2 , ι 2 ¯ ) ) + m ¯ 1 2 | r ( ι 1 , ι 1 ¯ ) r ( ι 2 , ι 2 ¯ ) | 2 C ( | ι 1 ι 2 | 2 + | ι 1 ¯ ι 2 ¯ | 2 ) ,
for all  ι 1 , ι 2 , ι 1 ¯ , ι 2 ¯ R o .
By utilizing Assumption 3, Chebyshev’s inequality for arbitrary  k R k > | s 0 | , and  Δ ( 0 , Δ ] , we are able to define stopping times  τ k = inf { g 0 : | s ( g ) | k }  and  τ ¯ Δ , k = inf { g 0 : | ϑ Δ ( g ) | k } , such that
P ( τ k G ) C k ϱ ^ and P ( τ ¯ Δ , k G ) C k ϱ ^
Lemma 2.
Let Assumptions 1–4 be satisfied and suppose that  q 2 . Consider  k > | s 0 | Δ ( 0 , Δ ]  to be small s.t.  Γ 1 ( ε ( Δ ) ) k . Then,
ϵ | f Δ ( g τ ) | q C ( ( ε ( Δ ) ) q Δ q / 2 + Δ ) ,
where  f Δ ( g ) = s ( g ) ϑ Δ ( g )  and  τ = τ k τ ¯ Δ , k .
Proof. 
The proof of this lemma can be attained by following the same approach as in [40]. □
Theorem 1.
Suppose that Assumptions 1–4 hold with  ϱ ^ > q 2 . Consider also for small values of  Δ ( 0 , Δ ]
ε ( Δ ) Γ ( [ ( ε ( Δ ) ) q Δ q / 2 ] 1 / ( ϱ ^ q ) ) .
Then,
ϵ | f Δ ( G ) | q C ( ( ε ( Δ ) ) q Δ q / 2 + Δ ) .
Proof. 
By applying the Young inequality [22], for any  ρ > 0  and  q [ 2 , ϱ ^ )  we have
ϵ | f Δ ( G ) | q = ϵ ( | f Δ ( G ) | q 1 { τ > G } ) + ϵ ( | f Δ ( G ) | q 1 { τ G } ) ϵ ( | f Δ ( G ) | q 1 { τ > G } ) + ρ q ϱ ^ ϵ | f Δ ( G ) | ϱ ^ + ϱ ^ q ϱ ^ ρ q ϱ ^ q P ( τ G ) .
By utilizing Assumption 3 and Equation (15), we have
ϵ | f Δ ( G ) | ϱ ^ 2 ϱ ^ 1 ϵ ( | s ( G ) | ϱ ^ + | ϑ Δ ( G ) | ϱ ^ ) C ,
and
P ( τ G ) P ( τ ¯ Δ , k G ) + P ( τ k G ) C k ϱ ^ .
By plugging in (20) and (21) into (19), we obtain
ϵ | f Δ ( G ) | q ϵ | f Δ ( G τ ) | q + C ρ q ϱ ^ + C ( ϱ ^ q ) ϱ ^ k ϱ ^ ρ q ϱ ^ q .
Upon selecting  ρ = ( ε ( Δ ) ) q Δ q / 2 k = ρ 1 / ( ϱ ^ q )  and utilizing condition (17) and Lemma 2, and then substituting in (22), the required assertion (18) is attained. □

4. Stability Analysis of Partially Truncated Split-Step Theta Method

In this section, we will show that the partially truncated SS θ -method can reproduce the almost sure polynomial stability of Equation (1). It will be assumed that
u ( 0 , 0 ) = u 1 ( 0 , 0 ) = r ( 0 , 0 ) = r 1 ( 0 , 0 ) = w ( 0 , 0 , m ) = 0
for all  m M .
Assumption 5.
There exist constants  α [ 0 , ] δ 1 > δ 3 + 2 k 3 0 δ 2 0  and  δ 4 0 , such that
2 ι , u 1 ( ι , ι ¯ ) + ( 1 + α ) | r 1 ( ι , ι ¯ ) | 2 δ 1 | ι | 2 + η δ 2 | ι ¯ | 2 ,
and
2 ι , u ( ι , ι ¯ ) + ( 1 + α 1 ) | r ( ι , ι ¯ ) | 2 δ 3 | ι | 2 + η δ 4 | ι ¯ | 2 ,
For all  ι , ι ¯ R o  and  η ( 0 , 1 ) , where during the following we select  α = 0  and put  α 1 | r ( ι , ι ¯ ) | 2 = 0  when the term  r ( ι , ι ¯ )  does not exist in  r ( ι , ι ¯ ) , while  α =  and we put  α | r ( ι , ι ¯ ) | 2 = 0  when the term  r 1 ( ι , ι ¯ )  does not exist in  r ( ι , ι ¯ ) . By utilizing Assumptions 1 and 5, it can be concluded that
2 ι , u ( ι , ι ¯ ) + | r ( ι , ι ¯ ) | 2 + M | w ( ι , ι ¯ , m ) | 2 π ( d m ) ( δ 1 δ 3 k 3 ) | ι | 2 + ( η ( δ 2 + δ 4 ) + k 3 ) | ι ¯ | 2
Lemma 3. 
Let Assumptions 1 and 5 hold; then, for all  Δ ( 0 , Δ ]
2 ι , u Δ ( ι , ι ¯ ) + | r Δ ( ι , ι ¯ ) | 2 + M | w ( ι , ι ¯ , m ) | 2 π ( d m ) ( δ 1 δ 3 2 k 3 ) | ι | 2 + ( η ( δ 2 + δ 4 ) + 2 k 3 ) | ι ¯ | 2
Proof. 
By utilizing the inequality  | ι + ι ¯ | 2 2 ( | ι | 2 + | ι ¯ | 2 )  (23) and Assumption 1, we have
M | w ( ι , ι ¯ , m ) | 2 π ( d m ) = M | w ( ι , ι ¯ , m ) w ( 0 , 0 , m ) + w ( 0 , 0 , m ) | 2 π ( d m ) 2 M | w ( ι , ι ¯ , m ) w ( 0 , 0 , m ) | 2 π ( d m ) + 2 M | w ( 0 , 0 , m ) | 2 π ( d m ) 2 k 3 ( | ι | 2 + | ι ¯ | 2 ) .
By considering Definitions (9) and (10) and then utilizing Assumption 5 and (23), the required assertion (25) is obtained. □
Lemma 4 
([41]). Suppose that Assumptions 1 and 5 hold. Then, for any  s 0  and  ζ > 0 , the solution  s ( g )  to Equation (1) possesses the property of almost sure polynomial stability, i.e.,
lim sup g log | s ( g ) | log ( 1 + g ) ζ 2 a . s .
Theorem 2. 
Let Assumptions 1 and 5 hold and  θ [ 0 , 1 2 ] . Assume also the existence of a positive constant κ, such that
Δ | u Δ ( ι , ι ¯ ) | 2 κ ( | ι | 2 + | ι ¯ | 2 )
and
δ 1 > δ 3 + 2 k 3 + ( η ( δ 2 + δ 4 ) + 2 k 3 ) ( 1 + [ 1 / η ] ) .
for all a,  b R o , let  ζ  be a unique positive root of following equation
ζ ( 1 + θ Δ ) ( 1 + θ κ ) δ 1 + δ 3 + 2 k 3 + κ ( 1 2 θ ) + ( ζ ( 1 + θ Δ ) θ Δ + η ( δ 2 + δ 4 ) + 2 k 3 + κ ( 1 2 θ ) ) ( 1 + [ 1 / η ] ) η ζ = 0 ,
with κ satisfying
κ < δ 1 δ 3 2 k 3 ( η ( δ 2 + δ 4 ) + 2 k 3 ) ( 1 + [ 1 / η ] ) ( 1 2 θ ) ( 2 + [ 1 / η ] ) .
Then, there exits a constant  Δ ¯ , such that for all  Δ ( 0 , Δ ¯ )  and any initial value  Q 0 , the approximate solution defined by Equation (8) possesses the property of almost sure polynomial stability, i.e.,
lim sup n log | Q n | log ( 1 + n Δ ) ζ 2 a . s .
Proof. 
For  ζ > 0 ,
( 1 + ( n + 1 ) Δ ) ζ | Q n + 1 | 2 ( 1 + n Δ ) ζ | Q n | 2 = ( 1 + ( n + 1 ) Δ ) ζ ( | Q n + 1 | 2 | Q n | 2 ) + ( 1 + ( n + 1 ) Δ ) ζ 1 1 + n Δ 1 + ( n + 1 ) Δ ζ | Q n | 2 .
For  ς > 0  and  ζ 0 , we have  1 ς ζ ζ log ς . Therefore,
1 1 + n Δ 1 + ( n + 1 ) Δ ζ ζ log 1 + ( n + 1 ) Δ 1 + n Δ ζ Δ .
From (8), we have
| Q n + 1 | 2 = | Q n | 2 + 2 ( v n ) , u Δ ( v n , v [ η n ] ) Δ + | r Δ ( v n , v [ η n ] ) | 2 Δ + Δ M | w ( v n , v [ η n ] , m ) | 2 π ( d m ) + ( 1 2 θ ) | u Δ ( v n , v [ η n ] ) | 2 Δ 2 + N n ,
where
N n = | r Δ ( v n , v [ η n ] ) | 2 ( | Δ B n | 2 Δ ) Δ M | w ( v n , v [ η n ] , m ) | 2 π ( d m ) + | g n g n + 1 M w ( v n , v [ η n ] , m ) J ˜ ( d g , d m ) | 2 + 2 Q n + u Δ ( v n , v [ η n ] ) Δ , r Δ ( v n , v [ η n ] ) Δ B n + 2 Q n + u Δ ( v n , v [ η n ] ) Δ , g n g n + 1 M w ( v n , v [ η n ] , u ) J ˜ ( d s , d m ) + 2 r Δ ( v n , v [ η n ] ) Δ B n , g n g n + 1 M w ( v n , v [ η n ] , m ) J ˜ ( d s , d m ) .
Then by plugging (34) and (35) into (33), we obtain
( 1 + ( n + 1 ) Δ ) ζ | Q n + 1 | 2 ( 1 + n Δ ) ζ | Q n | 2 ( 1 + ( n + 1 ) Δ ) ζ ( 1 2 θ ) | u Δ ( v n , v [ η n ] ) | 2 Δ 2 + ( 1 + ( n + 1 ) Δ ) ζ ( 2 ( v n ) , φ Δ ( v n , v [ η n ] ) Δ + | r Δ ( v n , v [ η n ] ) | 2 Δ + Δ M | w ( v n , v [ η n ] , m ) | 2 π ( d m ) ) + ( 1 + ( n + 1 ) Δ ) ζ N n + ( 1 + ( n + 1 ) Δ ) ζ ζ Δ | Q n | 2 .
By utilizing (7) and (28), we obtain
| Q n | 2 ( 1 + θ Δ ) | v n | 2 + ( 1 + θ Δ ) θ Δ | u Δ ( v n , v [ η n ] ) | 2 ( 1 + θ Δ ) ( 1 + θ κ ) | v n | 2 + ( 1 + θ Δ ) θ κ | v [ η n ] | 2 .
Then by applying Lemma 3 and substituting with (38) into (37), we obtain
( 1 + ( n + 1 ) Δ ) ζ | Q n + 1 | 2 ( 1 + n Δ ) ζ | Q n | 2 ( 1 + ( n + 1 ) Δ ) ζ ( A 1 ( ζ , Δ ) Δ | v n | 2 + A 2 ( ζ , Δ ) Δ | v [ η n ] | 2 + N n ) ,
where
A 1 ( ζ , Δ ) = ζ ( 1 + θ Δ ) ( 1 + θ κ ) δ 1 + δ 3 + 2 k 3 + κ ( 1 2 θ ) ,
and
A 2 ( ζ , Δ ) = ζ ( 1 + θ Δ ) θ κ + η ( δ 2 + δ 4 ) + 2 k 3 + κ ( 1 2 θ ) .
Taking the summation from  j = 0  to  j = n 1  to both sides of (39) yields
( 1 + n Δ ) ζ | Q n | 2 | Q 0 | 2 + A 1 ( ζ , Δ ) Δ j = 0 n 1 ( 1 + ( j + 1 ) Δ ) ζ | v j | 2 + A 2 ( ζ , Δ ) Δ j = 0 n 1 ( 1 + ( j + 1 ) Δ ) ζ | v [ η j ] | 2 + j = 0 n 1 ( 1 + ( j + 1 ) Δ ) ζ N j .
Also,
j = 0 n 1 ( 1 + ( j + 1 ) Δ ) ζ | v [ η j ] | 2 = | v 0 | 2 0 j n 1 : [ η j ] = 0 ( 1 + ( j + 1 ) Δ ) ζ + | v 1 | 2 0 j n 1 : [ η j ] = 1 ( 1 + ( j + 1 ) Δ ) ζ + + | v [ η ( n 1 ) ] | 2 0 j n 1 : [ η j ] = [ η ( n 1 ) ] ( 1 + ( j + 1 ) Δ ) ζ .
By following the same approach as in [42] and noting that for any  l { 0 , 1 , , [ η ( n 1 ) ] } , [ η j ] = l l j < l + 1 , it is deduced that the maximum number of  j { 0 , 1 , , n 1 }  satisfying  [ η j ] = l  is  1 + [ 1 / η ] . Then, by assuming that  Δ ( 0 , Δ 0 ) Δ 0 = 1 / η 1 , we have
j = 0 n 1 ( 1 + ( j + 1 ) Δ ) ζ | v [ η j ] | 2 ( 1 + [ 1 / η ] ) η ζ ( j = 0 n 1 ( 1 + ( j + 1 ) Δ ) ζ | v j | 2 j = [ η ( n 1 ) ] + 1 n 1 ( 1 + ( j + 1 ) Δ ) ζ | v j | 2 ) .
By plugging in (42) into (40), we obtain
( 1 + n Δ ) ζ | Q n | 2 + A 2 ( ζ , Δ ) ( 1 + [ 1 / η ] ) η ζ Δ j = [ η ( n 1 ) ] + 1 n 1 ( 1 + ( j + 1 ) Δ ) ζ | v j | 2 | Q 0 | 2 + j = 0 n 1 ( 1 + ( j + 1 ) Δ ) ζ N j + B ( ζ , Δ ) Δ j = 0 n 1 ( 1 + ( j + 1 ) Δ ) ζ | v j | 2 ,
where
B ( ζ , Δ ) = A 1 ( ζ , Δ ) + A 2 ( ζ , Δ ) ( 1 + [ 1 / η ] ) η ζ .
Then, for any  η ( 0 , 1 ) ζ 0  and  Δ ( 0 , Δ 0 ] ; it is noticeable that  d d ζ B ( ζ , Δ ) > 0 , and recalling (31), we have  B ( 0 , Δ ) < 0 . Therefore, there exists a unique  ζ > 0 , such that  B ( ζ , Δ ) = 0 , and this leads to
lim sup n ( 1 + n Δ ) ζ | Q n | 2 lim sup n ( 1 + n Δ ) ζ | Q n | 2 + A 2 ( ζ , Δ ) ( 1 + [ 1 / η ] ) η ζ Δ j = [ η ( n 1 ) ] + 1 n 1 ( 1 + ( j + 1 ) Δ ) ζ | v j | 2 D n ,
where  D n = | Q 0 | 2 + j = 0 n 1 ( 1 + ( j + 1 ) Δ ) ζ N j . By applying the discrete semi-martingale convergence theorem [43], we obtain for any initial data  υ 0 lim sup n D n < a . s . , which yields
lim sup n log ( ( 1 + n Δ ) ζ | Q n | 2 ) log ( 1 + n Δ ) lim sup n log D n log ( 1 + n Δ ) = 0 .
Therefore,
lim sup n log | Q n | ( 1 + n Δ ) ζ 2 a . s . ,
which implies the required assertion (32). The proof is complete. □
Theorem 3. 
Let Assumptions 1 and 5 hold and  θ ( 1 2 , 1 ] . Let  ζ  be a positive root of the following equation
δ 1 δ 3 2 k 3 ( η ( δ 2 + δ 4 ) + 2 k 3 ) ( 1 + [ 1 / η ] ) η ζ ( 2 θ 1 ) ζ ( 2 θ 1 ) θ 2 ζ Δ = 0
and assume that
δ 1 > δ 3 + 2 k 3 + ( η ( δ 2 + δ 4 ) + 2 k 3 ) ( 1 + [ 1 / η ] ) .
Then, for any step size  Δ > 0  and initial data  Q 0 , the approximate solution defined by Equation (8) possesses the property of almost sure polynomial stability, i.e.,
lim sup n log | Q n | log ( 1 + n Δ ) ζ 2 a . s .
Proof. 
It is noted that from Equation (7)
Δ u Δ ( v n , v [ η n ] ) = 1 θ ( v n Q n ) .
By utilizing Lemma 3 and (51), we can rewrite (8) as follows
| Q n + 1 | 2 ( 1 + 1 2 θ θ 2 ) | Q n | 2 ( 2 θ 1 θ 2 + ( δ 1 δ 3 2 k 3 ) Δ ) | v n | 2 + ( η ( δ 2 + δ 4 ) + 2 k 3 ) Δ | v [ η n ] | 2 + 2 θ 1 θ 2 2 Q n , v n + N n ,
where  N n  is the same as defined before. By utilizing (33) and (34), we have for any constant  ζ > 0
( 1 + ( n + 1 ) Δ ) ζ | Q n + 1 | 2 ( 1 + n Δ ) ζ | Q n | 2 ( 1 + ( n + 1 ) Δ ) ζ { ( 1 2 θ θ 2 + ζ Δ ) | Q n | 2 ( 2 θ 1 θ 2 + ( δ 1 δ 3 2 k 3 ) Δ ) | v n | 2 + ( η ( δ 2 + δ 4 ) + 2 k 3 ) Δ | v [ η n ] | 2 + 2 θ 1 θ 2 2 Q n , v n + N n } .
By summing up the above inequality (53) from  j = 0  to  j = n 1  and proceeding the same as it was done to get inequality (43) from inequality (40), we can obtain the following
( 1 + n Δ ) ζ | Q n | 2 | Y 0 | 2 + ( 1 2 θ θ 2 + ζ Δ ) j = 0 n 1 ( 1 + ( j + 1 ) Δ ) ζ | Q j | 2 ( 2 θ 1 θ 2 + ( δ 1 δ 3 2 k 3 ( η ( δ 2 + δ 4 ) + 2 k 3 ) ( 1 + [ 1 / η ] ) η ζ ) Δ ) j = 0 n 1 ( 1 + ( j + 1 ) Δ ) ζ | v j | 2 ( η ( δ 2 + δ 4 ) + 2 k 3 ) ( 1 + [ 1 / η ] ) η ζ Δ j = [ η ( n 1 ) ] + 1 n 1 ( 1 + ( j + 1 ) Δ ) ζ | v j | 2 + 2 θ 1 θ 2 j = 0 n 1 ( 1 + ( j + 1 ) Δ ) ζ 2 Q j , v j + j = 0 n 1 ( 1 + ( j + 1 ) Δ ) ζ N j .
Then by choosing  ζ ¯ > 0  small enough to achieve  1 2 θ θ 2 + ζ ¯ Δ < 0 , it can be concluded that, for any  ζ ( 0 , ζ ¯ )
H ( ζ ) : = 2 θ 1 θ 2 ζ Δ > 0 .
It is also noted that
2 θ 1 θ 2 2 Q j , v j 2 θ 1 θ 2 { θ 2 H ( ζ ) 2 θ 1 | Q j | 2 + 2 θ 1 θ 2 H ( ζ ) | v j | 2 } = H ( ζ ) | Q j | 2 + ( 2 θ 1 ) 2 θ 4 H ( ζ ) | v j | 2
and
1 Δ ( 2 θ 1 θ 2 ( 2 θ 1 ) 2 θ 4 H ( ζ ) ) = ( 2 θ 1 ) ζ ( 2 θ 1 ) θ 2 ζ Δ .
Therefore, by utilizing (56) and (57), inequality (54) can be rewritten as
( 1 + n Δ ) ζ | Q n | 2 | Q 0 | 2 + j = 0 n 1 ( 1 + ( j + 1 ) Δ ) ζ N j + ϕ ( ζ , Δ ) Δ j = 0 n 1 ( 1 + ( j + 1 ) Δ ) ζ | v j | 2 ,
where
ϕ ( ζ , Δ ) = ( δ 1 δ 3 2 k 3 ( η ( δ 2 + δ 4 ) + 2 k 3 ) ( 1 + [ 1 / η ] ) η ζ ) + ( 2 θ 1 ) ζ ( 2 θ 1 ) θ 2 ζ Δ .
From (59), we have  ϕ ( 0 , Δ ) < 0 . It is also noted that  d d ζ ϕ ( ζ , Δ ) > 0 . So, there exists a unique constant  ζ > 0  satisfying  ϕ ( ζ , Δ ) = 0 , and this yields  lim sup n ( 1 + n Δ ) ζ | Q n | 2 lim sup n C n , where  C n = | Q 0 | 2 + j = 0 n 1 ( 1 + ( j + 1 ) Δ ) ζ N j . Then, by applying the discrete semi-martingale convergence theorem and proceeding the same as we did before in Theorem 2, the required assertion (50) will be attained. □

5. Numerical Examples

In this section, we will present numerical examples to illustrate the theoretical results discussed. All of the upcoming computations were performed using Python 3.7. To manifest the computational merits of the partially truncated split-step theta (PTSST) method, we will present a comparison with the truncated Euler–Maruyama (TEM) method [13]
Q n + 1 = Q n + Δ u Δ ( Q n , Q [ η n ] ) + r Δ ( Q n , Q [ η n ] ) Δ B n + M w ( Q n , Q [ η n ] , m ) Δ J ˜ ( d m ) ,
where  f Δ ( ι , ι ¯ ) = f ( ( | ι | Γ 1 ( ε ( Δ ) ) ) ι | ι | , | ι ¯ | Γ 1 ( ε ( Δ ) ) ) ι ¯ | ι ¯ | )  for  f = u  or r.
The tamed explicit (TE) method [44] is defined by
Q n + 1 = Q n + Δ u ( Q n , Q [ η n ] ) 1 + Δ | u ( Q n , Q [ η n ] ) | + r ( Q n , Q [ η n ] ) Δ B n + M w ( Q n , Q [ η n ] , m ) Δ J ˜ ( d m ) ,
and the split-step backward Euler (SSBE) method [45] is given by
v n = Q n + Δ u ( v n , v [ η n ] ) ,
Q n + 1 = Q n + Δ u ( v n , v [ η n ] ) + r ( v n , v [ η n ] ) Δ B n + M w ( v n , v [ η n ] , m ) Δ J ˜ ( d m ) .
Also, discrete Brownian paths are generated over interval  [ 0 , 1 ]  with step size  d t = 2 13 , and for step sizes  Δ = 2 q + 1 d t , where  ( 4 q 7 ) , 2000 sample paths are used to simulate the numerical solution. For the ith sample path, let the exact solution be represented by  Q ( g n , ω i )  at time  g = g n , and let  Q n ( ω i )  represent numerical approximation of the numerical method at the nth step. Let  ϵ  represent the error in the pth moment, and, by the law of large numbers, the error in the  ϱ ^ -th moments at final time  g = G  will be
ϵ ( G ) 1 2000 i = 0 2000 | Q ( G , ω i ) Q N ( ω i ) | ϱ ^
Example 1. Consider the following stochastic pantograph model with jumps of the form
d s ( g ) = ( 3 s ( g ) 2 s 5 ( g ) s ( 0.5 g ) ) d g + ( s 2 ( g ) + s ( g ) sin 2 ( s ( 0.5 g ) ) ) d B ( g ) + M ( s ( g ) + s ( η g ) m J ˜ ( d g , d m ) ,
with  s 0 = 1  and  π ( d m ) d g = λ f ( m ) d m d t , where  λ = 2 ,
f ( m ) = 1 2 π m e ( ln m ) 2 2 , 0 m < .
It can be deduced that  u 1 ( s ( g ) , s ( 0.5 g ) ) = 3 s ( g ) s ( 0.5 g ) u ( s ( g ) , s ( 0.5 g ) ) = 2 s 5 ( g ) r 1 ( s ( g ) , s ( 0.5 g ) ) = 0 r ( s ( g ) , s ( 0.5 g ) ) = s 2 ( g ) + s ( g ) sin 2 ( s ( 0.5 g ) ) , and  w ( s ( g ) , s ( 0.5 g ) , u ) = ( s ( g ) + s ( 0.5 g ) ) u . Then, Assumption 1 is satisfied. For Assumption 4,
( ι 1 ι 2 ) ( u ( ι 1 , ι ¯ 1 ) u ( ι 2 , ι ¯ 2 ) ) + m ¯ 1 2 | r ( ι 1 , ι ¯ 1 ) r ( ι 2 , ι ¯ 2 ) | 2 = ( ι 1 ι 2 ) ( 2 ( ι 1 5 ι 2 5 ) ) + m ¯ 1 2 | ι 1 2 + ι 1 sin 2 ι ¯ 1 ι 2 2 ι 2 sin 2 ι ¯ 2 | 2 ( ι 1 ι 2 ) ( 2 ( ι 1 ι 2 ) ( ι 1 4 + ι 1 3 ι 2 + ι 1 2 ι 2 2 + ι 1 ι 2 3 + ι 2 4 ) ) + ( m ¯ 1 ) ( | ι 1 2 ι 2 2 | 2 + | ( ι 1 ι 2 ) sin 2 ι ¯ 1 + ι 2 ( sin 2 ι ¯ 1 sin 2 ι ¯ 2 ) | 2 ) .
Note that
( ι 1 3 ι 2 + ι 1 2 ι 2 2 + ι 1 ι 2 3 ) 0.5 ( ι 1 4 + ι 2 4 )
Then,
( ι 1 ι 2 ) ( u ( ι 1 , ι ¯ 1 ) u ( ι 2 , ι ¯ 2 ) ) + m ¯ 1 2 | r ( ι 1 , ι ¯ 1 ) r ( ι 2 , ι ¯ 2 ) | 2 [ ( ι 1 4 + ι 2 4 ) + 2 ( m ¯ 1 ) ( ι 1 2 + ι 2 2 ) + ( m ¯ 1 ) ( 1 + ι 1 2 + ι 2 2 ) ] × ( | ι 1 ι 2 | 2 + | ι ¯ 1 ι ¯ 2 | 2 ) [ 1 4 + 6 ( m ¯ 1 ) 2 ] ( | ι 1 ι 2 | 2 + | ι ¯ 1 ι ¯ 2 | 2 ) .
Therefore, Assumption 4 is satisfied for any value of  m ¯ . Furthermore,
ι , u ( ι , ι ¯ ) + ϱ ¯ 1 2 | r ( ι , ι ¯ ) | 2 = 2 ι 6 + ϱ ¯ 1 2 | ι 2 + ι sin 2 ι ¯ | 2 2 ι 6 + ( ϱ ¯ 1 ) ( | ι | 4 + | ι | 2 ) 2 ι 2 [ ( ι 2 ϱ ¯ 1 4 ) 2 ( ϱ ¯ 1 4 ) 2 ] + ( ϱ ¯ 1 ) | ι | 2 9 8 ( ϱ ¯ 1 ) 2 ( 1 + | ι | 2 + | ι ¯ | 2 ) .
Hence, Assumption 2 is hold for any  ϱ ¯ . Also,
sup | ι | | ι ¯ | b ( | u ( ι , ι ¯ ) | | r ( ι , ι ¯ ) | ) 2 b 5 , b 1 .
Therefore, we can select  Γ ( b ) = 2 ( b ) 5  and  ε ( Δ ) = Δ 1 / 10 , such that with these selected functions  Γ  and  ε , the partially truncated split-step theta (PTSS θ ) method (8) can be applied to obtain the numerical solution of Equation (64). Because it is difficult to obtain the analytical solution of Equation (64), it is needed to solve Equation (64) by using the partially truncated split-step theta (PTSS θ ) method with a sufficiently small step size  ( d t = 2 13 )  and to identify its output as the exact solution for the error comparison. The mean square errors of the partially truncated split-step theta (PTSS θ ) method are calculated at the final time  G = 1  with  θ = 0 0.5 , and 1. Figure 1 depicts the plot of the mean square errors against  Δ  on a log–log scale and, as a reference, a dashed line of slope  1 / 2  is added. The convergence rate is approximately one half. Furthermore, the numerical approximations (60), (61), and (63) have been applied to Equation (64), and the mean square errors of these approximations at the final time  G = 1  have been calculated and listed in Table 1, where the exact solutions are taken as the corresponding numerical schemes with small step sizes  ( d t = 2 13 ) . From Table 1, it can be seen that the partially truncated split-step theta (PTSS θ ) method with  θ = 0.4 0.6 , and  0.8  has a higher accuracy and less mean square error than the other schemes. Also, when the step size decreases, the mean square error decreases and the value of the mean square error changes with different selections of  θ .
Example 2. Consider the following stochastic Lévy jump model of the form
d s ( g ) = ( 7 s ( g ) s 3 ( g ) s 5 ( g ) ) d g + s ( g ) cos 2 ( s ( 0.25 g ) ) d B ( t ) + M ( 0.5 s ( g ) + 0.1 s ( 0.25 g ) ) u J ˜ ( d g , d m ) ,
with  s 0 = 1  and  π ( d m ) d g = λ f ( u ) d m d t  where  λ = 2 ,
f ( m ) = 1 2 π e m 2 2 , < m < .
It can be deduced that  u 1 ( s ( g ) , s ( 0.25 g ) ) = 7 s ( g ) u ( s ( g ) , s ( 0.25 g ) ) = s 3 ( g ) s 5 ( g ) r 1 ( s ( g ) , s ( 0.25 g ) ) = 0 r ( s ( g ) , s ( 0.25 g ) ) = s ( g ) cos 2 ( s ( 0.25 g ) ) , and  w ( s ( g ) , s ( 0.25 g ) , m ) = ( 0.5 s ( g ) + 0.1 s ( 0.25 g ) ) m . Because of the absence of  r 1 ( ι , ι ¯ ) , we select  α = . Then,
2 ι , u 1 ( ι , ι ¯ ) + ( 1 + α ) | r 1 ( ι , ι ¯ ) | 2 = 14 | ι | 2 ,
2 ι , u ( ι , ι ¯ ) + ( 1 + α 1 ) | r ( ι , ι ¯ ) | 2 = 2 ι 6 2 ι 4 + | ι cos 2 ι ¯ | 2 2 ι 2 [ ( ι 2 + 1 2 ) 2 1 4 ] + | ι | 2 2 ι 2 ( ι 2 + 1 2 ) 2 + 3 2 | ι | 2 3 2 | ι | 2
and
M | w ( ι , ι ¯ , m ) | 2 π ( d m ) = λ M | 0.5 ι + 0.1 ι ¯ | 2 m 2 f ( m ) d m | ι | 2 + | ι ¯ | 2 .
Therefore, inequality (24) is satisfied with  δ 1 = 14 δ 3 = 3 / 2 δ 2 = δ 4 = 0 , and  k 3 = 1 . By Lemma 4, the solution of Equation (66) possesses the property of almost sure polynomial stability. Then, we select  Γ ( b ) = b 5  and  ε ( Δ ) = Δ 1 / 4  to define the numerical solution of Equation (66) by using the partially truncated split-step theta (PTSS θ ) method (8). Moreover, the conditions of Theorem 2 are satisfied. Therefore, it can be concluded that for any  κ ( 0 , 7 4 ( 1 2 θ ) ) , there exits a constant  Δ ¯ , such that for every  Δ ( 0 , Δ ¯ )  and any initial value  s 0 , the partially truncated split-step theta (PTSS θ ) method applied to Equation (66) has almost sure polynomial stability when selecting  θ [ 0 , 1 / 2 ] . To manifest the almost sure polynomial stability of the numerical solution of (66), several trajectories of the partially truncated split-step theta (PTSS θ )-solutions are generated and plotted in Figure 2. It is obvious that the numerical solutions possess the property of almost sure polynomial stability.
Example 3. Consider the following stochastic pantograph model with Lévy jumps of the form
d s ( g ) = ( 8 s ( g ) s 3 ( g ) + s ( 0.9 g ) 2 + 2 s 2 ( 0.9 g ) ) d g + s ( g ) sin 2 ( s ( 0.9 g ) ) d B ( g ) + M 0.1 ( s ( g ) + s ( 0.9 g ) ) u J ˜ ( d g , d m ) ,
with  s 0 = 1 , and the compensator is also the same as in Example 1 with  λ = 5 . By proceeding the same as previously, it can be deduced that  u 1 ( s ( g ) , s ( 0.9 g ) ) = 8 s ( g ) u ( s ( g ) , s ( 0.9 g ) ) = s 3 ( g ) + s ( 0.9 g ) 1 + s 2 ( 0.9 g ) r 1 ( s ( g ) , s ( 0.9 g ) ) = 0 r ( s ( g ) , s ( 0.9 g ) ) = s ( g ) sin 2 ( s ( 0.9 g ) ) , and  w ( s ( g ) , s ( 0.9 g ) , m ) = 0.1 ( s ( g ) + s ( 0.9 g ) ) m . Because of the absence of  r 1 ( ι , ι ¯ ) , we select  α = . Then,
2 ι , u 1 ( ι , ι ¯ ) + ( 1 + α ) | r 1 ( ι , ι ¯ ) | 2 = 16 | ι | 2 ,
2 ι , u ( ι , ι ¯ ) + ( 1 + α 1 ) | r ( ι , ι ¯ ) | 2 = 2 ι 4 + ι ι ¯ 1 + ι ¯ 2 + | ι sin 2 ι ¯ | 2 2 ι 4 + ι ι ¯ + | ι | 2 3 2 | ι | 2 + 1 2 | ι ¯ | 2
and
M | w ( ι , ι ¯ , m ) | 2 π ( d m ) = λ M | 0.1 ι + 0.1 ι ¯ | 2 m 2 f ( m ) d m 0.1 e 2 ( | ι | 2 + | ι ¯ | 2 ) .
Therefore, inequality (24) is satisfied with  δ 1 = 16 δ 3 = 3 / 2 δ 2 = 0 δ 4 = 0.5 , and  k 3 = 0.1 e 2 . By Lemma 4, the solution of (67) possesses the property of almost sure polynomial stability. Then, we select  Γ ( b ) = b 5  and  ε ( Δ ) = Δ 1 / 4  to define the numerical solution of Equation (67) by using the partially truncated split-step theta (PTSS θ ) method (8). Moreover, the conditions of Theorem 3 are satisfied. Therefore the partially truncated split-step theta method applied to Equation (67) has almost sure polynomial stability when selecting  θ ( 1 / 2 , 1 ] . Figure 3 displays several trajectories of the partially truncated split-step theta (PTSS θ ) solutions (67), and it is clear that the numerical approximations have almost sure polynomial stability.

6. Conclusions

In this paper, the stochastic pantograph model with Lévy jumps is presented and the partially truncated split-step theta method is applied to it. The finite time  L ϱ ^ ( ϱ ^ 2 )  convergence rate was obtained, under both drift and diffusion coefficients, satisfying the super-linear growth condition while the jump coefficient grows linearly, and it was close to half. By setting theta equal to zero, the proposed scheme can be viewed as the partially truncated Euler–Maruyama method, which indicates that our results are more general. By utilizing the discrete semi-martingale convergence theorem, the numerical scheme reproduced the almost sure polynomial stability of the exact solution. The conditions imposed on the numerical scheme to reproduce the almost sure polynomial stability were sufficient, but not necessary. Therefore, our future work will focus on finding out the sufficient and necessary conditions. Other interesting topics would be to study the convergence rate with all coefficients growing super-linearly and trying to improve the convergence order of the proposed scheme.

Author Contributions

Conceptualization, A.A., G.A. and B.T.; Formal analysis, A.A., G.A. and B.T.; Supervision, B.T.; Validation, A.A., G.A. and B.T.; Visualization, A.A., G.A. and B.T.; Writing—original draft, A.A.; Writing—review and editing, A.A., G.A. and B.T.; Investigation, A.A., G.A. and B.T.; Methodology, A.A., G.A. and B.T.; Funding acquisition, G.A. All authors have read and agreed to the published version of the manuscript.

Funding

This research was funded by Princess Nourah bint Abdulrahman University Researchers Supporting Project number (PNURSP2024R45), Princess Nourah bint Abdulrahman University, Riyadh, Saudi Arabia.

Data Availability Statement

Data are contained within the article.

Acknowledgments

Princess Nourah bint Abdulrahman University Researchers Supporting Project number (PNURSP2024R45), Princess Nourah bint Abdulrahman University, Riyadh, Saudi Arabia.

Conflicts of Interest

There are no competing interests.

References

  1. 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]
  2. Ockendon, J.R.; Tayler, A.B. The dynamics of a current collection system for an electric locomotive. Proc. R. Soc. Lond. A Math. Phys. Sci. 1971, 322, 447–468. [Google Scholar]
  3. Kou, S.G. A jump-diffusion model for option pricing. Manag. Sci. 2002, 48, 1086–1101. [Google Scholar] [CrossRef]
  4. Svishchuk, A.; Kalemanova, A. The stochastic stability of interest rates with jump changes. Theory Probab. Math. Stat. 2000, 61, 161–172. [Google Scholar]
  5. Merton, R.C. Option pricing when underlying stock returns are discontinuous. J. Financ. Econ. 1976, 3, 125–144. [Google Scholar] [CrossRef]
  6. Black, F.; Scholes, M. The pricing of options and corporate liabilities. J. Political Econ. 1973, 81, 637–654. [Google Scholar] [CrossRef]
  7. 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]
  8. Hobson, D.G.; Rogers, L.C. Complete models with stochastic volatility. Math. Financ. 1998, 8, 27–48. [Google Scholar] [CrossRef]
  9. 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]
  10. Tankov, P. Financial Modelling with Jump Processes; Chapman and Hall/CRC: Boca Raton, FL, USA, 2003. [Google Scholar]
  11. He, L.; Banihashemi, S.; Jafari, H.; Babaei, A. Numerical treatment of a fractional order system of nonlinear stochastic delay differential equations using a computational scheme. Chaos Solitons Fractals 2021, 149, 111018. [Google Scholar] [CrossRef]
  12. Haghighi, A.; Rößler, A. Split-step double balanced approximation methods for stiff stochastic differential equations. Int. J. Comput. Math. 2019, 96, 1030–1047. [Google Scholar] [CrossRef]
  13. Geng, Y.; Song, M.; Liu, M. The convergence of truncated Euler-Maruyama method for stochastic differential equations with piecewise continuous arguments under generalized one-sided Lipschitz condition. J. Comput. Math. 2023, 41, 647–666. [Google Scholar] [CrossRef]
  14. Mao, X. Convergence rates of the truncated Euler–Maruyama method for stochastic differential equations. J. Comput. Appl. Math. 2016, 296, 362–375. [Google Scholar] [CrossRef]
  15. Huang, C. Mean square stability and dissipativity of two classes of theta methods for systems of stochastic delay differential equations. J. Comput. Appl. Math. 2014, 259, 77–86. [Google Scholar] [CrossRef]
  16. Liu, L.; Mo, H.; Deng, F. Split-step theta method for stochastic delay integro-differential equations with mean square exponential stability. Appl. Math. Comput. 2019, 353, 320–328. [Google Scholar] [CrossRef]
  17. Liu, L.; Deng, F.; Qu, B.; Fang, J. Stability analysis of split-step theta method for neutral stochastic delayed neural networks. J. Comput. Appl. Math. 2022, 417, 114536. [Google Scholar] [CrossRef]
  18. Rathinasamy, A.; Mayavel, P. The balanced split step theta approximations of stochastic neutral Hopfield neural networks with time delay and Poisson jumps. Appl. Math. Comput. 2023, 455, 128129. [Google Scholar] [CrossRef]
  19. Yang, X.; Yang, Z.; Zhang, C. Numerical Analysis of Split-Step Backward Euler Method with Truncated Wiener Process for a Stochastic Susceptible-Infected-Susceptible Model. J. Comput. Biol. J. Comput. Mol. Cell Biol. 2023, 30, 1098–1111. [Google Scholar] [CrossRef]
  20. Wu, D.; Li, Z.; Xu, L.; Peng, C. Mean square stability of the split-step theta method for non-linear time-changed stochastic differential equations. Appl. Anal. 2023, 103, 1733–1750. [Google Scholar] [CrossRef]
  21. Wu, X.; Gan, S. Convergence Rates of Split-Step Theta Methods for SDEs with Non-Globally Lipschitz Diffusion Coefficients. East Asian J. Appl. Math. 2023, 180, 16–32. [Google Scholar] [CrossRef]
  22. Higham, D.J.; Mao, X.; Stuart, A.M. Strong convergence of Euler-type methods for nonlinear stochastic differential equations. SIAM J. Numer. Anal. 2002, 40, 1041–1063. [Google Scholar] [CrossRef]
  23. Wang, P.; Liu, Z. Split-step backward balanced Milstein methods for stiff stochastic systems. Appl. Numer. Math. 2009, 59, 1198–1213. [Google Scholar] [CrossRef]
  24. Wang, P.; Li, Y. Split-step forward methods for stochastic differential equations. J. Comput. Appl. Math. 2010, 233, 2641–2651. [Google Scholar] [CrossRef]
  25. Liu, L.; Zhu, Q. Mean square stability of two classes of theta method for neutral stochastic differential delay equations. J. Comput. Appl. Math. 2016, 305, 55–67. [Google Scholar] [CrossRef]
  26. Wang, X.; Gan, S. The improved split-step backward Euler method for stochastic differential delay equations. Int. J. Comput. Math. 2011, 88, 2359–2378. [Google Scholar] [CrossRef]
  27. Zong, X.; Wu, F.; Huang, C. Exponential mean square stability of the theta approximations for neutral stochastic differential delay equations. J. Comput. Appl. Math. 2015, 286, 172–185. [Google Scholar] [CrossRef]
  28. Zhang, H.; Gan, S.; Hu, L. The split-step backward Euler method for linear stochastic delay differential equations. J. Comput. Appl. Math. 2009, 225, 558–568. [Google Scholar] [CrossRef]
  29. Cao, W.; Hao, P.; Zhang, Z. Split-step θ-method for stochastic delay differential equations. Appl. Numer. Math. 2014, 76, 19–33. [Google Scholar] [CrossRef]
  30. Bao, X.; Hu, L. Convergence and stability of split-step θ methods for stochastic variable delay differential equations. Int. J. Comput. Math. 2023, 100, 1171–1192. [Google Scholar] [CrossRef]
  31. Voss, D.A.; Khaliq, A.Q.M. Split-step Adams–Moulton Milstein methods for systems of stiff stochastic differential equations. Int. J. Comput. Math. 2015, 92, 995–1011. [Google Scholar] [CrossRef]
  32. Buckwar, E.; Winkler, R. Multi-Step Maruyama Methods for Stochastic Delay Differential Equations. Stoch. Anal. Appl. 2007, 25, 933–959. [Google Scholar] [CrossRef]
  33. Lu, Y.; Zhang, H.; Hong, S. Convergence and stability of the split-step composite theta-Milstein method for stochastic delay differential equations. Int. J. Dyn. Control 2023, 12, 1302–1313. [Google Scholar] [CrossRef]
  34. Zhang, Y.; Zhang, E.; Li, L. The Improved Stability Analysis of Numerical Method for Stochastic Delay Differential Equations. Mathematics 2022, 10, 3366. [Google Scholar] [CrossRef]
  35. Guo, Q.; Liu, W.; Mao, X.; Yue, R. The partially truncated Euler–Maruyama method and its stability and boundedness. Appl. Numer. Math. 2017, 115, 235–251. [Google Scholar] [CrossRef]
  36. Mao, W.; Hu, L.; Mao, X. The existence and asymptotic estimations of solutions to stochastic pantograph equations with diffusion and Lévy jumps. Appl. Math. Comput. 2015, 268, 883–896. [Google Scholar] [CrossRef]
  37. Nane, E.; Ni, Y. Stability of stochastic differential equation driven by time-changed L∖’evy noise. arXiv 2016, arXiv:1604.07382. [Google Scholar]
  38. Haghighi, A. A modified split-step truncated Euler-Maruyama method for SDEs with non-globally Lipschitz continuous coefficients. Comput. Methods Differ. Equ. 2023, 11, 522–534. [Google Scholar]
  39. Zhan, W.; Gao, Y.; Guo, Q.; Yao, X. The partially truncated Euler–Maruyama method for nonlinear pantograph stochastic differential equations. Appl. Math. Comput. 2019, 346, 109–126. [Google Scholar] [CrossRef]
  40. Abou-Senna, A.; AlNemer, G.; Zhou, Y.; Tian, B. Convergence Rate of the Diffused Split-Step Truncated Euler–Maruyama Method for Stochastic Pantograph Models with Lévy Leaps. Fractal Fract. 2023, 7, 861. [Google Scholar] [CrossRef]
  41. Zhang, T.; Gao, C. Stability with general decay rate of hybrid neutral stochastic pantograph differential equations driven by Lévy noise. Discret. Contin. Dyn. Syst. B 2022, 27, 3725–3747. [Google Scholar] [CrossRef]
  42. Guo, P.; Li, C.J. Almost sure exponential stability of numerical solutions for stochastic pantograph differential equations. J. Math. Anal. Appl. 2018, 460, 411–424. [Google Scholar] [CrossRef]
  43. Mao, X.; Yuan, C. Stochastic Differential Equations with Markovian Switching; Imperial College Press: London, UK, 2006; pp. 77–110. [Google Scholar]
  44. Song, M.; Lu, Y.; Liu, M. Convergence of the tamed Euler method for stochastic differential equations with piecewise continuous arguments under non-global Lipschitz continuous coefficients. Numer. Funct. Anal. Optim. 2018, 39, 517–536. [Google Scholar] [CrossRef]
  45. Tan, J.; Wang, H. Convergence and stability of the split-step backward Euler method for linear stochastic delay integro-differential equations. Math. Comput. Model. 2010, 51, 504–515. [Google Scholar] [CrossRef]
Figure 1. Log–log plot of mean square errors of the PTSS θ  method versus step size  Δ  for Equation (64), with  θ = 0 0.5 , and 1.
Figure 1. Log–log plot of mean square errors of the PTSS θ  method versus step size  Δ  for Equation (64), with  θ = 0 0.5 , and 1.
Mathematics 12 02016 g001
Figure 2. Trajectories of the partially truncated split-step theta (PTSS θ )-solutions for Equation (66), with  θ = 0.25  and  Δ = 0.05 .
Figure 2. Trajectories of the partially truncated split-step theta (PTSS θ )-solutions for Equation (66), with  θ = 0.25  and  Δ = 0.05 .
Mathematics 12 02016 g002
Figure 3. Trajectories of the partially truncated split-step theta (PTSS θ ) solutions for Equation (67), with  θ = 0.6  and  Δ = 0.7 .
Figure 3. Trajectories of the partially truncated split-step theta (PTSS θ ) solutions for Equation (67), with  θ = 0.6  and  Δ = 0.7 .
Mathematics 12 02016 g003
Table 1. Mean square errors of the numerical approximations for Equation (64).
Table 1. Mean square errors of the numerical approximations for Equation (64).
Step SizeSSBE MethodTEM MethodTE MethodPTSS θ  Method
θ = 0 . 4 θ = 0 . 6 θ = 0 . 8
2 5 0.17610.15220.23410.02170.03310.0486
2 6 0.14210.07630.15940.01340.02320.0256
2 7 0.09280.05410.09530.00380.01170.0143
2 8 0.06540.03240.07210.00180.00320.0041
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Share and Cite

MDPI and ACS Style

Abosenna, A.; AlNemer, G.; Tian, B. Convergence and Almost Sure Polynomial Stability of Partially Truncated Split-Step Theta Method for Stochastic Pantograph Models with Lévy Jumps. Mathematics 2024, 12, 2016. https://doi.org/10.3390/math12132016

AMA Style

Abosenna A, AlNemer G, Tian B. Convergence and Almost Sure Polynomial Stability of Partially Truncated Split-Step Theta Method for Stochastic Pantograph Models with Lévy Jumps. Mathematics. 2024; 12(13):2016. https://doi.org/10.3390/math12132016

Chicago/Turabian Style

Abosenna, Amr, Ghada AlNemer, and Boping Tian. 2024. "Convergence and Almost Sure Polynomial Stability of Partially Truncated Split-Step Theta Method for Stochastic Pantograph Models with Lévy Jumps" Mathematics 12, no. 13: 2016. https://doi.org/10.3390/math12132016

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