Next Article in Journal
Several Symmetric Identities of the Generalized Degenerate Fubini Polynomials by the Fermionic p-Adic Integral on Zp
Previous Article in Journal
Design Procedure for Real-Time Cyber–Physical Systems Tolerant to Cyberattacks
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

New Order 2.0 Simplified Weak Itô–Taylor Symmetrical Scheme for Stochastic Delay Differential Equations

College of Science, University of Shanghai for Science and Technology, Shanghai 200093, China
*
Author to whom correspondence should be addressed.
Symmetry 2024, 16(6), 685; https://doi.org/10.3390/sym16060685
Submission received: 29 April 2024 / Revised: 29 May 2024 / Accepted: 30 May 2024 / Published: 3 June 2024
(This article belongs to the Section Mathematics)

Abstract

:
In this article, we construct a new order 2.0 simplified weak Itô–Taylor symmetrical scheme for stochastic delay differential equations. By the new local weak convergence lemma and the connection inequality, we theoretically prove the global weak convergence theorem in two parts on the basis of Malliavin stochastic analysis. Meanwhile, numerical examples are presented to illustrate the error and convergence results. Furthermore, the obtained results display the influence of the delay coefficient on global errors.

1. Introduction

Nowadays, there are many scholars studying differential equations with delay terms.
The authors [1] propose a computationally effective numerical solution for a new design of a second-order Lane–Emden pantograph delayed problem. Stochastic delay differential equations (SDDEs) play a significant role in many application fields, such as control [2], dynamics [3], epidemic problems [4,5] and stock markets [6]. Ain and Wang [7] studied an epidemic model for the evolution of diseases utilizing an Itô–Levy stochastic differential equations system. Among these applications, the application of symmetry principles in the realm of SDDEs offers profound insights into the behavior of complex systems, see [8,9,10]. In this paper, we study d-dimensional SDDEs as follows:
d X t = a ( t , X t , X t τ ( t ) ) d t + b ( t , X t , X t τ ( t ) ) d W t , t [ 0 , T ] , X t = ψ ( t ) , t [ ρ , 0 ] ,
where W t = ( W t 1 , , W t q ) T is q-dimensional normally distributed Brownian motion with mean ( 0 , , 0 ) T and variance t I q × q , and ψ ( t ) is a F 0 -measurable C ( [ ρ , 0 ] , R d ) -valued random variable such that sup ρ t 0 E [ | ψ ( t ) | 2 ] < . Here, the constant ρ = inf { t τ ( t ) , t [ 0 , T ] } 0 , and t τ ( t ) is a continuous increasing function with the variable delay time τ ( t ) . The function a : [ 0 , T ] × R d × R d R d is known as the drift coefficient and b : [ 0 , T ] × R d × R d R d × q is the diffusion coefficient.
The existence and uniqueness theorems of SDDEs have been proved by the standard technique of Picard iterations in [11]. Generally, it is difficult to obtain an explicit solution of SDDEs. As a result, many scholars have proposed some numerical schemes for solving SDDEs, such as the Euler–Maruyama scheme [10,12,13,14], θ –Maruyama scheme [15], split-step θ scheme [16], multistep Maruyama scheme [17] and Runge–Kutta Maruyama scheme [18]. The classical Euler–Maruyama scheme for solving SDEs generally achieves a strong order of convergence 0.5 , and strong convergence schemes have the stability of absolute moments and mean-square stability. In [19,20], the Euler–Maruyama method was employed to solve the stochastic Cahn–Hilliard–Cook equations. Buckwar [8] proposed the strong Euler–Maruyama scheme for Equation (1) and proved the mean-square sense convergence theorem under a global Lipschitz condition by using an induction argument on the interval [ 0 , T ] . Mao [10,11,21] showed that the Euler–Maruyama numerical solution of SDDEs will converge to the true solution under a local Lipschitz condition by using the technique of stopping times and some moment inequalities for the solution of Equation (1). Subsequently, Mao [22] obtained the convergence in probability of the Euler–Maruyama scheme under a local Lipschitz condition and Khasminskii-type condition.
Given the application requirements in finance and related fields, there is an increasing interest in studying high-order numerical schemes for solving SDEs. Based on the Itô–Taylor expansion, Kolmogorov backward partial differential equations and some weak approximation properties, Kloeden and Platen [23] obtained the weak convergence theorem of classical Itô–Taylor weak high-order schemes for SDEs. However, if the scheme contains multiple stochastic Itô-type integrals, it will consume more CPU time and become computationally inefficient for multidimensional SDEs. In order to improve computational efficiency, the simplified weak second-order method [23] is used to solve multidimensional SDEs, which is highly effective and accurate compared to the classical order 2.0 Itô–Taylor scheme.
In addition, there are also some higher-order numerical schemes for SDDEs. For example, Buckwar and Winkler [17] constructed a linear multistep Maruyama scheme for SDDEs and proved that the implicit two-step backward differentiation method has an order 2.0 convergence rate with the smallest parameter in the noise term. Meanwhile, the weak order 2.0 stochastic orthogonal Runge–Kutta–Chebyshev (S-ROCK) method is proposed in [24,25] for solving SDEs. Then, based on the the S-ROCK method, Guo [18] developed an explicit Runge–Kutta scheme for SDDEs and studied its stability properties.
In this paper, a new order 2.0 simplified weak Itô–Taylor scheme is put forward to solve SDDEs, which is different from the traditional methods in [10,21,23,26]. The primary contributions of this paper can be highlighted as follows:
  • A new order 2.0 simplified weak Itô–Taylor symmetrical scheme is proposed for solving SDDEs, which involves no multiple stochastic Itô-type integrals and can be easily applied to solve multidimensional SDDEs.
  • Provided that the critical value ξ = τ ( ξ ) , we divide the global weak convergence theorem into two steps in the time intervals [ 0 , ξ ] and ( ξ , T ] . On the basis of the Malliavin space under some reasonable hypotheses, the global weak convergence theorem of the new scheme and the connect inequality are rigorously proven on the time interval [ 0 , ξ ] . Subsequently, based on the theory of Malliavin analysis, using the new weak convergence lemmas and the connection inequality between the two intervals [ 0 , ξ ] and ( ξ , T ] , we rigorously prove that the new scheme has global weak second-order convergence and mean-square stability.
  • Several numerical examples, including the Mackey–Glass equation with a multiplicative noise, a nonlinear SDDE about the square of the O-U delay process, a linear SDDE with a time-varying delay and a two-dimensional linear SDDE, are used to illustrate the error and convergence results of the new order 2.0 simplified numerical symmetrical scheme. Additionally, a dedicated discussion section is added to compare our method in detail with other existing methods in terms of computational time and show the global and local convergence rates and mean-square stability property.
The following notations are listed for future reference:
  • r is a positive constant, and each line may be different.
  • C is a positive constant, and it relies on the upper bounds of the derivatives of the coefficients a , b , f .
  • C b i , j , j : the set of functions U = U ( t , x , y ) : [ 0 , T ] × R d × R d R are continuously differentiable with uniformly bounded partial derivatives c U t c and d + e U x d y e for 1 c i and 1 d + e j .
  • C b k : the set of functions ϕ : x R d R with uniformly bounded partial derivatives c ϕ x c for 1 c k .
This paper is organized as follows. Some fundamental concepts such as the Itô–Taylor expansion and the Malliavin derivative are introduced in Section 2. In Section 3, we present a novel order 2.0 simplified weak Itô–Taylor numerical method for solving stochastic delay differential equations (SDDEs) and prove the global weak convergence theorem. Section 4 provides linear and nonlinear examples to illustrate the impact of the delay coefficient, alongside error and convergence analysis. Finally, in Section 5, we draw our conclusions.

2. Preliminaries

In Section 2.1, we introduce some basic concepts, such as the Itô formula and Itô–Taylor expansion. Further, we list two lemmas and one corollary of the Malliavin derivative in Section 2.2.

2.1. Itô–Taylor Expansion

In this paper, let ( Ω , F , { F t } t 0 , P ) be a complete probability space with the filtration { F t } t 0 . Furthermore, assume the filtration { F t } satisfies the usual conditions, i.e., it is right-continuous and F 0 contains all P-null sets. Moreover, let the filtration be q-dimensional Brownian motion W t . The random variable X t is F t -measurable and ψ ( t ) is F 0 -measurable, respectively.
Then, we introduce the set of all multi-indices, which are given by M in [23]:
M = { α = ( j 1 , j 2 , , j l ) : j i { 0 , 1 , , q } , 1 i l and l 1 } { v } ,
where v denotes the empty index. We give the definition of hierarchical set Γ l as follows: Γ l = α M : l ( α ) l , and B ( Γ l ) = α M : l ( α ) = l + 1 denotes the remainder set. Given a multi-index α M with the length l ( α ) > 1 , we write α = ( j 2 , , j l ) and α = ( j 1 , j 2 , , j l 1 ) . Then we have the recursive definition of the multiple Itô integral I α as follows:
I α [ g k , α ( s 1 , X s 1 , X s 1 τ ( s 1 ) ) ] ρ , ς = ρ ς I α [ g k , α ( s 1 , X s 1 , X s 1 τ ( s 1 ) ) ] ρ , s l d s l , l 1 , j l = 0 , ρ ς I α [ g k , α ( s 1 , X s 1 , X s 1 τ ( s 1 ) ) ] ρ , s l d W s l j l , l 1 , j l 1 ,
where g k , α can be represented by
g k , α = g k , ( 0 ) = a k ( t , X t , X t τ ( t ) ) , g k , ( i ) = b k , i ( t , X t , X t τ ( t ) ) , l = 1 . L j 1 g k , α , l > 1 .
For V C 2 , 1 ( [ 0 , T ] × R d × R d ; R ) , we introduce the operators L 0 V ( t , x , y ) , L i V ( t , x , y ) ( 1 i q ) such that
L 0 V ( t , x , y ) = t V ( t , x , y ) + k = 1 d x k V ( t , x , y ) a k ( t , x , y ) + 1 2 k , l = 1 d j = 1 q 2 x l x k V ( t , x , y ) b k , j ( t , x , y ) b l , j ( t , x , y ) , L i V ( t , x , y ) = k = 1 d x k V ( t , x , y ) b k , i ( t , x , y ) ,
Consequently, by using the above operators, the Itô formula in [21] is presented as
V ( t , X t , X t τ ( t ) ) = V ( 0 , X 0 , X τ ( 0 ) ) + 0 t L 0 V ( s , X s , X s τ ( s ) ) d s + i = 1 q 0 t L i V ( s , X s , X s τ ( s ) ) d W s i .
Let X k , ς be the k-th component of explicit solution X ς of Equation (1); therefore, we can obtain the following Itô–Taylor expansion:
X k , ς = X k , ρ + α Γ 2 { v } g k , α ( ρ , X ρ , X ρ τ ( ρ ) ) I α [ 1 ] ρ , ς + α B ( Γ 2 ) I α [ g k , α ( s 1 , X s 1 , X s 1 τ ( s 1 ) ) ] ρ , ς .

2.2. Malliavin Derivative

The Malliavin derivative D t of a random variable F = ( F 1 , , F d ) T is given by the following in [27]:
D t F = ( D t 1 F , , D t q F ) d × q , D t i F = ( D t i F 1 , , D t i F d ) T ,
and
D t 1 t l α = D t 1 t l ( j 1 , , j l ) = D t 1 j 1 · · · D t l j l
with, especially, D t k 0 = 1 for 1 k l .
Furthermore, D k , j can be defined as ordinary Sobolev spaces of functions on R d that together with their k first partial derivatives have moments of order j with regard to the standard normal law. For any j 1 and k N , we can define the following norm:
| | G | | k , j j = E [ | G | j ] + l = 1 k α ρ ς ρ ς E [ | D t 1 t l α G | j ] d t 1 d t l ,
where G is the smooth random variable. Next, we give two lemmas and a corollary with the Malliavin derivative.
Lemma 1
(duality formula, see [27]). Let F D 1 , 2 and X t D 1 , 2 for 0 t T . Then for 1 j q ,
E F 0 T X t d W t j = E 0 T X t D t j F d t , D t j 0 T X s d W s j = X t + t T D t j X s d W s j .
Lemma 2
(chain rules, see [27]). () For 1 i q , let G 1 , G 2 D 1 , 2 and also G 1 G 2 D 1 , 2 with
D t i ( G 1 G 2 ) = G 1 D t i G 2 + G 2 D t i G 1 .
Let G D 1 , 2 and ϕ C 1 ( R d ) with bounded partial derivatives. Then ϕ ( G ) D 1 , 2 and
D t i ϕ ( G ) = k = 1 d x k ϕ ( G ) D t i G k .
Corollary 1.
For 1 i , j q , by using the Itô formula, we can obtain the fact that
ρ ς ρ t d W s i d W t i = 1 2 ( W ς i W ρ i ) 2 ( ς ρ ) ,
and we can also deduce the following Malliavin derivative with regard to multiple stochastic integrals:
D r i ( ρ ς ρ t d W s i d W t i ) = W ς i W ρ i , D r i ( ρ ς ρ t d W s j d W t i ) = W r j W ρ j , D r i ( ρ ς ρ t d W s i d W t j ) = W ς j W r j , D r i ( ρ ς ρ t d s d W t i ) = r ρ
for 0 ρ < r ς T and i j .

3. Main Results

In Section 3.1, we present the new order 2.0 simplified weak numerical method for SDDEs on the basis of the Itô–Taylor expansion and trapezoidal rule. Further, by using the new local weak convergence lemma, we obtain the global weak convergence theorems in Section 3.2.

3.1. Order 2.0 Simplified Weak Scheme for SDDEs

Note that the continuous increasing function t τ ( t ) C [ ρ , T τ ( T ) ] , then for n = 0 , 1 , 2 , , N , we first present the uniform partition on time interval [ 0 , T ] and Δ t : = T N 0 , u i = i Δ t ( 1 i N 0 ) , and we define L : = min { i | i N + , u i τ ( u i ) 0 } and m : = max { i | i N , i L , u i τ ( u i ) u L } . In this paper, we use the time discretization { t n , 0 n N : = 2 N 0 L + 1 } :
0 = t 0 < < u m τ ( u m ) < t m + 1 = u L < < t N = T
with step size Δ t n = t n + 1 t n Δ t , including all the times { u i , 1 i N 0 } and { u L τ ( u L ) , u L + 1 τ ( u L + 1 ) , , u N 0 τ ( u N 0 ) } . Then, we have the k-th component of explicit solution X t n + 1 of Equation (1) by the Itô–Taylor expansion
X k , t n + 1 = X k , t n + α Γ 2 { v } g k , α ( t n , X t n , X t n τ ( t n ) ) I α [ 1 ] t n , t n + 1 + α B ( Γ 2 ) I α [ g k , α ( s 1 , X s 1 , X s 1 τ ( s 1 ) ) ] t n , t n + 1 .
Scheme 1.
For 1 n N 1 and initial value X 0 = X 0 , it takes the form
X k n + 1 = X k n + a k Δ t n + i = 1 q b k , i Δ W n i + 1 2 L 0 a k ( Δ t n ) 2 + i = 1 q 1 2 ( L i a k + L 0 b k , i ) Δ W n i Δ t n + i , j = 1 q 1 2 L i b k , j ( Δ W n i Δ W n j + V i , j ) ,
where Δ W n i = W t n + 1 i W t n i , a k = a k ( t n , X n , X n m ) and b k , i = b k , i ( t n , X n , X n m ) , and
X n m = ψ ( t n τ ( t n ) ) , 0 n m , X n m , m < n N ,
where the V i , j are independent two-point distributed random variables with P ( V i , j = ± Δ t n ) = 1 2 for j = 1 , , i 1 , V i , i = Δ t and V i , j = V j , i for i = 1 , , q and j = i + 1 , , q .
Hypothesis 1.
Assume the functions a , b satisfy the following conditions:
  • Lipschitz condition: for x 1 , x 2 , y 1 , y 2 R d , t [ 0 , T ] , there is a constant L > 0 with
    | a ( t , x 1 , y 1 ) a ( t , x 2 , y 2 ) | | b ( t , x 1 , y 1 ) b ( t , x 2 , y 2 ) | L ( | x 1 x 2 | + | y 1 y 2 | ) .
  • Linear growth condition: for x , y R d , there is a positive constant K with
    | a ( t , x , y ) | 2 | b ( t , x , y ) | 2 K ( 1 + | x | 2 + | y | 2 ) .
At the same time, the functions ψ satisfy the following conditions:
  • The Hölder continuity of the initial data: for all ρ s < t 0 , there exist constants H > 0 and γ 0 , 1 such that
    E [ | ψ ( t ) ψ ( s ) | 2 ] H ( | t s | γ ) .
Let X t and X n be the solution of Equation (1) and Scheme 1, respectively. We have the following hypothesis.
Hypothesis 2.
Assume the functions a , b C b 2 , 3 , 3 , ψ C b 3 .
Lemma 3.
X t and X n ( 0 n N ) are the solutions of Equation (1) and Scheme 1, respectively. Under Hypotheses 1 and 2, we can obtain { X t } 0 t T D 3 , 2 and { X n } 0 n N D 3 , 2 .
Proof. 
Assume X t is the explicit solution of following equation:
X t = X 0 + 0 t a ( s , X s , X s τ ( s ) ) d s + 0 t b ( s , X s , X s τ ( s ) ) d W s .
Using the B-D-G inequality, Gronwall’s inequality and Hypothesis 1, one can show that in reference [11],
E [ sup 0 r t | X r | 2 ] ( 1 + 3 E [ | X 0 | 2 ] ) e 3 K T ( T + 4 ) .
By taking the Malliavin derivative with respect to Equation (3), we obtain
D r X t = r t D r a ( s , X s , X s τ ( s ) ) d s + b ( r , X r , X r τ ( r ) ) + r t D r b ( s , X s , X s τ ( s ) ) d W s ,
where 0 r t T and
D r a ( s , X s , X s τ ( s ) ) = a 2 ( s , X s , X s τ ( s ) ) D r X s + a 3 ( s , X s , X s τ ( s ) ) D r X s τ ( s ) ,
D r b ( s , X s , X s τ ( s ) ) = b 2 ( s , X s , X s τ ( s ) ) D r X s + b 3 ( s , X s , X s τ ( s ) ) D r X s τ ( s ) .
Using the elementary inequality ( i = 1 3 c i ) 2 3 i = 1 3 c i 2 and a , b C b · , 1 , 1 , one can further show that
( D r X t ) 2 3 ( b ( r , X r , X r τ ( r ) ) ) 2 + 3 T r t ( D r a ( s , X s , X s τ ( s ) ) ) 2 d s + 3 ( r t D r b ( s , X s , X s τ ( s ) ) d W s ) 2 .
Then using Hölder’s inequality, we have
E [ | D r X t | 2 ] 3 E [ | b ( r , X r , X r τ ( r ) ) | 2 ] + 3 T r T E [ | D r a ( s , X s , X s τ ( s ) ) | 2 ] d s + 3 r T E [ | D r b ( s , X s , X s τ ( s ) ) | 2 ] d s C sup 0 s T E 1 + | X s | 2 + | X s τ ( s ) | 2 + C T r T E [ | D r X s | 2 ] d s ,
which by the Gronwall inequality yields
E [ | D r X t | 2 ] C sup 0 s T E 1 + | X s | 2 + | X s τ ( s ) | 2 e C T C .
Further, if a , b C b 2 , 4 , 4 , ψ C b 4 , we obtain that
E [ | D s 1 D s 2 X t | 2 ] C , E [ | D s 1 D s 2 D s 3 X t | 2 ] C ,
which yields { X t } 0 t T D 3 , 2 . Applying similar techniques as in the proofs of Inequalities (4) and (7), under the conditions of the lemma, we deduce { X n } 0 n N D 3 , 2 . □

3.2. Weak Convergence Theorems

For the sake of a simple proof, we present a new local weak convergence lemma before presenting the proof of global weak convergence. Next, we give two theorems to prove the global weak convergence theory on the basis of the new weak convergence lemma. In Theorem 1, we utilize the theory of Malliavin analysis and the new lemma to prove Scheme 1 has the global weak second-order convergence rate within [ 0 , t m ] . Based on Theorem 1, we prove the global weak convergence theorem within [ t m , T ] in Theorem 2.
Lemma 4
(Local weak convergence). Let X t n + 1 and X n + 1 ( 0 n N 1 ) be the solutions of Equation (1) and Scheme 1, respectively. Assume F n + 1 = F ( X t n + 1 , X n + 1 ) : R d × R d R . Under Hypothesis 1 and Hypothesis 2, for 1 j q , we have
| E F ( X t n + 1 , X n + 1 ) t n t n + 1 t n t d W s j d t 1 2 Δ W n j Δ t n | C ( 1 + E [ | X 0 | r ] ) ( Δ t ) 3
and
| E F ( X t n + 1 , X n + 1 ) t n t n + 1 t n t d s d W t j 1 2 Δ t n Δ W n j | C ( 1 + E [ | X 0 | r ] ) ( Δ t ) 3 .
Proof. 
For 1 j q , by taking the Malliavin derivative on both sides of Scheme 1 and Equation (2), we can obtain
D s j X k n + 1 = b k , j + 1 2 L j a k Δ t n + 1 2 L 0 b k , j Δ t n + L j b k , j Δ W n j + 1 2 i = 1 , i j q ( L j b k , i + L i b k , j ) Δ W n i ,
D s j X k , t n + 1 = α Γ 2 { v } g k , α ( t n , X t n , X t n τ ( t n ) ) D s j I α [ 1 ] t n , t n + 1 + α B ( Γ 2 ) D s j I α [ g k , α ( s 1 , X s 1 , X s 1 τ ( s 1 ) ) ] t n , t n + 1
for t n < s t n + 1 . Using Lemma 1 (duality formula), we conclude that
E F ( X t n + 1 , X n + 1 ) t n t n + 1 t n t d W s j d t 1 2 Δ W n j Δ t n = E t n t n + 1 t n t D s j ( F ( X t n + 1 , X n + 1 ) ) d s d t 1 2 t n t n + 1 t n t n + 1 D s j ( F ( X t n + 1 , X n + 1 ) ) d s d t .
Combining Equations (11) and (12) and Corollary 1, for t n < s t n + 1 , we have
D s j ( F ( X t n + 1 , X n + 1 ) ) = F 1 ( X t n + 1 , X n + 1 ) D s j X t n + 1 + F 2 ( X t n + 1 , X n + 1 ) D s j X n + 1 = ϕ 1 + ϕ 2 , s .
Here, ϕ 1 : = ϕ 1 ( t n , X n , X n m , X t n + 1 , X n + 1 , Δ W n , Δ t n ) is a function not depending only on time s, and
ϕ 2 , s : = ( W t n + 1 W s ) G 1 n + 1 + ( W s W t n ) G 2 n + 1 + G 3 n + 1 ,
where
G 1 n + 1 : = G 1 n + 1 ( X n , X t n , X n + 1 , X t n + 1 ) , G 2 n + 1 : = G 2 n + 1 ( X n , X t n , X n + 1 , X t n + 1 ) , G 3 n + 1 : = G 3 n + 1 ( Δ t n , X n , X n m , X t n + 1 , X n + 1 , s t n , t n + 1 s )
with the property
| E G 3 n + 1 ( Δ t n , X n , X n m , X t n + 1 , X n + 1 , s t n , t n + 1 s ) | C ( 1 + E [ | X 0 | r ] ) Δ t .
On the basis of Equations (13) and (14), we immediately obtain that
E F ( X t n + 1 , X n + 1 ) t n t n + 1 t n t d W s j d t 1 2 Δ W n j Δ t n = E t n t n + 1 t n t ( ϕ 1 + ϕ 2 , s ) d s d t 1 2 t n t n + 1 t n t n + 1 ( ϕ 1 + ϕ 2 , s ) d s d t = ε 1 + ε 2 ,
where
ε 1 = E ϕ 1 t n t n + 1 t n t d s d t 1 2 t n t n + 1 t n t n + 1 d s d t , ε 2 = E t n t n + 1 t n t ϕ 2 , s d s d t 1 2 t n t n + 1 t n t n + 1 ϕ 2 , s d s d t .
Since t n t n + 1 t n t d s d t 1 2 t n t n + 1 t n t n + 1 d s d t = 0 , we have ε 1 = 0 . Using Lemma 1 (duality formula), it follows from Equations (15) and (16) that
E [ ( W t n + 1 W s ) G 1 n + 1 ] = s t n + 1 E [ D r G 1 n + 1 ] d r , E [ ( W s W t n ) G 2 n + 1 ] = t n s E [ D r G 2 n + 1 ] d r
for t n < s t n + 1 . Utilizing Equations (15), (17) and (19), we deduce
| ε 2 | = | E t n t n + 1 t n t ϕ 2 , s d s d t 1 2 t n t n + 1 t n t n + 1 ϕ 2 , s d s d t | C ( 1 + E [ | X 0 | r ] ) ( Δ t ) 3 .
Consequently, from the fact ε 1 = 0 , by Equations (18) and (20), we obtain
| E F ( X t n + 1 , X n + 1 ) t n t n + 1 t n t d W s j d t 1 2 Δ W n j Δ t n | C ( 1 + E [ | X 0 | r ] ) ( Δ t ) 3 .
Applying similar techniques as those used to prove Inequality (9), we obtain that Inequality (10) holds.
The proof is completed. □
For the ease of the proof, we consider one-dimensional Wiener process W t and random variable X t . Next, we give the proof of global weak convergence (Theorem 1) on t [ 0 , t m ] .
Theorem 1
(global weak convergence: part I). Let Hypotheses 1 and 2 hold. Let X t and X n ( 1 n m ) be the solutions of Equation (1) and Scheme 1, respectively. Then, if f C b 4 ,   U n D 3 , 2 ( 1 n m ), we have
w e a k   c o n v e r g e n c e   i n e q u a l i t y : | E [ f ( X t m ) f ( X m ) ] | C ( 1 + E [ | X 0 | r ] ) ( Δ t ) 2 ;
c o n n e c t i o n   i n e q u a l i t y : | E [ ( X t n X n ) U n ] | C ( 1 + E [ | X 0 | r ] ) ( Δ t ) 2 .
Proof. 
In the case that the time t m + 1 = u L , it follows from the Taylor formula that
f ( X t m ) f ( X m ) = ( X t m X m ) f λ m
with f λ m = 0 1 d d x f ( X m + λ ( X t m X m ) ) d λ . Note that
t m 1 t m t m 1 s 2 d W s 1 d W s 2 = 1 2 ( Δ W m 1 ) 2 Δ t m 1 and t m 1 t m t m 1 s 2 d s 1 d s 2 = 1 2 ( Δ t m 1 ) 2 ,
so by virtue of the Itô–Taylor expansion, we can obtain
X t m X m = X t m 1 X m 1 + α B ( Γ 2 ) I α [ g α ( s 1 , X s 1 , ψ ( s 1 τ ( s 1 ) ) ) ] t m 1 , t m + α Γ 2 { v } g α ( t m 1 , X t m 1 , ψ ( t m 1 τ ( t m 1 ) ) ) g α ( t m 1 , X m 1 , ψ ( t m 1 τ ( t m 1 ) ) ) I α [ 1 ] t m 1 , t m + j 1 j 2 g α ( t m 1 , X m 1 , ψ ( t m 1 τ ( t m 1 ) ) ) t m 1 t m t m 1 s 2 d W s 1 j 1 d W s 2 j 2 1 2 Δ W m 1 j 1 Δ W m 1 j 2
for 1 j 1 , j 2 q and W s 0 = s . For g α = g α ( t , x , y ) , it follows from the Taylor formula that
g α ( t m 1 , X t m 1 , ψ ( t m 1 τ ( t m 1 ) ) ) g α ( t m 1 , X m 1 , ψ ( t m 1 τ ( t m 1 ) ) ) = ( X t m 1 X m 1 ) G α , x , ψ m 1 ,
where G α , x , ψ m 1 = 0 1 x g α ( t m 1 , X m 1 + λ ( X t m 1 X m 1 ) , ψ ( t m 1 τ ) ) d λ . Combining Equations (23)–(25), we have
E f ( X t m ) f ( X m ) = E ( X t m X m ) f λ m = E ( X t m 1 X m 1 ) f λ m + α Γ 2 { v } G α , x , ψ m 1 f λ m I α [ 1 ] t m 1 , t m + E 1 m 1 + E 2 m 1 = E ( X t m 1 X m 1 ) F m 1 + j = 1 2 E j m 1 ,
where
F m 1 : = f λ m 1 + α Γ 2 { v } G α , x , ψ m 1 I α [ 1 ] t m 1 , t m ,
E 1 m 1 : = j 1 j 2 E g α t m 1 , X m 1 , ψ ( t m 1 τ ( t m 1 ) ) f λ m t m 1 t m t m 1 s 2 d W s 1 j 1 d W s 2 j 2 1 2 Δ W m 1 j 1 Δ W m 1 j 2 ,
E 2 m 1 : = α B ( Γ 2 ) E f λ m I α [ g α ( s 1 , X s 1 , ψ ( s 1 τ ( s 1 ) ) ) ] t m 1 , t m .
From Equation (26), we deduce the following recursive formula:
E f ( X t m ) f ( X m ) = E ( X t m 1 X m 1 ) F m 1 + j = 1 2 E j m 1 = E ( X t 1 X 1 ) F 1 + l = 1 m 1 j = 1 2 E j l ,
where F m 1 , E 1 m 1 and E 2 m 1 are defined in (27), (28) and (29), respectively, and for 1 i m 2 ,
F i : = F i + 1 1 + α Γ 2 { v } G α , x , ψ i I α [ 1 ] t i , t i + 1 ,
E 1 i : = j 1 j 2 E g α t i , X i , ψ ( t i τ ( t i ) ) F i + 1 t i t i + 1 t i s 2 d W s 1 j 1 d W s 2 j 2 1 2 Δ W i j 1 Δ W i j 2 , E 2 i : = α B ( Γ 2 ) E F i + 1 I α [ g α ( s 1 , X s 1 , ψ ( s 1 τ ( s 1 ) ) ) ] t i , t i + 1 .
In order to give the estimate with respect to Equation (30), we give the detailed proof process in three parts. In the first part, let the condition X 0 = X 0 , so we obtain
X t 1 X 1 = α B ( Γ 2 ) I α [ g α s 1 , X s 1 , ψ ( s 1 τ ( s 1 ) ) ] t 0 , t 1 .
Using Lemma 1 (duality formula) and Equation (32), it yields
E [ ( X t 1 X 1 ) F 1 ] = α B ( Γ 2 ) E F 1 I α g α ( s 1 , X s 1 , ψ ( s 1 τ ( s 1 ) ) ) t 0 , t 1 = α B ( Γ 2 ) I ( 0 , 0 , 0 ) E D s 1 s 2 s 3 α ( F 1 ) g α ( s 1 , X s 1 , ψ ( s 1 τ ( s 1 ) ) ) t 0 , t 1 .
It follows from the condition in Hypotheses 1 and 2 that G α , x , ψ i = G α , x , ψ i ( X t i , X i ) D 3 , 2 for 1 i m 1 and f λ m = f λ m ( X t m , X m ) D 3 , 2 , which, by combining the Equations (27) and (31), yields
F 1 = f λ m i = 1 m 1 1 + α Γ 2 { v } G α , x , ψ i I α [ 1 ] t i , t i + 1 D 3 , 2 .
Consequently, we can infer from (33) and (34) that
| E [ ( X t 1 X 1 ) F 1 ] | C ( 1 + E [ | X 0 | r ] ) ( Δ t ) 3 .
In the second part, we give the error estimate with respect to E 1 i :
E 1 i = j 1 j 2 E g α ( t i , X i , ψ ( t i τ ( t i ) ) ) F i + 1 t i t i + 1 t i s 2 d W s 1 j 1 d W s 2 j 2 1 2 Δ W i j 1 Δ W i j 2 = j 1 j 2 E g α ( t i , X i , ψ ( t i τ ( t i ) ) ) E F i + 1 t i t i + 1 t i s 2 d W s 1 j 1 d W s 2 j 2 1 2 Δ W i j 1 Δ W i j 2 | F t i .
Next, by using Lemma 4, we have | E 1 i | C ( 1 + E [ | X 0 | r ] ) ( Δ t ) 3 . In the third part, by using Lemma 1 (duality formula), we deduce
E 2 i = α B ( Γ 2 ) E F i + 1 I α [ g α ( s 1 , X s 1 , ψ ( s 1 τ ( s 1 ) ) ) ] t i , t i + 1 = α B ( Γ 2 ) I ( 0 , 0 , 0 ) E D s 1 s 2 s 3 α ( F i + 1 ) g α ( s 1 , X s 1 , ψ ( s 1 τ ( s 1 ) ) ) t i , t i + 1 .
Furthermore, by Equation (36), it is obtained that
| E 2 i | = | α B ( Γ 2 ) I ( 0 , 0 , 0 ) E D s 1 s 2 s 3 α ( F i + 1 ) g α ( s 1 , X s 1 , ψ ( s 1 τ ( s 1 ) ) ) t i , t i + 1 | C ( 1 + E [ | X 0 | r ] ) ( Δ t ) 3 .
Combining Equation (30), Inequalities (35) and (37) and the fact | E 1 i | C ( 1 + E [ | X 0 | r ] ) ( Δ t ) 3 , we deduce
| E [ f ( X t m ) f ( X m ) ] | C ( 1 + E [ | X 0 | r ] ) ( Δ t ) 2 .
Further, in a similar way as in proving Inequality (21), due to U l D 3 , 2 ( 1 l m ) , we have
| E [ ( X t l X l ) U l ] | C ( 1 + E [ | X 0 | r ] ) ( Δ t ) 2 .
The proof is completed. □
Next, based on Inequalities (21) and (22), which are the connection between Theorems 1 and 2, we give the proof of global weak convergence on t [ t m , T ] .
Theorem 2
(global weak convergence: part II). Let Hypothesis 1 and Hypothesis 2 hold. Let X t and X n ( m n N ) be the solutions of Equation (1) and Scheme 1, respectively. Furthermore, if f C b 4 , we have
w e a k   c o n v e r g e n c e   i n e q u a l i t y : | E [ f ( X t N ) f ( X N ) ] | C ( 1 + E [ | X 0 | r ] ) ( Δ t ) 2 ;
m e a n - s q u a r e   s t a b i l i t y : E ( X t N X N ) 2 C ( 1 + E [ | X 0 | r ] ) ( Δ t ) 2 .
Proof. 
For the sake of a simple proof, by using the Taylor formula, we have the following equation:
f ( X t N ) f ( X N ) = ( X t N X N ) f λ N
with f λ N = 0 1 d d x f ( X N + λ ( X t N X N ) ) d λ . For m n N , it follows from the Itô–Taylor expansion that
X t n X n = X t n 1 X n 1 + α B ( Γ 2 ) I α [ g α ( s 1 , X s 1 , X s 1 τ ( s 1 ) ) ] t n 1 , t n + α Γ 2 { v } g α ( t n 1 , X t n 1 , X t n 1 m ) g α ( t n 1 , X n 1 , X n 1 m ) I α [ 1 ] t n 1 , t n + j 1 j 2 g α ( t n 1 , X n 1 , X n 1 m ) t n 1 t n t n 1 s 2 d W s 1 j 1 d W s 2 j 2 1 2 Δ W n 1 j 1 Δ W n 1 j 2
for 1 j 1 , j 2 q . For g α = g α ( t , x , y ) and m n N , by the Taylor formula we have
g α ( t n 1 , X t n 1 , X t n 1 m ) g α ( t n 1 , X n 1 , X n 1 m ) = g α ( t n 1 , X t n 1 , X t n 1 m ) g α ( t n 1 , X n 1 , X t n 1 m ) + g α ( t n 1 , X n 1 , X t n 1 m ) g α ( t n 1 , X n 1 , X n 1 m ) = ( X t n 1 X n 1 ) G α , 1 n 1 + ( X t n 1 m X n 1 m ) G α , 2 n 1 ,
where
G α , 1 n 1 = 0 1 x g α ( t n 1 , X n 1 + λ ( X t n 1 X n 1 ) , X t n 1 m ) d λ , G α , 2 n 1 = 0 1 y g α t n 1 , X n 1 , X n 1 m + λ ( X t n 1 m X n 1 m ) d λ .
Combining Equations (40)–(42), we deduce
E [ f ( X t N ) f ( X N ) ] = E [ ( X t N X N ) f λ N ] = E ( X t N 1 X N 1 ) f λ N + α Γ 2 { v } G α , 1 N 1 f λ N I α [ 1 ] t N 1 , t N + ζ 1 N 1 + ζ 2 N 1 + ζ 3 N 1 = E ( X t N 1 X N 1 ) R N 1 + j = 1 3 ζ j N 1 = E ( X t m X m ) R m + i = m 2 N l 1 j = 1 3 ζ j i ,
where
R N 1 : = f λ N 1 1 + α Γ 2 { v } G α , 1 N 1 I α [ 1 ] t N 1 , t N ;
R i : = R i + 1 1 + α Γ 2 { v } G α , 1 i I α [ 1 ] t i , t i + 1 , m i N 1 ;
ζ 1 i : = α Γ 2 { v } E ( X t i m X i m ) G α , 2 i R i + 1 I α [ 1 ] t i , t i + 1 , m i N 1 ; ζ 2 i : = j 1 j 2 E g α ( t i , X i , X i m ) R i + 1 t i t i + 1 t i s 2 d W s 1 j 1 d W s 2 j 2 1 2 Δ W i j 1 Δ W i j 2 , m i N 1 ; ζ 3 i : = α B ( Γ 2 ) E R i + 1 I α [ g α ( s 1 , X s 1 , X s 1 τ ( s 1 ) ) ] t i , t i + 1 , m i N 1 .
Next, we give the estimate with respect to Equation (43) in four parts. In the first part, we infer from the conditions in Hypotheses 1 and 2 that G α , 1 i = G α , 1 i ( X t i , X i , X t i m ) D 3 , 2 for m i N 1 and f λ N = f λ N ( X t N , X N ) D 3 , 2 , which, by employing Equations (44) and (45), yields
R m = f λ N i = m N 1 1 + α Γ 2 { v } G α , 1 i I α [ 1 ] t i , t i + 1 D 3 , 2 .
Therefore, we can infer from R m D 3 , 2 and Inequality (22) in Theorem 1 that
| E [ ( X t m X m ) R m ] | C ( 1 + E [ | X 0 | r ] ) ( Δ t ) 2 .
Next, we give the estimate with respect to ζ 1 i in the second part. Utilizing the tower rule and Lemma 1 (duality formula), we have
ζ 1 i = α Γ 2 { v } E ( X t i m X i m ) G α , 2 i R i + 1 I α [ 1 ] t i , t i + 1 = α Γ 2 { v } E ( X t i m X i m ) E G α , 2 i E [ R i + 1 I α [ 1 ] t i , t i + 1 | F t i ] | F t i m = α Γ 2 { v } E ( X t i m X i m ) E G α , 2 i I α 0 D · α ( R i + 1 ) t i , t i + 1 | F t i m ,
where α 0 = ( 0 , · · · , 0 ) l ( α ) . Under the conditions in Hypotheses 1 and 2, note that G α , 2 N 1 = G α , 1 N 1 ( X N 1 , X t N 1 m , X N 1 m ) ; therefore, we deduce G α , 2 N 1 D 3 , 2 . Assume the notation O i m ( Δ t ) is a F t i m -measurable function of X t i m and X i m , which has the estimate
| O i m ( Δ t ) | C Δ t ( 1 + | X t i m | r + | X i m | r ) .
Consequently, combining the fact E G α , 2 i I α 0 D · α R i + 1 t i , t i + 1 | F t i m = U i m = O i m ( Δ t ) and the connection of Inequality (22) in Theorem 1, we can deduce
| ζ 1 i | C ( 1 + E [ | X 0 | r ] ) ( Δ t ) 3 .
In the third part, we give the error estimate with respect to ζ 2 i :
ζ 2 i = j 1 j 2 E g α ( t i , X i , X i m ) R i + 1 t i t i + 1 t i s 2 d W s 1 j 1 d W s 2 j 2 1 2 Δ W i j 1 Δ W i j 2 = j 1 j 2 E g α ( t i , X i , X i m ) E R i + 1 t i t i + 1 t i s 2 d W s 1 j 1 d W s 2 j 2 1 2 Δ W i j 1 Δ W i j 2 | F t i .
Therefore, by combining Equation (48) and Lemma 4, we deduce the following inequality:
| ζ 2 i | C ( 1 + E [ | X 0 | r ] ) ( Δ t ) 3 .
In the fourth part, using Lemma 1 (duality formula), we have
ζ 3 i = α B ( Γ 2 ) E R i + 1 I α g α ( s 1 , X s 1 , X s 1 τ ( s 1 ) ) t i , t i + 1 = α B ( Γ 2 ) I ( 0 , 0 , 0 ) E D s 1 s 2 s 3 α ( R i + 1 ) g α ( s 1 , X s 1 , X s 1 τ ( s 1 ) ) t i , t i + 1 .
Furthermore, by Equation (50), we obtain that
| ζ 3 i | α B ( Γ 2 ) | I ( 0 , 0 , 0 ) E D s 1 s 2 s 3 α ( R i + 1 ) g α ( s 1 , X s 1 , X s 1 τ ( s 1 ) ) t i , t i + 1 | C ( 1 + E [ | X 0 | r ] ) ( Δ t ) 3 .
Combining Equation (43) and Inequalities (46), (47), (49) and (51), we have
| E [ f ( X t N ) f ( X N ) ] | C ( 1 + E [ | X 0 | r ] ) ( Δ t ) 2 .
Using a similar technique as in the proof of Inequality (52), we can obtain
| E [ ( X t N X N ) U N ] | C ( 1 + E [ | X 0 | r ] ) ( Δ t ) 2 ,
for U N D 3 , 2 . Then let U N = X t N X N D 3 , 2 in (53); therefore, we have the following mean-square stability estimation:
E [ ( X t N X N ) 2 ] C ( 1 + E [ | X 0 | r ] ) ( Δ t ) 2 .
The proof is completed. □
Remark 1.
It is worth noting that { X t } 0 t T D 3 , 2 and { X n } 0 n N D 3 , 2 are obtained under the regularity conditions on a , b C b 2 , 3 , 3 , f C b 3 and ψ C b 3 in Lemma 3. However, under a weaker regularity condition on these coefficients, we might obtain a lower order of convergence of Scheme 1. For example, if a , b C b 1 , 2 , 2 , f C b 2 and ψ C b 2 , we can only obtain the following weak order-one convergence:
| E [ f ( X t N ) f ( X N ) ] | C ( 1 + E [ | X 0 | r ] ) Δ t .
In this case, it is better to use the Euler–Maruyama scheme to solve SDDEs (1).

4. Numerical Experiments

In the following numerical examples, for 1 n N , let X k n and X k , t n be the solutions of Scheme 1 and Equation (1) at time t n , respectively. Furthermore, we give the definition of global errors and local errors as follows:
e Δ t g l o b a l : = | 1 M k = 1 M f ( X k N ) f ( X k , t N ) | and e Δ t l o c a l : = | 1 M 1 N k = 1 M n = 1 N f ( X k n ) f ( X k , t n ) | ,
where M = 5000 is the number of sample tracks, and Δ t is uniform-temporal with the time step by T N .
Example 1.
Consider the Mackey–Glass equation with a multiplicative noise:
d X t = [ a X t + b X t τ 1 + X t τ 2 ] d t + σ X t d W t ,
where a > 0 , and b and σ are real parameters. Next, we use Scheme 1 to solve the problem with parameters
a = 3 , b = 1 , σ = 1 , τ = 1 , X t = 1 , t [ 1 , 0 ] .
We approximate the “true solution” using the Euler–Maruyama method with a sufficiently small step size (here, Δ t = 2 10 ). In Table 1, we compare the errors, convergence rates (CR for short) and operating time of the Euler scheme, Milstein scheme and Scheme 1. The results demonstrate that Scheme 1 exhibits a superior convergence rate. In the left of Figure 1, we depict the numerical solution resulting from Scheme 1 with a step size of Δ t = 1 32 , alongside a sample path’s “true solution”. We obtain the mean-square convergence stability result of global errors to test stability in the right of Figure 1. The numerical results here are consistent with the results we established regarding convergence and stability.
Example 2
(Square of O-U delay process). In this example, we consider nonlinear SDDEs. In order to give nonlinear SDDEs, we first study linear SDDEs:
d X t = { a 1 X t + a 2 X t τ } d t + b d W t , t [ 0 , T ] , X t = 1 + t , t [ τ , 0 ] ,
with the terminal time T = 2 τ = 2 .
By using the Itô formula with respect to X t 2 , we deduce
d ( X t 2 ) = 2 X t ( a 1 X t + a 2 X t τ ) + 0.5 × 2 b 2 d t + 2 b X t d W t = b 2 + 2 a 1 X t 2 + 2 a 2 X t X t τ d t + 2 b X t d W t .
Assuming Y t = X t 2 , we have
d Y t = { b 2 + 2 a 1 Y t + 2 a 2 Y t Y t τ } d t + 2 b Y t d W t .
Therefore, we obtain the following nonlinear models for SDDEs:
d Y t = { b 2 + 2 a 1 Y t + 2 a 2 Y t Y t τ } d t + 2 b Y t d W t , t [ 0 , T ] , Y t = X t 2 , t [ τ , 0 ] .
Based on the explicit solution of Equation (55), we have the explicit solution of Equation (56) on t [ 0 , 1 ] :
Y t = X t 2 = X 0 e a 1 t + e a 1 t 0 t a 2 s e a 1 s d s + b e a 1 t 0 t e a 1 s d W s 2 ,
where X t has normal distribution N h ( t ) , σ ( t ) with the mean value h ( t ) = X 0 e a 1 t a 2 a 1 t e a 1 t a 2 a 1 2 e a 1 t 1 and the variance σ ( t ) = b 2 2 a 1 e 2 a 1 t 1 . Next, we obtain the solution of Equation (56) on t [ 1 , 2 ] :
Y t = X t 2 = X 1 e a 1 ( t 1 ) + e a 1 t 1 t a 2 X s 1 e a 1 s d s + b e a 1 t 1 t e a 1 s d W s 2 .
In this experiment, we give nonlinear SDDEs by the (O-U) process for linear SDDEs and study the property of the nonlinear SDDEs with the parameters of a 1 = 2 , a 2 = 1.7 and b = 0.01 . In Table 2, we present the error and convergence results for Example 2. For a more intuitive display, the plots of errors result with respect to N are drawn in the left of Figure 2, which implies that the experimental results are in agreement with the theoretical results. In addition, we obtain the mean-square convergence stability result of global errors with times steps Δ t = 1 16 , Δ t = 1 32 and Δ t = 1 64 , which are shown in the right of Figure 2.
Example 3.
Consider the linear SDDE with a time-varying delay:
d X t = { a 1 X t + a 2 X t τ ( t ) } d t + { b 1 + b 2 X t τ ( t ) } d W t , t [ 0 , T ] , X t = ψ ( t ) , t [ τ , 0 ]
where τ ( t ) = 1 + t 2 and the terminal time T = 2 . Next, we give the solution of Equation (57) on t [ 0 , 1 ] :
X t = X 0 e a 1 t + e a 1 t 0 t a 2 ψ ( s τ ( s ) ) e a 1 s d s + e a 1 t 0 t ( b 1 + b 2 ψ ( s τ ( s ) ) ) e a 1 s d W s .
Next, we utilize Equation (58) to obtain a solution on t [ 1 , 2 ] . Therefore, Equation (57) has the solution
X t = X 1 e a 1 ( t 1 ) + e a 1 t 1 t a 2 X s τ ( s ) e a 1 s d s + e a 1 t 1 t ( b 1 + b 2 X s τ ( s ) ) e a 1 s d W s .
In this example, we assume N { 2 2 , 2 3 , 2 4 , 2 5 , 2 6 } . We test the convergence rate and errors of Scheme 1 by setting the delay function ψ ( t ) = 1 + t , a 1 = 1 , a 2 = 1 , b 1 = 0.01 , b 2 = 0.01 ; the error and convergence results are provided in Table 3. As expected, Scheme 1 can obtain global second-order and local third-order convergence rates, which are in agreement with theoretical results. We also plot the lines of average local errors (Avg.Local Errors for short) and global errors with respect to the steps N in the left of Figure 3. Furthermore, the figure intuitively displays that the theoretical results are correct. For three different time steps Δ t = 1 4 , Δ t = 1 8 and Δ t = 1 16 , we obtain the mean-square convergence stability result of global errors in the right of Figure 3.
Example 4.
Consider the following two-dimensional linear SDDEs:
d X t = λ 0 0 λ X t d t + 0 σ σ 0 X t τ d W t , t [ 0 , T ] , X t = ψ ( t ) , t [ τ , 0 ] ,
where τ = 1 and the terminal time T = 1 . Next, we use Scheme 1 to solve the problem with parameters
λ = 4 , σ = 0.3 , ψ ( t ) = ( 1 + t , 1 + t ) T .
In this example, it is not a simple decoupled SDDE, so it cannot be regarded as a scalar equation. With an assumption of N { 16 , 32 , 64 , 128 , 256 } , we simulate and calculate the convergence rates and errors of Scheme 1; the error and convergence results are provided in Table 4. It is gratifying that Scheme 1 can obtain global second-order and local third-order convergence rates. We also plot the lines of average local errors (Avg. Local Errors for short) and global errors with respect to the steps N in the left of Figure 4. For three different time steps Δ t = 1 16 , Δ t = 1 32 and Δ t = 1 64 , we obtain the mean-square convergence stability result of global errors in the right of Figure 4. The figure intuitively displays that the theoretical results are correct.

5. Conclusions

A simplified numerical method is developed to solve SDDEs, which involves no multiple stochastic Itô-type integrals and can be easily used to solve multidimensional SDDEs. Based on the theory of Malliavin derivatives, we introduce a novel weak local convergence lemma for multiple random integrals, deriving the connecting inequality between Theorems 1 and 2. We rigorously establish in two steps that Scheme 1 exhibits a global weak second-order convergence rate. Furthermore, we present four distinct numerical examples to illustrate the efficiency, mean-square stability and convergence rates of the simplified weak high-order numerical method. Additionally, we included a dedicated discussion section to provide a detailed comparison of our approach with other existing methods in terms of computational time. According to the above experiments, we can obtain that the new scheme has the most precision of all schemes but costs more time. In future work, we will investigate higher-order numerical methods for solving SDDEs.

Author Contributions

Conceptualization, Y.L.; methodology, Y.L.; software, Q.X. and Y.Z.; validation, Y.L., Q.X., Y.X. and Y.Z.; formal analysis, Y.L. and Q.X.; investigation, Y.L., Q.X., Y.X. and Y.Z.; resources, Y.L.; data curation, Y.L., Q.X., Y.X. and Y.Z.; writing—original draft preparation, Y.L. and Q.X.; writing—review and editing, Y.L., Q.X., Y.X. and Y.Z.; visualization, Y.X.; supervision, Y.L.; project administration, Y.L.; funding acquisition, Y.L. All authors have read and agreed to the published version of the manuscript.

Funding

This research was funded by the National Natural Science Foundation of China grant number No. 11501366 and Research Project on Teacher Development of University of Shanghai for Science and Technology grant number: CFTD2023YB38.

Data Availability Statement

Data are contained within the article.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Izadi, M.; Srivastava, H.M. An efficient approximation technique applied to a non-linear Lane–Emden pantograph delay differential model. Appl. Math. Comput. 2021, 401, 126123. [Google Scholar] [CrossRef]
  2. Paola, M.D.; Pirrotta, A. Time delay induced effects on control of linear systems under random excitation. Probab. Eng. Mech. 2001, 16, 43–51. [Google Scholar] [CrossRef]
  3. Tsimring, L.S.; Pikovsky, A. Noise-induced dynamics in bistable systems with delay. Phy. Rev. Lett. 2001, 87, 250602. [Google Scholar] [CrossRef] [PubMed]
  4. Beretta, E.; Kolmanovskii, V.B.; Shaikhet, L. Stability of epidemic model with time delays influenced by stochastic perturbations. Math. Comput. Simul. 1998, 45, 269–277. [Google Scholar] [CrossRef]
  5. Beuter, A.; Belair, J. Feedback and delays in neurological diseases: A modeling study using dynamical systems. Bull. Math. Biol. 1993, 55, 525–541. [Google Scholar] [CrossRef]
  6. Chang, M.H.; Youree, R.K. The European option with hereditary price structures: Basic theory. Appl. Math. Comput. 1999, 102, 279–296. [Google Scholar] [CrossRef]
  7. Ain, Q.; Wang, J. A stochastic analysis of co-infection model in a finite carrying capacity population. Int. J. Biomath. 2023, 235–833. [Google Scholar] [CrossRef]
  8. Buckwar, E. Introduction to the numerical analysis of stochastic delay differential equations. J. Comput. Appl. Math. 2000, 125, 297–307. [Google Scholar] [CrossRef]
  9. Sykora, H.T.; Bachrathy, D.; Stepan, G. Stochastic semi-discretization for linear stochastic delay differential equations. Int. J. Numer. Methods. Eng. 2019, 119, 879–898. [Google Scholar] [CrossRef]
  10. Mao, X.; Sabanis, S. Numerical solutions of stochastic differential delay equations under local Lipschitz condition. J. Comput. Appl. Math. 2003, 151, 215–227. [Google Scholar] [CrossRef]
  11. Mao, X. Stochastic Differential Equations and Applications; Horwood Publising: Chichester, UK, 1997. [Google Scholar]
  12. Baker, C.T.H.; Buckwar, E. Numerical analysis of explicit one-step methods for stochastic delay differential equations. LMS J. Comput. Appl. Math. 2000, 3, 315–335. [Google Scholar] [CrossRef]
  13. Cao, W.; Liu, M.; Fan, Z. MS-stability of the Euler–Maruyama method for stochastic differential delay equations. Appl. Math. Comput. 2004, 159, 127–135. [Google Scholar] [CrossRef]
  14. Lan, G.; Wang, Q. Strong convergence rates of modified truncated EM methods for neutral stochastic differential delay equations. J. Comput. Appl. Math. 2019, 362, 83–98. [Google Scholar] [CrossRef]
  15. Wang, X.; Gan, S.; Wang, D. θ-Maruyama methods for nonlinear stochastic differential delay equations. Appl. Numer. Math. 2015, 98, 38–58. [Google Scholar] [CrossRef]
  16. Cao, W.; Hao, P.; Zhang, Z. Split-step θ-method for stochastic delay differential equations. Appl. Numer. Math. 2014, 76, 19–33. [Google Scholar] [CrossRef]
  17. Buckwar, E.; Winkler, R. Multi-Step Maruyama Methods for Stochastic Delay Differential Equations. Stoch. Anal. Appl. 2007, 25, 933–959. [Google Scholar] [CrossRef]
  18. Guo, Q.; Qiu, M.; Mitsui, T. Asymptotic mean-square stability of explicit Runge–Kutta Maruyama methods for stochastic delay differential equations. J. Comput. Appl. Math. 2016, 296, 427–442. [Google Scholar] [CrossRef]
  19. Abbaszadeh, M.; Khodadadian, A.; Parvizi, M.; Dehghan, M.; Heitzinger, C. A multilevel Monte Carlo finite element method for the stochastic Cahn-Hilliard-Cook equation. Comput. Mech. 2019, 64, 937–949. [Google Scholar]
  20. Abbaszadeh, M.; Khodadadian, A.; Parvizi, M.; Dehghan, M.; Heitzinger, C. A direct meshless local collocation method for solving stochastic Cahn-Hilliard-Cook and stochastic Swift–Hohenberg equations. Eng. Anal. Bound. Elem. 2019, 98, 253–264. [Google Scholar] [CrossRef]
  21. Mao, X.; Yuan, C. Stochastic Differential Equation with Markovian Switching; Imperial College Press: London, UK, 2006. [Google Scholar]
  22. Mao, X. Numerical solutions of stochastic differential delay equations under the generalized Khasminskii-type conditions. Appl. Math. Comput. 2011, 217, 5512–5524. [Google Scholar] [CrossRef]
  23. Kloeden, P.; Platen, E. Numerical Solution of Stochastic Differential Equations; Springer: Berlin/Heidelberg, Germany, 1992. [Google Scholar]
  24. Abdulle, A.; Li, T. S-ROCK methods for stiff Itô SDEs. Commun. Math. Sci. 2008, 6, 845–868. [Google Scholar] [CrossRef]
  25. Komori, Y.; Burrag, K. Weak second order S-ROCK methods for Stratonovich stochastic differential equation. J. Comput. Appl. Math. 2012, 236, 2895–2908. [Google Scholar] [CrossRef]
  26. Li, Y.; Yang, J.; Zhao, W. A New Second-Order One-Step Scheme for Solving Decoupled FBSDEs and Optimal Error Estimates. East Asian J. Appl. Math 2020, 10, 354–380. [Google Scholar]
  27. Nualart, D. The Malliavin Calculus and Related Topics; Springer: Berlin/Heidelberg, Germany, 2006. [Google Scholar]
Figure 1. (Left) Path simulation; (Right) mean-square stability with different time steps Δ t = 1 8 , Δ t = 1 16 and Δ t = 1 32 .
Figure 1. (Left) Path simulation; (Right) mean-square stability with different time steps Δ t = 1 8 , Δ t = 1 16 and Δ t = 1 32 .
Symmetry 16 00685 g001
Figure 2. (Left) The plots of global and average local errors with respect to the steps N; (Right) mean-square stability with different time steps Δ t = 1 16 , Δ t = 1 32 and Δ t = 1 64 .
Figure 2. (Left) The plots of global and average local errors with respect to the steps N; (Right) mean-square stability with different time steps Δ t = 1 16 , Δ t = 1 32 and Δ t = 1 64 .
Symmetry 16 00685 g002
Figure 3. (Left) The plots of global and average local errors with respect to the steps N; (Right) mean-square stability with different time steps Δ t = 1 4 , Δ t = 1 8 and Δ t = 1 16 .
Figure 3. (Left) The plots of global and average local errors with respect to the steps N; (Right) mean-square stability with different time steps Δ t = 1 4 , Δ t = 1 8 and Δ t = 1 16 .
Symmetry 16 00685 g003
Figure 4. (Left) The plots of global and average local errors with respect to the steps N; (Right) mean-square stability with different time steps Δ t = 1 16 , Δ t = 1 32 and Δ t = 1 64 .
Figure 4. (Left) The plots of global and average local errors with respect to the steps N; (Right) mean-square stability with different time steps Δ t = 1 16 , Δ t = 1 32 and Δ t = 1 64 .
Symmetry 16 00685 g004
Table 1. The results of global convergence rates and errors for three schemes in Example 1.
Table 1. The results of global convergence rates and errors for three schemes in Example 1.
N163264128256CRTime(s)
Euler scheme1.433 × 10 2 7.032 × 10 3 3.548 × 10 3 1.766 × 10 3 6.773 × 10 4 1.0790.3337
Milstein scheme1.380 × 10 2 6.319 × 10 3 3.238 × 10 3 1.771 × 10 3 5.928 × 10 4 1.0920.3581
Scheme 11.293 × 10 2 3.240 × 10 3 1.049 × 10 3 3.375 × 10 4 2.805 × 10 5 2.0960.3608
Table 2. The results of convergence rates and errors with constant parameters in Example 2.
Table 2. The results of convergence rates and errors with constant parameters in Example 2.
NAvg.Local ErrorsCRGlobal ErrorsCR
81.576 × 10 1 8.102 × 10 2
162.073 × 10 2 2.92641.998 × 10 2 2.0196
322.444 × 10 3 3.00545.076 × 10 3 1.9991
642.841 × 10 4 3.04311.261 × 10 3 1.9985
1283.415 × 10 5 3.05333.384 × 10 4 1.9790
Table 3. The results of convergence rates and errors with constant parameters in Example 3.
Table 3. The results of convergence rates and errors with constant parameters in Example 3.
NAvg.Local ErrorsCRGlobal ErrorsCR
41.494 × 10 3 6.060 × 10 3
81.621 × 10 4 3.20401.290 × 10 3 2.2323
161.918 × 10 5 3.14183.060 × 10 4 2.1539
322.737 × 10 6 3.03598.224 × 10 5 2.0686
643.020 × 10 7 3.04352.275 × 10 5 2.0086
Table 4. The results of convergence rates and errors with constant parameters in Example 4.
Table 4. The results of convergence rates and errors with constant parameters in Example 4.
NAvg.Local ErrorsCRGlobal ErrorsCR
166.267 × 10 4 1.002 × 10 2
326.059 × 10 5 3.37061.939 × 10 3 2.3701
647.003 × 10 6 3.24184.482 × 10 4 2.2416
1288.830 × 10 7 3.15261.132 × 10 4 2.1519
2561.207 × 10 7 3.07843.747 × 10 5 2.0796
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

Li, Y.; Xu, Q.; Xin, Y.; Zhang, Y. New Order 2.0 Simplified Weak Itô–Taylor Symmetrical Scheme for Stochastic Delay Differential Equations. Symmetry 2024, 16, 685. https://doi.org/10.3390/sym16060685

AMA Style

Li Y, Xu Q, Xin Y, Zhang Y. New Order 2.0 Simplified Weak Itô–Taylor Symmetrical Scheme for Stochastic Delay Differential Equations. Symmetry. 2024; 16(6):685. https://doi.org/10.3390/sym16060685

Chicago/Turabian Style

Li, Yang, Qianhai Xu, Yifei Xin, and Yu Zhang. 2024. "New Order 2.0 Simplified Weak Itô–Taylor Symmetrical Scheme for Stochastic Delay Differential Equations" Symmetry 16, no. 6: 685. https://doi.org/10.3390/sym16060685

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