Higher order time discretization method for a class of semilinear stochastic partial differential equations with multiplicative noise
Abstract
In this paper, we consider a new approach for semi-discretization in time and spatial discretization of a class of semi-linear stochastic partial differential equations (SPDEs) with multiplicative noise. The drift term of the SPDEs is only assumed to satisfy a one-sided Lipschitz condition and the diffusion term is assumed to be globally Lipschitz continuous. Our new strategy for time discretization is based on the Milstein method from stochastic differential equations. We use the energy method for its error analysis and show a strong convergence order of nearly for the approximate solution. The proof is based on new Hölder continuity estimates of the SPDE solution and the nonlinear term. For the general polynomial-type drift term, there are difficulties in deriving even the stability of the numerical solutions. We propose an interpolation-based finite element method for spatial discretization to overcome the difficulties. Then we obtain stability, higher moment stability, stability, and higher moment stability results using numerical and stochastic techniques. The nearly optimal convergence orders in time and space are hence obtained by coupling all previous results. Numerical experiments are presented to implement the proposed numerical scheme and to validate the theoretical results.
keywords:
Stochastic partial differential equations, multiplicative noise, Wiener process, Itô stochastic integral, Milstein scheme, finite element method, error estimates.AMS:
65N12, 65N15, 65N301 Introduction
We consider the following initial-boundary value problem for general semi-linear stochastic partial differential equations (SPDEs) with function-type multiplicative noise:
(1.1) | |||||
(1.2) | |||||
(1.3) |
where . are two given functions that will be specified later. denotes an -valued Wiener process.
The corresponding stochastic ordinary differential equations of (1.1) (without the Laplacian term) are studied in [17, 23] for the case when both and are Lipschitz continuous, and in [14] for the case when satisfies the one-sided Lipschitz condition as stated in (2.7). The strong and weak divergence is considered in [15] for some which are not Lipschitz continuous. Besides, the corresponding stochastic partial differential equations of (1.1) when is Lipschitz and non-Lipschitz continuous and when is additive and multiplicative are studied in [8, 9, 10, 21, 22] based on the variational approach and in [4, 12, 13, 16, 18, 19, 20] based on the semigroup approach. Here the half-order convergence is established in [22] when the drift term is using the Euler-type scheme. The half-order convergence is established in [10] for the drift term in (2.6) and diffusion term in assumptions (A1)–(A3) for a fully discrete scheme.
The primary goal of this paper is to design and analyze a first-order numerical scheme for the time discretization of the problem (1.1)–(1.3). Specifically, we design a new time discretization method first and then propose an interpolation finite element method, which is based on the new time scheme to discretize the space. Our idea for the time discretization method is inspired by the Milstein method [24] from stochastic differential equations and the semi-discrete in time strategy of the stochastic Stokes equations in [28]. In addition, the diffusion function is assumed to satisfy the global Lipschitz condition while the drift-nonlinear function is only one-sided Lipschitz. Furthermore, to establish the rates of convergence of the proposed scheme, we use the energy method followed by two steps: the first step is to prove the first-order error order in time by utilizing several established Hölder continuity estimates. The second step is to prove the optimal error order in space. To achieve this, the stability of the numerical solution is needed. The -seminorm stability of the numerical solution is proved first and based on which the stability of the numerical solution is established.
The remainder of this paper is organized as follows. In Section 2, several Hölder continuity results about the strong solution are proved. These results will be used in establishing the semi-discrete in-time error estimates. In Section 3, we present the new approach for the time discretization and its a priori stability as well as the error estimates of the semi-discrete solution are proved. The convergence order is proved to be nearly for the proposed scheme in -norm and the energy norm. In Section 4, we consider an interpolation finite element method for spatial discretization. The finite element method is designed where the interpolation operator is utilized to overcome the difficulty resulting from nonlinearity. Through this approach, the second moment and higher moment stability results are proved first, based on which the second moment and higher moment stability results are proved. Finally, the error estimates with optimal convergence order in space are established based on those stability results. In Section 5, several numerical tests including different initial conditions, drift terms, and diffusion terms are used to validate the theoretical results.
2 Preliminaries
Let be the triangulation of satisfying the following assumption [30]:
(2.1) |
where denotes the edge of simplex . Note this assumption is just the Delaunay triangulation when . In 3D, the notations in the assumption (2.1) are as follows: denote the vertices of , the edge connecting two vertices and , the -dimensional simplex opposite to the vertex , or the angle between the faces and , and .
Let , be two Hilbert spaces. Then, is the space of linear maps from to . For , inductively define
(2.2) |
as the space of all multi-linear maps from ( times) to for .
For some function , we define the Gateaux derivative of with respect to , , whose action is seen as
In general, we denote , as the -Gateaux derivative of with respect to .
Below, we state the assumptions on the functionals .
-
(A1)
is globally Lipschitz continuous and has linear growth. Namely, there exists a constant such that for all
(2.3a) (2.3b) -
(A2)
There exists a constant such that
(2.4) -
(A3)
There exists a constant such that for all
(2.5)
In this paper, suppose that , and
(2.6) |
where . For simplicity, we choose for all odd numbers . Then satisfies the following one-sided Lipschitz condition [25]
(2.7) |
where is a positive constant.
Under the above assumptions for the drift term and the diffusion term, it can be proved in [11] that there exists a unique strong variational solution u such that
(2.8) | ||||
holds -almost surely. Moreover, when the initial condition is sufficiently smooth, the following stability estimate for the strong solution holds
(2.9) |
where is the exponent in the drift term of .
Next, we introduce the Hölder continuity estimates for the variational solution .
Lemma 1.
Proof.
The proof of can be found in [10, Lemma 2.1], while the establishment of is based on the semigroup theory, which can be found in many references such as [27, 26, 29]. In addition, the proof of is followed [26, Lemma 10.27] and [28, Lemma 2.3] with minor modifications for . We just need to prove . To prove , we use the Taylor expansion for with respect to as follows.
(2.10) |
where .
Therefore, we have
Since we have , then we obtain
(2.11) | ||||
Taking the expectation to (2.11) and then using the Cauchy-Schwarz inequality, we obtain
(2.12) | |||
Using the interpolation inequality that and Lemma 1 yield to
(2.13) | |||
By using (2.9), we arrive at
(2.14) |
where .
3 Semi-discretization in time
In this section, we follow the strategy of the Milstein scheme in SDEs to propose a new time discretization method of (1.1). This approach generates a convergence order of nearly for the approximate solution.
3.1 Formulation of the proposed method
Let be a uniform mesh of the interval with the time step size . Note that and .
Algorithm 1
Let be a given -valued random variable. Find recursively such that -a.s.
(3.1) | ||||
for all and .
Remark 3.1.
The scheme (3.1) will produce a convergence of order nearly . The difference between (3.1) and the standard Euler-Maruyama method is the discretization of the noise term. While the Euler-type schemes, which establish a convergence order of , contain only the term , the scheme (3.1) adds the extra term , which is the key point to obtain a higher convergence order.
Next, we state the following technical lemma that is used to prove the error estimate results of this paper.
Lemma 2.
Suppose that satisfies the assumptions . Let , there exist constants such that the function defined in (3.2) satisfies
-
(i)
,
-
(ii)
, for and .
Proof.
The Lipschitz continuity of in is directly obtained from the assumptions of while the proof of can be found in [26, Lemma 10.36] with similar arguments.
∎
Next, we will provide the stability estimates of Algorithm 1 in the following lemma. These stability estimates will be used for the proof of the error estimates of the finite element approximation later.
Lemma 3.
Let be the solution of Algorithm 1. Then , there exists a constant such that
-
(i)
, for any integers .
-
(ii)
, for any integers .
Proof.
We just provide the proof of (i) when . When , the proof is similar to [6, Lemma 3.1] with minor modifications. So, we skip it to save space.
To begin, we rewrite (3.1) in the strong form as follow:
(3.4) | ||||
Testing the equation (3.4) by and then using integration by parts we obtain
(3.5) | ||||
By using the integration by parts, we obtain
(3.6) | ||||
where the last inequality of (3.6) is obtained by using the fact that, for all odd , .
To bound II, we take the expectation and then use the fact that . Namely,
(3.7) | ||||
In addition, by using the Cauchy-Schwarz and the assumptions , we have
(3.8) | ||||
where the last inequality of (3.8) is obtained by using the fact that .
Substituting all the estimates from into (3.4) and absorbing the like-terms from the right side to the left side, we obtain
(3.9) | ||||
Next, applying the summation , for any , we obtain
(3.10) | |||
The proof is completed by using Gronwall’s inequality.
Finally, the proof of (ii) is followed by using the result from (i) and Hölder inequality.
∎
3.2 Error estimates for Algorithm 1
In this part, we state the first main result of this paper which establishes an convergence order for the proposed method.
Theorem 4.
Let be the variational solution to (1.1) and be generated by Algorithm 1. Assume that satisifies and . Suppose that , then there exists a constant such that
(3.11) |
Proof.
Denote . Subtracting (3.3) from (2.8), we obtain the following error equation
(3.12) | ||||
Now, choosing and using the identity , we have
(3.13) | ||||
Next, we bound the right side of (3.13) as follows.
In order to estimate I, we add and subtract for any , as follow.
(3.14) | ||||
By using Lemma 1 , we obtain
(3.15) | ||||
Next, by the integration by parts we have
(3.16) | ||||
We note that due to the martingale property of the Itô integral. So, it is left to estimate . By using the Hölder inequality, we obtain
(3.17) | ||||
By using the Itô isometry we have
(3.18) | ||||
Similarly, we can estimate II as follows.
(3.19) | ||||
By using Lemma 1 and Poincaré’s inequality, we obtain
(3.20) |
To estimate , we use the same techniques from estimating and also use (2.9), we obtain
To estimate , we use the one-sided Lipschitz condition (2.7) as follows.
(3.21) | ||||
To estimate IV, using Lemma 2, the Itô isometry and the martingale property of Itô integrals we have
(3.22) | ||||
Now, we substitute all the estimates from I, II, III, IV into (3.13) and use the left side to absorb the like-terms from the right side of the resulting inequality. In summary, we obtain
(3.23) | ||||
We choose ( for small enough) such that , so the middle term on the left side of (3.23) is nonnegtive.
Next, applying the summation for , we obtain
(3.24) |
By using the discrete Gronwall’s inequality and taking supremum over all , we arrive at
(3.25) |
The proof is complete.
∎
4 Fully discrete finite element discretization
In this section, we consider the -Lagrangian finite element space
(4.1) |
where denotes the space of all linear polynomials. Then the finite element approximation of Algorithm 1 is presented in Algorithm 2 as below.
Algorithm 2
We seek an adapted -valued process such that it holds -almost surely that
(4.2) | ||||
where , , and is the standard nodal value interpolation operator , i.e.,
(4.3) |
where denotes the number of vertices of the triangulation , and denotes the nodal basis function of corresponding to the vertex . The initial condition is chosen by where is the -projection operator defined by
For each for , the following error estimates about the -projection can be found in [3, 7]:
(4.4) | ||||
(4.5) |
Finally, given , the discrete Laplace operator is defined by
(4.6) |
4.1 Stability estimates for the -th moment of the -seminorm of
First, we shall prove the second moment discrete -seminorm stability result, which is necessary to establish the corresponding higher moment stability result.
Theorem 5.
Under the mesh constraint (2.1), we have
(4.7) | ||||
Proof.
Testing (4.2) with . Then
(4.8) | ||||
Using the definition of the discrete Laplace operator and the simple identity , we get
(4.9) | ||||
(4.10) |
The expectation of the second term on the right-hand side of (4.8) can be bounded by
(4.11) | ||||
The expectation of the third term on the right-hand side of (4.8) can be bounded by
(4.12) | ||||
where the last inequality is obtained by using the assumption (A2). Notice that the stability in the -seminorm of the -projection (see [2]) is used in the inequalities of (4.11) and (4.12).
For the first term on the right-hand side of (4.8) since it cannot be treated as a bad term, which aligns with the continuous case. Denote , and then
(4.13) | ||||
where .
Using Young’s inequality when , we have
(4.14) |
Besides, since the stiffness matrix is diagonally dominant, we have
(4.15) | ||||
Then we have
(4.16) |
Using Gronwall’s inequality, we obtain (4.7). ∎
Before we establish the error estimates, we need to prove the stability of the higher moments for the -seminorm of the numerical solution.
Theorem 6.
Suppose the mesh assumption (2.1) holds. Then for any ,
Proof.
The proof is divided into three steps. In Step 1, we establish the bound for . In Step 2, we give the bound for , where and is an arbitrary positive integer. In Step 3, we obtain the bound for , where is an arbitrary real number and .
The first term on the right-hand side of (4.20) can be written as
(4.21) | ||||
where will be determined later.
The second term on the right-hand side of (4.20) can be written as
(4.22) | ||||
For the right-hand side of (4.22), using the Cauchy-Schwarz inequality, we get
(4.23) | ||||
where will be determined later.
Similarly, using the Cauchy-Schwarz inequality, we have
(4.24) | ||||
where will be determined later.
The third term on the right-hand side of (4.20) can be written as
(4.25) | ||||
For the right-hand side of (4.25), using the Cauchy-Schwarz inequality, we get
(4.26) | |||
where will be determined later. Similarly, using the Cauchy-Schwarz inequality, we have
(4.27) | |||
where will be determined later.
Choosing such that , and then taking the summation over from to and taking the expectation on both sides of (4.20), we obtain
(4.28) | ||||
When restricting , we have
(4.29) | ||||
Using Gronwall’s inequality, we obtain
(4.30) | ||||
Proceed similarly as in Step 1. Multiplying (4.31) with , we can obtain the 8-th moment of the -seminorm stability result of the numerical solution. Then repeat this process, the -th moment of the -seminorm stability result of the numerical solution can be obtained.
Step 3. Suppose . By Young’s inequality, we have
(4.32) |
where the second inequality follows from the results of Step 2. The proof is completed. ∎
4.2 Stability estimates for the -th moment of the -norm of
Since the mass matrix may not be the diagonally dominated matrix, we cannot use the above idea to prove the stability. Instead, we prove the stability results by utilizing the above established results. The following results hold when is the odd integer in 2D case, and when or in 3D case.
Theorem 7.
Under the mesh assumption (2.1), there holds
Proof.
Testing (4.2) with yields
(4.33) | ||||
We can easily prove the following inequalities:
where (A2) is used in the inequality above.
We have the following standard interpolation result and the inverse inequality (see [7]):
(4.34) | ||||
(4.35) |
Note when , if , and when , if . Using the above inequalities, Theorem 6, taking summation over from to , and taking expectation on both sides of (4.33), we obtain
(4.37) | ||||
where Theorem 6 is used in the last inequality.
The conclusion is a direct result by using Gronwall’s inequality. ∎
To obtain the error estimates results, we need to establish a higher moment discrete stability result for the numerical solution .
Theorem 8.
Suppose the mesh assumption (2.1) holds. Then there holds for any ,
Proof.
The proof is divided into three steps. In Step 1, we give the bound for . In Step 2, we give the bound for , where and is an arbitrary positive integer. In Step 3, we give the bound for , where is an arbitrary real number and .
The first term on the right-hand side of (4.40) can be written as
(4.41) | ||||
where will be determined later.
The second term on the right-hand side of (4.40) can be written as
(4.42) | ||||
For the second term on the right-hand side of (4.42), using the Cauchy-Schwarz inequality, we get
(4.43) | ||||
where will be determined later. Using (2.3b), the third term on the right-hand side of (4.42) can be bounded by
(4.44) | ||||
where will be determined later.
The third term on the right-hand side of (4.40) can be written as
(4.45) | ||||
For the second term on the right-hand side of (4.45), using the Cauchy-Schwarz inequality, we get
(4.46) | ||||
where will be determined later. Using (2.3b), the third term on the right-hand side of (4.45) can be bounded by
(4.47) | ||||
where will be determined later.
Choosing such that , and then taking the summation over from to and taking the expectation on both sides of (4.40), we obtain
(4.48) | ||||
When , we have
(4.49) | ||||
Using Gronwall’s inequality, we obtain
(4.50) | ||||
Similar to Step 1, multiplying (4.51) by , we can obtain the 8-th moment of the stability result of the discrete solution. Then repeating this process, the second moment of the stability result of the discrete solution can be obtained.
Step 3. Suppose , and then by Young’s inequality, we have
(4.52) |
where Step 2 is used in the second inequality. The proof is complete. ∎
4.3 Error estimates of the finite element approximation
In this subsection, we consider error estimates between the semi-discrete solution of Algorithm 1 and its finite element approximation from Algorithm 2. Let . In the following theorem, the -projection is used in the proof of the error estimates and the strong convergence rate is given.
Theorem 9.
Let and denote respectively the solutions of Algorithm 1 and Algorithm 2. Then, under the condition (2.1), there holds
Proof.
We write where
Subtracting (4.2) from (3.1) and setting , the following error equation holds -almost surely,
(4.53) | ||||
The expectation of the left-hand side of (4.53) can be bounded by
(4.54) |
The first term on the right-hand side of (4.53) is 0 by the property of the -projection.
For the second term on the right-hand side of (4.53), we have
(4.55) | ||||
In order to estimate the third term on the right-hand side of (4.53), we write
(4.56) | ||||
The first term on the right-hand side of (4.56) can be bounded as follows. Using Cauchy-Schwarz’s inequality, the Ladyzhenskaya inequality , and (4.4) we obtain
(4.57) | ||||
Taking the summation to (4.57) for any we obtain
(4.58) | ||||
Next, applying the expectation to (4.58) and using Cauchy-Schwarz’s inequality, and then using Lemma 3 we have
(4.59) | |||
Moreover, using the embedding inequality for any integers (see [5, Corollary 9.14]) we also have
where the last inequality is obtained by using Lemma 3. In summary, we obtain the following estimate for the first term of
(4.60) |
By using the one-sided Lipchitz condition (2.7), the second term on the right-hand side of (4.56) can be bounded by
(4.61) |
Using properties of the interpolation operator, the inverse inequality, and the fact that is a piecewise linear polynomial, the third term on the right-hand side of (4.56) can be handled by
(4.62) | ||||
By the assumption for and then Lemma 3, we have
(4.64) | ||||
By using the assumption (A3) for and then Lemma 3, we have
(4.65) | ||||
Taking the expectation on (4.53) and combining estimates (4.54)–(4.65), summing over with , and using Lemma 3 we obtain
(4.66) | ||||
Finally, the conclusion of the theorem follows from the discrete Gronwall’s inequality, the fact that , and the triangle inequality. ∎
4.4 Global error estimates
Finally, we are ready to state the global error estimates of our proposed method in the following theorem.
5 Numerical Experiments
In this section, three numerical tests are presented. In Test 1, the evolution and stability of (1.1) in the case are illustrated with different noise intensities. Test 2 provides the visualization of the stability using a different drift term and diffusion term. Test 3 presents the error orders with respect to time step size . The domain for all the following tests is chosen to be .
Test 1. Consider the initial condition:
(5.1) |
For this test, is used as the nonlinear term, and is used as the diffusion term. In Figure 1, the zero-level sets of the evolution using two different levels of noise intensity are shown. One can observe that the average zero-level set is a shrinking circle for both levels of noise intensity. Figure 2 demonstrates the and stability for each time step. One can make the observation that they are both bounded. A one-sample and stability are provided in Figure 3. Those stability results are still bounded but they are not always decreasing over time.






Test 2. For this test, the initial condition is still in (5.1), and that . The drift term is changed to , and the diffusion term is changed to . In Figure 4, the and stability are given by the blue and pink solid lines, along with the maximum and minimum of those two stabilities given by upper and lower edges of the shaded red and blue regions. One can see that both the and stability are bounded.


Test 3. Consider the initial condition:
(5.2) |
In this test, we use , as the drift term, and as the diffusion term. The final time is . Table 1 demonstrates the error and the error . The error is denoted by , and the error is denoted by . By observingTable 1, one can see that the error orders for both and are 1.
error | order | error | order | |
---|---|---|---|---|
0.080163 | - | 0.054115 | - | |
0.038604 | 1.0542 | 0.027675 | 0.9675 | |
0.018036 | 1.0978 | 0.013978 | 0.9855 | |
0.008724 | 1.0479 | 0.007467 | 0.9045 |
References
- [1] P. L. Chow, Stochastic Partial Differential Equations, Chapman and Hall/CRC, 2007.
- [2] R. Bank and H. Yserentant, On the -stability of the -projection onto finite element spaces, Numer. Math., 126 (2014), 361–381.
- [3] S. Brenner and R. Scott, The Mathematical Theory of Finite Element Methods, Springer, 2008.
- [4] C-E Bréhier and L. Goudenège, Analysis of some splitting schemes for the stochastic Allen-Cahn equation, Discrete Contin. Dyn. Syst. Ser. B, 24 (2019), 4169-4190.
- [5] H. Brezis, Functional analysis, Sobolev spaces and partial differential equations, Springer, volume 2, 2011.
- [6] Z. Brzeźniak, E. Carelli, and A. Prohl, Finite-element-based discretizations of the incompressible Navier–Stokes equations with multiplicative random forcing, IMA Journal of Numerical Analysis, 33.3 (2013): 771-824.
- [7] P. Ciarlet, The finite element method for elliptic problems, Classics in Appl. Math., 40 (2002), 1–511.
- [8] X. Feng, Y. Li and A. Prohl, Finite element approximations of the stochastic mean curvature flow of planar curves of graphs, Stoch. PDEs: Analysis and Computations, 2 (2014), 54–83.
- [9] X. Feng, Y. Li and Y. Zhang, Finite element methods for the stochastic Allen-Cahn equation with gradient-type multiplicative noise, SIAM J. Numer. Anal., 55 (2017), 194–216.
- [10] X. Feng, Y. Li and Y. Zhang. Strong convergence of a fully discrete finite element method for a class of semilinear stochastic partial differential equations with multiplicative noise, Journal of Computational Mathematics, 39(4):574-598, 2021.
- [11] B. Gess. Strong solutions for stochastic partial differential equations of gradient type, Funct. Anal., 263, 2355–2383, 2012.
- [12] I. Gyöngy and A. Millet, On discretization schemes for stochastic evolution equations, Potential analysis, 23 (2005), 99–134.
- [13] I. Gyöngy, S. Sabanis and D. Šiška, Convergence of tamed Euler schemes for a class of stochastic evolution equations, Stochastics and Partial Differential Equations: Analysis and Computations, 4 (2016), 225–245.
- [14] D. Higham, X. Mao and A. Stuart, Strong convergence of Euler-type methods for nonlinear stochastic differential equations, SIAM J. Numer. Anal., 40 (2002), 1041–1063.
- [15] M. Hutzenthaler, A. Jentzen and P. Kloeden, Strong and weak divergence in finite time of Euler’s method for stochastic differential equations with non-globally Lipschitz continuous coefficients, Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences, 467 (2010), 1563–1576.
- [16] A. Jentzen and P. Pušnik, Strong convergence rates for an explicit numerical approximation method for stochastic evolution equations with non-globally Lipschitz continuous nonlinearities, IMA J. Numer. Anal., 40 (2020), 1–38.
- [17] P. Kloeden and E. Platen, Numerical Methods for Stochastic Differential Equations, Springer, 1991.
- [18] M. Kovács, S. Larsson and F. Lindgren, On the backward Euler approximation of the stochastic Allen-Cahn equation, J. Appl. Probab., 52 (2015), 323–338.
- [19] M. Kovács, S. Larsson and F. Lindgren, On the discretisation in time of the stochastic Allen–Cahn equation, Mathematische Nachrichten, 291 (2018), 966–995.
- [20] Z. Liu and Z. Qiao, Strong approximation of monotone stochastic partial differential equations driven by white noise, IMA J. Numer. Anal., 40 (2020), 1074–1093.
- [21] A. Majee and A. Prohl, Strong rates of convergence for a space-time discretization of the stochastic Allen-Cahn equation with multiplicative noise, Comput. Methods Appl. Math., 18 (2018), 297–311.
- [22] A. Majee and A. Prohl, Optimal Strong rates of convergence for a space-time discretization of the stochastic Allen-Cahn equation with multiplicative noise, Comput. Methods Appl. Math., 18 (2018), 297–311.
- [23] X. Mao, Stochastic differential equations and applications, 2nd Edition, Elsevier, 2007.
- [24] Mil’shtejn, Approximate integration of stochastic differential equations, Theory of Probability & Its Applications, 1975.
- [25] D. Higham, X. Mao and A. Stuart. Strong convergence of Euler-type methods for nonlinear stochastic differential equations, SIAM J. Numer. Anal., 40 (2002), 1041–1063.
- [26] G. J. Lord, C. E. Powel and T. Shardlow. An Introduction to Computational Stochastic PDEs, volume 50, Cambridge University Press, 2014.
- [27] J. Printems, On the discretization in time of parabolic stochastic partial differential equations, M2AN Math. Model. Numer. Anal., 35 (2001), 1055–1078.
- [28] L. Vo, Higher order time discretization method for the stochastic Stokes equations with multiplicative noise, arXiv 2211.02757, 2022.
- [29] L. Vo, High moment and pathwise error estimates for fully discrete mixed finite element approximation of the stochastic Stokes equations with multiplicative noises, arXiv:2106.04534, 2021.
- [30] J. Xu and L. Zikatanov, A monotone finite element scheme for convection-diffusion equations, Math. Comp., 68 (1999), 1429–1446.