Next Article in Journal
Estimation of Fractal Dimensions and Classification of Plant Disease with Complex Backgrounds
Previous Article in Journal
A High-Order Fractional Parallel Scheme for Efficient Eigenvalue Computation
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Milstein Scheme for a Stochastic Semilinear Subdiffusion Equation Driven by Fractionally Integrated Multiplicative Noise

1
Department of Mathematics and Artificial Intelligence, Lyuliang University, Lüliang 033000, China
2
School of Computer and Engineering Sciences, University of Chester, Chester CHI 4BJ, UK
*
Author to whom correspondence should be addressed.
These authors contributed equally to this work.
Fractal Fract. 2025, 9(5), 314; https://doi.org/10.3390/fractalfract9050314
Submission received: 25 March 2025 / Revised: 27 April 2025 / Accepted: 10 May 2025 / Published: 14 May 2025
(This article belongs to the Section Numerical and Computational Methods)

Abstract

This paper investigates the strong convergence of a Milstein scheme for a stochastic semilinear subdiffusion equation driven by fractionally integrated multiplicative noise. The existence and uniqueness of the mild solution are established via the Banach fixed point theorem. Temporal and spatial regularity properties of the mild solution are derived using the semigroup approach. For spatial discretization, the standard Galerkin finite element method is employed, while the Grünwald–Letnikov method is used for time discretization. The Milstein scheme is utilized to approximate the multiplicative noise. For sufficiently smooth noise, the proposed scheme achieves the temporal strong convergence order of O ( τ α ) , α ( 0 , 1 ) . Numerical experiments are presented to verify that the computational results are consistent with the theoretical predictions.

1. Introduction

This paper considers the Milstein scheme for solving the following stochastic semilinear subdiffusion equation driven by the fractionally integrated multiplicative noise, with 0 < α < 1 :
D t α 0 C u ( t ) = A u ( t ) + F ( u ( t ) ) + D t α 1 0 R G ( u ( t ) ) d W ( t ) d t , for 0 < t T , with u ( 0 ) = u 0 ,
where A = Δ with D ( A ) = H 0 1 ( D ) H 2 ( D ) and Δ is the Laplacian. Here, D R d , where d = 1 , 2 , 3 , is a regular domain with a C 1 -boundary. Here, D t α 0 C v ( t ) denotes the left-sided Caputo fractional derivative with order α ( 0 , 1 ) ,
D t α 0 C v ( t ) = 1 Γ ( 1 α ) 0 t ( t s ) α v ( s ) d s ,
and D t α 1 0 R v ( t ) is the Riemann–Liouville fractional integral of order 1 α ( 0 , 1 ) ,
D t α 1 0 R v ( t ) = 1 Γ ( 1 α ) 0 t ( t s ) α v s . ( s ) d s .
The term d W ( t ) d t denotes the noise on a complete filtered probability space ( Ω , F , P , { F t } t 0 ) ; see Section 2 for details. We assume that the multiplicative noise term G ( u ( t ) ) d W ( t ) d t in (1) is commutative ([1,2]). In this case, the Lévy area, which typically arises in Milstein-type time discretization schemes, vanishes. The nonlinear term F : R R is a real-valued function, and the initial value u 0 is a given function.
Stochastic subdiffusion equations are extensively employed to model anomalous diffusion phenomena, including those observed in highly heterogeneous aquifers [3], random walks [4], underground environmental issues [5], and thermal diffusion in media with fractional geometries [6], among others. The fractionally integrated noise term, D t α 1 0 R G ( u ( t ) ) d W ( t ) d t , captures the random effects on particle motion in media with memory, accounting for behaviors such as particle sticking and trapping [7] or the dependence of internal energy on past random fluctuations.
To clarify the physical motivation behind model (1), we briefly introduce a representative application; see [7] for further details. Let v ( t , x ) , P ( t , x ) , and S ( t , x ) denote the body temperature, energy, and flux density, respectively. In a homogeneous medium, with constants a 1 > 0 and a 2 > 0 , the following relations are satisfied:
P ( t , x ) t = div S ( t , x ) , P ( t , x ) = a 1 v ( t , x ) , S ( t , x ) = a 2 v ( t , x ) .
From these equations, we obtain the heat equation:
a 1 v ( t , x ) t = a 2 Δ v ( t , x ) .
In practical inhomogeneous media, for example, in the case of heat conduction in materials with thermal memory subjected to multiplicative noise, the energy term is expressed as follows, with W ˙ ( r ) = d W ( r ) d r and α ( 0 , 1 ) :
P ( t , x ) = 0 t h 1 ( t r ) v ( r , x ) d r + 0 t h 2 ( t r ) ( a 2 ( v ( r , x ) ) + g ( v ( r , x ) ) W ˙ ( r , x ) ) d r ,
where h 1 ( t ) = Γ ( 1 α ) 1 t α , h 2 ( t ) = Γ ( 1 α ) Γ ( 2 α ) 1 t h 1 ( t ) = Γ ( 2 α ) 1 t 1 α . Differentiating (2), we obtain the model (1):
div S = 1 Γ ( 1 α ) t 0 t ( t r ) α v ( r , x ) d r 1 Γ ( 2 α ) t 0 t ( t r ) 1 α ( a 2 ( v ( r , x ) ) + g ( v ( r , x ) ) W ˙ ( r , x ) ) d r = D t α 0 C v ( t , x ) 1 Γ ( 1 α ) t 0 t 0 τ ( τ r ) 1 α ( a 2 ( v ( r , x ) ) + g ( v ( r , x ) ) W ˙ ( r , x ) ) d r d τ = D t α 0 C v ( t , x ) D t α 1 0 R ( a 2 ( v ( t , x ) ) + g ( v ( t , x ) ) W ˙ ( t , x ) ) .
This equation characterizes heat conduction in a non-homogeneous medium influenced by the fractional-order dynamics driven by the integrated multiplicative noise. We note that other types of fractional derivatives, such as the Caputo–Fabrizio and Atangana–Baleanu derivatives, also appear in the literature. The study of (1) with these alternative fractional derivatives will be the subject of our future work.
Let us briefly recall some theoretical results related to (1). Anh et al. [8] discussed sufficient conditions for the existence of a solution (in the mean-square sense) and established the temporal and spatial Hölder continuities of the solution to (1) for F = 0 with additive noise. Mijena and Nane [9] proved the existence and uniqueness of mild solutions to (1) defined on the whole domain R with F = 0 and provided conditions ensuring the continuity of the solution. Furthermore, Mijena and Nane [10] showed that the absolute moments of the solution to (1) with F = 0 (defined on R ) grow exponentially and that the distances to the origin of the farthest high peaks of those moments increase linearly with time. Liu et al. [11] studied the existence and uniqueness of solutions to (1) involving fairly general quasi-linear elliptic operators; see also [12] for additional analytic results. Chen [13] analyzed the moments, Hölder continuity, and intermittency of the solution for the one-dimensional nonlinear stochastic subdiffusion equation. Chen et al. [14] studied the existence and uniqueness of solutions to (1) with F = 0 defined on the entire domain R . Kang et al. [15] investigated the existence and uniqueness of mild solutions to (1) with additive noise, assuming that F satisfies a global Lipschitz condition.
Numerical methods for solving stochastic linear and semilinear subdiffusion equations driven by fractionally integrated noise have been extensively studied in the literature. For instance, Jin et al. [16] proposed a fully discrete numerical scheme for the linear stochastic subdiffusion equation with fractionally integrated additive Gaussian noise, employing the Galerkin finite element method for spatial discretization and the Grünwald–Letnikov method for temporal discretization; see also [17,18]. Wu et al. [19] applied the L 1 scheme in combination with the finite element method to solve the linear stochastic subdiffusion equation driven by fractionally integrated additive noise, and established optimal convergence rates for the fully discrete scheme; see also [20]. Hu et al. [21] investigated the weak convergence of stochastic subdiffusion problems using the L 1 scheme for time discretization. Noupelah et al. [22] studied strong convergence rates for a fully discrete spatio-temporal scheme for stochastic semilinear subdiffusion, using a fractional exponential integrator for temporal discretization and the finite element method for spatial discretization. Karaa et al. [23] analyzed strong approximations for a stochastic time-fractional Allen–Cahn equation with additive noise, employing the standard finite element method for spatial discretization, the Grünwald–Letnikov method for temporal discretization, and the Euler scheme for approximating the noise term.
Although a few numerical methods have been developed for the stochastic subdiffusion equation, to the best of our knowledge, there are no existing higher-order numerical methods for solving the stochastic subdiffusion equation driven by fractionally integrated multiplicative noise. Recently, Qiao et al. [24] studied a numerical scheme for the classical Allen–Cahn equation with multiplicative noise. They employed the Galerkin finite element method for spatial discretization and the Milstein scheme for time integration. It was shown that, for sufficiently smooth noise, the Milstein scheme achieves a higher convergence order—twice that of the standard Euler scheme. Inspired by the approach in [24], we propose an efficient Milstein scheme for solving a semilinear stochastic subdiffusion equation driven by fractionally integrated multiplicative noise. The standard Galerkin finite element method is used for spatial discretization, while the time-fractional derivative is approximated using the Grünwald–Letnikov scheme. The multiplicative noise is approximated via the Milstein scheme. The optimal error estimates for the proposed fully discrete scheme are established using a discrete convolution argument.
Let us introduce the main results in this paper below. Let N > 0 be a positive integer, 0 = t 0 < t 1 < < t N = T the time partition of [ 0 , T ] , and τ the time step size. Let u h j , j = 0 , 1 , , N be the approximate solutions of u ( t j ) in the finite element space S h . Let P h : H = L 2 ( D ) S h and A h : S h S h denote the L 2 -projection operator and the discrete Laplacian operator, respectively. The Milstein scheme is defined as follows (see Section 4 for detail):
τ α j = 0 n ω n j ( α ) ( u h j u h 0 ) + A h u h n = P h F ( u h n ) + τ 1 α j = 0 n ω n j ( α 1 ) P h g j , n 1 ,
where ω j ( α ) are some suitable weights, g j = ρ 1 j + ρ 2 j , and j = 1 , 2 , , n . Here,
ρ 1 j = G ( u h j 1 ) W ( t j ) W ( t j 1 ) τ , ρ 2 j = G ( u h j 1 ) G ( u h j 1 ) t j 1 t j W ( s ) W ( t j 1 ) τ d W ( s ) .
With the application of the discrete Laplace transform, the solution u h n takes the following form:
u h n = u ¯ h n + j = 0 n 1 t j t j + 1 R n j P h F ( u h j + 1 ) d s + j = 0 n 1 t j t j + 1 R ¯ n j P h G ( u h j ) d W ( s ) + j = 0 n 1 t j t j + 1 R ¯ n j P h G ( u h j ) G ( u h j ) ( W ( s ) W ( t j ) ) d W ( s ) ,
where u ¯ h n denotes the approximate solution of the corresponding homogeneous problem. Here, R j and R ¯ j (where j = 1 , 2 , , n ) are some suitable discrete operators specified in Section 4.
Let u and u h n be the solutions of (1) and (4), respectively. We obtain the following error estimates: with 1 / 2 < α < 1 , 1 σ 2 , 0 κ 2 , and 0 σ κ 1 ,
u ( t n ) u h n L 2 ( Ω , H ) C τ t n 1 + σ α 2 u 0 L 2 ( Ω , H ˙ σ ) + C h 2 t n α + σ α 2 u 0 L 2 ( Ω , H ˙ σ ) + C h { 2 ε , μ } + C τ min { α σ 2 , α , α ( σ κ ) 2 + 1 2 , α ( σ 1 ) , α ( σ κ ) + 1 α } ,
where 0 < μ 2 and α ( μ ( σ κ ) ) 1 .
Under the assumption that the noise is sufficiently smooth, e.g., σ = 2 , σ κ = 1 , and u 0 L 2 ( Ω , H ˙ 2 ) , we have the following error estimate, with ε > 0 :
u ( t n ) u h n L 2 ( Ω , H ) C h 2 ε + C τ min { α , α 2 + 1 2 } = C ( τ α + h 2 ε ) .
The main contributions of this paper are summarized as follows:
  • The existence and uniqueness of solutions to stochastic semilinear subdiffusion equations driven by integrated multiplicative noise are established via the Banach fixed point theorem.
  • The temporal and spatial regularity of mild solutions to the stochastic semilinear subdiffusion equations driven by integrated multiplicative noise are rigorously analyzed.
  • A higher-order fully discrete numerical scheme is developed for solving the stochastic semilinear subdiffusion equations with integrated multiplicative noise. Specifically, the standard Galerkin finite element method is employed for spatial discretization, the Grünwald–Letnikov method is used for time discretization, and the Milstein scheme is adopted to approximate the multiplicative noise.
  • Error estimates for the proposed fully discrete scheme are derived using the semigroup approach.
The paper is organized as follows. In Section 2, we present the formulation of the mild solution. The existence, uniqueness, and regularity of the solution in both space and time are established in Section 3. Section 4 introduces the fully discrete scheme, which combines the finite element method for spatial discretization, the Grünwald–Letnikov scheme for temporal approximation, and the Milstein scheme for handling the multiplicative noise. Detailed error estimates for the fully discrete scheme are provided in Section 5. In Section 6, the numerical simulations are presented to validate the theoretical results.
Throughout the paper, C denotes a generic positive constant, which may differ at each occurrence and may depend on T and α but remains independent of the step sizes τ and h.

2. Preliminaries

Let ( · , · ) , · denote the inner product and the norm in H = L 2 ( D ) . Let { λ j , e j } j = 1 be the eigenpairs of the operator A. Denote as H ˙ r , r R , the space
H ˙ r : = D ( A r 2 ) = { v H : | v | r 2 = A r 2 v 2 = j = 1 λ j r ( v , e j ) 2 < } .
Let E stand for the expectation in the probability space ( Ω , F , P , { F t } t 0 ) . We assume the noise d W ( t ) d t can be expressed as follows:
d W ( t ) d t : = l = 1 γ l 1 / 2 β ˙ l ( t ) e l ,
where β l ( t ) , l = 1 , 2 , are the real-valued mutually independent Brownian motions and { γ j , e j } j = 1 are the eigenpairs of the covariance operator Q in H.
Define as L 2 0 : = H S ( Q 1 2 ( H ) , H ) ([25,26]) the space of Hilbert–Schmidt operators from Q 1 2 ( H ) to H equipped with the inner product · , · and norm · L 2 0 :
ϕ 1 , ϕ 2 : = j = 1 ( ϕ 1 Q 1 2 e j , ϕ 2 Q 1 2 e j ) , ϕ L 2 0 2 : = j = 1 ϕ Q 1 2 e j 2 < , for ϕ 1 , ϕ 2 , ϕ L 2 0 .
Let H S ( Q 1 2 ( H ) , L 2 0 ) denote the Hilbert–Schmidt operator space with norm · H S ( Q 1 2 ( H ) , L 2 0 ) defined by
ϕ H S ( Q 1 2 ( H ) , L 2 0 ) 2 : = i = 1 j = 1 γ i γ j ϕ e i e j < , ϕ H S ( Q 1 2 ( H ) , L 2 0 ) .
We also use the operator space L 2 ( H , L 2 0 ) , in which the norm is defined by
ϕ L 2 ( H , L 2 0 ) : = sup v 1 H , v 2 H ϕ v 1 v 2 L 2 0 v 1 v 2 < , ϕ L 2 ( H , L 2 0 ) .
Assumption 1. 
The elliptic operator A satisfies the following resolvent estimate, with θ ( π / 2 , π ) :
( z I + A ) 1 C | z | 1 f o r z Σ θ = { z 0 : | a r g z | < θ } ,
which implies that, with 0 < α < 1 ,
( z α I + A ) 1 C | z | α , z Σ θ = { z 0 : | a r g z | < θ } .
Assumption 2 
([27]). For the nonlinear term F ( u ) , we assume that there exist 1 ν < 2 and 1 θ < 2 such that
F ( u ) F ( v ) C u v , u , v H ,
F ( u ) C ( 1 + u ) , u H ,
F ( u ) v C v , u , v H ,
| F ( u ) v | ν C ( 1 + | u | σ 1 ) | v | σ 1 , u H ˙ σ 1 , v H ˙ σ 1 , 0 σ 1 < ν ,
| F ( u ) ( v 1 , v 2 ) | θ C v 1 v 2 , v 1 , v 2 H .
Assumption 3. 
For 1 σ 2 , 0 κ 2 , 0 σ κ 1 , we assume
A σ κ 2 G ( u ) L 2 0 C ( 1 + | u | σ κ ) ,
where κ is defined by [16],
κ : = 2 , 0 < α < 1 2 , 1 ε α , 1 2 α < 1 , 0 < ε < 1 ,
which ensures 0 t A κ 2 E ( s ) 2 d s < . Here, E ( t ) represents the Mittag-Leffler function as defined in (20). Moreover, the functions G ( u ) , G ( u ) , and G ( u ) satisfy certain properties that play a crucial role in establishing the strong convergence rates of the Milstein-type scheme (see Assumption 5.2 in [24]):
A s 2 ( G ( u ) G ( v ) ) L 2 0 C | u v | s , 0 s 1 ,
G ( v ) L ( H , L 2 0 ) C ,
G ( v ) L 2 ( H , L 2 0 ) C ,
G ( u ) G ( u ) G ( v ) G ( v ) H S ( Q 1 2 ( H ) , L 2 0 ) C u v .
Denote f ( t ) = F ( u ( t ) ) , h ( t ) = G ( u ( t ) ) d W ( t ) d t , then (1) can be written as
D t α 0 C u ( t ) + A u ( t ) = f ( t ) + D t α 1 0 R h ( t ) , f o r 0 < t T , w i t h u ( 0 ) = u 0 .
Taking the Laplace transform of (19), we have
z α u ^ ( z ) z α 1 u 0 + A u ^ ( z ) = f ^ ( z ) + z α 1 h ^ ( z ) ,
which implies that
u ^ ( z ) = z α 1 ( z α + A ) 1 u 0 + ( z α + A ) 1 f ^ ( z ) + z α 1 ( z α + A ) 1 h ^ ( z ) .
By the inverse Laplace transform, we have
u ( t ) = E ( t ) u 0 + 0 t E ¯ ( t s ) F ( u ( s ) ) d s + 0 t E ( t s ) G ( u ( s ) ) d W ( s ) ,
where E ( t ) = E α , 1 ( t α A )   and   E ¯ ( t ) = t α 1 E α , α ( t α A ) , respectively, are Mittag-Leffler functions that also have the following integration forms:
E ( t ) = 1 2 π i Γ e z t ( z α + A ) 1 z α 1 d z , E ¯ ( t ) = 1 2 π i Γ e z t ( z α + A ) 1 d z ,
where z increases along Γ and
Γ = { z : | arg z | = θ , π 2 < θ < θ 0 < π } .
Under Assumption 1, and following an approach similar to the one in the proof of Lemma 4.1 in [16], the Mittag-Leffler functions E ( t ) and E ¯ ( t ) in (20) satisfy the following estimates: p 0 , q 0 , 0 p q 2 , l = 0 , 1 ,
| d l E ( t ) d t l v | p C t α p q 2 l | v | q ,
| d l E ¯ ( t ) d t l v | p C t α p q 2 + α 1 l | v | q .
We present a useful lemma that will be applied in handling stochastic integrals.
Lemma 1 
([16,28]). Let p 2 and ( ψ ( t ) ) t [ 0 , T ] be a predictable and L 2 0 -valued stochastic process such that ψ L p ( Ω ; L 2 ( 0 , T ; L 2 0 ) ) < . Then, it holds that
0 T ψ ( t ) d W ( t ) L p ( Ω , H ) C ψ L p ( Ω ; L 2 ( 0 , T , L 2 0 ) ) < .
We also utilize the following fractional Grönwall inequality to analyze the spatial regularity of the mild solution (20).
Lemma 2 
([23]). Let α ( 0 , 1 ) . Suppose that y is nonnegative and y satisfies the inequality
D t α 0 C y ( t ) β y ( t ) + σ ( t ) ,
where the function σ L ( 0 , T ) and the constant β > 0 . Then,
y ( t ) C ( y ( 0 ) + σ L ( 0 , T ) ) .

3. The Well-Posedness of the Mild Solution

In this section, we investigate the well-posedness of problem (1), including the existence, uniqueness, and spatial and temporal regularity of the mild solution (20). The proof of existence and uniqueness for the mild solution (20) is inspired by the corresponding theorem presented in [15]. In Theorem 1, we apply the Banach fixed point theorem to establish the existence and uniqueness of solutions to the stochastic semilinear subdiffusion equations driven by integrated multiplicative noise. In Theorem 2, we employ the semigroup approach to establish the spatial regularity of the mild solution. In Theorem 3, we again use the semigroup approach to demonstrate the temporal regularity of the mild solution.
Theorem 1. 
Let 0 σ 2 . Let Assumptions A2 and A3 hold. Assume that the initial dataset u 0 L 2 p ( Ω , H ˙ σ ) is an F 0 -measurable random variable. Then, there exists a unique mild solution (20) such that u ( t ) C ( [ 0 , T ] ; L 2 p ( Ω , H ˙ σ ) ) .
Proof. 
See the proof in Appendix A.1 in Appendix A. □
Next, we shall consider the spatial and temporal regularities of solution u ( t ) . First, we show the spatial regularity.
Theorem 2. 
Let u ( t ) be the solution of (1). Suppose that Assumptions A2 and A3 hold. Furthermore, assume u 0 L 2 p ( Ω , H ˙ σ ) with σ [ 1 , 2 ] . Then, there exists a positive constant C such that the following estimates hold:
sup 0 t T u ( t ) L 2 p ( Ω , H ˙ σ ) C ( 1 + u 0 L 2 p ( Ω , H ˙ σ ) ) .
Proof. 
See the proof in Appendix A.2 in Appendix A. □
Next, we provide the temporal regularity of the mild solution u ( t ) .
Theorem 3. 
Let 0 < α < 1 . Let Assumptions 1–3 hold. Assume u 0 L 2 p ( Ω , H ˙ σ ) ( 1 σ 2 ) . Then, for 0 t 1 < t 2 T , we have, for 0 σ κ 1 ,
u ( t 2 ) u ( t 1 ) L 2 p ( Ω , H ) C ( t 2 t 1 ) min { α σ 2 , α , 1 2 } = : C ( t 2 t 1 ) η ,
u ( t 2 ) u ( t 1 ) L 2 p ( Ω , H ˙ 1 ) C ( t 2 t 1 ) min { α σ 1 2 , α 2 , α ( σ κ ) 2 + 1 2 α 2 } = : C ( t 2 t 1 ) β .
Furthermore, we have the important estimate that will be used in the Milstein scheme error analysis:
u ( t 2 ) u ( t 1 ) t 1 t 2 G ( u ( s ) ) d W ( s ) L 2 p ( Ω , H ) C ( t 2 t 1 ) min { α σ 2 , α , α ( σ κ ) 2 + 1 2 } = C ( t 2 t 1 ) β + α 2 .
Proof. 
See the proof in Appendix A.3 in Appendix A. □

4. Full Discretization Scheme

In this section, we propose an efficient fully discrete spatio-temporal scheme for solving problem (1). The numerical method is based on the standard piecewise linear finite element method for spatial discretization, the Grünwald–Letnikov method for temporal discretization, and the Milstein scheme for noise approximation.
Let S h H 0 1 ( D ) denote the space of piecewise linear finite elements associated with a triangulation T h of the domain D R d , d 3 . Let P h : H S h denote the L 2 projection defined by
( P h v , χ ) = ( v , χ ) , χ S h .
Let A h : S h S h be the discrete approximation of the elliptic operator A : D ( A ) H H , defined by
( A h ψ , χ ) = A ( ψ , χ ) , χ S h ,
where A ( · , · ) is the bilinear form associated with the elliptic operator A. Here, A h satisfies, with 1 2 r 1 2 ;
A h r P h v c A r v , v H ,
see [16].
The spatial semidiscrete scheme of the problem (1) is to find the solution u h ( t ) S h such that, with u h ( 0 ) = P h u 0 ,
D t α 0 C u h ( t ) + A h u h ( t ) = P h F ( u h ( t ) ) + D t α 1 0 R P h G ( u h ( t ) ) d W ( t ) d t , 0 < t T .
Similar to the continuous case, one can likewise derive the mild solution of the spatial semidiscrete problem (28), given by
u h ( t ) = E h ( t ) P h u 0 + 0 t E ¯ h ( t s ) P h F ( u h ( s ) ) d s + 0 t E h ( t s ) P h G ( u h ( s ) ) d W ( s ) .
These operators,
E h ( t ) = E α , 1 ( t α A h ) , E ¯ h ( t ) = t α 1 E α , α ( t α A h ) ,
have similar smoothing properties to E ( t ) and E ¯ ( t ) . Thus, u h ( t ) and u ( t ) have the same temporal and spatial regularity estimate results.
We now introduce the time discretization scheme of the spatially semidiscrete solution (29). Let u h n u h ( t n ) be the approximation of u h ( t n ) . Let g j = ρ 1 j + ρ 2 j , where, for j = 1 , 2 , , N ,
ρ 1 j = G ( u h j 1 ) W ( t j ) W ( t j 1 ) τ , ρ 2 j = G ( u h j 1 ) G ( u h j 1 ) t j 1 t j W ( s ) W ( t j 1 ) τ d W ( s ) .
We consider the time-stepping scheme: given the initial value u h 0 = P h u 0 , find u h n such that
τ α ( u h n u h 0 ) + A h u h n = P h F ( u h n ) + τ α 1 P h g n ,
where the Riemann–Liouville integral/derivative at time t n is approximated using the Grüwald–Letnikov scheme:
τ α v ( t n ) τ α j = 0 n ω n j ( α ) v j = : τ α v n , τ α 1 v ( t n ) τ ( 1 α ) j = 0 n ω n j ( α 1 ) v j = : τ ( 1 α ) v n .
Here, the weights ω n j ( α ) and ω n j ( α 1 ) are generated by the power series expansion ( δ ( ξ ) = 1 ξ ):
δ ( ξ ) α = j = 0 ω j ( α ) ξ j , δ ( ξ ) α 1 = j = 0 ω j ( α 1 ) ξ j ,
respectively. Then, the numerical scheme (30) reads, with g 0 = 0 ,
τ α j = 0 n ω n j ( α ) ( u h j u h 0 ) + A h u h n = P h F ( u h n ) + τ 1 α j = 0 n ω n j ( α 1 ) P h g j , n 1 .
Next, we introduce the new operators R j and R ¯ j , which satisfy
R ˜ ( ξ ) : = j = 0 R j ξ j , R ¯ ˜ ( ξ ) : = j = 0 R ¯ j ξ j ,
where R ˜ ( ξ ) = 1 + ξ ( τ α δ ( ξ ) α + A h ) 1 τ 1 , while R ¯ ˜ ( ξ ) = 1 + ξ ( τ α δ ( ξ ) α + A h ) 1 τ α δ ( ξ ) α 1 .
Following the analysis in [16] as applied to (31), we obtain
u h n = u ¯ n + τ j = 0 n 1 R n j P h F ( u h j + 1 ) + τ j = 0 n 1 R ¯ n j P h ( ρ 1 j + 1 + ρ 2 j + 1 ) ,
where u ¯ n represents the discrete solution of the homogeneous problem in (31). Equivalently, we have
u h n = u ¯ n + j = 0 n 1 t j t j + 1 R n j P h F ( u h j + 1 ) d s + j = 0 n 1 t j t j + 1 R ¯ n j P h G ( u h j ) d W ( s ) + j = 0 n 1 t j t j + 1 R ¯ n j P h G ( u h j ) G ( u h j ) ( W ( s ) W ( t j ) ) d W ( s ) .

5. The Error Estimates

In this section, we provide detailed proofs of the error estimates for the proposed fully discrete scheme (33). Using the semigroup approach, we establish the error estimates presented in Theorems 4 and 5 below.
To complete the proofs of Theorems 4 and 5 below, we need the following lemmas.
Lemma 3 
([16]). Denote F h ( t ) = E ( t ) E h ( t ) P h and F ¯ h ( t ) = E ¯ ( t ) E ¯ h ( t ) P h . Let 0 ν μ 2 and v H ˙ ν . For t > 0 , it holds true that
F h ( t ) v C h μ t α μ ν 2 | v | ν ,
F ¯ h ( t ) v C h μ t α μ ν 2 + α 1 | v | ν .
Lemma 4 
([23]). Let α ( 0 , 1 ) . Let p 1 and N be positive integers and τ > 0 . Let t n = n τ for 0 n N . Let ( y n ) n = 1 N be a nonnegative sequence. Assume that there exist η 1 , , η p 1 [ 0 , 1 ) and s 1 , , s p 1 , b > 0 such that
y n j = 1 p 1 s j t n η j + b τ j = 1 n 1 t n j α 1 y j , 1 n N .
Then, there exists a constant C = C ( η 1 , , η p 1 , α , b , t N ) such that
y n C j = 1 p 1 s j t n η j f o r 1 n N .
For the fully discrete error estimation in L 2 ( Ω , H ) , we introduce an intermediate solution u ˜ h n defined by
u ˜ h n = u ¯ n + j = 0 n 1 t j t j + 1 R n j P h F ( u ( t j + 1 ) ) d s + j = 0 n 1 t j t j + 1 R ¯ n j P h G ( u ( t j ) ) d W ( s ) + j = 0 n 1 t j t j + 1 R ¯ n j P h G ( u ( t j ) ) G ( u ( t j ) ) ( W ( s ) W ( t j ) ) d W ( s ) ;
then, we have
u ( t n ) u ˜ h n = ( E ( t n ) u 0 u ¯ n ) + 0 t n E ¯ ( t n s ) F ( u ( s ) ) d s j = 0 n 1 t j t j + 1 R n j P h F ( u ( t j + 1 ) ) d s + 0 t n E ( t n s ) G ( u ( s ) ) d W ( s ) τ j = 0 n 1 R ¯ n j P h ( ρ 1 ( t j + 1 ) + ρ 2 ( t j + 1 ) ) = I 1 + I 2 + I 3 .
Lemma 5 
([16]). (Error estimate of I 1 ) Assume u 0 L 2 p ( Ω , H ˙ σ ) , where 1 σ 2 and p 1 , is an F 0 -measurable random variable. Then, there exists a constant C such that
I 1 L 2 ( Ω , H ) C τ t n 1 + σ α 2 u 0 L 2 ( Ω , H ˙ σ ) + C h 2 t n α + σ α 2 u 0 L 2 ( Ω , H ˙ σ ) .
Lemma 6. 
(Error estimate of I 2 ) Let ε > 0 and β be defined as in Theorem 3. Then, we have, with 1 2 < α < 1 ,
I 2 L 2 ( Ω , H ) C τ α σ 2 u 0 L 2 ( Ω , H ˙ σ ) + C h 2 ε + C τ min { α , α ( σ κ ) 2 + 1 2 , 2 β } .
Proof. 
See the proof in Appendix A.5 in Appendix A. □
Lemma 7. 
(Error estimate of I 3 ) Let β and η be defined as in Theorem 3. For I 3 , we have the following estimate with 0 σ κ 1 :
I 3 L 2 ( Ω , H ) C h μ + C τ min { 1 , α ( σ κ ) 2 + 1 2 , β + α 2 , η + 1 2 , 2 β } ,
where 0 < μ 2 and α ( μ ( σ κ ) ) 1 .
Proof. 
See the proof in Appendix A.6 in Appendix A. □
Combing Lemmas 5 and 6 with Lemma 7, we obtain the following theorem, designated Theorem 4.
Theorem 4. 
Let p 1 . Let u 0 L 2 p ( Ω , H ˙ σ ) with σ [ 1 , 2 ] . Let β and η be defined as in Theorem 3. We assume that Assumptions A1–A3 hold. Let u be the mild solution defined in (20), and let u ˜ h n be the numerical solution (36). Then, there exists a positive constant C such that the following estimates hold for 0 σ κ 1 , 1 2 < α < 1 , and ε > 0 :
u ( t n ) u ˜ h n L 2 ( Ω , H ) C τ t n 1 + σ α 2 u 0 L 2 ( Ω , H ˙ σ ) + C h 2 t n α + σ α 2 u 0 L 2 ( Ω , H ˙ σ ) + C h { 2 ε , μ } + C τ min { α σ 2 , α , α ( σ κ ) 2 + 1 2 , β + α 2 , η + 1 2 , 2 β } = C τ t n 1 + σ α 2 u 0 L 2 ( Ω , H ˙ σ ) + C h 2 t n α + σ α 2 u 0 L 2 ( Ω , H ˙ σ ) + C h { 2 ε , μ } + C τ min { α σ 2 , α , α ( σ κ ) 2 + 1 2 , α ( σ 1 ) , α ( σ κ ) + 1 α } .
where 0 < μ 2 and α ( μ ( σ κ ) ) 1 .
Now, we turn to the main theorem in this paper.
Theorem 5. 
Let Assumptions A1–A3 hold. Let u be the mild solution in (20), and let u h n be the numerical solution (33). Then, for 1 2 < α < 1 , there exists a constant C independent of τ and h such that, for 0 σ κ 1 and ε > 0 ,
u ( t n ) u h n L 2 ( Ω , H ) C τ t n 1 + σ α 2 u 0 L 2 ( Ω , H ˙ σ ) + C h 2 t n α + σ α 2 u 0 L 2 ( Ω , H ˙ σ ) + C h { 2 ε , μ } + C τ min { α σ 2 , α , α ( σ κ ) 2 + 1 2 , α ( σ 1 ) , α ( σ κ ) + 1 α } ,
where 0 < μ 2 and α ( μ ( σ κ ) ) 1 .
Proof. 
See the proof in Appendix A.4 in Appendix A. □
Remark 1. 
Let 1 2 < α < 1 . Let u 0 L 2 ( Ω , H ˙ σ ) with 1 σ 2 . We have, for σ = κ ,
u ( t ) u h ( t ) L 2 ( Ω , H ) C h 2 t n α + σ α 2 u 0 L 2 ( Ω , H ˙ σ ) + C h { 2 ε , μ } , t [ 0 , T ] ,
where 0 < μ 2 and α μ 1 .
Remark 2. 
Let 1 2 < α < 1 . Let u 0 L 2 ( Ω , H ˙ σ ) with 1 σ 2 . We have, for σ κ = 1 ,
u ( t ) u h ( t ) L 2 ( Ω , H ) C h 2 t n α + σ α 2 u 0 L 2 ( Ω , H ˙ σ ) + C h 2 ε , t [ 0 , T ] .
Remark 3. 
Let 1 2 < α < 1 . Let u 0 L 2 ( Ω , H ˙ σ ) with 1 σ 2 . We have, for σ κ = 1 ,
u h ( t n ) u h n L 2 ( Ω , H ) C τ t n 1 + ν α 2 u 0 L 2 ( Ω , H ˙ σ ) + C τ α .

6. Numerical Simulations

In this section, we consider the numerical simulations for the following semilinear stochastic subdiffusion problem, with α ( 0 , 1 ) ,
D t α 0 C u ( t , x ) 2 u ( t , x ) x 2 = f ( u ( t , x ) ) + D t α 1 0 R G ( u ( t , x ) ) d W ( t ) d t , 0 t T , 0 < x < 1 ,
with the initial condition u ( 0 , x ) = u 0 ( x ) = x ( 1 x ) and the boundary conditions: u ( t , 0 ) = u ( t , 1 ) = 0 . Here, f ( u ) = sin u and G ( u ) = sin u and
d W ( t ) d t = m = 1 γ m 1 / 2 e m d β m ( t ) d t ,
where β m ( t ) , m = 1 , 2 , are the Brownian motions and e m ( x ) = 2 sin m π x denote the eigenfunctions of the operator A = 2 x 2 with D ( A ) = H 0 1 ( 0 , 1 ) H 2 ( 0 , 1 ) . Here, γ m , m = 1 , 2 , are the eigenvalues of the covariance operator Q of the stochastic process W ( t ) , that is, Q e m = γ m e m .
With v ( t , x ) = u ( t , x ) u 0 ( x ) , we rewrite (37) as the following equivalent form: with v ( 0 , x ) = 0 and v ( t , 0 ) = v ( t , 1 ) = 0 ,
D t α 0 C v s . ( t , x ) 2 v s . ( t , x ) x 2 = 2 u 0 ( x ) x 2 + f ( u ( t , x ) ) + g ( t , x ) , 0 t T , 0 < x < 1 ,
where g ( t , x ) = D t α 1 0 R G ( u ( t , x ) ) d W ( t ) d t .
Let 0 = t 0 < t 1 < < t N = T be a partition of the time interval [ 0 , T ] with uniform time step size τ , and let 0 = x 0 < x 1 < < x M = 1 be a partition of the spatial interval [ 0 , 1 ] with uniform space step size h. Let S h denote the piecewise linear finite element space. We approximate v ( t n , x ) by V n S h . The Milstein scheme for (39) is then defined as follows: find V n S h for n = 0 , 1 , , N , such that, with V 0 = 0 ,
τ α j = 1 n w n j V j , χ + ( V n , χ ) = ( P h u 0 , χ ) + ( f ( U n 1 ) , χ ) + ( g n 1 , χ ) , χ S h ,
where U n 1 = V n 1 + u 0 is the approximation of u ( t n 1 , x ) and P h : H S h denotes the L 2 projection operator. For simplicity, we adopt an explicit scheme to approximate the nonlinear term f ( u ) . The weights are generated by the Grüwald–Letnikov scheme for α ( 0 , 1 ) ,
( 1 z ) α = j = 0 w j z j .
Here
g n 1 = D t α 1 0 R G ( U n 1 ) m = 1 γ m 1 / 2 e m ( x ) β m ( t n ) β m ( t n 1 ) τ + D t α 1 0 R G ( U n 1 ) G ( U n 1 ) m = 1 γ m 1 / 2 e m ( x ) t n 1 t n β m ( s ) β m ( t n 1 ) τ d β m ( s ) = : g n 1 ( 1 ) + g n 1 ( 2 ) .
Let M > 1 be a positive integer and Let φ k , k = 1 , 2 , , M 1 denote the finite element basis functions. The kth component f ( U n 1 ) , φ k , k = 1 , 2 , , M 1 can be approximated by using the following formula:
f ( U n 1 ) , φ k = x k 1 x k f ( U n 1 ) φ k d x + x k x k + 1 f ( U n 1 ) φ k d x h 2 f ( U n 1 ( x k 1 ) ) + f ( U n 1 ( x k + 1 ) ) = : h 2 F 1 + F 1 ,
where, with k = 1 , 2 , , M 1 ,
F 1 = f ( U n 1 ( x k 1 ) ) = f ( V n 1 ( x k 1 ) + u 0 ( x k 1 ) ) , F 1 = f ( U n 1 ( x k + 1 ) ) = f ( V n 1 ( x k + 1 ) + u 0 ( x k + 1 ) ) .
The kth component is
g n 1 , φ k = g n 1 ( 1 ) , φ k + g n 1 ( 2 ) , φ k ,
where, with k = 1 , 2 , , M 1 ,
g n 1 ( 1 ) , φ k τ 1 α j = 1 n w n j ( α 1 ) m = 1 M 1 γ m 1 / 2 ( G ( U j 1 ) e m , φ k ) β m ( t j ) β m ( t j 1 ) τ ,
and
g n 1 ( 2 ) , φ k τ 1 α j = 1 n w n j ( α 1 ) m = 1 M 1 γ m 1 / 2 ( G ( U j 1 ) G ( U j 1 ) e m , φ k ) ( β m ( t j ) β m ( t j 1 ) ) 2 τ .
Here, w j ( α 1 ) , j = 0 , 1 , 2 , , n are generated by
( 1 ζ ) α 1 = j = 0 w j ( 1 α ) ζ j ,
and
G ( U j 1 ) , φ k = x k 1 x k G ( U j 1 ) φ k d x + x k x k + 1 G ( U j 1 ) φ k d x h 2 G ( U j 1 ( x k 1 ) ) e m ( x k 1 ) + G ( U j 1 ( x k ) ) e m ( x k ) ,
and
G ( U j 1 ) G ( U j 1 ) , φ k x k 1 x k G ( U j 1 ) G ( U j 1 ) φ k d x + x k x k + 1 G ( U j 1 ) G ( U j 1 ) φ k d x h 2 G ( U j 1 ( x k 1 ) ) G ( U j 1 ( x k 1 ) ) e m ( x k 1 ) + G ( U j 1 ( x k ) ) G ( U j 1 ( x k ) ) e m ( x k ) .
The computational complexity of (40) is relatively low, as it is an explicit method. We remark that in (43) and (44), the noise series is truncated after the first M 1 terms, which does not affect the convergence order with respect to h. Additionally, the integrals in (41) are approximated using the trapezoidal rule, which likewise does not impact the convergence order of h.
Let N ref = 2 7 and T = 1 . Let d t ref = T / N ref denote the reference time step size. To obtain the reference solution v ref , we set the space step size to h = 2 6 and the time step size to d t ref = 2 7 . To observe the time convergence orders, we consider the different time step sizes τ = k a p p a · d t ref , where k a p p a = [ 2 5 , 2 4 , 2 3 , 2 2 ] , and obtain the approximate solution V N . We then calculate the error in L 2 norm at T = 1 for the different time step sizes using M 1 = 20 simulations:
v r e f ( t N ) V N L 2 ( Ω , H ) = E v r e f ( t N ) V N 2 .
We shall consider the following two cases for the numerical simulations using the proposed Milstein scheme.
Case 1: The smooth noise case with γ l = l β 1 , β 1 > 1 which implies that
t r ( Q ) = l = 1 γ l = l = 1 l β 1 < ,
where t r ( Q ) denotes the trace of the operator Q.
Case 2: The nonsmooth noise case with β 1 = 0 .
By Theorem 5, the theoretical convergence orders with σ κ = 1 in Case 1 shows
v ref ( t N ) V N L 2 ( Ω , H ) = O ( τ min { α , α + 1 2 } ) = C τ α .
In Table 1, we consider Case 1 with γ l = l 3 and α = 0.5 , 0.6 , 0.7 , 0.8 , 0.9 . The observed time convergence rates are consistent with the theoretical predictions, as indicated in brackets.
In Table 2, we consider Case 2 with γ l = 1 and α = 0.5 , 0.6 , 0.7 , 0.8 , 0.9 . As expected, the experimentally observed time convergence rates of the Milstein scheme are higher than those achieved by the standard Euler scheme.
We next consider (37) with f ( u ) = u 1 + | u | and g ( u ) = u , which corresponds to a one-dimensional model discussed in Section 6 of [22]. In [22], the authors proposed a fully discrete scheme for solving (37) and established a temporal convergence order of O τ min ( α ( 2 H ¯ + β ¯ 1 ) , 2 ( 2 β ¯ ) α ) 2 , where H ¯ ( 0 , 1 ) denotes the Hurst parameter and β ¯ [ 0 , 1 ] describes the smoothness of the noise (see Theorem 3 in [22]). When H ¯ = 1 / 2 (corresponding to the standard Wiener process, as in our paper) and β ¯ = 1 (corresponding to the trace-class noise), the time convergence order obtained in [22] reduces to O ( τ α / 2 ) , which is lower than our achieved order of O ( τ α ) . In Table 3, we solve this model using the same parameters as in Table 1. We observe that the temporal convergence rates of our scheme are O ( τ α ) , which are notably higher than the O ( τ α / 2 ) order reported in [22].

Conclusions

In this work, we propose a Milstein scheme for solving the stochastic semilinear time-fractional subdiffusion equation with fractionally integrated multiplicative noise. The existence and uniqueness of the mild solution are established using the Banach fixed point theorem. The temporal and spatial regularity of the mild solution are derived through the semigroup approach. For numerical approximation, the standard Galerkin finite element method is employed for spatial discretization, the Grünwald–Letnikov method is used for temporal discretization, and the Milstein scheme is used to approximate the multiplicative noise. Detailed error estimates for the proposed scheme are also provided.

Author Contributions

Conceptualization, X.W. and Y.Y.; methodology, X.W. and Y.Y.; software, Y.Y.; validation, Y.Y.; formal analysis, X.W.; investigation, X.W.; writing—original draft preparation, X.W.; writing—review and editing, Y.Y.; visualization, Y.Y.; supervision, Y.Y.; funding acquisition, X.W. All authors have read and agreed to the published version of the manuscript.

Funding

This research was funded by the Fund Program for the Scientific Activities of Selected Returned Overseas Professionals in Shanxi Province (Grant No. 20240037), the Research Project Supported by Shanxi Scholarship Council of China (Grant No. 2024-139), the Lvliang High Tech Research and Development Program (Grant No. 2023GXYF14), and the Shanxi Provincial Art Science Planning Project (Grant No. 24BA106).

Institutional Review Board Statement

Not applicable.

Informed Consent Statement

Not applicable.

Data Availability Statement

The data are contained within the article.

Acknowledgments

The authors are grateful to the Reviewers and the Associate Editor for their helpful comments.

Conflicts of Interest

The authors declare that they have no competing interests.

Appendix A

In this Appendix, we provide the detailed proofs of Theorems 1–3, 5, and Lemmas 6 and 7.

Appendix A.1. Proof of Theorem 1

Proof. 
Set C ( [ 0 , T ] , L 2 p ( Ω , H ˙ σ ) ) λ , λ > 0 , as the set of functions in C ( [ 0 , T ] , L 2 p ( Ω , H ˙ σ ) ) λ with a weighted norm of
ϕ C λ , σ = sup 0 t T e λ t ϕ L 2 p ( Ω , H ˙ σ ) ,
which is equivalent to the norm ϕ C σ = sup 0 t T ϕ L 2 p ( Ω , H ˙ σ ) in C ( [ 0 , T ] , L 2 p ( Ω , H ˙ σ ) ) . We now define a nonlinear map M : C ( [ 0 , T ] , L 2 p ( Ω , H ˙ σ ) ) λ C ( [ 0 , T ] , L 2 p ( Ω , H ˙ σ ) ) λ as
M v ( t ) = E ( t ) u 0 + 0 t E ¯ ( t s ) F ( v ( s ) ) d s + 0 t E ( t s ) G ( v ( s ) ) d W ( s ) .
For any λ > 0 , the function u ( t ) C ( [ 0 , T ] , L 2 p ( Ω , H ˙ σ ) ) is a solution of (20) if and only if u ( t ) is a fixed point of the map M : C ( [ 0 , T ] , L 2 p ( Ω , H ˙ σ ) ) λ C ( [ 0 , T ] , L 2 p ( Ω , H ˙ σ ) ) λ . In order to apply the Banach fixed point theorem, it is enough to show that for a suitable chosen λ > 0 , M is a contraction. We proceed with the proof in two steps below.
Step 1: We first prove that if v ( t ) C ( [ 0 , T ] , L 2 p ( Ω , H ˙ σ ) ) λ , then M v ( t ) C λ , σ < for a sufficient large number λ > 0 .
In fact, by the triangle inequality, we obtain
e λ t M v ( t ) L 2 p ( Ω , H ˙ σ ) e λ t E ( t ) u 0 L 2 p ( Ω , H ˙ σ ) + e λ t 0 t E ¯ ( t s ) F ( v ( s ) ) d s L 2 p ( Ω , H ˙ σ ) + e λ t 0 t E ( t s ) G ( v ( s ) ) d W ( s ) L 2 p ( Ω , H ˙ σ ) = I + I I + I I I .
For I, we have
I C e λ t u 0 L 2 p ( Ω , H ˙ σ ) C u 0 C λ , σ .
Applying (22) with p = σ ε and q = 0 , (9) yields
I I C 0 t A σ ε 2 e λ ( t s ) E ¯ ( t s ) e λ s F ( v ( s ) ) L 2 p ( Ω , H ) d s C 0 t ( t s ) α ( 1 σ ε 2 ) 1 ( 1 + v ( s ) C λ , σ ) d s C .
Employing the inequalities (23) and (21) with p = κ , q = 0 , l = 0 , and the variable transform s = t θ , we obtain
I I I 2 C 0 t e λ ( t s ) A κ 2 E ( t s ) 2 A σ κ 2 e λ s G ( v ( s ) ) L 2 p ( Ω , L 2 0 ) 2 d s C 0 t e λ ( t s ) ( t s ) α κ d s ( 1 + v ( s ) C λ , σ ) 2 = C 0 1 e λ t ( 1 θ ) ( 1 θ ) α κ t α κ + 1 d θ ( 1 + v ( s ) C λ , σ ) 2 C 0 1 e λ t ( 1 θ ) ( λ t ( 1 θ ) ) α κ 2 + 1 2 ( 1 θ ) α κ 2 1 2 d θ ( T λ ) α κ 2 + 1 2 ( 1 + v ( s ) C λ , σ ) 2 C 0 1 ( 1 θ ) α κ 2 1 2 d θ ( T λ ) α κ 2 + 1 2 ( 1 + v ( s ) C λ , σ ) 2 .
By the definition of κ in (14), we derive, for sufficiently large λ > 0 , M v ( t ) C λ , σ C if v ( t ) C λ , σ C .
Step 2: We prove that M is a contraction mapping on C ( [ 0 , T ] , L 2 p ( Ω , H ˙ σ ) ) λ .
By the triangle inequality, we have
e λ t ( ( M v 1 ) ( t ) ( M v 2 ) ( t ) ) L 2 p ( Ω , H ˙ σ ) C 0 t e λ t E ¯ ( t s ) [ F ( v 1 ( s ) ) F ( v 2 ( s ) ) ] d s L 2 p ( Ω , H ˙ σ ) + C 0 t e λ t E ( t s ) [ G ( v 1 ( s ) ) G ( v 2 ( s ) ) ] d W ( s ) L 2 p ( Ω , H ˙ σ ) .
On the one hand, the use of (10), (22), and s = t θ yields
0 t e λ t E ¯ ( t s ) [ F ( v 1 ( s ) ) F ( v 2 ( s ) ) ] d s L 2 p ( Ω , H ˙ σ ) ) C 0 t e λ ( t s ) ( t s ) α σ ε 2 + α 1 e λ s ( v 1 ( s ) v 2 ( s ) ) L 2 p ( Ω , H ˙ ε ) ) d s C 0 t e λ s s α σ ε 2 + α 1 d s v 1 ( s ) v 2 ( s ) C λ , ε C 0 1 e λ t θ ( λ t θ ) α ( 1 σ ε 2 ) 2 θ α ( 1 σ ε 2 ) 2 1 d θ ( T λ ) α ( 1 σ ε 2 ) 2 C ( T λ ) α ( 1 σ ε 2 ) 2 v 1 ( s ) v 2 ( s ) C λ , σ .
On the other hand, by virtue of inequality (23), the definition of κ (14), (15), and the variable transform s = t θ , we obtain
0 t e λ t E ( t s ) [ G ( v 1 ( s ) ) G ( v 2 ( s ) ) ] d W ( s ) L 2 p ( Ω , H ˙ σ ) ) 2 C 0 t e λ ( t s ) A κ 2 E ( t s ) 2 A σ κ 2 e λ s [ G ( v 1 ( s ) ) G ( v 2 ( s ) ) ] L 2 p ( Ω , L 2 0 ) 2 d s C 0 t e 2 λ ( t s ) ( t s ) α κ d s v 1 ( s ) v 2 ( s ) C λ , σ 2 = C 0 1 e 2 λ t ( 1 θ ) ( 1 θ ) α κ t α κ + 1 d t C 0 1 e 2 λ t ( 1 θ ) ( λ t ( 1 θ ) ) α κ 2 + 1 2 ( 1 θ ) α κ 2 1 2 d θ ( T λ ) α κ 2 + 1 2 v 1 ( s ) v 2 ( s ) C λ , σ 2 C ( T λ ) α κ 2 + 1 2 v 1 ( s ) v 2 ( s ) C λ , σ 2 .
Choosing a sufficiently large λ > 0 , we have
M ( v 1 ) ( t ) M ( v 2 ) ( t ) C λ , σ r v 1 ( s ) v 2 ( s ) C λ , σ , 0 < r < 1 .
Hence, the Banach contraction mapping theorem ensures the existence of a unique fixed point v ( t ) of the nonlinear map M , which is the mild solution given by (20) of the problem (1). This completes the rest of the proof. □

Appendix A.2. Proof of Theorem 2

Proof. 
By the triangle inequality, we have
u ( t ) L 2 p ( Ω , H ˙ σ ) E ( t ) u 0 L 2 p ( Ω , H ˙ σ ) + 0 t E ¯ ( t s ) F ( u ( s ) ) d s L 2 p ( Ω , H ˙ σ ) + 0 t E ( t s ) G ( u ( s ) ) d W ( s ) L 2 p ( Ω , H ˙ σ ) = I + I I + I I I .
As for I, it is easy, using (21) with l = 0 and p = q = σ , to obtain
I C t α σ σ 2 u 0 L 2 p ( Ω , H ˙ σ ) C .
As for I I , the estimate (22) with l = 0 , p = σ , and q = 0 ; (9) in Assumption 2.2; and Theorem 1 lead to
I I C 0 t ( t s ) α ( 1 σ 2 ) 1 sup 0 s T ( 1 + u ( s ) L 2 p ( Ω , H ) ) d s C ,
where we require σ < 2 .
When σ = 2 , by (22) with l = 0 , p = 2 , and q = 0 ; the relationship between E ( t ) and E ¯ ( t ) ( d E ( t ) d t = A E ¯ ( t ) ); (9); (10) and Theorem 1, we have
I I = 0 t A E ¯ ( t s ) F ( u ( s ) ) d s L 2 p ( Ω , H ) 0 t A E ¯ ( t s ) [ F ( u ( s ) F ( u ( t ) ) ] d s L 2 p ( Ω , H ) + 0 t A E ¯ ( t s ) F ( u ( t ) ) d s L 2 p ( Ω , H ) , C 0 t ( t s ) 1 u ( s ) u ( t ) L 2 p ( Ω , H ) d s + 0 t A E ¯ ( s ) d s sup 0 t T F ( u ( t ) ) L 2 p ( Ω , H ) , C 0 t ( t s ) 1 + ε d s + E ( t ) E ( 0 ) C .
Here, ε > 0 will be determined by time regularity in Theorem 2.
The use of the assumption on G (13) implies
I I I 2 C 0 t A κ 2 E ( t s ) 2 A σ κ 2 G ( u ( s ) ) L 2 p ( Ω , L 2 0 ) 2 d s C 0 t ( t s ) α κ ( 1 + u ( s ) L 2 p ( Ω , H ˙ σ ) 2 ) d s C + 0 t ( t s ) α κ u ( s ) L 2 p ( Ω , H ˙ σ ) 2 d s .
Here, the definition of κ ensures 0 t ( t s ) α κ d s < . From (A2)–(A5), we derive Theorem 2 by using the Grönwall inequality in Lemma 2. □

Appendix A.3. Proof of Theorem 3

Proof. 
First, we divide u ( t 2 ) u ( t 1 ) L 2 p ( Ω , H ˙ i ) into three parts, with i = 0 , 1 :
u ( t 2 ) u ( t 1 ) L 2 p ( Ω , H ˙ i ) = ( E ( t 2 ) E ( t 1 ) ) u 0 L 2 p ( Ω , H ˙ i ) + 0 t 2 E ¯ ( t 2 s ) F ( u ( s ) ) d s 0 t 1 E ¯ ( t 1 s ) F ( u ( s ) ) d s L 2 p ( Ω , H ˙ i ) + 0 t 2 E ( t 2 s ) G ( u ( s ) ) d W ( s ) 0 t 1 E ( t 1 s ) G ( u ( s ) ) d W ( s ) L 2 p ( Ω , H ˙ i ) = I + I I + I I I .
As for I, by the estimate (22) with p = 2 + i σ , q = 0 , and l = 0 , we have
I = t 1 t 2 E ( t ) u 0 d t L 2 p ( Ω , H ˙ i ) C t 1 t 2 A 1 + i σ 2 E ¯ ( t ) d t u 0 L 2 p ( Ω , H ˙ σ ) C t 1 t 2 t α ( σ i ) 2 1 d t u 0 L 2 p ( Ω , H ˙ σ ) C ( t 2 t 1 ) α ( σ i ) 2 .
By using (9), the regularity estimate of (22), and Theorem 2, we arrive at the following estimate of I I :
I I 0 t 1 t 1 t 2 A i 2 d E ¯ ( t s ) d t F ( u ( s ) ) d t d s L 2 p ( Ω , H ) + t 1 t 2 A i 2 E ¯ ( t 2 s ) F ( u ( s ) ) d s L 2 p ( Ω , H ) C t 1 t 2 0 t 1 A i 2 d E ¯ ( t s ) d t d s d t + t 1 t 2 A i 2 E ¯ ( t 2 s ) d s sup 0 s T F ( u ( s ) ) L 2 p ( Ω , H ) C t 1 t 2 ( t t 1 ) α i 2 + α 1 d t + C t 1 t 2 ( t 2 s ) α i 2 + α 1 d s C ( t 2 t 1 ) ( 1 i 2 ) α .
For I I I , it is easy to see that
I I I = 0 t 2 E ( t 2 s ) G ( u ( s ) ) d W ( s ) 0 t 1 E ( t 1 s ) G ( u ( s ) ) d W ( s ) L 2 p ( Ω , H ˙ i ) 0 t 1 [ E ( t 2 s ) E ( t 1 s ) ] G ( u ( s ) ) d W ( s ) L 2 p ( Ω , H ˙ i ) + t 1 t 2 E ( t 2 s ) G ( u ( s ) ) d W ( s ) L 2 p ( Ω , H ˙ i ) = I I I 1 + I I I 2 .
For I I I 2 , applying the inequalities (23) and (13) as well as Theorem 1, we obtain, for 0 σ κ 1 and i = 1 ,
I I I 2 2 = t 1 t 2 E ( t 2 s ) G ( u ( s ) ) d W ( s ) L 2 p ( Ω , H ˙ 1 ) 2 C t 1 t 2 A 1 + κ σ 2 E ( t 2 s ) 2 d s sup 0 s T A σ κ 2 G ( u ( s ) ) L 2 p ( Ω , L 2 0 ) 2 C 0 t 2 t 1 s α ( 1 + κ σ ) d s C ( t 2 t 1 ) 1 α ( 1 + κ σ ) ,
and for 0 σ κ 1 and i = 0 , we obtain
I I I 2 2 = t 1 t 2 E ( t 2 s ) G ( u ( s ) ) d W ( s ) L 2 p ( Ω , H ) 2 C t 1 t 2 A κ σ 2 E ( t 2 s ) 2 d s sup 0 s T A σ κ 2 G ( u ( s ) ) L 2 p ( Ω , L 2 0 ) 2 C ( t 2 t 1 ) .
To estimate I I I 1 , we use the inequality (23) and the stochastic Fubini theorem; the estimate for 0 σ κ 1 and i = 1 is as follows:
I I I 1 = t 1 t 2 0 t 1 E t ( t s ) G ( u ( s ) ) d W ( s ) d t L 2 p ( Ω , H ˙ 1 ) C t 1 t 2 0 t 1 A 1 2 E t ( t s ) G ( u ( s ) ) L 2 p ( Ω , L 2 0 ) 2 d s 1 2 d t C t 1 t 2 0 t 1 A 1 + κ σ 2 E t ( t s ) 2 d s 1 2 d t sup 0 s T A σ κ 2 G ( u ( s ) ) L 2 p ( Ω , L 2 0 ) C t 1 t 2 0 t 1 ( t s ) 2 ( α 1 + κ σ 2 1 ) d s 1 2 d t C ( t 2 t 1 ) min { 1 , α ( σ κ ) 2 + 1 2 α 2 } .
Note that E ( t ) = A E ¯ ( t ) ; thus, similar to the estimate (A12), we obtain the following for 0 σ κ 1 and i = 0 :
I I I 1 = t 1 t 2 0 t 1 E t ( t s ) G ( u ( s ) ) d W ( s ) d t L 2 p ( Ω , H ) C t 1 t 2 0 t 1 E t ( t s ) G ( u ( s ) ) L 2 p ( Ω , L 2 0 ) 2 d s 1 2 d t C t 1 t 2 0 t 1 A 2 + κ σ 2 E ¯ ( t s ) 2 d s 1 2 d t sup 0 s T A σ κ 2 G ( u ( s ) ) L 2 p ( Ω , L 2 0 ) C t 1 t 2 0 t 1 ( t s ) α ( σ κ ) 2 d s 1 2 d t C ( t 2 t 1 ) α ( σ κ ) 2 + 1 2 .
Combining the estimates (A7)–(A13), we deduce the following for 0 σ κ 1 :
u ( t 2 ) u ( t 1 ) L 2 p ( Ω , H ˙ 1 ) C ( t 2 t 1 ) α ( σ 1 ) 2 u 0 L 2 p ( Ω , H ˙ σ ) + C ( t 2 t 1 ) min { α 2 , α ( σ κ ) 2 + 1 2 α 2 } ,
and
u ( t 2 ) u ( t 1 ) L 2 p ( Ω , H ) C ( t 2 t 1 ) α σ 2 u 0 L 2 p ( Ω , H ˙ σ ) + C ( t 2 t 1 ) min { α , 1 2 } .
Similarly, we also have, for 0 σ κ 1 ,
u ( t 2 ) u ( t 1 ) t 1 t 2 G ( u ( s ) ) d W ( s ) L 2 p ( Ω , H ) C ( t 2 t 1 ) α σ 2 u 0 L 2 p ( Ω , H ˙ σ ) + C ( t 2 t 1 ) min { α , α ( σ κ ) 2 + 1 2 } .
In fact, we have
u ( t 2 ) u ( t 1 ) t 1 t 2 G ( u ( s ) ) d W ( s ) L 2 p ( Ω , H ) ( E ( t 2 ) E ( t 1 ) ) u 0 L 2 p ( Ω , H ) + 0 t 1 ( E ¯ ( t 2 s ) E ¯ ( t 1 s ) ) F ( u ( s ) ) d s L 2 p ( Ω , H ) + t 1 t 2 E ( t 2 s ) F ( u ( s ) ) d s L 2 p ( Ω , H ) + 0 t 1 ( E ( t 2 s ) E ( t 1 s ) ) G ( u ( s ) ) d W ( s ) L 2 p ( Ω , H ) + t 1 t 2 ( E ( t 2 s ) I ) G ( u ( s ) ) d W ( s ) L 2 p ( Ω , H ) .
For the last term, since A ρ [ ( z α + A ) 1 z α 1 z 1 ] C | z | α ρ 1 for 0 ρ 1 , we obtain
t 1 t 2 ( E ( t 2 s ) I ) G ( u ( s ) ) d W ( s ) L 2 p ( Ω , H ) 2 C t 1 t 2 ( E ( t 2 s ) I ) G ( u ( s ) ) L 2 p ( Ω , L 2 0 ) 2 d s C t 1 t 2 Γ | e z ( t 2 s ) | A κ σ 2 [ ( z α + A ) 1 z α 1 z 1 ] d | z | 2 d s sup 0 s T A σ κ 2 G ( u ( s ) ) L 2 p ( Ω , L 2 0 ) 2 C t 1 t 2 Γ | e z ( t 2 s ) | | z | α σ κ 2 1 d | z | 2 d s C t 1 t 2 ( t 2 s ) α ( σ κ ) C ( t 2 t 1 ) α ( σ κ ) + 1 .
Combining this with the same analysis as in I , I I , and I I I , it holds that
t 1 t 2 ( E ( t 2 s ) I ) G ( u ( s ) ) d W ( s ) L 2 p ( Ω , H ) 2 C ( t 2 t 1 ) α σ 2 u 0 L 2 p ( Ω , H ˙ σ ) + C ( t 2 t 1 ) min { α , α ( σ κ ) 2 + 1 2 } .
Together, these estimates complete the proof of Theorem 3. □

Appendix A.4. Proof of Theorem 5

Proof. 
Let e ˜ n : = u ˜ h n u h n . We write
u ( t n ) u h n = e ˜ n + u ( t n ) u ˜ h n .
Since the error estimates of u ( t n ) u ˜ h n L 2 ( Ω , H ) have been shown in Theorem 4, it now remains to estimate e ˜ n L 2 ( Ω , H ) .
Subtracting (36) from (33), it follows that
e ˜ n L 2 ( Ω , H ) C j = 0 n 1 t j t j + 1 [ R n j P h ( F ( u ( t j + 1 ) ) F ( u h j + 1 ) ) ] d s L 2 ( Ω , H ) + j = 0 n 1 t j t j + 1 R ¯ n j P h [ G ( u ( t j ) ) + G ( u ( t j ) ) G ( u ( t j ) ) ( W ( s ) W ( t j ) ) ] d W ( s ) j = 0 n 1 t j t j + 1 R ¯ n j P h [ G ( u h j ) + G ( u h j ) G ( u h j ) ( W ( s ) W ( t j ) ) ] d W ( s ) L 2 ( Ω , H ) C j = 0 n 1 t j t j + 1 [ R n j P h ( F ( u ( t j + 1 ) ) F ( u h j + 1 ) ) ] d s L 2 ( Ω , H ) + j = 0 n 1 t j t j + 1 R ¯ n j P h [ G ( u ( t j ) ) G ( u h j ) ] d W ( s ) L 2 ( Ω , H ) + j = 0 n 1 t j t j + 1 R ¯ n j P h [ G ( u ( t j ) ) G ( u ( t j ) ) G ( u h j ) G ( u h j ) ] ( W ( s ) W ( t j ) ) L 2 ( Ω , H ) = J 1 + J 2 + J 3 .
For J 1 , the use of (10) and R n j C ( t n t j ) α 1 yields
J 1 C j = 0 n 1 t j t j + 1 ( t n t j ) α 1 u ( t j + 1 ) u h j + 1 L 2 ( Ω ; H ) d s C τ j = 0 n 1 ( t n t j + 1 ) α 1 u ( t j + 1 ) u h j + 1 L 2 ( Ω ; H ) C τ j = 1 n ( t n t j ) α 1 u ( t j ) u h j ) L 2 ( Ω ; H ) .
For J 2 , by the estimate of R ¯ n C and (15), we derive
J 2 2 C j = 0 n 1 t j t j + 1 R ¯ n j P h G ( u ( t j ) ) G ( u h j ) L 2 ( Ω , L 2 0 ) 2 d s C j = 0 n 1 t j t j + 1 u ( t j ) u h j L 2 ( Ω , H ) 2 d s C τ j = 0 n 1 u ( t j ) u h j L 2 ( Ω , H ) 2 .
Similar to the estimate of J 2 , by employing the fact that E | β l ( t j ) β l ( s ) | 2 C τ and invoking (18), we can obtain
J 3 2 C j = 0 n 1 t j t j + 1 R ¯ n j P h G ( u ( t j ) ) G ( u ( t j ) ) G ( u h j ) G ( u h j ) ] ( W ( s ) W ( t j ) ) L 2 ( Ω , L 2 0 ) 2 d s C j = 0 n 1 t j t j + 1 l = 1 E G ( u ( t j ) ) G ( u ( t j ) ) G ( u h j ) G ( u h j ) ] ( W ( s ) W ( t j ) ) Q 1 2 e l 2 d s C j = 0 n 1 t j t j + 1 l = 1 k = 1 E G ( u ( t j ) ) G ( u ( t j ) ) G ( u h j ) G ( u h j ) ] λ l 1 2 λ k 1 2 e k e l 2 · E | β l ( t j ) β l ( s ) | 2 d s C τ 2 j = 0 n 1 E G ( u ( t j ) ) G ( u ( t j ) ) G ( u h j ) G ( u h j ) H S ( Q 1 2 ( H ) , L 2 0 ) 2 d s C τ 2 j = 0 n 1 u ( t j ) u h j ) L 2 ( Ω , H ) 2 .
From (A14)–(A16) and Theorem 4, we derive
u ( t n ) u h n L 2 ( Ω , H ) 2 C τ 2 t n 2 + σ α u 0 L 2 ( Ω , H ˙ σ ) 2 + C h 4 t n 2 α + σ α u 0 L 2 ( Ω , H ˙ σ ) 2 + C h { 4 2 ε , 2 μ } + C τ 2 + C τ min { α σ 2 , α , α ( σ κ ) 2 + 1 2 , α ( σ 1 ) , α ( σ κ ) + 1 α } + C τ j = 1 n 1 ( t n t j ) 2 α 2 u ( t j ) u h j ) L 2 ( Ω ; H ) 2 + C τ j = 1 n 1 u ( t j ) u h j ) L 2 ( Ω ; H ) 2 .
An application of the Grönwall lemma (Lemma 4) shows
u ( t n ) u h n L 2 ( Ω , H ) C τ t n 1 + σ α 2 u 0 L 2 ( Ω , H ˙ σ ) + C h 2 t n α + σ α 2 u 0 L 2 ( Ω , H ˙ σ ) + C h { 2 ε , μ } + + C τ min { α σ 2 , α , α ( σ κ ) 2 + 1 2 , α ( σ 1 ) , α ( σ κ ) + 1 α } ,
where 0 < μ 2 and α ( μ ( σ κ ) ) 1 , with 1 2 < α < 1 . The proof of Theorem 5 is now complete. □

Appendix A.5. Proof of Lemma 6

Proof. 
Divide I 2 as I 2 = j = 1 4 I 2 j , where
I 2 1 = j = 0 n 1 t j t j + 1 E ¯ ( t n s ) F ( u ( s ) ) F ( u ( t j + 1 ) ) d s , I 2 2 = j = 0 n 1 t j t j + 1 E ¯ ( t n s ) E ¯ h ( t n s ) P h F ( u ( t j + 1 ) ) d s , I 2 3 = j = 0 n 1 t j t j + 1 E ¯ h ( t n s ) E ¯ h ( t n t j ) P h F ( u ( t j + 1 ) ) d s , I 2 4 = j = 0 n 1 t j t j + 1 E ¯ h ( t n t j ) R n j P h F ( u ( t j + 1 ) ) d s .
For I 2 1 , by using the Taylor expansion
F ( u ( t j + 1 ) ) = F ( u ( s ) ) + F ( u ( s ) ) ( u ( t j + 1 ) u ( s ) ) + 0 1 F ( u ( s ) + r u ( t j + 1 ) u ( s ) ) u ( t j + 1 ) u ( s ) , u ( t j + 1 ) u ( s ) ( 1 r ) d r = F ( u ( s ) ) + F ( u ( s ) ) ( u ( t j + 1 ) u ( s ) ) + R ˜ F ( u ( s ) , u ( t j + 1 ) ) ,
we obtain
I 2 1 L 2 ( Ω , H ) j = 0 n 1 t j t j + 1 E ¯ ( t n s ) F ( u ( s ) ) E ( t j + 1 ) E ( s ) u 0 d s L 2 ( Ω , H ) + j = 0 n 1 t j t j + 1 E ¯ ( t n s ) F ( u ( s ) ) 0 s ( E ¯ ( t j + 1 t ) E ¯ ( s t ) ) F ( u ( t ) ) d t d s L 2 ( Ω ; H ) + j = 0 n 1 t j t j + 1 E ¯ ( t n s ) F ( u ( s ) ) s t j + 1 E ¯ ( t j + 1 t ) F ( u ( t ) ) d t d s L 2 ( Ω ; H ) + j = 0 n 1 t j t j + 1 E ¯ ( t n s ) F ( u ( s ) ) 0 s ( E ( t j + 1 t ) E ( s t ) ) G ( u ( t ) ) d W ( t ) d s L 2 ( Ω ; H ) + j = 0 n 1 t j t j + 1 E ¯ ( t n s ) F ( u ( s ) ) s t j + 1 E ( t j + 1 t ) G ( u ( t ) ) d W ( t ) d s L 2 ( Ω ; H ) + j = 0 n 1 t j t j + 1 E ¯ ( t n s ) R ˜ F ( u ( s ) , u ( t j + 1 ) ) d s L 2 ( Ω ; H ) = : I 2 11 + I 2 12 + I 2 13 + I 2 14 + I 2 15 + I 2 16 .
For I 2 11 , applying the regularity estimate of E ( t ) in (21), E ¯ ( t ) in (22), and (11), we have
I 2 11 j = 0 n 1 t j t j + 1 A ν 2 E ¯ ( t n s ) F ( u ( s ) ) E ( t j + 1 ) E ( s ) u 0 L 2 ( Ω , H ˙ ν ) d s C j = 0 n 1 t j t j + 1 ( t n s ) ( 1 ν 2 ) α 1 ( E ( t j + 1 ) E ( s ) ) u 0 L 4 ( Ω , H ˙ σ 1 ) d s sup 0 s T ( 1 + u ( s ) L 4 ( Ω , H ˙ σ 1 ) ) .
Note that sup 0 t T u ( t ) L 4 ( Ω , H ˙ σ 1 ) < , and
( E ( t j + 1 ) E ( s ) ) u 0 L 4 ( Ω , H ) C s t j + 1 A 1 σ 2 E ¯ ( t ) d t u 0 L 4 ( Ω , H ˙ σ ) C s t j + 1 t α σ 2 1 d t C τ α σ 2 ;
thus, we arrive at
I 2 11 C 0 t n ( t n s ) ( 1 ν 2 ) α 1 d s τ α σ 2 C τ α σ 2 .
Since
0 s ( E ¯ ( t j + 1 t ) E ¯ ( s t ) ) F ( u ( t ) ) d t L 4 ( Ω , H ˙ σ 1 ) C 0 s s t t j + 1 t E ¯ ( r ) d r d t sup 0 t T F ( u ( t ) ) L 4 ( Ω , H ) C 0 s s t j + 1 ( r t ) α 2 d r d t C s t j + 1 ( r s ) α 1 d r C τ α ,
and
s t j + 1 E ¯ ( t j + 1 t ) F ( u ( t ) ) d t L 4 ( Ω , H ˙ σ 1 ) C s t j + 1 ( t j + 1 t ) α 1 d t sup 0 t T F ( u ( t ) ) L 4 ( Ω , H ) C τ α ,
we use the same argument as in I 2 11 to arrive at
I 2 12 C τ α 0 t n ( t n s ) ( 1 ν 2 ) α 1 d s sup 0 s T F ( u ( s ) ) L 4 ( Ω , H ) C τ α , a n d I 2 13 C τ α .
For I 2 14 , by writing 0 s = 0 t j + t j s , s [ t j , t j + 1 ] and using the stochastic Fubini theorem, we have
I 2 14 j = 0 n 1 0 t j t j t j + 1 E ¯ ( t n s ) F ( u ( s ) ) E ( t j + 1 t ) E ( s t ) G ( u ( t ) ) d s d W ( t ) L 2 ( Ω ; H ) + j = 0 n 1 t j t j + 1 t t j + 1 E ¯ ( t n s ) F ( u ( s ) ) E ( t j + 1 t ) E ( s t ) G ( u ( t ) ) d s d W ( t ) L 2 ( Ω ; H ) j = 0 n 1 0 t j t j t j + 1 E ¯ ( t n s ) F ( u ( s ) ) E ( t j + 1 t ) E ( s t ) G ( u ( t ) ) d s d W ( t ) L 2 ( Ω ; H ) + j = 0 n 1 t j t j + 1 t j t j + 1 E ¯ ( t n s ) F ( u ( s ) ) E ( t j + 1 t ) E ( s t ) G ( u ( t ) ) d s d W ( t ) L 2 ( Ω , H ) : = H .
Applying the discrete Burkholder inequality and the Cauchy–Schwarz inequality, we arrive at
H C j = 0 n 1 0 t j t j t j + 1 E ¯ ( t n s ) F ( u ( s ) ) s t t j + 1 t E ( r ) G ( u ( t ) ) d r d s L 2 ( Ω ; L 2 0 ) 2 d t 1 2 + C j = 0 n 1 t j t j + 1 t j t j + 1 E ¯ ( t n s ) F ( u ( s ) ) s t t j + 1 t E ( r ) G ( u ( t ) ) d r d s L 2 ( Ω ; L 2 0 ) 2 d t 1 2 C τ 1 2 { j = 0 n 1 0 t j t j t j + 1 E ¯ ( t n s ) F ( u ( s ) ) s t t j + 1 t E ( r ) G ( u ( t ) ) d r L 2 ( Ω ; L 2 0 ) 2 d s d t } 1 2 + C τ 1 2 { j = 0 n 1 t j t j + 1 t j t j + 1 E ¯ ( t n s ) F ( u ( s ) ) s t t j + 1 t E ( r ) G ( u ( t ) ) d r L 2 ( Ω ; L 2 0 ) 2 d s d t } 1 2 .
Note that, by (10) for 0 σ κ 1 ,
E ¯ ( t n s ) F ( u ( s ) ) s t t j + 1 t E ( r ) G ( u ( t ) ) d r L 2 ( Ω , L 2 0 ) 2 C ( t n s ) 2 ( α 1 ) l = 1 F ( u ( s ) ) s t t j + 1 t E ( r ) G ( u ( t ) ) d r Q 1 2 e l L 2 ( Ω , H ) 2 C ( t n s ) 2 ( α 1 ) l = 1 s t t j + 1 t E ( r ) G ( u ( t ) ) d r Q 1 2 e l L 2 ( Ω , H ) 2 C ( t n s ) 2 ( α 1 ) s t t j + 1 t A 2 + κ σ 2 E ¯ ( r ) d r 2 sup 0 t T A σ κ 2 G ( u ( t ) ) L 2 ( Ω , L 2 0 ) 2 .
Thus, with 1 2 < α < 1 , we have
I 2 14 C τ 1 2 j = 0 n 1 t j t j + 1 ( t n s ) 2 ( α 1 ) 0 t j s t t j + 1 t r α σ κ 2 1 d r 2 d t d s 1 2 + C τ 1 2 j = 0 n 1 t j t j + 1 ( t n s ) 2 ( α 1 ) t j t j + 1 s t t j + 1 t r α σ κ 2 1 d r 2 d t d s 1 2 C τ 1 2 0 t n ( t n s ) 2 ( α 1 ) d s C τ 1 2 + α ( σ κ ) 2 .
Similar to the estimate of J 2 14 , we obtain
I 2 15 j = 0 n 1 t j t j + 1 t j t j + 1 E ¯ ( t n s ) F ( u ( s ) ) E ( t j + 1 t ) G ( u ( t ) ) d s L 2 ( Ω ; L 2 0 ) 2 d t 1 2 τ 1 2 j = 0 n 1 t j t j + 1 t j t j + 1 ( t n s ) 2 ( α 1 ) A κ σ 2 E ( t j + 1 t ) 2 d t d s 1 2 A σ κ 2 G ( u ( t ) ) L 2 ( Ω , L 2 0 ) τ 0 t n ( t n s ) 2 ( α 1 ) d s 1 2 C τ .
Now we turn to the estimate of I 2 16 . Applying the same argument as for I 2 11 and using (12) and the time regularity in Theorem 3, we show that
I 2 16 C j = 0 n 1 t j t j + 1 ( t n s ) ( 1 θ 2 ) α 1 0 1 F u ( s ) + r u ( t j + 1 ) u ( s ) u ( t j + 1 ) u ( s ) , u ( t j + 1 ) u ( s ) ( 1 r ) L 2 ( Ω , H ˙ θ ) d r d s C j = 0 n 1 t j t j + 1 ( t n s ) ( 1 θ 2 ) α 1 ( u ( t j + 1 ) u ( s ) ) 2 L 2 ( Ω , H ) d s C j = 0 n 1 t j t j + 1 ( t n s ) ( 1 θ 2 ) α 1 u ( t j + 1 ) u ( s ) L 4 ( Ω ; H ˙ 1 ) 2 d s C τ 2 β .
Combining the above estimates I 2 11 I 2 16 , we arrive at
I 2 1 L 2 ( Ω , H ) C τ α σ 2 u 0 L 2 ( Ω , H ˙ σ ) + C τ min { α , α ( σ κ ) 2 + 1 2 , 2 β } ,
where β is defined in Theorem 3.
For I 2 2 , the use of (35) with ν = 0 and μ = 2 ε yields
I 2 2 L 2 ( Ω , H ) C h 2 ε 0 t n ( t n s ) α ε 2 1 d s sup 0 t T F ( u ( t ) ) L 2 ( Ω , H ) C h 2 ε .
For I 2 3 , we divide 0 t n = 0 t n 1 + t n 1 t n and use the regularity estimate of E ¯ ( t ) to obtain
I 2 3 L 2 ( Ω , H ) C j = 0 n 1 t j t j + 1 t n t j t n s E ¯ ( r ) d r d s sup 0 t T F ( u ( t ) ) L 2 ( Ω , H ) C j = 0 n 2 t j t j + 1 t j s ( t n r ) α 2 d r d s + t n 1 t n τ t n s r α 2 d r d s C τ 0 t n 1 ( t n r ) α 2 d r + C τ α C τ α .
Next, we turn to the estimate I 2 4 . Applying the estimate ( E ¯ h ( t n ) R n ) P h C τ t n α 2 (see Lemma 4.6 in [16]), we obtain
I 2 4 L 2 ( Ω , H ) C τ j = 0 n 1 t j t j + 1 ( t n t j ) α 2 d s sup 0 t T F ( u ( t ) ) L 2 ( Ω , H ) C τ j = 0 n 2 t j t j + 1 ( t n t j ) α 2 d s + t n 1 t n τ α 2 d s C τ α .
From the estimates of I 2 1 , I 2 2 , I 2 3 , and I 2 4 , we complete the proof of Lemma 6, i.e.,
I 2 L 2 ( Ω , H ) C τ α σ 2 u 0 L 2 ( Ω , H ˙ σ ) + C h 2 ε + C τ min { α , α ( σ κ ) 2 + 1 2 , 2 β } ,
where β is defined in Theorem 3. □

Appendix A.6. Proof of Lemma 7

Proof. 
Note that
I 3 = 0 t n E ( t n s ) G ( u ( s ) ) d W ( s ) j = 0 n 1 t j t j + 1 R ¯ n j P h ( ρ 1 ( t j + 1 ) + ρ 2 ( t j + 1 ) ) d s .
Rewrite I 3 as
I 3 = j = 0 n 1 t j t j + 1 E ( t n s ) G ( u ( s ) ) d W ( s ) j = 0 n 1 t j t j + 1 R ¯ n j P h [ G ( u ( t j ) ) + G ( u ( t j ) ) G ( u ( t j ) ) ( W ( s ) W ( t j ) ) ] d W ( s ) = j = 0 n 1 t j t j + 1 ( E ( t n s ) E ( t n t j ) ) G ( u ( s ) ) d W ( s ) + j = 0 n 1 t j t j + 1 ( E ( t n t j ) E h ( t n t j ) P h ) G ( u ( s ) ) d W ( s ) + j = 0 n 1 t j t j + 1 ( E h ( t n t j ) R ¯ n j ) P h G ( u ( s ) ) d W ( s ) + j = 0 n 1 t j t j + 1 R ¯ n j P h [ G ( u ( s ) ) G ( u ( t j ) ) G ( u ( t j ) ) G ( u ( t j ) ) ( W ( s ) W ( t j ) ) ] d W ( s ) : = I 3 1 + I 3 2 + I 3 3 + I 3 4 .
For I 3 1 , by the regularity estimate of E ( t ) and the Burkholder inequality in Lemma 1, we have
I 3 1 L 2 ( Ω , H ) C j = 0 n 1 t j t j + 1 t n s t n t j E ( r ) G ( u ( s ) ) d r d W ( s ) L 2 ( Ω , H ) C j = 0 n 1 t j t j + 1 t n s t n t j E ( r ) G ( u ( s ) ) d r L 2 ( Ω , L 2 0 ) 2 d s 1 2 C j = 0 n 1 t j t j + 1 t n s t n t j A κ σ 2 E ( r ) d r 2 d s 1 2 sup 0 s T A σ κ 2 G ( u ( s ) ) L 2 ( Ω , L 2 0 ) .
For 0 σ κ 1 , we have
I 3 1 L 2 ( Ω , H ) C j = 0 n 1 t j t j + 1 t n s t n t j r α ( σ κ ) 2 1 d r 2 d s 1 2 C t n 1 t n t n s τ r α ( σ κ ) 2 1 d r 2 d s + j = 0 n 2 t j t j + 1 t n s t n t j r α ( σ κ ) 2 1 d r 2 d s 1 2 C τ min { 1 , α ( σ κ ) 2 + 1 2 } .
For I 3 2 , we can easily check that, from (34) in Lemma 3,
I 3 2 L 2 ( Ω , H ) C j = 0 n 1 t j t j + 1 ( E ( t n t j ) E h ( t n t j ) P h ) G ( u ( s ) ) d W ( s ) L 2 ( Ω , H ) C j = 0 n 1 t j t j + 1 A κ σ 2 F h ( t n t j ) 2 d s 1 2 sup 0 s T A σ κ 2 G ( u ( s ) ) L 2 ( Ω , L 2 0 ) C τ 1 2 h μ j = 0 n 1 ( t n t j ) α ( μ ( σ κ ) ) 1 2 C τ 1 2 h μ τ α ( μ ( σ κ ) ) + τ α ( μ ( σ κ ) ) 0 n 2 ( n x ) α ( μ ( σ κ ) ) d x 1 2 C τ 1 2 α 2 ( μ ( σ κ ) ) h μ ( 1 + n 1 α ( μ ( σ κ ) ) ) 1 2 C h μ ,
where we require α ( μ ( σ κ ) ) 1 .
For I 3 3 , by applying the estimate A ρ 2 ( E h ( t n t j ) Q n j ) C τ ( t n t j ) α ρ 2 1 ( 0 ρ 1 ) , we obtain, for 0 σ κ 1 ,
I 3 3 L 2 ( Ω , H ) j = 0 n 1 t j t j + 1 ( E ( t n t j ) R ¯ n j ) P h G ( u ( s ) ) L 2 ( Ω , L 2 0 ) 2 d s 1 2 j = 0 n 1 t j t j + 1 A κ σ 2 ( E ( t n t j ) R ¯ n j ) d s 1 2 A σ κ 2 G ( u ( s ) ) L 2 ( Ω , L 2 0 ) C τ j = 0 n 1 t j t j + 1 ( t n t j ) α ( σ κ ) 2 d s 1 2 C τ α ( σ κ ) 2 + 1 2 .
For I 3 4 , by employing R ¯ n C , the Burkholder inequality, and the Taylor expansion
G ( u ( s ) ) G ( u ( t j ) ) = G ( u ( t j ) ) ( u ( s ) u ( t j ) ) + R G ( u ( s ) , u ( t j ) ) ,
we obtain
I 3 4 L 2 ( Ω , H ) C ( j = 0 n 1 t j t j + 1 R ¯ n j P h [ G ( u ( s ) ) G ( u ( t j ) ) G ( u ( t j ) ) G ( u ( t j ) ) ( W ( s ) W ( t j ) ) ] L 2 ( Ω , L 2 0 ) 2 d s ) 1 2 C j = 0 n 1 t j t j + 1 ( H 1 + H 2 + H 3 ) 2 d s 1 2 ,
where
H 1 = G ( u ( t j ) ) u ( s ) u ( t j ) t j s G ( u ( r ) ) d W ( r ) L 2 ( Ω , L 2 0 ) ,
H 2 = G ( u ( t j ) ) t j s ( G ( u ( r ) ) G ( u ( t j ) ) ) d W ( r ) L 2 ( Ω , L 2 0 ) ,
and
H 3 = R G ( u ( s ) , u ( t j ) ) L 2 ( Ω , L 2 0 ) .
For H 1 , by the definition of the norm in L 2 0 and the assumption for G ( u ) (16), we obtain
H 1 C G ( u ( t j ) ) L ( H , L 2 0 ) u ( s ) u ( t j ) t j s G ( u ( r ) ) d W ( r ) L 2 ( Ω , H ) C τ β + α 2 .
Similar to the estimate of H 1 , we obtain
H 2 C G ( u ( t j ) ) L ( H , L 2 0 ) t j s ( G ( u ( r ) ) G ( u ( t j ) ) ) d W ( r ) L 2 ( Ω , H ) C t j s G ( u ( r ) ) G ( u ( t j ) ) L 2 ( Ω , L 2 0 ) 2 d r 1 2 C τ η + 1 2 .
Similarly, for H 3 , we can use (17) to obtain
H 3 C 0 1 G ( u ( t j ) + λ ( u ( s ) u ( t j ) ) ) ( u ( s ) u ( t j ) ) 2 ( 1 λ ) d λ L 2 ( Ω , L 2 0 ) C G ( u ( t j ) + λ ( u ( s ) u ( t j ) ) ) L 2 ( H , L 2 0 ) ( u ( s ) u ( t j ) ) 2 L 2 ( Ω , H ) C u ( s ) u ( t j ) L 4 ( Ω , L 4 ) 2 C u ( s ) u ( t j ) L 4 ( Ω , H ˙ 1 ) 2 C τ 2 β .
Let β and η be defined as in Theorem 3. From the estimates H 1 H 3 , we arrive at
I 3 4 L 2 ( Ω , H ) C τ min { η + 1 2 , β + α 2 , 2 β } 0 t n 1 1 2 d s C τ min { η + 1 2 , β + α 2 , 2 β } .
Combining the estimates (A26), (A27), (A28), and (A32), we derive, for 0 σ κ 1 ,
I 3 L 2 ( Ω , H ) C h μ + C τ min { 1 , α ( σ κ ) 2 + 1 2 , β + α 2 , η + 1 2 , 2 β } ,
where 0 < μ 2 and α ( μ ( σ κ ) ) 1 . □

References

  1. Lord, G.J.; Powell, C.E.; Shardlow, T. An Introduction to Computational Stochastic PDEs; Cambridge University Press: Cambridge, UK, 2014. [Google Scholar]
  2. Jentzen, A.; Röckner, M. A Milstein scheme for SPDEs. Found. Comput. Math. 2015, 15, 313–362. [Google Scholar] [CrossRef]
  3. Adams, E.E.; Gelhar, L.W. Field study of dispersion in a heterogeneous aquifer: 2. Spatial moments analysis. Water Resour. Res. 1992, 28, 3293–3307. [Google Scholar] [CrossRef]
  4. Gorenflo, R.; Mainardi, F. Random walk models for space fractional diffusion processes. Fract. Calc. Appl. Anal. 1998, 1, 167–191. [Google Scholar]
  5. Hatano, Y.; Hatano, N. Dispersive transport of ions in column experiments: An explanation of long-tailed profiles. Water Resour. Res. 1998, 34, 1027–1033. [Google Scholar] [CrossRef]
  6. Nigmatulin, R. The realization of the generalized transfer equation in a medium with fractal geometry. Phys. Status Solidi B 1986, 133, 425–430. [Google Scholar] [CrossRef]
  7. Chen, Z.-Q.; Kim, K.-H.; Kim, P. Fractional time stochastic partial differential equations. Stoch. Process. Appl. 2015, 125, 1470–1499. [Google Scholar] [CrossRef]
  8. Anh, V.V.; Leonenko, N.N.; Ruiz-Medina, M.D. Space-time fractional stochastic equations on regular bounded open domains. Fract. Calc. Appl. Anal. 2016, 19, 1161–1199. [Google Scholar] [CrossRef]
  9. Mijena, J.B.; Nane, E. Space–time fractional stochastic partial differential equations. Stoch. Process. Appl. 2015, 125, 3301–3326. [Google Scholar] [CrossRef]
  10. Mijena, J.B.; Nane, E. Intermittence and space-time fractional stochastic partial differential equations. Potential Anal. 2016, 44, 295–312. [Google Scholar] [CrossRef]
  11. Liu, W.; Röckner, M.; da Silva, J.L. Quasi-linear (stochastic) partial differential equations with time-fractional derivatives. SIAM J. Math. Anal. 2018, 50, 2588–2607. [Google Scholar] [CrossRef]
  12. Foondun, M.; Mijena, J.B.; Nane, E. Non-linear noise excitation for some space-time fractional stochastic equations in bounded domains. Fract. Calc. Appl. Anal. 2016, 19, 1527–1553. [Google Scholar] [CrossRef]
  13. Chen, L. Nonlinear stochastic time-fractional diffusion equations on R: Moments, Holder regularity and intermittency. Trans. Amer. Math. Soc. 2017, 369, 8497–8535. [Google Scholar] [CrossRef]
  14. Chen, L.; Hu, Y.; Nualart, D. Nonlinear stochastic time-fractional slow and fast diffusion equations on Rd. Stoch. Process. Appl. 2019, 129, 5073–5112. [Google Scholar] [CrossRef]
  15. Kang, W.; Yan, Y.; Panic, A.K. Galerkin finite element approximation of a stochastic semilinear fractional subdiffusion with fractionally integrated additive noise. IMA J. Numer. Anal. 2022, 42, 2301–2335. [Google Scholar] [CrossRef]
  16. Jin, B.; Yan, Y.; Zhou, Z. Numerical approximation of stochastic time-fractional diffusion. ESAIM Math. Model. Numer. Anal. 2019, 53, 1245–1268. [Google Scholar] [CrossRef]
  17. Gunzburger, M.; Li, B.; Wang, J. Convergence of finite element solutions of stochastic partial integral-differential equations driven by white noise. Numer. Math. 2019, 141, 1043–1077. [Google Scholar] [CrossRef]
  18. Gunzburger, M.; Li, B.; Wang, J. Sharp convergence rates of time discretization for stochastic time-fractional PDEs subject to additive space-time white noise. Math. Comput. 2019, 88, 1715–1741. [Google Scholar] [CrossRef]
  19. Wu, X.; Yan, Y.; Yan, Y. An analysis of the L1 scheme for stochastic subdiffusion problem driven by integrated space-time white noise. Appl. Numer. Math. 2020, 157, 69–87. [Google Scholar] [CrossRef]
  20. Liu, X. Error analysis of a fully discrete method for time-fractional diffusion equations with a tempered fractional Gaussian noise. J. Comput. Appl. Math. 2024, 449, 115953. [Google Scholar] [CrossRef]
  21. Hu, Y.; Li, C.; Yan, Y. Weak convergence of the L1 scheme for a stochastic subdiffusion problem driven by fractionally integrated additive noise. Appl. Numer. Math. 2022, 178, 192–215. [Google Scholar] [CrossRef]
  22. Noupelah, A.J.; Tambue, A.; Woukeng, J.L. Strong convergence of a fractional exponential integrator scheme for finite element discretization of time-fractional SPDE driven by fractional and standard Brownian motions. Commun. Nonlinear Sci. Numer. Simul. 2023, 125, 107371. [Google Scholar] [CrossRef]
  23. Al-Maskari, M.; Karaa, S. Strong convergence rates for the approximation of a stochastic time-fractional Allen–Cahn equation. Commun. Nonlinear Sci. Numer. Simul. 2023, 119, 107099. [Google Scholar] [CrossRef]
  24. Liu, Z.; Qiao, Z. Strong approximation of monotone stochastic partial differential equations driven by multiplicative noise. Stoch. Partial. Differ. Equ. Anal. Comput. 2020, 9, 559–602. [Google Scholar] [CrossRef]
  25. Qi, X.; Azaiez, M.; Huang, C.; Xu, C. An efficient numerical approach for stochastic evolution PDEs driven by random diffusion coefficients and multiplicative noise. AIMS Math. 2022, 7, 20684–20710. [Google Scholar] [CrossRef]
  26. Qi, X.; Zhang, Y.; Xu, C. An efficient approximation to the stochastic Allen-Cahn equation with random diffusion coefficient field and multiplicative noise. Adv. Comput. Math. 2023, 49, 73–103. [Google Scholar] [CrossRef]
  27. Chen, Z.; Gan, S.; Wang, X. A full-discrete exponential Euler approximation of the invariant measure for parabolic stochastic partial differential equations. Appl. Numer. Math. 2020, 157, 135–158. [Google Scholar] [CrossRef]
  28. Qi, R.; Wang, X. Optimal error estimates of Galerkin finite element methods for stochastic Allen–Cahn equation with additive noise. J. Sci. Comput. 2019, 80, 1171–1194. [Google Scholar] [CrossRef]
Table 1. Time convergence orders at T = 1 for smooth noise in Case 1 with various α > 1 2 , where γ l = l 3 for l = 1 , 2 , .
Table 1. Time convergence orders at T = 1 for smooth noise in Case 1 with various α > 1 2 , where γ l = l 3 for l = 1 , 2 , .
α 1 α τ = 1 / 4 1 / 8 1 / 16 1 / 32 Order
0.5 0.53.89 × 10−32.19 × 10−31.73 × 10−31.21 × 10−3 
   0.830.340.510.56 (0.50)
0.6 0.44.90 × 10−32.69 × 10−32.01 × 10−31.26 × 10−3 
   0.860.420.670.65 (0.60)
0.7 0.36.11 × 10−33.25 × 10−32.30 × 10−31.28 × 10−3 
   0.910.500.840.75 (0.70)
0.8 0.27.41 × 10−33.81 × 10−32.58 × 10−31.31 × 10−3 
   0.960.560.980.83 (0.80)
0.9 0.18.46 × 10−34.17 × 10−32.73 × 10−31.31 × 10−3 
   1.020.611.060.90 (0.90)
Table 2. Time convergence orders at T = 1 for nonsmooth noise in Case 2 with various α > 1 2 , where γ l = 1 for l = 1 , 2 , .
Table 2. Time convergence orders at T = 1 for nonsmooth noise in Case 2 with various α > 1 2 , where γ l = 1 for l = 1 , 2 , .
α 1 α τ = 1 / 4 1 / 8 1 / 16 1 / 32 Order
0.5 0.53.52 × 10−32.37 × 10−31.47 × 10−31.1 × 10−3 
   0.570.450.650.56
0.6 0.44.42 × 10−32.87 × 10−32.16 × 10−31.38 × 10−3 
   0.620.410.650.56
0.7 0.35.65 × 10−33.61 × 10−32.75 × 10−31.83 × 10−3 
   0.650.390.590.54
0.8 0.27.20 × 10−34.68 × 10−33.55 × 10−32.53 × 10−3 
   0.620.40.490.50
0.9 0.18.56 × 10−35.69 × 10−34.25 × 10−33.26 × 10−3 
   0.600.420.390.47
Table 3. Time convergence orders at T = 1 for smooth noise in Case 1 with various α > 1 2 , where γ l = l 3 for l = 1 , 2 , , for the one-dimensional model discussed in Section 6 of [22].
Table 3. Time convergence orders at T = 1 for smooth noise in Case 1 with various α > 1 2 , where γ l = l 3 for l = 1 , 2 , , for the one-dimensional model discussed in Section 6 of [22].
α 1 α τ = 1 / 4 1 / 8 1 / 16 1 / 32 Order
0.5 0.53.69 × 10−31.89 × 10−31.43 × 10−31.01 × 10−3 
   0.810.320.490.54 (0.50)
0.6 0.44.70 × 10−32.49 × 10−31.80 × 10−31.03 × 10−3 
   0.840.400.650.63 (0.60)
0.7 0.36.01 × 10−33.15 × 10−32.20 × 10−31.08 × 10−3 
   0.890.460.810.72 (0.70)
0.8 0.27.21 × 10−33.61 × 10−32.38 × 10−31.11 × 10−3 
   0.940.540.960.81 (0.80)
0.9 0.18.26 × 10−33.97 × 10−32.53 × 10−31.11 × 10−3 
   1.000.591.040.88 (0.90)
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

Wu, X.; Yan, Y. Milstein Scheme for a Stochastic Semilinear Subdiffusion Equation Driven by Fractionally Integrated Multiplicative Noise. Fractal Fract. 2025, 9, 314. https://doi.org/10.3390/fractalfract9050314

AMA Style

Wu X, Yan Y. Milstein Scheme for a Stochastic Semilinear Subdiffusion Equation Driven by Fractionally Integrated Multiplicative Noise. Fractal and Fractional. 2025; 9(5):314. https://doi.org/10.3390/fractalfract9050314

Chicago/Turabian Style

Wu, Xiaolei, and Yubin Yan. 2025. "Milstein Scheme for a Stochastic Semilinear Subdiffusion Equation Driven by Fractionally Integrated Multiplicative Noise" Fractal and Fractional 9, no. 5: 314. https://doi.org/10.3390/fractalfract9050314

APA Style

Wu, X., & Yan, Y. (2025). Milstein Scheme for a Stochastic Semilinear Subdiffusion Equation Driven by Fractionally Integrated Multiplicative Noise. Fractal and Fractional, 9(5), 314. https://doi.org/10.3390/fractalfract9050314

Article Metrics

Back to TopTop