Optimal Strong Rates of Convergence for a Space-Time Discretization of the Stochastic Allen-Cahn Equation with multiplicative noise
Ananta K. Majee, Andreas Prohl

TL;DR
This paper establishes optimal strong convergence rates for a space-time discretization of the stochastic Allen-Cahn equation with multiplicative noise, using weak monotonicity to derive uniform bounds and error estimates.
Contribution
It introduces a novel approach leveraging weak monotonicity to obtain optimal convergence rates for discretizations of the stochastic Allen-Cahn equation.
Findings
Achieves an error bound of order $k^{1- ext{delta}} + h^2$.
Provides uniform strong norm bounds for solutions.
Demonstrates structure-preserving finite element discretization.
Abstract
The stochastic Allen-Cahn equation with multiplicative noise involves the nonlinear drift operator . We use the fact that satisfies a weak monotonicity property to deduce uniform bounds in strong norms for solutions of the temporal, as well as of the spatio-temporal discretization of the problem. This weak monotonicity property then allows for the estimate for all small , where is the strong variational solution of the stochastic Allen-Cahn equation, while solves a structure preserving finite element based space-time discretization of the problem on a temporal mesh of size…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Optimal Strong Rates of Convergence for a Space-Time Discretization of
the Stochastic Allen-Cahn Equation with multiplicative noise
Ananta K. Majee
Mathematisches Institut Universität Tübingen Auf der Morgenstelle 10 D-72076 Tübingen, Germany
and
Andreas Prohl
Mathematisches Institut Universität Tübingen Auf der Morgenstelle 10 D-72076 Tübingen, Germany
Abstract.
The stochastic Allen-Cahn equation with multiplicative noise involves the nonlinear drift operator {\mathscr{A}}(x)=\Delta x-\bigl{(}|x|^{2}-1\bigr{)}x. We use the fact that satisfies a weak monotonicity property to deduce uniform bounds in strong norms for solutions of the temporal, as well as of the spatio-temporal discretization of the problem. This weak monotonicity property then allows for the estimate \underset{1\leq j\leq J}{\sup}{\mathbb{E}}\bigl{[}\|X_{t_{j}}-Y^{j}\|_{{\mathbb{L}}^{2}}^{2}\bigr{]}\leq C_{\delta}(k^{1-\delta}+h^{2}) for all small , where is the strong variational solution of the stochastic Allen-Cahn equation, while \big{\{}Y^{j}:0\leq j\leq J\big{\}} solves a structure preserving finite element based space-time discretization of the problem on a temporal mesh of size which covers .
Key words and phrases:
Stochastic Allen-Cahn equation, monotone operator, variational solution, strong rate of convergence.
2000 Mathematics Subject Classification:
45K05, 46S50, 49L20, 49L25, 91A23, 93E20
1. Introduction
Let \bigl{(}{\mathbb{H}},(\cdot,\cdot)_{{\mathbb{H}}}\bigr{)} be a separable Hilbert space, and be a reflexive Banach space, such that constitutes a Gelfand triple. The main motivation for this work is to identify the structural properties for the drift operator of the nonlinear SPDE
[TABLE]
which allow to construct a space-time discretization of (1.1) for which optimal strong rates of convergence may be shown. Relevant works in this direction are [5, 6], where both, and are required to be Lipschitz. The Lipschitz assumption for the drift operator does not hold for many nonlinear SPDEs including the stochastic Navier-Stokes equation, or the stochastic version of general phase field models (including (1.2)) below for example. A usual strategy for a related numerical analysis is then to truncate nonlinearities (see e.g. [9]), or to quantify the mean square error on large subsets . As an example, the following estimate for a (time-implicit, finite element based) space-time discretization of the 2D stochastic Navier-Stokes equation with solution was obtained in [2],
[TABLE]
for all , where (resp. ) is such that for (resp. for ). We also mention the work [8] which studies a spatial discretization of the stochastic Cahn-Hilliard equation.
Let , be a bounded Lipschitz domain. We consider the stochastic Allen-Cahn equation with multiplicative noise, where the process solves
[TABLE]
where is an -valued Wiener process which is defined on the given filtered probability space ; however it is easily possible to generalize the analysis below to a trace class - Wiener process. Obviously, the drift operator is only locally Lipschitz, but is the negative Gâteaux differential of and satisfies the weak monotonicity property
[TABLE]
for some ; see Section 2 for the notation. Our goal is a (variational) error analysis for the structure preserving finite element based space-time discretization (2.5) which accounts for this structural property, avoiding arguments that exploit only the locally Lipschitz property of to arrive at optimal strong error estimate.
The existing literature (see e.g. [8]) for estimating the numerical strong error on the problem (1.2) mainly uses the involved linear semigroup theory; the authors have considered the additive colored noise case, in which they have benefited from it by using the stochastic convolution, and then used a truncation of the nonlinear drift operator to prove a rate of convergence for a (spatial) semi-discretization on sets of probability close to without exploiting the weak monotonicity of . In contrast, property (1.3) and variational arguments were used in the recent work [10], where strong error estimates for both, semi-discrete (in time) and fully-discrete schemes for (1.2) were obtained, which are of sub-optimal order for the fully discrete scheme in the case . In [10], a standard implicit discretization of (1.2) was considered for which it is not clear to obtain uniform bounds for arbitrary higher moments of the solution of the fully discrete scheme, thus leading to sub-optimal convergence rates above. In this work, we consider the modified scheme (2.5) for (1.2), and derive optimal strong numerical error estimate.
The subsequent analysis for the scheme (2.5) is split into two steps to independently address errors due to the temporal and spatial discretization. First we exploit the variational solution concept for (1.2) and the semi-linear structure of to derive uniform bounds for the arbitrarily higher moments of the solution of (1.2) in strong norms; these bounds may then be used to bound increments of the solution of (1.2) in Lemma 3.2. The second ingradient to achieve optimal error bounds is a temporal discretization which inherits the structural properties of (1.2); the scheme (4.1) is constructed to allow for bounds of arbitrary moments of in Lemma 4.1, which then settles the error bounds in Theorem 4.2 by using property (1.3) to effectively handle the nonlinear terms. We recover the asymptotic rate which is known for SPDEs of the form (1.1) when is linear elliptic. It is interesting to compare the present error analysis for the SPDE (1.2) with the one in [7] for a general SODE with polynomial drift (see [7, Ass.s 3.1, 4.1, 4.2]) which also exploits the weak monotonicity of the drift.
The temporal semi-discretization was studied as a first step rather than spatial discretization to inherit bounds in strong norms which are needed for a complete error analysis of the problem. The second part of the error analysis is then on the structure preserving finite element based fully discrete scheme (2.5), for which we first verify the uniform bounds of arbitrary moments of (cf. Lemma 5.1). It is worth mentioning that, if \big{\{}Y^{j}:0\leq j\leq J\} is a solution to a standard space-time discretization which involves the nonlinearity , then only basic uniform bounds may be obtained (see [10, Lemma ]), as opposed to those in Lemma 5.1. Next to it, we use again (1.3) for the drift, in combination with well-known approximation results for a finite element discretization to show that the error part due to spatial discretization is of order where is the time discretization parameter and is the space discretization parameter (see Theorem 5.2). In this context, we mention the numerical analysis in [11] for an extended model of (1.2), where the uniform bounds for the exponential moments next to arbitrary moments in stronger norms are obtained for the solution of a semi-discretization in space in the case (see [11, Prop.s 4.2, 4.3]); those bounds, together with a monotonicity argument are then used to properly address the nonlinear effects in the error analysis and arrive at the (lower) strong rate for the -th mean convergence of the numerical solution.
2. Technical framework and main result
Throughout this paper, we use the letter to denote various generic constants. Let , , with be a cube in . Let us denote and for . The problem (1.2) is then supplemented by the space-periodic boundary condition
[TABLE]
Let \bigl{(}{\mathbb{L}}^{p}_{\rm per},\|\cdot\|_{{\mathbb{L}}^{p}}\bigr{)} resp. \bigl{(}{\mathbb{W}}^{m,p}_{\rm per},\|\cdot\|_{{\mathbb{W}}^{m,p}}\bigr{)} denote the Lebesgue resp. Sobolev space of -periodic functions . Recall that functions in may be characterized by their Fourier series expansion, i.e.,
[TABLE]
Below, we set for . Throughout this article, we make the following assumption on .
- A.1
, and are bounded. Moreover, is Lipschitz continuous, i.e., there exists a constant such that
[TABLE]
Definition 2.1**.**
(Strong variational solution) Fix , and . A -valued -adapted stochastic process is called a strong variational solution of (1.2) if X\in L^{2}\bigl{(}\Omega;C([0,T];{\mathbb{L}}^{2}_{\rm per})\bigr{)} satisfies -a.s. for all that
[TABLE]
The following estimate for the strong solution is well-known (),
[TABLE]
2.1. Fully discrete scheme
Let us introduce some notation needed to define the structure preserving finite element based fully discrete scheme. Let be a uniform partition of of size . Let be a quasi-uniform triangulation of the domain . We consider the -conforming finite element space (cf. [1]) such that
[TABLE]
where is the space of -valued functions on which are polynomials of degree less or equal to . We may then consider the space-time discretization of (1.2): Let , where denotes the -orthogonal projection, i.e., for all
[TABLE]
Find the -adapted -valued process such that -almost surely
[TABLE]
where
[TABLE]
Solvability for is again immediate via Brouwer fixed point theorem.
We are now in a position to state the main result of this article.
Main Theorem**.**
Let the assumption A.1 hold and . For every , there exist constants , independent of the discretized parameters , and such that for all sufficiently small, there holds
[TABLE]
where \big{\{}X_{t};t\in[0,T]\big{\}} solves (1.2) while \big{\{}Y^{j};0\leq j\leq J\big{\}} solves (2.5).
The proof is detailed in Sections 3, 4 and 5 and uses the semi-linear structure of along with the weak monotonicity property (1.3). We first consider a semi-discrete (in time) scheme (4.1) of the problem (1.2) and derive the error estimate between the strong solution of (1.2) and the discretized solution \big{\{}X^{j};0\leq j\leq J\big{\}} of (4.1), see Theorem 4.2. Again, using uniform bounds for higher moments of the solutions and , we derive the error estimate of and in strong norm, cf. Theorem 5.2. Putting things together then settles the main theorem.
3. Stochastic Allen-Cahn equation: The continuous case
In this section, we derive uniform bounds of arbitrary moments for the strong solution X\equiv\big{\{}X_{t}:t\in[0,T]\big{\}} of (1.2) and using these uniform bounds, we estimate the expectation of the increment in terms of .
The following estimate may be shown by a standard Galerkin method which employs a (finite) sequence of (-orthonormal) eigenfunctions of the inversely compact, self-adjoint isomorphic operator , the use of Itô’s formula to the functional , and the final passage to the limit (see e.g. [4]),
[TABLE]
for which we require the improved regularity property . Thanks to the assumption A.1, we see that satisfies the following estimates:
- a)
There exists a constant such that
[TABLE]
- b)
There exist constants and such that for all
[TABLE]
Lemma 3.1**.**
Suppose that the assumption A.1 holds and . Then, there exists a constant such that
- (i)
\underset{t\in[0,T]}{\sup}{\mathbb{E}}\Bigl{[}\Bigl{(}\mathcal{J}(X_{t})\Bigr{)}^{p}\Bigr{]}+{\mathbb{E}}\Bigl{[}\int_{0}^{T}\|\nabla X_{s}\|^{2(p-1)}_{{\mathbb{L}}^{2}}\|\Delta X_{s}\|^{2}_{{\mathbb{L}}^{2}}\,{\rm d}s\Bigr{]}\leq C\,.**
Suppose in addition . Then, there exists a constant such that
- (ii)
\underset{t\in[0,T]}{\sup}{\mathbb{E}}\Bigl{[}\|\Delta X_{t}\|^{2}_{{\mathbb{L}}^{2}}\Bigr{]}+{\mathbb{E}}\Bigl{[}\int_{0}^{T}\|\nabla\Delta X_{s}\|^{2}_{{\mathbb{L}}^{2}}\,{\rm d}s\Bigr{]}\leq C\,.**
Proof.
(i) We proceed formally. Note that
[TABLE]
We use Itô’s formula for \xi\mapsto g(\xi):=\bigl{(}\mathcal{J}(\xi)\bigr{)}^{p}.
[TABLE]
where for all . By Cauchy-Schwartz inequality, and (3.2), we have
[TABLE]
Since is bounded, by using Young’s inequality, we have
[TABLE]
We choose such that . With this choice of , by (3.1), we have for some constant ,
[TABLE]
We use Gronwall’s lemma to conclude that
[TABLE]
In view of (2.3), and (3.4) it follows that
[TABLE]
Note that,
[TABLE]
where we use the embedding for . Thanks to (3.4) and (3.5), together with Cauchy-Schwartz inequality and the above estimate, we see that
[TABLE]
One can combine (3.4) and (3.6) to conclude the assertion.
(ii) Use Itô’s formula for . We compute its derivatives.
[TABLE]
Note that by integration by parts
[TABLE]
Because of for we estimate the last term through
[TABLE]
Note that , and therefore we see that
[TABLE]
Inserting (3.8) and (3.9) in (3.7), we obtain
[TABLE]
Let . Then by (3.3), we see that
[TABLE]
One can combine the above estimate in (3.10) and use (3.5), (3.6) along with Gronwall’s lemma to conclude the assertion for .
Let . Then, thanks to (3.3) and Cauchy-Schwartz inequality, we have
[TABLE]
We combine (3.10) and (3.11) and use (3.5), (3.6) along with Gronwall’s lemma to conclude the assertion for . This completes the proof. ∎
The following result is to bound the increments of the solutions of (1.2) in terms of for some ; its proof uses Lemma 3.1 in particular.
Lemma 3.2**.**
Let the assumption A.1 holds and . Then for every , there exists a constant such that
- (i)
{\mathbb{E}}\bigl{[}\|X_{t}-X_{s}\|^{p}_{{\mathbb{L}}^{2}}\bigr{]}\leq C|t-s|\qquad(p\geq 2), 2. (ii)
{\mathbb{E}}\bigl{[}\|X_{t}-X_{s}\|^{2}_{{\mathbb{W}}^{1,2}}\bigr{]}\leq C|t-s|\,.**
Proof.
Fix . An application of Itô’s formula for with to (1.2) yields, after taking expectation
[TABLE]
We use the weak monotonicity property (1.3) to bound from below the second term on the left-hand side,
[TABLE]
The integration by parts formula and Young’s inequality reveal that
[TABLE]
Since for , by using Young’s inequality, we see that
[TABLE]
Again, thanks to (2.1) and Young’s inequality, we see that
[TABLE]
We combine all the above estimates and use (2.3) and Lemma 3.1, along with Gronwall’s inequality to get the result.
We apply Itô’s formula to the function for any to (1.2), and then use for fixed and integrate with respect to spatial variable. Thanks to Young’s inequality, and the boundedness of ,
[TABLE]
Notice that \|\mathscr{A}(X_{\zeta})\|_{\mathbb{L}^{2}}^{2}\leq\|\Delta X_{\zeta}\|_{\mathbb{L}^{2}}^{2}+C\big{(}\|X_{\zeta}\|_{\mathbb{L}^{6}}^{6}+\|X_{\zeta}\|_{\mathbb{L}^{2}}^{2}\big{)}. From the above estimate, and Lemma 3.1, , (3.5), and the embedding for , we conclude
[TABLE]
One can use of Lemma 3.2 for , and (3.12) to arrive at . This finishes the proof. ∎
4. Semi-discrete scheme (in time) and its bound
Let be an equi-distant partition of of size . The structure preserving time discrete version of (1.2) defines an -adapted -valued process such that -almost surely and for all
[TABLE]
where and are defined in (2.6). Solvability for easily follows from a coercivity property of the drift operator, and the Lipschitz continuity property (2.1) for the diffusion operator. Below, we denote again
[TABLE]
The proof of the following lemma evidences why is substituted by in (4.1) to recover uniform bounds for arbitrary higher moments of .
Lemma 4.1**.**
Suppose , and that assumption A.1 holds. For every , , there exists a constant such that
[TABLE]
Proof.
1. Consider (4.1) for a fixed and choose . Then one has -a.s.,
[TABLE]
By using the identity (a-b)a=\frac{1}{2}\Big{(}|a|^{2}-|b|^{2}+|a-b|^{2}\Big{)}\,\,\forall a,b\in\mathbb{R} along with integration by parts formula, we calculate
[TABLE]
Since is bounded, we observe that
[TABLE]
We decompose into the sum of two terms and where
[TABLE]
In view of Young’s inequality and the boundedness of , we have
[TABLE]
Next we estimate independently to bound . To do so, we choose as test function in (4.1) and obtain
[TABLE]
Note that
[TABLE]
where in the last inequality we have used the Lipschitz continuous property of . We use (4.5) in (4.4) to get
[TABLE]
Again, since is a bounded domain, one has
[TABLE]
where denotes the Lebesgue measure of . Combining the above estimates and then those for and in (4.2), and then (4.3), we obtain after taking expectation
[TABLE]
Summation over all time steps, and the discrete Gronwall’s lemma then establish the assertion for .
2. In order to validate the assertion for , we proceed inductively and illustrate the argument for . Recall that we have from before
[TABLE]
To prove the assertion for , one needs to multiply (4.8) by some quantity to produce a term like \mathcal{J}^{2}(X^{j})-\mathcal{J}^{2}(X^{j-1})+\alpha\big{|}\mathcal{J}(X^{j})-\mathcal{J}(X^{j-1})\big{|}^{2} with on the left hand side of the inequality in order to absorb related terms coming from the right-hand side of the inequality before discrete Gronwall’s lemma. Therefore, we multiply (4.8) with to get by binomial formula
[TABLE]
By Young’s inequality, we have
[TABLE]
We can decompose as
[TABLE]
Note that \mathbb{E}\big{[}\mathcal{A}_{6,2}\big{]}=0. By using Young’s inequality and the boundedness of , we estimate ,
[TABLE]
Again, can be written as with \mathbb{E}\big{[}\mathcal{A}_{5,2}]=0, where
[TABLE]
Thanks to Young’s inequality, the boundedness of and (4.7) we get for
[TABLE]
We combine all the above estimates in (4.9), and choose with to have, after taking expectation
[TABLE]
Summation over all time steps in (4.10), together with the discrete Gronwall’s lemma then validates the assertion of the theorem for . This completes the proof. ∎
We employ the bounds for arbitrary moments of in the strong norms in Lemma 3.1, , and a weak monotonicity argument to prove the following error estimate for the solution of (4.1).
Theorem 4.2**.**
Assume that , and the assumption A.1 holds true. Then, for every , there exist constants and such that for all sufficiently small
[TABLE]
where solves (2.2) while solves (4.1).
The parameter which appears in Theorem 4.2 is due to the non-Lipschitz drift in the problem and is caused by the estimate (4.12) below.
Proof.
Consider (2.2) for the time interval , and denote . There holds -a.s. for all
[TABLE]
The third term on the right-hand side attributes to the use of instead of in (4.1). Choose , and apply expectation. By the weak monotonicity property (1.3) of the drift, the left-hand side of (4.11) is then bounded from below by
[TABLE]
Because of Young’s inequality and Lemma 3.2, we conclude
[TABLE]
Next we bound . For this purpose, we use the embedding for , the algebraic identity a^{3}-b^{3}=\frac{1}{2}(a-b)\bigl{(}(a+b)^{2}+a^{2}+b^{2}\bigr{)}, and Young’s and Hölder’s inequalities in combination with Lemma 3.2 to estimate ()
[TABLE]
The leading factor is bounded by by Lemma 3.2, , while the second factor may be bounded by due to (3.5). Thus we have
[TABLE]
It is immediate to validate
[TABLE]
by adding and subtracting in the second argument and proceeding as before, and Itô’s isometry in combination with (2.1) and Lemma 3.2, . Next we focus on the term . In view of generalized Hölder’s inequality, and the embedding for ,
[TABLE]
In view of Lemma 4.1, we see that
[TABLE]
We use (4.6), Lemma 4.1 and (4.13) to estimate ,
[TABLE]
and therefore we obtain
[TABLE]
We combine all the above estimates to have
[TABLE]
Summation over all time steps in (4.14), together with the discrete (implicit form) Gronwall’s lemma then validates the assertion of the theorem. ∎
5. Space-time discretization and strong error estimate
In this section, we first derive the uniform moment estimate for the discretized solution \big{\{}Y^{j}:0\leq j\leq J\big{\}} of the structure preserving finite element based fully discrete scheme (2.5). Then by using these uniform bounds along with Lemma 4.1 we bound the error , where solves (4.1).
We define the discrete Laplacian by the variational identity
[TABLE]
One can use the test function in (2.5) and proceed as in the proof of Lemma 4.1 along with (2.4), the and -stabilities of the projection operator (cf. [3]) to arrive at the following uniform moment estimates for \big{\{}Y^{j};0\leq j\leq J\big{\}}.
Lemma 5.1**.**
For every , there exists a constant such that
[TABLE]
provided \mathbb{E}\big{[}|\mathcal{J}(Y^{0})|^{p}\big{]}\leq C.
In view of Lemma 5.1, it follows that
[TABLE]
We have the following theorem regarding the error in strong norm.
Theorem 5.2**.**
Assume that . Then, under the assumption A.1, there exist constants , independent of the discretization parameters and such that for all sufficiently small, there holds
[TABLE]
where solves (4.1) while solves (2.5).
Proof.
We subtract (2.5) from (4.1), and restrict to the test functions . Choosing , and using (2.4), we obtain
[TABLE]
Note that the third term on the right-hand side of the first equality reflects that is a perturbation of . By the weak monotonicity property (1.3), we see that
[TABLE]
and therefore we arrive at the following inequality
[TABLE]
Note that, in view of Lemma 4.1, Young’s inequality and the embedding for
[TABLE]
Thus using Lemma 4.1 and the estimate above, we see that
[TABLE]
Let us recall the following well-known properties of , see [1]
[TABLE]
We use (5.3) and (5.4) to infer that
[TABLE]
Next we estimate . A simple approximation argument, (2.1), and (5.3) together with Young’s inequality lead to
[TABLE]
We now bound the term . We use the algebraic formula given before (4.12), the embedding for , and a generalized Young’s inequality to have
[TABLE]
Thanks to (4.13) and (5.4), we note that
[TABLE]
We use (4.13), (5.1) and (5.4), together with Young’s inequality to get
[TABLE]
It remains to bound . We decompose as follows.
[TABLE]
Thanks to generalized Hölder’s inequality, the -stability of , the embedding for , the estimates (5.4), (5.1) and (4.13), we have
[TABLE]
Next we estimate . We use the generalized Hölder’s inequality, the -stability of , the embedding for , Young’s inequality, the estimates (5.1), (5.4) and (4.6), (4.7) and (4.13), along with Lemma 4.1 to get
[TABLE]
Putting things together in (5.2) and using the discrete Gronwall’s lemma (implicit form) then yields
[TABLE]
Thus, thanks to (4.13), (5.4) and (5.5), we conclude that
[TABLE]
This finishes the proof. ∎
5.1. Proof of Main Theorem
Let the assumption A.1 hold and . Then thanks to Theorem 4.2, for every , there exist constants and such that for all sufficiently small
[TABLE]
where solves (2.2) while solves (4.1). Again, Theorem 5.2 asserts that there exist constants , independent of the discretization parameters and such that for all sufficiently small
[TABLE]
Let . Then (5.6) and (5.7) hold true for all sufficiently small. We combine (5.6) and (5.7) to conclude the proof of the main theorem.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] S.C. Brenner, L.R. Scott. The mathematical theory of finite element methods. 2nd edition, Springer (2002).
- 2[2] E. Carelli, A. Prohl. Rates of convergence for discretizations of the stochastic incompressible Navier-Stokes equations. SIAM J. Numer. Anal. 50 , pp. 2467-2496 (2012).
- 3[3] J. Douglas, Jr. T. Dupont, L. Wahlbin. The stability in L q superscript 𝐿 𝑞 L^{q} of the L 2 superscript 𝐿 2 L^{2} -projection into finite element function spaces. Numer. Math. 23, 193-197 (1975).
- 4[4] B. Gess. Strong solutions for stochastic partial differential equations of gradient type. J. Funct. Anal. 263 , pp. 2355-2383 (2012).
- 5[5] I. Gyöngy, A. Millet. Rate of convergence of implicit approximations for stochastic evolution equations. In: Baxendale, P., Lototsky, S. (eds.) Stochastic Differential Equations: Theory and Applications (A volume in honor of Boris L. Rosovskii), vol. 2 , pp. 281-310. World Scientific Interdisciplinary Mathematical Sciences. World Scientific, Singapore (2007).
- 6[6] I. Gyöngy, A. Millet. Rate of convergence of space time approximations for stochastic evolution equations. Potential Anal. 30 , pp. 29–64 (2009).
- 7[7] D.J. Higham, X. Mao, A.M. Stuart. Strong convergence of Euler-type methods for nonlinear stochastic differential equations. SIAM J. Numer. Anal. 40 , pp. 1041-1063 (2002).
- 8[8] M. Kovács, S. Larsson, A. Mesforush. Finite element approximation of the Cahn-Hilliard-Cook equation. SIAM J. Numer. Anal. 49 , pp. 2407-2429 (2011).
