Next Article in Journal
Very Large Angular Oscillations (Up to 3π/4) of the Physical Pendulum—A Simple Trigonometric Analytical Solution
Previous Article in Journal
Carbon Price Prediction and Risk Assessment Considering Energy Prices Based on Uncertain Differential Equations
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Numerical Approximation for a Stochastic Caputo Fractional Differential Equation with Multiplicative Noise

School of Computer and Engineering Sciences, University of Chester, Chester CH1 4BJ, UK
*
Author to whom correspondence should be addressed.
These authors contributed equally to this work.
Mathematics 2025, 13(17), 2835; https://doi.org/10.3390/math13172835
Submission received: 8 June 2025 / Revised: 10 August 2025 / Accepted: 24 August 2025 / Published: 3 September 2025

Abstract

We investigate a numerical method for approximating stochastic Caputo fractional differential equations driven by multiplicative noise. The nonlinear functions f and g are assumed to satisfy the global Lipschitz conditions as well as the linear growth conditions. The noise is approximated by a piecewise constant function, yielding a regularized stochastic fractional differential equation. We prove that the error between the exact solution and the solution of the regularized equation converges in the L 2 ( ( 0 , T ) × Ω ) norm with an order of O ( Δ t α 1 / 2 ) , where α ( 1 / 2 , 1 ] is the order of the Caputo fractional derivative, and Δ t is the time step size. Numerical experiments are provided to confirm that the simulation results are consistent with the theoretical convergence order.

1. Introduction

Consider the stochastic Caputo fractional differential equation driven by a multiplicative noise, with α ( 1 / 2 , 1 ] , written as follows [1]:
D t α 0 C u ( t ) = f ( t , u ( t ) ) + g ( t , u ( t ) ) d W ( t ) d t , t ( 0 , T ] , u ( 0 ) = u 0 ,
where u 0 R is a random variable and W ( t ) represents the real-valued Brownian motion, defined on a probability space ( Ω , F , P ) . Here, D t α 0 C v ( t ) denotes the Caputo fractional derivative, written as follows [2]:
D t α 0 C v ( t ) = 1 Γ ( 1 α ) 0 t ( t τ ) α v ( τ ) d τ .
The nonlinear functions f ( t , x ) and g ( t , x ) satisfy the global Lipschitz conditions and the linear growth conditions, written as follows:
| f ( t , x ) f ( t , y ) | C | x y | , | g ( t , x ) g ( t , y ) | C | x y | , x , y R , | f ( t , x ) | C ( 1 + | x | ) , | g ( t , x ) | C ( 1 + | x | ) , x R .
By integrating (1) with order α ( 1 / 2 , 1 ] , we obtain the following stochastic Volterra integral equation (SVIE):
u ( t ) = u 0 + 1 Γ ( α ) 0 t ( t ζ ) α 1 f ( ζ , u ( ζ ) ) d ζ + 1 Γ ( α ) 0 t ( t ζ ) α 1 g ( ζ , u ( ζ ) ) d W ( ζ ) , t [ 0 , T ] .
In this paper, we shall consider the following more general stochastic Volterra integral equations (SVIEs) characterized by a weakly singular kernel of the type, with β ( 1 / 2 , 1 ] [1]:
u ( t ) = u 0 + 1 Γ ( α ) 0 t ( t ζ ) α 1 f ( ζ , u ( ζ ) ) d ζ + 1 Γ ( β ) 0 t ( t ζ ) β 1 g ( ζ , u ( ζ ) ) d W ( ζ ) , t [ 0 , T ] .
We remark that when α = β , the Equation (4) reduces to (3) which have been studied in [3,4].
When the singular kernels ( t ζ ) 1 α and ( t ζ ) 1 β are replaced by smoother functions, numerical methods for stochastic Volterra integral equations (SVIEs) (4) have been studied in recent years. Tudor and Tudor [5] established strong convergence rates for one-step approximations of SVIEs in the mean-square sense. Wen and Zhang [6] improved the rectangular method for SVIEs, proving first-order convergence. Wang [7] approximated SVIE solutions through related SDEs and proposed two numerical schemes: the stochastic theta method and the splitting method. Xiao et al. [8] developed a split-step collocation method with a convergence order of 1 / 2 . The work done by Liang et al. [9] showed that the Euler–Maruyama (EM) method can attain superconvergence of order 1 under certain boundary conditions on the diffusion kernel. Recent studies have extended Euler schemes to broader classes, including SVIEs with delays, stochastic Volterra integro-differential equations, and stochastic fractional integro-differential equations; see [10,11,12,13,14] for further developments.
Li et al. [1] analyze stochastic Volterra integral equations with weakly singular kernels, proving existence, uniqueness, and Hölder continuity of solutions. They propose two numerical schemes, the Euler–Maruyama and Milstein methods. Both methods derive strong convergence rates in the L p -norm. Specifically, the Euler–Maruyama scheme converges at rate min { 1 α , β 1 / 2 } , while the Milstein scheme achieves min { 1 α , 2 β 1 } for 1 / 2 < α 1 and 1 / 2 < β 1 . These rates differ significantly from those for equations with regular kernels, due to the absence of a standard Itô formula, which is instead handled via Taylor expansions. Kamrani [15] studies stochastic fractional differential equations (SFDEs) with additive noise, written as follows:
D t α 0 C u ( t ) = f ( t , u ( t ) ) + 0 t g ( t , s ) d W ( s ) , t ( 0 , T ] , u ( 0 ) = u 0 ,
where α ( 1 / 2 , 1 ] . Applying the Galerkin method based on orthogonal polynomials such as Jacobi polynomials, convergence of order 1 is established, supported by numerical experiments demonstrating efficiency. The work [16] considers SFDEs driven by integrated multiplicative noise with Caputo derivatives,
D t α 0 C u ( t ) = f ( t , u ( t ) ) + 0 t g ( t , u ( s ) ) d W ( s ) , t ( 0 , T ] , u ( 0 ) = u 0 ,
approximating the noise with piecewise constant functions and proving an error bound of order α ( 1 / 2 , 1 ] in the L 2 ( ( 0 , T ) × Ω ) norm (see references [17,18,19,20,21]), etc.
In this paper, we propose a new numerical method for solving Equation (4) by approximating the noise using a piecewise constant function, leading to a regularized stochastic Volterra integral equation. We observe that the solution of (6) is significantly more regular than that of (4). As a result, the analysis of the numerical method for solving (4) is more technically involved than for (6).
Let us briefly summarize the main results presented in this paper and highlight its novel contributions.
Consider a partition written as follows:
0 = t 0 < t 1 < t 2 < < t N 1 < t N = T ,
of the interval [ 0 , T ] , where Δ t denotes the time step size. To handle the stochastic term, we approximate the white noise d W ( t ) d t by the following piecewise constant function d W ^ ( t ) d t , as introduced in [15], for t [ 0 , t n ] , n = 1 , 2 , , N :
d W ^ ( t ) d t = W ( t 1 ) W ( t 0 ) Δ t Δ t · η 1 Δ t , t [ t 0 , t 1 ) , W ( t 2 ) W ( t 1 ) Δ t Δ t · η 2 Δ t , t [ t 1 , t 2 ) , W ( t n ) W ( t n 1 ) Δ t Δ t · η n Δ t , t [ t n 1 , t n ) ,
where η i N ( 0 , 1 ) , i = 1 , 2 , , n are the independent normally distributed random variables. For simplicity, we can express d W ^ ( t ) d t as the following:
d W ^ ( t ) d t = i = 1 n Δ t χ i ( t ) η i Δ t = i = 1 n χ i ( t ) η i Δ t ,
where
χ i ( t ) = 1 , t [ t i 1 , t i ) , 0 , otherwise .
We then obtain the following regularized stochastic Volterra integral equation corresponding to (4), with t = t n :
u ^ ( t ) = u 0 + 0 t f ( ζ , u ^ ( ζ ) ) ( t ζ ) 1 α d ζ + 0 t g ( ζ , u ^ ( ζ ) ) ( t ζ ) 1 β d W ^ ( ζ ) d ζ d ζ ,
which can be equivalently rewritten in the following form, with t = t n :
u ^ ( t ) = u 0 + 0 t f ( ζ , u ^ ( ζ ) ) ( t ζ ) 1 α d ζ + j = 0 n 1 t j t j + 1 g ( ζ , u ^ ( ζ ) ) ( t ζ ) 1 β t j t j + 1 d W ( ζ 1 ) Δ t d ζ = u 0 + 0 t f ( ζ , u ^ ( ζ ) ) ( t ζ ) 1 α d ζ + j = 0 n 1 t j t j + 1 g ( ζ 1 , u ^ ( ζ 1 ) ) ( t n ζ 1 ) 1 β t j t j + 1 d W ( ζ ) Δ t d ζ 1 = u 0 + 0 t f ( ζ , u ^ ( ζ ) ) ( t ζ ) 1 α d ζ + j = 0 n 1 t j t j + 1 1 Δ t t j t j + 1 ( t n ζ 1 ) β 1 g ( ζ 1 , u ^ ( ζ 1 ) ) d ζ 1 d W ( ζ ) .
In Theorem 2, we show that in the case of additive noise, the approximation error is of order O ( Δ t β 1 / 2 ) in the L 2 ( ( 0 , T ) × Ω ) norm, where β ( 1 / 2 , 1 ] . In Theorem 4, we establish that in the case of multiplicative noise, the error also attains the same order O ( Δ t β 1 / 2 ) in the L 2 ( ( 0 , T ) × Ω ) norm.
The main contributions of this paper are summarized as follows:
  • A regularized stochastic Volterra integral equation is derived by approximating the noise with a piecewise constant function.
  • The stability of the regularized stochastic Volterra integral equation is rigorously analyzed.
  • The convergence order of the approximation error is shown to be O ( Δ t β 1 / 2 ) for both additive and multiplicative noise cases, where β ( 1 / 2 , 1 ] .
The paper is organized as follows: In Section 2, we consider the approximation method for the case of additive noise. In Section 3, we extend the analysis to the case of multiplicative noise. Section 4 presents several numerical simulations to verify the theoretical results.
Throughout this paper, we use C > 0 to denote a generic deterministic constant that depends on T but is independent of the time step size Δ t . The value of C may vary from line to line.

2. The Additive Noise Case

In this section, we consider the approximation of (4) for the additive noise case. Assume that g ( ζ , u ( ζ ) ) = g 1 ( ζ ) for ζ [ 0 , T ] in (4), where g 1 satisfies the Lipschitz condition. We first study the regularity of (4).
The following Grönwall Lemma is used in this paper:
Lemma 1
(Grönwall inequality ([15], Lemma 4.1)). Let z : R + R + be a function satisfying, for all t [ 0 , T ] , the inequality, written as follows:
z ( t ) a + K 0 t ( t s ) σ z ( s ) d s ,
with constants a > 0 , K > 0 , and σ > 1 . Then, there exists a constant C = C ( σ , K , T ) such that we obtain the following:
z ( t ) C a , t [ 0 , T ] .
Lemma 2.
Assume that g ( ζ , u ( ζ ) ) = g 1 ( ζ ) for ζ [ 0 , T ] in (4), where g 1 satisfies the Lipschitz condition. Let u ( t ) be the solution of (4). Then, there exists a constant C = C ( T ) such that, with α ( 1 / 2 , 1 ] , β ( 1 / 2 , 1 ] , written as follows:
E | u ( t 2 ) u ( t 1 ) | 2 C ( t 2 t 1 ) min ( 2 α , 2 β 1 ) = C ( t 2 t 1 ) 2 β 1 .
Proof. 
We have obtained the following:
u ( t 2 ) u ( t 1 ) = 0 t 2 ( t 2 ζ ) α 1 f ( ζ , u ( ζ ) ) d ζ 0 t 1 ( t 1 ζ ) α 1 f ( ζ , u ( ζ ) ) d ζ + 0 t 2 ( t 2 ζ ) β 1 g 1 ( ζ ) d W ( ζ ) 0 t 1 ( t 1 ζ ) β 1 g 1 ( ζ ) d W ( ζ ) = I + I I .
For I, see the proof in [16] (Lemma 2), we obtain the following:
E | I | 2 C ( t 2 t 1 ) 2 α 1 + E | u ( 0 ) | 2 C Δ t 2 α .
Now we turn to I I .
I I = 0 t 2 ( t 2 ζ ) β 1 g 1 ( ζ ) d W ( ζ ) 0 t 1 ( t 1 ζ ) β 1 g 1 ( ζ ) d W ( ζ ) = t 1 t 2 ( t 2 ζ ) β 1 g 1 ( ζ ) d W ( ζ ) + 0 t 1 ( t 2 ζ ) β 1 ( t 1 ζ ) β 1 g 1 ( ζ ) d W ( ζ ) = I I 1 + I I 2 .
For I I 1 , using the Itô isometry and the boundedness of g 1 (since g 1 satisfies the Lipschitz condition), we have the following:
E | I I 1 | 2 C t 1 t 2 ( t 2 ζ ) 2 β 2 d ζ C Δ t 2 β 1 .
For I I 2 , we obtain, using the Itô isometry and the boundedness of g 1 , the following:
E | I I 2 | 2 = E 0 t 1 ( t 2 ζ ) β 1 ( t 1 ζ ) β 1 g 1 ( ζ ) d W ( ζ ) 2 C 0 t 1 t 1 t 2 ( x ζ ) β 2 d x 2 d ζ C Δ t t 1 t 2 0 t 1 ( x ζ ) 2 β 4 d ζ d x C Δ t t 1 t 2 ( x t 1 ) 2 β 3 d x C Δ t 2 β 1 .
Hence, we obtain the following:
E | u ( t 2 ) u ( t 1 ) | 2 C ( t 2 t 1 ) 2 β 1 ,
which completes the proof of Lemma 2. □
Theorem 1.
Assume that g ( ζ , u ( ζ ) ) = g 1 ( ζ ) for ζ [ 0 , T ] in (7), where g 1 satisfies the Lipschitz condition. Let u ^ ( t ) be the solution of (7). There holds the following:
E 0 T | u ^ ( t ) | 2 d t C 1 + E | u ^ ( 0 ) | 2 .
Proof. 
This proof follows a similar method found in [15], Theorem 4.2. Note that by (7) we obtain the following:
E 0 T | u ^ ( t ) | 2 d t C E 0 T | u ^ ( 0 ) | 2 d t + C E 0 T 0 t f ( ζ , u ^ ( ζ ) ) ( t ζ ) 1 α d ζ 2 d t + C E 0 T 0 t g ( ζ ) ( t ζ ) 1 β d W ^ ( ζ ) 2 d t I + I I + I I I .
For I I , applying a variable change of v = t ζ , returns the following:
I I = C E 0 T 0 t v α 1 f ( t v , u ^ ( t v ) ) d v 2 d t = C E 0 T 0 T χ [ 0 , t ] ( v ) v α 1 f ( t v , u ^ ( t v ) ) d v 2 d t ,
where χ [ 0 , t ] ( v ) denotes the characteristic function on [ 0 , t ] .
Using the following Minkowski integral inequality, with h L 2 ( ( a , b ) × ( c , d ) ) ,
c d h ( x , y ) d y L x 2 ( a , b ) C c d h ( x , y ) L x 2 ( a , b ) d y = C c d a b | h ( x , y ) | 2 d x 1 / 2 d y ,
we arrive at the following:
I I C 0 T E 0 T | χ [ 0 , t ] ( v ) v α 1 f ( t v , u ^ ( t v ) ) | 2 d t 1 2 d v 2 = C 0 T v α 1 E v T | f ( t v , u ^ ( t v ) ) | 2 d t 1 2 d v 2 = C 0 T v α 1 E 0 T v | f ( ζ , u ^ ( ζ ) ) | 2 d ζ 1 2 d v 2 = C 0 T ( T v ) α 1 E 0 v | f ( ζ , u ^ ( ζ ) ) | 2 d ζ 1 2 d v 2
Using the linear growth assumption for f, we have the following:
I I C 0 T ( T v ) α 1 E 0 v ( 1 + | u ^ ( ζ ) | 2 ) d ζ 1 2 d v 2 = C + C 0 T ( T v ) α 1 0 v E | u ^ ( ζ ) | 2 d ζ 1 2 d v 2 .
Now we estimate I I I . Note that, with t = t n , we obtain the following:
E 0 t ( t ζ ) β 1 g 1 ( ζ ) d W ^ ( ζ ) 2 = E | j = 0 n 1 t j t j + 1 ( t n ζ ) β 1 g 1 ( ζ ) t j t j + 1 d W ( ζ 1 ) Δ t d ( ζ ) | 2 = E | j = 0 n 1 t j t j + 1 1 Δ t t j t j + 1 ( t n ζ ) β 1 g 1 ( ζ ) d ζ d W ( ζ 1 ) | 2 C E j = 0 n 1 t j t j + 1 1 Δ t 2 | t j t j + 1 ( t n ζ ) β 1 g 1 ( ζ ) d ζ | 2 d ζ 1 .
Applying Cauchy–Schwarz inequality, we have the following:
E 0 t ( t ζ ) β 1 g 1 ( ζ ) d W ^ ( ζ ) 2 C E j = 0 n 1 t j t j + 1 1 Δ t 2 Δ t t j t j + 1 ( t n ζ ) 2 β 2 g 1 2 ( ζ ) d ζ d ζ 1 = C E j = 0 n 1 t j t j + 1 ( t n ζ ) 2 β 2 g 1 2 ( ζ ) d ζ = C E 0 t n ( t n ζ ) 2 β 2 g 1 2 ( ζ ) d ζ .
Hence, we obtain the following:
I I I = E 0 T 0 t ( t ζ ) β 1 g 1 ( ζ ) d W ^ ( ζ ) 2 d t C E 0 T 0 t ( t ζ ) 2 β 2 g 1 2 ( ζ ) d ζ d t = C E 0 T 0 t v 2 β 2 g 1 2 ( t v ) d v d t = C E 0 T 0 T χ [ 0 , t ] ( v ) v 2 β 2 g 1 2 ( t v ) d v d t = C E 0 T 0 T χ [ 0 , t ] ( v ) v 2 β 2 g 1 2 ( t v ) d t d v = C E 0 T v 2 β 2 v T g 1 2 ( t v ) d t d v = C E 0 T v 2 β 2 0 T v g 1 2 ( ζ ) d ζ d v = C E 0 T ( T v ) 2 β 2 0 v g 1 2 ( ζ ) d ζ d v ,
which implies that, by the bounded assumption of g 1 , the following is valid:
I I I C .
Thus, we obtain the following:
E 0 T | u ^ ( t ) | 2 d t C 1 + E | u ^ ( 0 ) | 2 + C 1 + 0 T ( t ˜ v ) α 1 E 0 v | u ^ ( ζ ) | 2 d ζ 1 2 d v 2 .
Denote u 1 : [ 0 , T ] [ 0 , ) by the following:
u 1 ( v ) = E 0 v | u ^ ( ζ ) | 2 d ζ 1 2 .
Then we have the following:
u 1 ( T ) C 1 + E | u ^ ( 0 ) | 2 1 2 + C 0 T ( T v ) α 1 u 1 ( v ) d v .
Applying Grönwall Lemma, we have the following:
u 1 ( T ) C 1 + E | u ^ ( 0 ) | 2 1 2 ,
and thus we obtain the final result, written as follows:
E 0 T | u ^ ( t ) | 2 d t C 1 + E | u ^ ( 0 ) | 2 .
The proof of Theorem 1 is complete. □
Theorem 2.
Assume that g ( ζ , u ( ζ ) ) = g 1 ( ζ ) for ζ [ 0 , T ] in (4) and (7), where g 1 satisfies the Lipschitz condition. Let u ( t ) and u ^ ( t ) be the solutions of (4) and (7), respectively. Then, we have the following inequality:
E 0 T | u ( t ) u ^ ( t ) | 2 d t C ( Δ t ) 2 β 1 .
Proof. 
The proof follows arguments similar to those in ([15], Theorem 4.3), which treats a slightly different model (5).
Note that the exact solution u ( t ) and the approximate solution u ^ ( t ) of the regularized stochastic fractional differential equation take the following forms, with t = t n :
u ( t ) = u 0 + 0 t f ( ζ , u ( ζ ) ) ( t ζ ) 1 α d ζ + j = 0 n 1 t j t j + 1 1 Δ t t j t j + 1 ( t n ζ ) β 1 g 1 ( ζ ) d ζ 1 d W ( ζ ) .
u ^ ( t ) = u 0 + 0 t f ( ζ , u ^ ( ζ ) ) ( t ζ ) 1 α d ζ + j = 0 n 1 t j t j + 1 1 Δ t t j t j + 1 ( t n ζ 1 ) β 1 g 1 ( ζ 1 ) d ζ 1 d W ( ζ ) .
Denote
e ( t ) = u ( t ) u ^ ( t ) ,
We then have, with t = t n , the following
e ( t ) = 0 t ( t ζ ) α 1 f ( ζ , u ( ζ ) ) f ( ζ , u ^ ( ζ ) ) d ζ + j = 0 n 1 t j t j + 1 1 Δ t t j t j + 1 ( t n ζ ) β 1 g 1 ( ζ ) d ζ 1 1 Δ t t j t j + 1 ( t n ζ 1 ) β 1 g 1 ( ζ 1 ) d ζ 1 d W ( ζ ) .
Thus, with t = t n , we obtain the following:
E 0 T | e ( t ) | 2 d t C E 0 T | 0 t ( t ζ ) α 1 f ( ζ , u ( ζ ) ) f ( ζ , u ^ ( ζ ) d ζ | 2 d t + C E 0 T | j = 0 n 1 t j t j + 1 [ 1 Δ t t j t j + 1 ( t n ζ ) β 1 g 1 ( ζ ) d ζ 1 1 Δ t t j t j + 1 ( t n ζ 1 ) β 1 g 1 ( ζ 1 ) d ζ 1 ] d W ( ζ ) | 2 d t = I + I I .
For I we obtain (see the proof of [16], Theorem 4) the following:
I C Δ t 2 α + C 0 T ( T ν ) α 1 E 0 ν e 2 ( ζ ) d ζ 1 2 d ν 2 .
Now we turn to I I . Note the following:
E | j = 0 n 1 t j t j + 1 [ 1 Δ t t j t j + 1 ( t n ζ ) β 1 g 1 ( ζ ) d ζ 1 1 Δ t t j t j + 1 ( t n ζ 1 ) β 1 g 1 ( ζ 1 ) d ζ 1 ] d W ( ζ ) | 2 C E j = 0 n 1 t j t j + 1 | 1 Δ t t j t j + 1 ( t n ζ ) β 1 g 1 ( ζ ) d ζ 1 1 Δ t t j t j + 1 ( t n ζ 1 ) β 1 g 1 ( ζ 1 ) d ζ 1 | 2 d ζ C E j = 0 n 1 t j t j + 1 | 1 Δ t t j t j + 1 ( t n ζ ) β 1 ( t n ζ 1 ) β 1 g 1 ( ζ ) d ζ 1 | 2 d ζ d t + C E 0 T j = 0 n 1 t j t j + 1 | 1 Δ t t j t j + 1 ( t n ζ 1 ) β 1 g 1 ( ζ ) g 1 ( ζ 1 ) d ζ 1 | 2 d ζ = I I 1 + I I 2 ,
which implies the following:
I I C 0 T ( I I 1 + I I 2 ) d t .
For I I 1 , since g 1 is bounded, we obtain the following
I I 1 = C E j = 0 n 1 t j t j + 1 | 1 Δ t t j t j + 1 ( t n ζ ) β 1 ( t n ζ 1 ) β 1 g 1 ( ζ ) d ζ 1 | 2 d ζ C j = 0 n 1 t j t j + 1 | 1 Δ t t j t j + 1 ( t n ζ ) β 1 ( t n ζ 1 ) β 1 d ζ 1 | 2 d ζ C [ j = 0 n 2 t j t j + 1 | 1 Δ t t j t j + 1 ( t n ζ ) β 1 ( t n ζ 1 ) β 1 d ζ 1 | 2 d ζ + t n 1 t n | 1 Δ t t n 1 t n ( t n ζ ) β 1 ( t n ζ 1 ) β 1 d ζ 1 | 2 d ζ ] = I I 11 + I I 12 .
Now we consider I I 11 .
I I 11 = C j = 0 n 2 t j t j + 1 | 1 Δ t t j t j + 1 ( t n ζ ) β 1 ( t n ζ 1 ) β 1 d ζ 1 | 2 d ζ .
Note the following:
| 1 Δ t t j t j + 1 ( t n ζ ) β 1 ( t n ζ 1 ) β 1 d ζ 1 | 2 C | 1 Δ t t j t j + 1 ζ 1 ζ ( t n τ ) β 2 d τ d ζ 1 | 2 C | 1 Δ t t j t j + 1 ζ 1 t j + 1 ( t n τ ) β 2 d τ d ζ 1 | 2 = C | 1 Δ t t j t j + 1 t j τ ( t n τ ) β 2 d ζ 1 d τ | 2 = C | 1 Δ t t j t j + 1 ( t n τ ) β 2 · ( τ t j ) d τ | 2 C | t j t j + 1 ( t n τ ) β 2 d τ | 2 .
Thus, by the Cauchy–Schwartz Inequality, we obtain the following:
I I 11 C j = 0 n 2 t j t j + 1 | t j t j + 1 ( t n τ ) β 2 d τ | 2 d s C E j = 0 n 2 t j t j + 1 · t j t j + 1 ( t n τ ) 2 β ¯ 4 d τ Δ t d s = C Δ t 2 j = 0 n 2 t j t j + 1 ( t n τ ) 2 β ¯ 4 d τ = C Δ t 2 · t 0 t n 1 ( t n τ ) 2 β ¯ 4 d τ C ( Δ t 2 · Δ t 2 β 3 ) = C Δ t 2 β 1 .
Now for I I 12 , if ζ < ζ 1 , then we have the following:
I I 12 = t n 1 t n | 1 Δ t t n 1 t n ( t n ζ ) β 1 ( t n ζ 1 ) β 1 d ζ 1 | 2 d ζ C t n 1 t n | 1 Δ t t n 1 t n ( t n ζ ) β 1 d ζ 1 | 2 d ζ = C t n 1 t n | 1 Δ t · Δ t β | 2 d ζ C Δ t 2 β 2 · Δ t = C Δ t 2 β 1 .
If ζ > ζ 1 , then we obtain the following:
I I 12 = t n 1 t n | 1 Δ t t n 1 t n ( t n ζ ) β 1 ( t n ζ 1 ) β 1 d ζ 1 | 2 d ζ C t n 1 t n | 1 Δ t t n 1 t n ( t n ζ ) β 1 d ζ 1 | 2 d ζ = C t n 1 t n ( t n ζ ) 2 β 2 d ζ C Δ t 2 β 1 .
Thus for I I 1 we yield the following:
I I 1 = I I 11 + I I 12 C Δ t 2 β 1 .
Now we turn to I I 2 . We have, by the Lipschitz condition assumption of g 1 ( ζ ) , the following:
I I 2 = C E j = 0 n 1 t j t j + 1 | 1 Δ t t j t j + 1 ( t n ζ 1 ) β 1 g 1 ( ζ ) g 1 ( ζ 1 ) d ζ 1 | 2 d ζ C E j = 0 n 1 t j t j + 1 1 Δ t t j t j + 1 ( t n ζ 1 ) 2 β 2 g 1 ( ζ ) g 1 ( ζ 1 ) 2 d ζ 1 d ζ C j = 0 n 1 t j t j + 1 1 Δ t t j t j + 1 ( t n ζ 1 ) 2 β 2 Δ t 2 d ζ 1 d ζ C j = 0 n 1 t j t j + 1 ( t n ζ 1 ) 2 β 2 Δ t 2 d ζ 1 C Δ t 2 0 t n ( t n ζ 1 ) 2 β 2 d ζ 1 C Δ t 2 .
Thus we obtain the following:
I I C 0 T ( I I 1 + I I 2 ) d t C 0 T ( Δ t 2 β 1 + Δ t 2 ) d t C Δ t 2 β 1 .
Therefore we arrive at the following:
E 0 T | e ( t ) | 2 d t C Δ t 2 α + C Δ t 2 β 1 + C 0 T ( T v ) α 1 E 0 v | e ( ζ ) | 2 d ζ 1 2 d v 2 .
Denote u 2 : [ 0 , T ] [ 0 , ) by the following
u 2 ( v ) = E 0 v | u ^ ( ζ ) | 2 d ζ 1 2 .
Then we have the following:
u 2 ( T ) C Δ t α + C Δ t β 1 / 2 + C 0 T ( T v ) α 1 u 2 ( v ) d v .
Applying Grönwall Lemma, we have the following:
u 2 ( T ) C Δ t α + C Δ t β 1 / 2 ,
and thus we obtain the following:
E 0 T | e ( t ) | 2 d t C Δ t min ( 2 α , 2 β 1 ) = C Δ t 2 β 1 .
Combining these estimates, we obtain the following:
E 0 T | u ( t ) u ^ ( t ) | 2 d t C Δ t 2 β 1 .
The proof of Theorem 2 is now complete. □

3. The Multiplicative Noise Case

In this section, we consider the approximation of (4) for the multiplicative noise case. We first analyze the stability of the solution to (7).
Theorem 3.
Let u ^ ( t ) be the solution of (7). Then we have the following:
E 0 T | u ^ ( t ) | 2 d t C 1 + E | u ^ ( 0 ) | 2 .
Proof. 
This proof follows a similar method as in [15], Theorem 4.2. Note that, by (7), we obtain the following:
E 0 T | u ^ ( t ) | 2 d t C E 0 T | u ^ ( 0 ) | 2 d t + C E 0 T 0 t f ( ζ , u ^ ( ζ ) ) ( t ζ ) 1 α d ζ 2 d t + C E 0 T 0 t g ( ζ , u ^ ( ζ ) ) ( t ζ ) 1 β d W ^ ( ζ ) 2 d t = I + I I + I I I .
Case 1: g = 0 , so I I I = 0 .
Following the same estimate as in the proof of Theorem 1, we have the following:
I I C 1 + 0 T ( t ˜ v ) α 1 E 0 v | u ^ ( ζ ) | 2 d ζ 1 2 d v 2 .
Thus, we obtain the following:
E 0 T | u ^ ( t ) | 2 d t C 1 + E | u ^ ( 0 ) | 2 + C 1 + 0 T ( T v ) α 1 E 0 v | u ^ ( ζ ) | 2 d ζ 1 2 d v 2 .
The definition is as follows:
u 1 ( t ) = E 0 t | u ^ ( v ) | 2 d v 1 2 .
Hence, we obtain the following:
u 1 ( T ) C 1 + E | u ^ ( 0 ) | 2 1 2 + C 0 T ( T v ) α 1 u 1 ( v ) d v .
Applying the Grönwall inequality for fractional integrals, we conclude the following:
u 1 ( T ) C 1 + E | u ^ ( 0 ) | 2 1 2 ,
which implies the following:
E 0 T | u ^ ( t ) | 2 d t C 1 + E | u ^ ( 0 ) | 2 .
Case 2: f = 0 , so I I = 0 .
For I I I , following the same argument as in (10), we have the following:
I I I C E 0 T ( T ν ) 2 β 2 0 ν | g ( ζ , u ^ ( ζ ) ) | 2 d ζ d ν C E 0 T ( T ν ) 2 β 2 0 ν 1 + | g ( ζ , u ^ ( ζ ) ) | 2 d ζ d ν C + C 0 T ( T ν ) 2 β 2 0 ν E | u ^ ( ζ ) | 2 d ζ d ν .
Therefore, we obtain the following:
E 0 T | u ^ ( t ) | 2 d t C 1 + E | u ^ ( 0 ) | 2 + C 0 T ( T ν ) 2 β 2 0 ν E | u ^ ( ζ ) | 2 d ζ d ν .
Let the following be valid:
u 2 ( ν ) = 0 ν E | u ^ ( ζ ) | 2 d ζ .
Then we obtain the following:
u 2 ( T ) C 1 + E | u ^ ( 0 ) | 2 + C 0 T ( T ν ) 2 β 2 u 2 ( ν ) d ζ ,
By the Grönwall lemma, we obtain the following:
E 0 T | u ^ ( t ) | 2 d t C 1 + E | u ^ ( 0 ) | 2 .
Together these estimates complete the proof of Thoerem 3. □
We will now consider the regularity of the solution of (4).
Lemma 3.
Let u ( t ) be the solution of (4). Then, we have the following:
E | u ( t 2 ) u ( t 1 ) | 2 C ( t 2 t 1 ) 2 β 1 .
Proof. 
We have the following:
u ( t 2 ) u ( t 1 ) = 0 t 2 ( t 2 ζ ) α 1 f ( ζ , u ( ζ ) ) d ζ 0 t 1 ( t 1 ζ ) α 1 f ( ζ , u ( ζ ) ) d ζ + 0 t 2 ( t 2 ζ ) β 1 g ( ζ , u ( ζ ) ) d W ( ζ ) 0 t 1 ( t 1 ζ ) β 1 g ( ζ , u ( ζ ) ) d W ( ζ ) = I + I I .
For I, following the proof of [16], Lemma 2, we obtain the following:
E | I | 2 C ( t 2 t 1 ) 2 α 1 + E | u ( 0 ) | 2 C Δ t 2 α .
Now we turn to I I .
I I = 0 t 2 ( t 2 ζ ) β 1 g ( ζ , u ( ζ ) ) d W ( ζ ) 0 t 1 ( t 1 ζ ) β 1 g ( ζ , u ( ζ ) ) d W ( ζ ) 0 t 2 ( t 2 ζ ) β 1 g ( ζ , u ( ζ ) ) d W ( ζ ) 0 t 1 ( t 2 ζ ) β 1 g ( ζ , u ( ζ ) ) d W ( ζ ) + 0 t 1 ( t 2 ζ ) β 1 g ( ζ , u ( ζ ) ) d W ( ζ ) 0 t 1 ( t 1 ζ ) β 1 g ( ζ , u ( ζ ) ) d W ( ζ ) = I I 1 + I I 2 .
For I I 1 , we have the following:
E | I I 1 | 2 = E | 0 t 2 ( t 2 ζ ) β 1 g ( ζ , u ( ζ ) ) d W ( ζ ) 0 t 1 ( t 2 ζ ) β 1 g ( ζ , u ( ζ ) ) d W ( ζ ) | 2 E | t 1 t 2 ( t 2 ζ ) β 1 g ( ζ , u ( ζ ) ) d W ( ζ ) | 2 .
Using the Itô isometry property, we obtain the following:
E | I I 1 | 2 t 1 t 2 | ( t 2 ζ ) β 1 | 2 · E | g ( ζ , u ( ζ ) ) | 2 d ζ .
It is easy to show that E | u ( t ) | 2 is uniformally bounded. We then have the following:
E | I I 1 | 2 C t 1 t 2 ( t 2 ζ ) 2 β 2 d ζ C Δ t 2 β 1 .
For I I 2 , we obtain the following:
E | I I 2 | 2 = E | 0 t 1 ( t 2 ζ ) β 1 g ( ζ , u ( ζ ) ) d W ( ζ ) 0 t 1 ( t 1 ζ ) β 1 g ( ζ , u ( ζ ) ) d W ( ζ ) | 2 = E | 0 t 1 ( t 2 ζ ) β 1 ( t 1 ζ ) β 1 g ( ζ , u ( ζ ) ) d W ( ζ ) | 2 .
Applying the Itô isometry property, we yield the following:
E | I I 2 | 2 C 0 t 1 ( t 2 ζ ) β 1 ( t 1 ζ ) β 1 2 E | g ( ζ , u ( ζ ) ) | 2 d ζ .
Noting again the boundedness of E | u ( t ) | 2 , we arrive at the following:
E | I I 2 | 2 C 0 t 1 t 1 t 2 ( x ζ ) β 2 d x 2 d ζ C 0 t 1 · Δ t t 1 t 2 ( x ζ ) 2 ( β 2 ) d x d ζ = C Δ t t 1 t 2 0 t 1 ( x ζ ) 2 β 4 d ζ d x C Δ t · t 1 t 2 ( x t 1 ) 2 β 3 d x C Δ t 2 β 1 .
Hence, we obtain the following:
E | u ( t 2 ) u ( t 1 ) | 2 C ( t 2 t 1 ) 2 β 1 ,
which completes the proof of Lemma 3. □
Remark 1.
The difference between Lemma 2 and Lemma 3 is as follows: Lemma 2 considers the case for (4) driven by additive noise with g ( ζ , u ( ζ ) ) = g 1 ( ζ ) , whereas Lemma 3 considers the case for (4) driven by multiplicative noise. Both cases yield the same regularity order O ( Δ t β 1 / 2 , β ( 1 / 2 , 1 ] .
Now, we introduce the main theorem in this section.
Theorem 4.
Let u ( t ) and u ^ ( t ) be the solutions of (4) and (7), respectively. Then, we have the following:
E 0 T | u ( t ) u ^ ( t ) | 2 d t C Δ t 2 β 1 .
Proof. 
Note that the exact solution u ( t ) and the approximate solution u ^ ( t ) of the regularized stochastic fractional differential equation take the following forms, with t = t n
u ( t ) = u 0 + 0 t f ( ζ , u ( ζ ) ) ( t ζ ) 1 α d ζ + j = 0 n 1 t j t j + 1 1 Δ t t j t j + 1 ( t n ζ ) β 1 g ( ζ , u ( ζ ) ) d ζ 1 d W ( ζ ) .
u ^ ( t ) = u 0 + 0 t f ( ζ , u ^ ( ζ ) ) ( t ζ ) 1 α d ζ + j = 0 n 1 t j t j + 1 1 Δ t t j t j + 1 ( t n ζ 1 ) β 1 g ( ζ 1 , u ^ ( ζ 1 ) ) d ζ 1 d W ( ζ ) .
Denote this as the following:
e ( t ) = u ( t ) u ^ ( t ) .
Then, e ( t ) satisfies the following equation:
e ( t ) = 0 t ( t ζ ) α 1 f ( ζ , u ( ζ ) ) f ( ζ , u ^ ( ζ ) ) d ζ + j = 0 n 1 t j t j + 1 [ 1 Δ t t j t j + 1 ( t n ζ ) β 1 g ( ζ , u ( ζ ) ) d ζ 1 1 Δ t t j t j + 1 ( t n ζ 1 ) β 1 g ( ζ 1 , u ^ ( ζ 1 ) ) d ζ 1 ] d W ( ζ ) ,
which implies the following:
E 0 T | e ( t ) | 2 d t C E 0 T | 0 t ( t ζ ) α 1 f ( ζ , u ( ζ ) ) f ( ζ , u ^ ( ζ ) d ζ | 2 d t + C E 0 T | j = 0 n 1 t j t j + 1 [ 1 Δ t t j t j + 1 ( t n ζ ) β 1 g ( ζ , u ( ζ ) ) d ζ 1 1 Δ t t j t j + 1 ( t n ζ 1 ) β 1 g ( ζ 1 , u ( ζ 1 ) ) d ζ 1 ] d W ( ζ ) | 2 d t = I + I I .
For I we obtain (see proof of [16], Theorem 4) the following:
I C Δ t 2 α + C 0 T ( T ν ) α 1 E 0 ν e 2 ( ζ ) d ζ 1 2 d ν 2 .
Now, we turn to I I . Note the the following:
E | j = 0 n 1 t j t j + 1 [ 1 Δ t t j t j + 1 ( t n ζ ) β 1 g ( ζ , u ( ζ ) ) d ζ 1 1 Δ t t j t j + 1 ( t n ζ 1 ) β 1 g ( ζ 1 , u ^ ( ζ 1 ) ) d ζ 1 ] d W ( ζ ) | 2 C E j = 0 n 1 t j t j + 1 | 1 Δ t t j t j + 1 ( t n ζ ) β 1 g ( ζ , u ( ζ ) ) d ζ 1 1 Δ t t j t j + 1 ( t n ζ 1 ) β 1 g ( ζ 1 , u ( ζ 1 ) ) d ζ 1 | 2 d ζ C E j = 0 n 1 t j t j + 1 | 1 Δ t t j t j + 1 ( t n ζ ) β 1 ( t n ζ 1 ) β 1 g ( ζ , u ( ζ ) ) d ζ 1 | 2 d ζ + C E j = 0 n 1 t j t j + 1 | 1 Δ t t j t j + 1 ( t n ζ 1 ) β 1 g ( ζ , u ( ζ ) ) g ( ζ 1 , u ^ ( ζ 1 ) ) d ζ 1 | 2 d ζ = I I 1 + I I 2 ,
which implies the following:
I I C 0 T ( I I 1 + I I 2 ) d t .
Following the same argument as in the proof of Theorem 2, we have the following:
I I 1 C Δ t 2 β 1 .
Now we turn to consider I I 2 .
I I 2 = C E j = 0 n 1 t j t j + 1 | 1 Δ t t j t j + 1 ( t n ζ 1 ) β 1 g ( ζ , u ( ζ ) ) g ( ζ 1 , u ^ ( ζ 1 ) ) d ζ 1 | 2 d ζ C E j = 0 n 1 t j t j + 1 | 1 Δ t t j t j + 1 ( t n ζ 1 ) β 1 g ( ζ 1 , u ( ζ 1 ) ) g ( ζ 1 , u ^ ( ζ 1 ) ) d ζ 1 | 2 d ζ + C E j = 0 n 1 t j t j + 1 | 1 Δ t t j t j + 1 ( t n ζ 1 ) β 1 g ( ζ , u ( ζ ) ) g ( ζ 1 , u ( ζ 1 ) ) d ζ 1 | 2 d ζ = I I 2 1 + I I 2 2 .
For I I 2 2 , we have, by the Lipschitz assumption of g and Lemma 3, the following:
I I 2 2 = C E j = 0 n 1 t j t j + 1 | 1 Δ t t j t j + 1 ( t n ζ 1 ) β 1 g ( ζ , u ( ζ ) ) g ( ζ 1 , u ( ζ 1 ) ) d ζ 1 | 2 d ζ C E j = 0 n 1 t j t j + 1 | 1 Δ t t j t j + 1 ( t n ζ 1 ) β 1 g ( ζ , u ( ζ ) ) g ( ζ 1 , u ( ζ 1 ) ) 2 d ζ 1 | d ζ C E j = 0 n 1 t j t j + 1 ( t n ζ 1 ) β 1 Δ t 2 β 2 d ζ 1 C Δ t 2 β 1 0 t n ( t n ζ 1 ) β 1 d ζ 1 C Δ t 2 β 1 .
For I I 2 1 , we have, by the Lipschitz assumption of g, the following:
I I 2 1 C 0 t n ( t n ζ 1 ) 2 β 2 E | e ( ζ 1 ) | 2 d ζ 1 .
Thus, we obtain, by (10), the following:
E 0 T | e ( t ) | 2 d t C Δ t 2 α + C 0 T ( T v ) α 1 E 0 v | e ( ζ ) | 2 d ζ 1 2 d v 2 C Δ t 2 β 1 + C 0 T ( T v ) 2 β 2 E 0 v | e ( ζ ) | 2 d ζ d v .
Case 1. When g = 0 , we have the following:
E 0 T | e ( t ) | 2 d t C Δ t 2 α + C 0 T ( T v ) α 1 E 0 v | e ( ζ ) | 2 d ζ 1 2 d v . 2
Denote u 3 : [ 0 , T ] [ 0 , ) by the following:
u 3 ( v ) = E 0 v | u ^ ( ζ ) | 2 d ζ 1 2 .
Then we have the following:
u 3 ( T ) C Δ t α + C 0 T ( T v ) α 1 u 3 ( v ) d v .
Applying Grönwall Lemma, we have the following:
u 3 ( T ) C Δ t α ,
and thus we obtain the following:
E 0 T | e ( t ) | 2 d t C Δ t 2 α .
Case 2. When f = 0 , we have the following:
E 0 T | e ( t ) | 2 d t C Δ t 2 β 1 + C 0 T ( T v ) 2 β 2 E 0 v | e ( ζ ) | 2 d ζ d v .
Denote u 4 : [ 0 , T ] [ 0 , ) by the following:
u 4 ( v ) = E 0 v | u ^ ( ζ ) | 2 d ζ .
Then we have the following:
u 4 ( T ) C Δ t 2 β 1 + C 0 T ( T v ) 2 β 2 u 4 ( v ) d v .
Applying Grönwall Lemma, we have the following:
u 4 ( T ) C Δ t 2 β 1 ,
and thus we obtain the following:
E 0 T | e ( t ) | 2 d t C Δ t 2 β 1 .
The proof of Theorem 4 is now complete. □
Remark 2.
The difference between Theorem 2 and Theorem 4 is as follows: Theorem 2 considers the convergence order for (4) driven by additive noise with g ( ζ , u ( ζ ) ) = g 1 ( ζ ) , whereas Theorem 4 considers the convergence order for (4) driven by multiplicative noise with g ( ζ , u ( ζ ) ) . The additive case yields a convergence order of O ( Δ t β 1 / 2 ) , β ( 1 / 2 , 1 ] , whereas the multiplicative case achieves a convergence order of O ( Δ t β 1 / 2 ) , β ( 1 / 2 , 1 ] .

4. Numerical Simulations

Consider the following stochastic fractional differential equation:
D t α 0 C u ( t ) = f ( u ( t ) ) + g ( u ( t ) ) d W ( t ) d t , u ( 0 ) = u 0 ,
where α ( 1 / 2 , 1 ] and W ( t ) is a standard Brownian motion.
The equivalent integral form is as follows:
u ( t ) = u 0 + 1 Γ ( α ) 0 t ( t s ) α 1 f ( u ( s ) ) d s + 1 Γ ( α ) 0 t ( t s ) α 1 g ( u ( s ) ) d W ( s ) .
Below we shall consider the numerical approximation of the following integral equation:
u ( t ) = u 0 + 1 Γ ( α ) 0 t ( t s ) α 1 f ( u ( s ) ) d s + 1 Γ ( β ) 0 t ( t s ) β 1 g ( u ( s ) ) d W ( s ) ,
where the orders satisfy 1 / 2 < α 1 and 1 / 2 < β 1 and W ( t ) is a standard Brownian motion.
Let u m u ( t m ) be the approximate solution. We obtain the following:
u m = u 0 + 1 Γ ( α ) 0 t m ( t m s ) α 1 f ( u ( s ) ) d s + 1 Γ ( β ) 0 t m ( t m s ) β 1 g ( u ( s ) ) d W ^ ( s ) ,
where W ^ ( s ) is the piecewise constant function approximation of W ( s ) . In our numerical simulation, we will approximate f ( u ) and g ( u ) by f ( u k ) and g ( u k ) , respectively on the subinterval [ t k , t k + 1 ] . This approximation preserves the expected convergence order of Δ t β 1 / 2 since β ( 1 / 2 , 1 ) . More precisely, we calculate u m by the following formula:
u m u 0 + 1 Γ ( α ) k = 0 m 1 t k t k + 1 ( t m s ) α 1 f ( u k ) d s + 1 Γ ( β ) k = 0 m 1 t k t k + 1 ( t m s ) β 1 g ( u k ) d W ( s ) u 0 + 1 Γ ( α + 1 ) k = 0 m 1 ( t m t k ) α ( t m t k + 1 ) α f ( u k ) + 1 Γ ( β ) k = 0 m 1 ( t m t k ) β 1 g ( u k ) W ( t k + 1 ) W ( t k ) .
where W ( t k + 1 ) W ( t k ) Δ t N ( 0 , 1 ) .
The algorithm employs numerical integration combined with Monte Carlo simulations to approximate the solution of the Equation (15) and to analyze the associated errors and convergence behavior. We compute approximate solutions using several discretization levels corresponding to step sizes Δ t = 2 5 , 2 6 , 2 7 , 2 8 . A finer step size of Δ t = 2 12 , together with 50 Monte Carlo samples, is used to generate a reference solution for comparison.

Step-by-Step Algorithm

  • Step 1
Compute u 1 u ( t 1 ) :
u 1 = u 0 + 1 Γ ( α + 1 ) ( t 1 t 0 ) α f ( u 0 ) + 1 Γ ( β ) ( t 1 t 0 ) β 1 g ( u 0 ) W ( t 1 ) W ( t 0 ) .
  • Step 2
Compute u 2 u ( t 2 ) :
u 2 = u 0 + 1 Γ ( α + 1 ) k = 0 1 ( t 2 t k ) α ( t 2 t k + 1 ) α f ( u k ) + 1 Γ ( β ) k = 0 1 ( t 2 t k ) β 1 g ( u k ) W ( t k + 1 ) W ( t k ) .
  • Step m
Compute u m u ( t m ) :
u m = u 0 + 1 Γ ( α + 1 ) k = 0 m 1 ( t m t k ) α ( t m t k + 1 ) α f ( u k ) + 1 Γ ( β ) k = 0 m 1 ( t m t k ) β 1 g ( u k ) W ( t k + 1 ) W ( t k ) .
Each step requires storing all previous values u 0 , u 1 , , u m 1 in order to compute u m .
To analyze convergence, we compute the error at final time T = 1 and assume a approximate estimate of the following form:
error ( h ) = U N u ( T ) C h p , p > 0 .
For step sizes h i = 2 i , i = 5 , 6 , 7 , 8 , we define the error as follows:
error ( h i ) = E U N i u ( T ) 2 1 / 2 C h i p .
The experimental order of convergence p is then estimated using the following:
p log 2 error ( h i ) error ( h i + 1 ) log 2 h i h i + 1 .
This procedure allows us to test and compare the accuracy of the numerical method under different configurations of the drift and diffusion terms f ( u ) and g ( u ) and to assess the rate of convergence numerically.
We derive four distinct EOCs using four step sizes, denoted as h i for values of i = 4 , 5 , 6 , 7 , 8 . We then calculate the average of these four EOCs, which can be found in the EOC column of the Table 1, Table 2, Table 3, Table 4, Table 5 and Table 6.
We consider the following choices of functions f ( t , u ( t ) ) and g ( t , u ( t ) ) :
f ( t , u ( t ) ) = u ( t ) , g ( t , u ( t ) ) = 1 , α = 0.9 ,
f ( t , u ( t ) ) = u ( t ) , g ( t , u ( t ) ) = 1 , β = 0.9 ,
f ( t , u ( t ) ) = u ( t ) 1 + ( u ( t ) ) 2 , g ( t , u ( t ) ) = u ( t ) 1 + ( u ( t ) ) 2 , α = 0.9 ,
f ( t , u ( t ) ) = u ( t ) 1 + ( u ( t ) ) 2 , g ( t , u ( t ) ) = u ( t ) 1 + ( u ( t ) ) 2 , β = 0.9 ,
f ( t , u ( t ) ) = sin ( u ( t ) ) , g ( t , u ( t ) ) = sin ( u ( t ) ) , α = 0.9 ,
f ( t , u ( t ) ) = sin ( u ( t ) ) , g ( t , u ( t ) ) = sin ( u ( t ) ) , β = 0.9 .
We observe that the convergence orders are approximately O ( Δ t β 1 / 2 ) for different values of α ( 1 / 2 , 1 ] and β ( 1 / 2 , 1 ] . This is consistent with the theoretical order O ( Δ t 2 β 1 ) for both additive and multiplicative noises.
Figure 1 and Figure 2 illustrate the order of convergence plotted against varying values of α , using data from Table 1 and Table 2, which correspond to additive noise cases. In both figures, the theoretical convergence order β 0.5 = 0.3 (for β = 0.8 ) and β 0.5 = 0.4 (for β = 0.9 ), respectively, are marked as reference lines.
Figure 3, Figure 4, Figure 5 and Figure 6 present similar plots based on Table 3, Table 4, Table 5 and Table 6, which correspond to multiplicative noise cases. Here, the theoretical convergence order β 0.5 = 0.4 (with β = 0.9 ) is again used as a reference line. The convergence orders observed in all figures show a parallel line to the reference line of β 0.5 for both additive noise and multiplicative noise cases.

5. Conclusions

This paper considered the numerical approximation of stochastic Caputo fractional differential equations with multiplicative noise. The approach involved approximating the noise using a piecewise constant function, leading to a regularized stochastic fractional differential equation. We established the regularity of the solution and analyzed the convergence order of the proposed numerical scheme. Numerical simulations were performed using the Monte Carlo method to estimate the error and evaluate the experimental order of convergence (EOC). The results demonstrated that, for both additive and multiplicative noise cases, the convergence order was approximately O ( Δ t β 1 / 2 ) , with most EOC values closely matching the theoretical rate β 1 / 2 , where β ( 1 / 2 , 1 ] characterizes the singularity in the stochastic integral of the corresponding stochastic Volterra integral equation. This suggests that the type of noise (additive or multiplicative) and the fractional order α ( 1 / 2 , 1 ] do not significantly influence the convergence rate of the proposed method.

Author Contributions

Both authors have contributed equally towards this paper. J.H. conducted the theoretical analysis, wrote the original draft, and carried out the numerical simulations. Y.Y. wrote the original draft and introduced and provided guidance in this research area. All authors have read and agreed to the published version of the manuscript.

Funding

This research received no external funding.

Data Availability Statement

The original contributions presented in this study are included in the article. Further inquiries can be directed to the corresponding author.

Conflicts of Interest

The authors declare that they have no competing interests.

References

  1. Li, M.; Huang, C.; Hu, Y. Numerical methods for stochastic Volterra integral equations with weakly singular kernels. IMA J. Numer. Anal. 2022, 42, 2656–2683. [Google Scholar] [CrossRef]
  2. Diethelm, K. The Analysis of Fractional Differential Equations; Lecture Notes in Mathematics; Springer: Berlin/Heidelberg, Germany, 2010. [Google Scholar]
  3. Kloeden, P.E.; Platen, E. Numerical Solution of Stochastic Differential Equations; Applications of Mathematics (New York); Springer: Berlin/Heidelberg, Germany, 1992; Volume 23. [Google Scholar]
  4. Milstein, G.N.; Tretyakov, M.V. Stochastic Numerics for Mathematical Physics; Scientific Computation; Springer: Berlin/Heidelberg, Germany, 2004. [Google Scholar]
  5. Tudor, C.; Tudor, M. Approximation schemes for Itô–Volterra stochastic equations. Bol. Soc. Mat. Mex. 1995, 1, 73–85. [Google Scholar]
  6. Wen, C.H.; Zhang, T.S. Improved rectangular method on stochastic Volterra equations. J. Comput. Appl. Math. 2011, 235, 2492–2501. [Google Scholar] [CrossRef]
  7. Wang, Y. Approximate representations of solutions to SVIEs, and an application to numerical analysis. J. Math. Anal. Appl. 2017, 449, 642–659. [Google Scholar] [CrossRef]
  8. Xiao, Y.; Shi, J.N.; Yang, Z.W. Split-step collocation methods for stochastic Volterra integral equations. J. Integral Equ. Appl. 2018, 30, 197–218. [Google Scholar] [CrossRef]
  9. Liang, H.; Yang, Z.; Gao, J. Strong superconvergence of the Euler–Maruyama method for linear stochastic Volterra integral equations. J. Comput. Appl. Math. 2017, 317, 447–457. [Google Scholar] [CrossRef]
  10. Dai, X.; Bu, W.; Xiao, A. Well-posedness and EM approximations for non-Lipschitz stochastic fractional integro-differential equations. J. Comput. Appl. Math. 2019, 356, 377–390. [Google Scholar] [CrossRef]
  11. Gao, J.; Liang, H.; Ma, S. Strong convergence of the semi-implicit Euler method for nonlinear stochastic Volterra integral equations with constant delay. Appl. Math. Comput. 2019, 348, 385–398. [Google Scholar] [CrossRef]
  12. Yang, H.; Yang, Z.; Ma, S. Theoretical and numerical analysis for Volterra integro-differential equations with Itô integral under polynomially growth conditions. Appl. Math. Comput. 2019, 360, 70–82. [Google Scholar] [CrossRef]
  13. Zhang, W. Theoretical and numerical analysis of a class of stochastic Volterra integro-differential equations with non-globally Lipschitz continuous coefficients. Appl. Numer. Math. 2020, 147, 254–276. [Google Scholar] [CrossRef]
  14. Zhang, W.; Liang, H.; Gao, J. Theoretical and numerical analysis of the Euler–Maruyama method for generalized stochastic Volterra integro-differential equations. J. Comput. Appl. Math. 2020, 365, 17. [Google Scholar] [CrossRef]
  15. Kamrani, M. Numerical solution of stochastic fractional differential equations. Numer. Algorithms 2015, 68, 81–93. [Google Scholar] [CrossRef]
  16. Hoult, J.; Yan, Y. Numerical approximation for a stochastic fractional differential equation driven by integrated multiplicative noise. Mathematics 2024, 3, 265. [Google Scholar] [CrossRef]
  17. Mohammadi, F.; Ciancio, A. Wavelet-based numerical method for solving fractional integro-differential equation with a weakly singular kernel. Wavelet Linear Algebra 2017, 4, 53–73. [Google Scholar]
  18. Zhang, X. Euler schemes and large deviations for stochastic Volterra equations with singular kernels. J. Differ. Equ. 2008, 244, 2226–2250. [Google Scholar] [CrossRef]
  19. Asadzade, J.A.; Mahmudov, N.I. Euler-Maruyama approximation for stochastic fractional neutral integro-differential equations with weakly singular kernel. Phys. Scr. 2024, 99, 075281. [Google Scholar] [CrossRef]
  20. Anh, P.T.; Doan, T.S.; Huong, P.T. A variation of constant formula for Caputo fractional stochastic differential equations. Statist. Probab. Lett. 2019, 145, 351–358. [Google Scholar] [CrossRef]
  21. Son, D.T.; Huong, P.T.; Kloeden, P.E.; Tuan, H.T. Asymptotic separation between solutions of Caputo fractional stochastic differential equations. Stoch. Anal. Appl. 2018, 36, 654–664. [Google Scholar] [CrossRef]
Figure 1. Convergence order for Equation (15) defined by (16) with α = 0.9 and β = 0.8 .
Figure 1. Convergence order for Equation (15) defined by (16) with α = 0.9 and β = 0.8 .
Mathematics 13 02835 g001
Figure 2. Convergence order for Equation (15) defined by (17) with α = 0.6 and β = 0.9 .
Figure 2. Convergence order for Equation (15) defined by (17) with α = 0.6 and β = 0.9 .
Mathematics 13 02835 g002
Figure 3. Convergence order for Equation (15) defined by (18) with α = 0.9 and β = 0.9 .
Figure 3. Convergence order for Equation (15) defined by (18) with α = 0.9 and β = 0.9 .
Mathematics 13 02835 g003
Figure 4. Convergence order for Equation (15) defined by (19) with α = 0.6 and β = 0.9 .
Figure 4. Convergence order for Equation (15) defined by (19) with α = 0.6 and β = 0.9 .
Mathematics 13 02835 g004
Figure 5. Convergence order for Equation (15) defined by (20) with α = 0.9 and β = 0.9 .
Figure 5. Convergence order for Equation (15) defined by (20) with α = 0.9 and β = 0.9 .
Mathematics 13 02835 g005
Figure 6. Convergence order for Equation (15) defined by (21) with α = 0.6 and β = 0.9 .
Figure 6. Convergence order for Equation (15) defined by (21) with α = 0.6 and β = 0.9 .
Mathematics 13 02835 g006
Table 1. Convergence orders for Equation (15) defined by (16) with fixed α = 0.9 and varying β .
Table 1. Convergence orders for Equation (15) defined by (16) with fixed α = 0.9 and varying β .
β h 1 = 1 16 h 2 = 1 32 h 3 = 1 64 h 4 = 1 128 h 5 = 1 256 EOC
0.5 8.6280 × 10 1 7.6180 × 10 1 6.5860 × 10 1 5.5070 × 10 1 4.5370 × 10 1 0.2318
0.17950.21010.25810.2796
0.6 2.8520 × 10 1 2.5920 × 10 1 2.2440 × 10 1 1.9750 × 10 1 1.5400 × 10 1 0.2221
0.13760.20830.18420.3584
0.7 3.1000 × 10 2 2.3000 × 10 2 1.7000 × 10 2 1.3000 × 10 2 1.0000 × 10 2 0.4071
0.42970.43530.38490.3785
0.8 3.1000 × 10 2 2.3000 × 10 2 1.7000 × 10 2 1.3000 × 10 2 1.0000 × 10 2 0.4631
0.33870.41370.48400.6161
0.9 6.9000 × 10 3 4.8000 × 10 3 3.4000 × 10 3 2.4000 × 10 3 1.7000 × 10 3 0.5057
0.52610.48370.52670.4863
Table 2. Convergence orders for Equation (15) defined by (17) with fixed β = 0.9 and varying α .
Table 2. Convergence orders for Equation (15) defined by (17) with fixed β = 0.9 and varying α .
α h 1 = 1 16 h 2 = 1 32 h 3 = 1 64 h 4 = 1 128 h 5 = 1 256 EOC
0.5 6.8000 × 10 3 4.9000 × 10 3 3.6000 × 10 3 2.4000 × 10 3 1.7000 × 10 3 0.5070
0.45990.46000.58170.5264
0.6 5.8000 × 10 3 4.2000 × 10 3 3.1000 × 10 3 2.3000 × 10 3 1.7000 × 10 3 0.4407
0.46450.43310.42970.4353
0.7 5.3000 × 10 3 4.1000 × 10 3 2.9000 × 10 3 2.2000 × 10 3 1.5000 × 10 3 0.4504
0.38830.50650.40670.5002
0.8 6.9000 × 10 3 5.2000 × 10 3 3.7000 × 10 3 2.5000 × 10 3 1.6000 × 10 3 0.5364
0.40730.48400.55620.6982
0.9 6.9000 × 10 3 4.8000 × 10 3 3.4000 × 10 3 2.4000 × 10 3 1.7000 × 10 3 0.5057
0.52610.48370.52670.4863
Table 3. Convergence orders for Equation (15) defined by (18) with fixed α = 0.9 and varying β .
Table 3. Convergence orders for Equation (15) defined by (18) with fixed α = 0.9 and varying β .
β h 1 = 1 16 h 2 = 1 32 h 3 = 1 64 h 4 = 1 128 h 5 = 1 256 EOC
0.5 3.8460 × 10 1 3.3930 × 10 1 2.9870 × 10 1 2.4400 × 10 1 2.0380 × 10 1 0.2289
0.18050.18390.29180.2595
0.6 1.4040 × 10 1 1.2730 × 10 1 1.1040 × 10 1 9.4900 × 10 2 7.5000 × 10 2 0.2261
0.14220.20460.21910.3387
0.7 4.0800 × 10 2 3.4700 × 10 2 2.6600 × 10 2 2.2200 × 10 2 1.7000 × 10 2 0.3161
0.23490.38000.26160.3879
0.8 1.5200 × 10 2 1.2000 × 10 2 9.0000 × 10 3 6.5000 × 10 3 4.2000 × 10 3 0.4609
0.34120.41080.47730.6145
0.9 3.4000 × 10 3 2.6000 × 10 3 1.9000 × 10 3 1.4000 × 10 3 1.1000 × 10 3 0.4057
0.38490.44970.43970.3485
Table 4. Convergence orders for Equation (15) defined by (19) with fixed β = 0.9 and varying α .
Table 4. Convergence orders for Equation (15) defined by (19) with fixed β = 0.9 and varying α .
α h 1 = 1 16 h 2 = 1 32 h 3 = 1 64 h 4 = 1 128 h 5 = 1 256 EOC
0.5 3.5000 × 10 3 2.5000 × 10 3 1.8000 × 10 3 1.2000 × 10 3 8.0000 × 10 4 0.5159
0.45490.47080.58700.5508
0.6 2.9000 × 10 3 2.3000 × 10 3 1.7000 × 10 3 1.3000 × 10 3 9.0000 × 10 4 0.4399
0.35940.41200.36420.6240
0.7 2.7000 × 10 3 2.1000 × 10 3 1.4000 × 10 3 1.1000 × 10 3 8.0000 × 10 4 0.4532
0.38250.51690.41180.5014
0.8 3.5000 × 10 3 2.6000 × 10 3 1.9000 × 10 3 1.3000 × 10 3 8.0000 × 10 4 0.5334
0.41030.48060.55280.6902
0.9 3.4000 × 10 3 2.4000 × 10 3 1.7000 × 10 3 1.2000 × 10 3 8.0000 × 10 4 0.5041
0.51050.48280.54510.4781
Table 5. Convergence orders for Equation (15) defined by (20) with fixed α = 0.9 and varying β .
Table 5. Convergence orders for Equation (15) defined by (20) with fixed α = 0.9 and varying β .
β h 1 = 1 16 h 2 = 1 32 h 3 = 1 64 h 4 = 1 128 h 5 = 1 256 EOC
0.5 6.4550 × 10 1 6.6620 × 10 1 5.4180 × 10 1 4.5860 × 10 1 4.0360 × 10 1 0.1694
-0.04560.29810.24070.1844
0.6 2.4460 × 10 1 2.2800 × 10 1 2.0620 × 10 1 1.8760 × 10 1 1.4620 × 10 1 0.1856
0.10110.14530.13630.3595
0.7 7.2300 × 10 2 6.0700 × 10 2 4.7500 × 10 2 4.0800 × 10 2 3.1300 × 10 2 0.3023
0.25120.35450.22040.3831
0.8 2.4600 × 10 2 1.8900 × 10 2 1.4100 × 10 2 1.0400 × 10 2 7.9000 × 10 3 0.4114
0.38060.41830.43920.4075
0.9 5.8000 × 10 3 4.2000 × 10 3 3.3000 × 10 3 2.5000 × 10 3 1.7000 × 10 3 0.4455
0.46450.33320.44530.5389
Table 6. Convergence orders for Equation (15) defined by (21) with fixed β = 0.9 and varying α .
Table 6. Convergence orders for Equation (15) defined by (21) with fixed β = 0.9 and varying α .
α h 1 = 1 16 h 2 = 1 32 h 3 = 1 64 h 4 = 1 128 h 5 = 1 256 EOC
0.5 6.9000 × 10 3 5.5000 × 10 3 3.7000 × 10 3 2.5000 × 10 3 2.0000 × 10 3 0.4561
0.34060.57160.56850.3436
0.6 5.6000 × 10 3 4.1000 × 10 3 3.1000 × 10 3 2.3000 × 10 3 1.9000 × 10 3 0.3891
0.45000.40100.42970.2756
0.7 5.0000 × 10 3 3.8000 × 10 3 2.8000 × 10 3 2.1000 × 10 3 1.5000 × 10 3 0.4340
0.40500.43090.38180.5184
0.8 5.7000 × 10 3 4.1000 × 10 3 3.0000 × 10 3 2.1000 × 10 3 1.5000 × 10 3 0.4816
0.47080.47370.48820.4938
0.9 5.8000 × 10 3 4.2000 × 10 3 3.3000 × 10 3 2.5000 × 10 3 1.7000 × 10 3 0.4455
0.46450.33320.44530.5389
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

Hoult, J.; Yan, Y. Numerical Approximation for a Stochastic Caputo Fractional Differential Equation with Multiplicative Noise. Mathematics 2025, 13, 2835. https://doi.org/10.3390/math13172835

AMA Style

Hoult J, Yan Y. Numerical Approximation for a Stochastic Caputo Fractional Differential Equation with Multiplicative Noise. Mathematics. 2025; 13(17):2835. https://doi.org/10.3390/math13172835

Chicago/Turabian Style

Hoult, James, and Yubin Yan. 2025. "Numerical Approximation for a Stochastic Caputo Fractional Differential Equation with Multiplicative Noise" Mathematics 13, no. 17: 2835. https://doi.org/10.3390/math13172835

APA Style

Hoult, J., & Yan, Y. (2025). Numerical Approximation for a Stochastic Caputo Fractional Differential Equation with Multiplicative Noise. Mathematics, 13(17), 2835. https://doi.org/10.3390/math13172835

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