A finite element approximation for the stochastic Maxwell--Landau--Lifshitz--Gilbert system
Beniamin Goldys, Kim-Ngan Le, Thanh Tran

TL;DR
This paper introduces a finite element method for approximating solutions to the stochastic Maxwell--Landau--Lifshitz--Gilbert system, enabling the simulation of magnetic phenomena relevant for nanostructured memories.
Contribution
It reformulates the stochastic LLG equation for time-differentiable solutions and proposes a convergent $ heta$-linear scheme with proven convergence and weak solution existence.
Findings
Convergent numerical scheme for stochastic MLLG system
Proof of existence of weak martingale solutions
Numerical results demonstrating method applicability
Abstract
The stochastic Landau--Lifshitz--Gilbert (LLG) equation coupled with the Maxwell equations (the so called stochastic MLLG system) describes the creation of domain walls and vortices (fundamental objects for the novel nanostructured magnetic memories). We first reformulate the stochastic LLG equation into an equation with time-differentiable solutions. We then propose a convergent -linear scheme to approximate the solutions of the reformulated system. As a consequence, we prove convergence of the approximate solutions, with no or minor conditions on time and space steps (depending on the value of ). Hence, we prove the existence of weak martingale solutions of the stochastic MLLG system. Numerical results are presented to show applicability of the method.
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.
Taxonomy
TopicsAdvanced Mathematical Modeling in Engineering · Theoretical and Computational Physics · Magnetic properties of thin films
A FINITE ELEMENT APPROXIMATION FOR
THE STOCHASTIC Maxwell–LANDAU–LIFSHITZ–GILBERT SYSTEM
Beniamin Goldys
School of Mathematics and Statistics, The University of Sydney, Sydney 2006, Australia
,
Kim-Ngan Le
School of Mathematics and Statistics, The University of New South Wales, Sydney 2052, Australia
and
Thanh Tran
School of Mathematics and Statistics, The University of New South Wales, Sydney 2052, Australia
Abstract.
The stochastic Landau–Lifshitz–Gilbert (LLG) equation coupled with the Maxwell equations (the so called stochastic MLLG system) describes the creation of domain walls and vortices (fundamental objects for the novel nanostructured magnetic memories). We first reformulate the stochastic LLG equation into an equation with time-differentiable solutions. We then propose a convergent -linear scheme to approximate the solutions of the reformulated system. As a consequence, we prove convergence of the approximate solutions, with no or minor conditions on time and space steps (depending on the value of ). Hence, we prove the existence of weak martingale solutions of the stochastic MLLG system. Numerical results are presented to show applicability of the method.
Key words and phrases:
stochastic partial differential equation, Landau–Lifshitz–Gilbert equation, Maxwell equation, finite element, ferromagnetism
2000 Mathematics Subject Classification:
Primary 35R60, 60H15, 65L60, 65L20; Secondary 82D45
1. Introduction
The Maxwell–Landau–Lifshitz–Gilbert (MLLG) system describes the electromagnetic behaviour of a ferromagnetic material [12]. For simplicity, we suppose that there is a bounded cavity (with perfectly conducting outer surface ) in which a ferromagnet is embedded, and is an isotropic material. Letting and , the magnetisation field (where is the unit sphere in ) and the magnetic field satisfy the quasi-static model of the MLLG system:
[TABLE]
in which , , and are constants. Here, the inverse of the conductivity is a scalar positive bounded function on satisfying for all [24]. Vector function is the effective field and is the zero extension of onto , i.e.,
[TABLE]
The system (1.1)–(1.2) is supplemented with the initial conditions
[TABLE]
and the boundary conditions
[TABLE]
where and are the unit outward normal vectors to and , respectively. Here denotes the normal derivative.
It is highly significant to consider the stochastic MLLG system in order to describe the creation of domain walls and vortices (fundamental objects for the novel nanostructured magnetic memories) [26]. We follow [6, 9] to add a noise to the effective field so that the stochastic version of the MLLG system takes the form
[TABLE]
where is a given bounded function, and is a one-dimensional Wiener process. Here stands for the Stratonovich differential. We assume without loss of generality that (see [9])
[TABLE]
For simplicity the effective field is taken to be .
In the deterministic case, i.e. (1.1)–(1.2), the existence and uniqueness of a local strong solution is shown by Cimrák [11]. He also proposes [10] a finite element method to approximate this local solution and provides error estimation. Various results on the existence of global weak solutions are proved in [17, 18, 27]. A more complete list can be found in [12, 16, 20]. It should be noted that apart from [10] where a numerical scheme is suggested for a local solution, other analyses are non-constructive, namely no computational techniques are proposed for the solution.
In [25], the stability of a semidiscrete scheme to numerically solve (1.1)–(1.2) is verified, but its convergence is not studied. Baňas, Bartels and Prohl [4] propose an implicit nonlinear scheme to solve the MLLG system, and succeed in proving that the finite element solution converges to a weak global solution of the problem. A -linear finite element scheme is proposed in [7, 21, 22] to find a weak global solution to the MLLG system, and convergence of the numerical solutions is proved with no condition imposed on time step and space step if . It should be mentioned that the proofs of existence proposed in [4, 7, 21, 22] are constructive proofs, namely an approximate solution can be computed.
In the stochastic case, the Faedo–Galerkin method is used in [9] to show the existence of a weak martingale solution for the stochastic Landau–Lifshitz–Gilbert (LLG) equation (1.5). Finite element schemes for this equation are studied in [2, 6, 14] which prove that the numerical solutions converge to a weak martingale solution. It is noted that a non-linear scheme is proposed in [6] and linear schemes are proposed in [2, 14].
The full version of the stochastic Landau–Lifshitz equation coupled with the Maxwell’s equations is studied firstly in [23, Section 5] where the existence of the weak martingale solution and its regularity are proved by using the Faedo-Galerkin approximation, the methods of compactness and Skorokhod’s Theorem.
To the best of our knowledge the numerical analysis of the system (1.5)–(1.6) is an open problem at present. In this paper, we extend the -linear finite element scheme developed in [22] for the deterministic MLLG system to the stochastic case. Since this scheme seeks to approximate the time derivative of the magnetization , we adopt the technique in [14] to reformulate system (1.5)–(1.6) into a system not involving the Stratonovich differential . Then the -linear scheme mentioned above can be applied. As a consequence, we prove the existence of weak martingale solutions to the stochastic MLLG system.
The paper is organised as follows. In Section 2 we define the notations to be used, and recall some technical results. In Section 3 we define weak martingale solutions to (1.5)–(1.6) and state our main result. Details of the reformulation of (1.5) are presented in Section 4. We also show in this section how a weak solution to (1.5)–(1.6) can be obtained from a weak solution of the reformulated system. In Section 5, we introduce our finite element scheme and present a proof of the convergence of finite element solutions to a weak solution of the reformulated system. Section 6 is devoted to the proof of the main theorem. Our numerical experiments are presented in Section 7.
Throughout this paper, denotes a generic constant which may take different values at different occurences.
2. Notations and technical results
2.1. Notations
In this subsection, we introduce some function spaces and notations which are used in the rest of this paper.
For any open set , the curl operator of a vector function defined on is denoted by
[TABLE]
if the partial derivatives exist. The function spaces and are defined, respectively, by
[TABLE]
Here, is the usual space of Lebesgue square integrable functions defined on and taking values in . The inner product and norm in are denoted by and , respectively.
For any vector functions , we denote
[TABLE]
provided that the partial derivatives exist, at least in the weak sense. We also denote
[TABLE]
for any and any normed vector space .
2.2. Technical results
In this subsection we recall some results from [14]. They will be used in the next section to reformulate (5) to a new form.
Assume that , and let be defined by
[TABLE]
Then the operator is bounded [14].
Lemma 2.1**.**
For any and there hold
[TABLE]
In the proof of the existence of weak solutions we also need the following result for the operator .
Lemma 2.2**.**
Assume that . For any , and , let
[TABLE]
with being defined by
[TABLE]
There holds
[TABLE]
From now on, we assume that .
We finish this section by stating two elementary identities involving the dot and cross products of vectors in , which will be frequently used. For all , the following identities hold
[TABLE]
and
[TABLE]
3. The main result
In this section we state the definition of a weak martingale solution to (1.5)–(1.6) and our main result.
Recalling that , multiplying (1.5) by a test function and integrating over we obtain formally
[TABLE]
From (2.8), the Green identity and we define
[TABLE]
and similarly
[TABLE]
Therefore,
[TABLE]
In the same manner, if we multiply (1.6) by a test function , integrate over , and note (1.3), then we obtain, formally,
[TABLE]
We remark that the time derivative is taken on because in general is not time differentiable. Since , see (1.4), and , see the definition of in Section 2, it follows from [24, Corollary 3.20] that
[TABLE]
Hence
[TABLE]
The above observations prompt us to define the solution of (1.5)–(1.6) as follows.
Definition 3.1**.**
Given , a weak martingale solution to (1.5)–(1.6) on the time interval , consists of
- (a)
a filtered probability space with the filtration satisfying the usual conditions, 2. (b)
a one-dimensional -adapted Wiener process , 3. (c)
a progressively measurable process , 4. (d)
a progressively measurable process
such that there hold
- (1)
\mathbb{P}\big{(}\boldsymbol{M}\in C([0,T];\mathbb{H}^{-1}(D))\big{)}=1; 2. (2)
\mathbb{P}\big{(}\boldsymbol{H}\in L^{2}(0,T;\mathbb{H}(\operatorname{{curl\/}};\widetilde{D})\big{)}=1; 3. (3)
; 4. (4)
for all , a.e. in , and -a.s.; 5. (5)
for every , for all , -a.s.:
[TABLE] 6. (6)
for all , -a.s.:
[TABLE]
The main theorem of the paper is stated below.
Theorem 3.2**.**
Assume that satisfies (1.7) and \big{(}\boldsymbol{M}_{0},\boldsymbol{H}_{0}\big{)} satisfies
[TABLE]
For each , there exists a weak martingale solution to (1.5)–(1.6).
Proof.
The theorem is a direct consequence of Theorem 6.9. ∎
4. Equivalence of weak solutions
In this section, we use the operator defined in Section 2 to define new variables and from and .
Informally, if \big{(}\boldsymbol{M},\boldsymbol{H}\big{)} is a weak solution to (5)–(3.2) then we can define new processes and (see (4.1)–(4.2) below) such that the Stratonovich differential vanishes in the partial differential equation satisfied by . Moreover, it will be seen that is differentiable with respect to . We will make this argument more rigorous in the following lemma.
Let a filtered probability space \big{(}\Omega,{\mathcal{F}},({\mathcal{F}}_{t})_{t\in[0.T]},\mathbb{P}\big{)} and a Wiener process on it be given. We define a new processes and from processes and
[TABLE]
where is the zero extension of onto . Then it follows immediately from (LABEL:equ:G12) and (2.4) that, for all and almost all ,
[TABLE]
The following lemma shows that in order to find and , it suffices to find and .
Lemma 4.1**.**
Let \boldsymbol{m}\in H^{1}\big{(}0,T;\mathbb{H}^{1}(D)\big{)} and , -a.s., satisfy
[TABLE]
and
[TABLE]
where
[TABLE]
for all \boldsymbol{\xi}\in L^{2}\big{(}0,T;\mathbb{W}^{1,\infty}(D)\big{)} and , with defined in Lemma 2.2. Then and satisfy (5)–(3.2) -a.s.
Proof.
Step 1: and satisfy (5):
Since is a semimartingale and is absolutely continuous, using Itô’s formula for (see e.g. [13]), we deduce
[TABLE]
where the first integral on the right-hand side is an Itô integral and the last two are Bochner integrals. Recalling the relation between the Stratonovich and Itô differentials, namely
[TABLE]
and noting that we rewrite (4) in the Stratonovich form as
[TABLE]
Multiplying both sides of the above equation by a test function and integrating over we obtain
[TABLE]
where in the last step we used (2.4).
On the other hand, we note that e^{-W(\cdot)G}\boldsymbol{\psi}\in L^{2}\big{(}0,t;\mathbb{W}^{1,\infty}(D)\big{)} for . Let the test function in (4.4) be , we obtain from (4.6) that
[TABLE]
Considering , we use successively (2.8), Lemma 2.2, (4.1), and (2.6) to obtain
[TABLE]
Therefore,
[TABLE]
Similarly, considering we have
[TABLE]
so that
[TABLE]
On the other hand, by using (2.4), (2.6), and noting that in , we obtain
[TABLE]
and
[TABLE]
Therefore,
[TABLE]
This equation and (4) give
[TABLE]
Hence, and satisfy (5).
Step 2: and satisfy (3.2):
This follows immediately from (4.5) and the fact that
[TABLE]
completing the proof of the lemma. ∎
In the next lemma we provide an equivalence of equation (4.4), namely its Gilbert form.
Lemma 4.2**.**
Assume that \boldsymbol{m}\in H^{1}\big{(}0,T;\mathbb{H}^{1}(D)\big{)} and , -a.s., satisfy
[TABLE]
Assume further that satisfies -a.s.
[TABLE]
for all \boldsymbol{\varphi}\in L^{2}\big{(}0,T;\mathbb{H}^{1}(D)\big{)}, where and
[TABLE]
*with defined in Lemma 2.2. Then satisfies (4.4) -a.s. *
Proof.
Firstly, we observe that for each \boldsymbol{\xi}\in L^{2}\big{(}0,T;\mathbb{W}^{1,\infty}(D)\big{)}, due to Lemma 8.1, there exists \boldsymbol{\varphi}\in L^{2}\big{(}0,T;\mathbb{H}^{1}(D)\big{)} satisfying
[TABLE]
Next we derive some identities which will be used later in the proof. By using (2.7) and noting (4.10) (so that ), we have
[TABLE]
Moreover,
[TABLE]
The above identities and (2.1) imply
[TABLE]
and
[TABLE]
where in the last step we used the elementary property for all .
Now consider each term on the left-hand side of (4.4). By using (4.12)–(4) and noting (2.8) we obtain
[TABLE]
Adding the above equations side by side we deduce that the left-hand side of (4.4) equals that of (4.11). Thus (4.4) holds if (4.11) holds. The lemma is proved. ∎
Thanks to Lemma 4.1 and Lemma 4.2, in order to solve (1.5)–(1.6), we solve (4.11) and (4.5). It is therefore necessary to define the weak martingale solutions for these two latter equations.
Definition 4.3**.**
Given , a weak martingale solution to (4.11) and (4.5) on the time interval , denoted by , consists of
- (a)
a filtered probability space with the filtration satisfying the usual conditions, 2. (b)
a one-dimensional -adapted Wiener process , 3. (c)
a progressively measurable process , 4. (d)
a progressively measurable process ,
such that there hold
- (1)
, -a.s.; 2. (2)
, -a.s.; 3. (3)
; 4. (4)
* for all , a.e. in , and -a.s.;* 5. (5)
* satisfies (4.11) and (4.5) -a.s.*
We state the following lemma which is a direct consequence of Lemma 4.1, Lemma 4.2, and statement (4.3).
Lemma 4.4**.**
If is a weak martingale solution of (4.11) and (4.5) in the sense of Definition 4.3, then is a weak martingale solution of (1.5) and (1.6) in the sense of Definition 3.1.
In the next section, we present a finite element scheme to approximate the solutions of (4.11) and (4.5).
5. The finite element scheme
In this section we introduce the -linear finite element scheme which approximates a weak solution defined in Definition 4.3.
Let be a regular tetrahedrization of the domain into tetrahedra of maximal mesh-size . Let be its restriction to . We denote by the set of vertices in and by the set of edges in .
To discretize the equation (4.11), we introduce the finite element space defined by
[TABLE]
where is the set of polynomials of maximum total degree in . A basis for can be chosen to be , where is a continuous piecewise linear function on satisfying (the Kronecker delta) and is the canonical basis for . The interpolation operator from onto is defined by
[TABLE]
To discretize (4.5), we introduce the lowest order edge elements of Nédélec’s first family (see [24]) defined by
[TABLE]
where
[TABLE]
A basis of can be defined by
[TABLE]
where is the unit vector in the direction of edge . For any and , the interpolation operator from onto is defined by
[TABLE]
where
Before introducing our approximation scheme, we state the following result, proved in [5], which will be used in the analysis.
Lemma 5.1**.**
If there holds
[TABLE]
then for all satisfying , , there holds
[TABLE]
When , condition (5.1) holds for Delaunay triangulations. When , it holds if all dihedral angles of the tetrahedra in are less than or equal to ; see [5]. In the sequel we assume that (5.1) holds.
With the finite element spaces defined as above, we are ready to define our approximation scheme. Fixing a positive integer , we choose the time step to be and define , . For , the functions and are approximated by and , respectively. If is an approximation of , then since
[TABLE]
we can define from by
[TABLE]
To maintain the condition , we normalise the right-hand side of (5.3) and therefore define belonging to by
[TABLE]
which ensures that at vertices. Hence it suffices to propose a scheme to compute .
We first rewrite (4.11) as
[TABLE]
where . Then, noting that (which follows from ) and , we can design a Galerkin method in which the unknown and the test function reflect the above property. Hence we follow [1, 3] to define
[TABLE]
and we will seek in this space. It remains to approximate the other terms in (5).
Considering the piecewise constant approximation of , namely,
[TABLE]
we define
[TABLE]
We can now discretise (5) as: For some , find satisfying
[TABLE]
To discretise (4.5), even though is not time differentiable we formally use integration by parts to bring the time derivative to , and thus with defined by
[TABLE]
the discretisation of (4.5) reads: Compute by solving
[TABLE]
We summarise the above procedure in the following algorithm.
Algorithm 5.1**.**
**
**Step 1: **
Set . Choose and .
**Step 2: **
Solve (5) and (5.11) to find .
**Step 3: **
Define
[TABLE]
**Step 4: **
Set and and return to Step if . Stop if .
By the Lax–Milgram theorem, for each there exists a unique solution of equations (5)–(5.11). Since and for all and , there hold (by induction)
[TABLE]
In particular, the above inequality shows that Step 3 of the algorithm is well defined.
We finish this section by proving the following lemmas concerning boundedness of , and .
Lemma 5.2**.**
For any there hold
[TABLE]
where denotes the measure of .
Proof.
The first inequality follows from (5.12) and the second can be obtained by integrating over . ∎
Lemma 5.3**.**
Assume that satisfies (1.7) and . There exists a deterministic constant depending only on such that, for any , there holds ,
[TABLE]
Proof.
The proof of (5.13) is similar to that of [14, Lemma 5.3]. To prove (5.14) we first note that the definition of gives
[TABLE]
where in the last step we used for all , . Since and for all , we have
[TABLE]
Therefore,
[TABLE]
proving (5.14).
Finally, in order to prove (5.15) we use the inequality
[TABLE]
to obtain
[TABLE]
On the other hand from the definition of , we deduce
[TABLE]
Since , by using Lemma 5.2 and (5.14) we obtain from the above equality
[TABLE]
This completes the proof. ∎
Lemma 5.4**.**
The sequence \left\{\big{(}\boldsymbol{m}_{h}^{(j)},\boldsymbol{v}_{h}^{(j)},\boldsymbol{P}^{(j)}_{h}\big{)}\right\}_{j=0,1,\cdots,J} produced by Algorithm 5.1 satisfies
[TABLE]
Proof.
Choosing in (5), we obtain
[TABLE]
or equivalently
[TABLE]
Lemma 5.1 and the above equation yield
[TABLE]
By using the elementary inequality
[TABLE]
for the last two terms on the right hand side, we deduce
[TABLE]
By rearranging the above inequality and using (5.13)–(5.14) we obtain
[TABLE]
Replacing by in the above inequality and summing for from [math] to yields
[TABLE]
Since it can be shown that there exists a deterministic constant depending only on such that
[TABLE]
By using (5.18) we deduce
[TABLE]
In order to estimate the two sums on the right-hand side, we take in (5.11) to obtain the following identity
[TABLE]
Let is the lower bound of on . By using successively (5.17) and (5.15) we deduce from the above equality
[TABLE]
or equivalently
[TABLE]
Replacing by in the above inequality and summing over from [math] to and using the following Abel summation
[TABLE]
we obtain
[TABLE]
By using (3.3) and the error estimate for the interpolant , it can be shown that there exists a constant c depending only on such that
[TABLE]
By using (5.20) we deduce
[TABLE]
[TABLE]
By using induction and (5.18)-(5.20) we can show that
[TABLE]
Summing over from [math] to and using we obtain
[TABLE]
The required result (5.4) now follows from (5), (5.21) and (5.22). ∎
6. Proof of the main theorem
The discrete solutions , and constructed via Algorithm 5.1 are interpolated in time in the following definition.
Definition 6.1**.**
For all and all , let be such that . We then define
[TABLE]
The above sequences have the following obvious bounds.
Lemma 6.2**.**
There exist a deterministic constant depending on , , , , and such that for all there holds -a.s.
[TABLE]
where or . In particular, when , there holds -a.s.
[TABLE]
Proof.
Both inequalities are direct consequences of Definition 6.1, Lemmas 5.2 and 5.4, noting that the second inequality requires the use of the inverse estimate (see e.g. [19])
[TABLE]
∎
Lemma 6.3**.**
There exist a deterministic constant depending on , , , , and such that for all there holds -a.s.
[TABLE]
where or .
Proof.
It is easy to prove (6.1) by using Lemma 5.4 and Definition 6.1. Inequality (6.2) can be deduced from Lemma 5.4 by noting that for there holds
[TABLE]
completing the proof of the lemma. ∎
The next lemma provides a bound of in the -norm and relationships between , and .
Lemma 6.4**.**
Assume that and go to [math] with a further condition when and no condition otherwise. The sequences , , and defined in Definition 6.1 satisfy the following properties -a.s.
[TABLE]
Proof.
The proof of this lemma is similar to that of [14, Lemma 6.3] ∎
The following two Lemmas 6.5 show that and , respectively, satisfy discrete forms of (4.11) and (4.5).
Lemma 6.5**.**
Assume that and go to 0 with the following conditions
[TABLE]
Then for any \boldsymbol{\varphi}\in C\big{(}0,T;{\mathbb{C}}^{\infty}(D)\big{)} and , there holds -a.s.
[TABLE]
and
[TABLE]
Proof.
Proof of (6.5): For , we use (5) with \boldsymbol{w}_{h}^{(j)}=I_{\mathbb{V}_{h}}\big{(}\boldsymbol{m}_{h,k}^{-}(t,\cdot)\times\boldsymbol{\varphi}(t,\cdot)\big{)}\in\mathbb{W}_{h}^{(j)} to have
[TABLE]
Integrating both sides of the above equation over and summing over we deduce
[TABLE]
This implies
[TABLE]
where
[TABLE]
Hence it suffices to prove that for . Firstly, by using Lemma 5.2 we obtain
[TABLE]
This inequality, Lemma 6.2 and Lemma 8.2 yield
[TABLE]
The bounds for , and can be obtained similarly by using Lemma 6.2 and Lemma 5.3, respectively, noting that when , a bound of can be deduced from the inverse estimate This completes the proof (6.5).
Proof of (6.5): For , we use (5.11) with to have
[TABLE]
Integrating both sides of the above equation over andsumming over , and using integration by parts (noting that ) we deduce
[TABLE]
By using Lemma 6.3 and the following error estimate, see e.g. [24],
[TABLE]
we deduce
[TABLE]
Using Green’s identity (see [24, Corollary 3.20]) we obtain (6.5), completing the proof of the lemma. ∎
In the next lemma we show that can be replaced by , as indeed the latter approximates .
Lemma 6.6**.**
Assume that and go to 0 satisfying (6.7). Then for any and , there holds -a.s.
[TABLE]
and
[TABLE]
Proof.
Proof of (6.6): From (6.5) it follows that
[TABLE]
where
[TABLE]
Hence it suffices to prove that for .
First, by using the triangle inequality we obtain
[TABLE]
Therefore, the bound of can be obtained by using Lemmas 6.2 and 6.4. The bounds for and can be obtained similarly.
Finally, using (5.14), Lemmas 6.2 and 6.3 we obtain
[TABLE]
This completes the proof of (6.6).
Proof of (6.6): It follows from (6.5) that
[TABLE]
where
[TABLE]
By using (6.4) and (6.2) we obtain that for . This completes the proof of (6.6). ∎
In order to prove the -a.s. convergence of random variables and , we first show that the family and are tight.
Lemma 6.7**.**
Assume that and go to 0 satisfying (6.7). Then the set of laws on the space C\big{(}0,T;\mathbb{H}^{-1}(D)\big{)}\times H^{-1}(\widetilde{D}_{T})\times{\mathbb{D}}(0,T) is tight. Here, is the Skorokhod space; see e.g. [8].
Proof.
Firstly, from Definition 5.5, the approximation of the Wiener process belongs to . The tightness of in is proved in [8, Theorem 2.5.6]. The tightness of on C\big{(}0,T;\mathbb{H}^{-1}(D)\big{)} and of on can be obtained as in the proof of [14, Lemma 6.6] and is therefore omitted. ∎
The following proposition is a consequence of the tightness of , and .
Proposition 6.8**.**
Assume that and go to 0 satisfying (6.7). Then there exist
- (a)
a probability space , 2. (b)
a sequence of random variables defined on and taking values in the space C\big{(}0,T;\mathbb{H}^{-1}(D)\big{)}\times\mathbb{H}^{-1}(\widetilde{D}_{T})\times{\mathbb{D}}(0,T), 3. (c)
a random variable defined on and taking values in C\big{(}[0,T];\mathbb{H}^{-1}(D)\big{)}\times\mathbb{H}^{-1}(\widetilde{D}_{T})\times{\mathbb{D}}(0,T),
satisfying
- (1)
, 2. (2)
* in C\big{(}0,T;\mathbb{H}^{-1}(D)\big{)} strongly, -a.s.,* 3. (3)
* in strongly, -a.s.,* 4. (4)
* in -a.s.*
Moreover, the sequence and satisfy -a.s.
[TABLE]
Proof.
By Lemma 6.7 and the Donsker theorem [8, Theorem 8.2], the family of probability measures is tight on C\big{(}0,T;\mathbb{H}^{-1}(D)\big{)}\times\mathbb{H}^{-1}(\widetilde{D}_{T})\times{\mathbb{D}}(0,T). Then by Theorem 5.1 in [8] the family of measures is relatively compact on C\big{(}0,T;\mathbb{H}^{-1}(D)\big{)}\times\mathbb{H}^{-1}(\widetilde{D}_{T})\times{\mathbb{D}}(0,T), that is there exists a subsequence, still denoted by , such that converges weakly. Hence, the existence of (a)–(c) satisfying (1)–(4) follows immediately from the Skorokhod Theorem [8, Theorem 6.7] since C\big{(}0,T;\mathbb{H}^{-1}(D)\big{)}\times\mathbb{H}^{-1}(\widetilde{D}_{T})\times{\mathbb{D}}(0,T) is a separable metric space.
We note that from the Kuratowski theorem, the Borel subsets of or are Borel subsets of C\big{(}0,T;\mathbb{H}^{-1}(D)\big{)} and the Borel subsets of are Borel subsets of . The estimates (6.12)–(6.15) are direct consequences of Lemmas 6.3–6.4 and the equality of laws stated in part (1). ∎
We now ready to prove the main result of this paper.
Theorem 6.9**.**
Assume that , and satisfy (LABEL:equ:m0) and (1.7), respectively. Then , , , the sequences , and the probability space given by Proposition 6.8 satisfy
- (1)
the sequence converges to weakly in , -a.s. 2. (2)
the sequence converges to weakly in , -a.s. 3. (3)
\big{(}\Omega^{\prime},{\mathcal{F}}^{\prime},({\mathcal{F}}^{\prime}_{t})_{t\in[0,T]},\mathbb{P}^{\prime},W^{\prime},\boldsymbol{M}^{\prime},\boldsymbol{P}^{\prime}\big{)}* is a weak martingale solution of (1.5), where*
[TABLE]
Proof.
By Proposition 6.8 there exists a set such that ,
[TABLE]
[TABLE]
and (6.12), (6.15) hold for every . In what follows, we work with a fixed .
The convergences of sequences and are obtained by using the same arguments as in [15, Theorem 6.8].
In order to prove (3), by noting Lemma 4.4 we need to prove that and satisfy (4.10), (4.11) and (4.5).
Prove that satisfies (4.10): Since is compactly embedded in , there exists a subsequence of (still denoted by ) such that
[TABLE]
Therefore (4.10) follows from (6.16) and (6.14).
Prove that satisfy (4.11) and (4.5): From Lemma 6.6 , \big{(}\boldsymbol{m}_{h,k},\boldsymbol{P}_{h,k}^{+},W_{k}\big{)} satisfies (6.6)–(6.6) -a.s.. Therefore, it follows from the equality of laws in Proposition 6.8 that \big{(}\boldsymbol{m}_{h,k}^{\prime},\boldsymbol{P}_{h,k}^{\prime},W_{k}^{\prime}\big{)} satisfies the following equations for all \boldsymbol{\psi}\in C_{0}^{\infty}\big{(}(0,T);{\mathbb{C}}^{\infty}(D)\big{)} and , -a.s.
[TABLE]
and
[TABLE]
It suffices now to use the same arguments as in [15, Theorem 6.8] to pass the limit in (6) and (6). Indeed, from [15, Theorem 6.8] there hold
[TABLE]
To prove the convergence of the last term in (6), we use the triangle inequality, Hölder inequaliy, (5.14), (5.6) and (2.3) to obtain
[TABLE]
here the last inequality is obtained by using (6.15) and a.e..
Hence, it follows from (6.16), part (4) in Proposition 6.8 and the weak convergence of in that
[TABLE]
This implies that satisfy (4.11).
The convergence of (6) can be proved in the same manner by noting that converges weakly in , completing the proof of the theorem. ∎
7. Numerical experiment
In order to carry out physically relevant experiments (see [16]), the initial fields , must satisfy the following conditions
[TABLE]
This can be achieved by taking
[TABLE]
where in . In our experiment, for simplicity, we choose to be a constant. We solve an academic example with and
[TABLE]
where , and . The constant represents the strength of in the -direction. We carried out the experiments for . We set the values for the other parameters in (5) and (3.2) as .
For each time step , we generate a discrete Brownian path by:
[TABLE]
An approximation of any expected value is computed as the average of discrete Brownian paths. In our experiments, we choose .
At each iteration we solve two linear systems of sizes and , recalling that is the number of vertices and is the number of edges in the triangulation. The code is written in Fortran90. The parameter in Algorithm 5.1 is chosen to be .
In the first set of experiments, to observe convergence of the method, we solve with , where , and different time steps , , and . For each value of , the domain is partitioned into uniform cubes of size . Each cube is then partitioned into six tetrahedra. Noting that
[TABLE]
we compute and plotte in Figure 1 the error for different values of and .
In the second set of experiments to observe boundedness of discrete energies, we solve the problem with fixed values of and . We plot in Figure 2 and in Figure 3 for three individual paths and the expectations which seems to suggest that these energies are bounded when . Figure 4 shows that the total energy is bounded as in Lemma 5.4.
8. Appendix
For the reader’s convenience we will recall the following lemmas proved in [15].
Lemma 8.1**.**
For any real constants and with , if satisfy , then there exists satisfying
[TABLE]
As a consequence, if \boldsymbol{\zeta}\in H^{1}\big{(}(0,T);\mathbb{H}^{1}(D)\big{)} with a.e. in and \boldsymbol{\psi}\in L^{2}\big{(}(0,T);W^{1,\infty}(D)\big{)}, then \boldsymbol{\varphi}\in L^{2}\big{(}(0,T);\mathbb{H}^{1}(D)\big{)}.
Lemma 8.2**.**
For any , and there hold
[TABLE]
where is defined in Defintion 6.1
The next lemma defines a discrete -norm in which is equivalent to the usual -norm.
Lemma 8.3**.**
There exist -independent positive constants and such that for all and there holds
[TABLE]
where , d=1,2,3.
Acknowledgements
The authors acknowledge financial support through the ARC projects DP160101755 and DP120101886.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] F. Alouges. A new finite element scheme for Landau-Lifchitz equations. Discrete Contin. Dyn. Syst. Ser. S , 1 (2008), 187–196.
- 2[2] F. Alouges, A. D. Bouard, and A. Hocquet. A semi-discrete scheme for the stochastic Landau–Lifshitz equation. Research Report, ar Xiv:1403.3016, 2014.
- 3[3] F. Alouges and P. Jaisson. Convergence of a finite element discretization for the Landau-Lifshitz equations in micromagnetism. Math. Models Methods Appl. Sci. , 16 (2006), 299–316.
- 4[4] L. Baňas, S. Bartels, and A. Prohl. A convergent implicit finite element discretization of the Maxwell–Landau–Lifshitz–Gilbert equation. SIAM J. Numer. Anal. , 46 (2008), 1399–1422.
- 5[5] S. Bartels. Stability and convergence of finite-element approximation schemes for harmonic maps. SIAM J. Numer. Anal. , 43 (2005), 220–238 (electronic).
- 6[6] L. Baňas, Z. Brzeźniak, A. Prohl, and M. Neklyudov. A convergent finite-element-based discretization of the stochastic Landau–Lifshitz–Gilbert equation. IMA Journal of Numerical Analysis , (2013).
- 7[7] L. Baňas, M. Page, and D. Praetorius. A convergent linear finite element scheme for the Maxwell–Landau–Lifshitz–Gilbert equation. Submitted , (2012).
- 8[8] P. Billingsley. Convergence of Probability Measures . Wiley Series in Probability and Statistics: Probability and Statistics. John Wiley & Sons Inc., New York, second edition, 1999. A Wiley-Interscience Publication.
