Temporal convergence of extrapolated BDF-2 scheme for the Maxwell-Landau-Lifshitz equations
Introduction
The Landau-Lifshitz (LL) equation describes the evolution of magnetization in continuum ferromagnets and plays a fundamental role in the understanding of non-equilibrium magnetism. Let be a bounded and convex domain with smooth boundary ∂Ω. The unknown magnetization m satisfies the following nonlinear parabolic problem in : where represents the damping constant. Multiplying (1.1) by m, it is easy to see that which means that remains unchanged in time. Usually, one assumes that the initial value , where is the unit sphere in . Then the magnetization m always satisfies
In designing numerical algorithms for the LL equation, a crucial issue is how to preserve the point-wise constraint (1.2) of numerical solutions in fully discrete level. There are two different strategies to deal with it: one implementing the unit length constraint approximately and another preserving the unit length constraint exactly. For the first strategy, the point-wise constraint (1.2) can be relaxed by introducing some penalty terms [26], [27]. On the other hand, we note that the point-wise constraint (1.2) can be deduced from the equation (1.1), and some linearized semi-implicit schemes were proposed and studied in [5], [13], [20], in which only the solution of a linear system is required at each time step. The last technique in the first strategy is the projection free method. For example, the projection free method was applied to the decoupled integration of the coupling of the Landau–Lifshitz–Gilbert (LLG) equation with a spin diffusion equation for the spin accumulation in [1]. The error estimate of the projection free method for the LLG equation was presented in [18]. Akrivis et al. presented an orthogonal projection-free method based on -averaged orthogonality constraints and higher order nonconforming finite element approximations [3].
For the second strategy, one is to design a suitable scheme embedding the constraint implicitly as the LL equation does. Most of these schemes are nonlinear and fully implicit and an inner iteration is required for solving the nonlinear discrete system [11], [15]. Another way preserving the point-wise constraint (1.2) of numerical solutions is the projection method. An orthogonal sphere projection method was firstly introduced by Alouges and Jaisson in [4] for the LLG equation, where one has to build a new finite element space which is orthogonal point-wisely to the finite element solution at the previous time step. A simple and natural projection method is to update the intermediate magnetization by projecting it onto the unit sphere to get the end-of-step magnetization [17]. Recently, optimal error estimates for such projection method are proved in [6] for the finite difference methods of Euler and Crank-Nicolson schemes and in [7] for the k-th order finite element method of Euler scheme, where .
In this paper, we consider the Maxwell-Landau-Lifshitz (MLL) equations which are used to describe certain electromagnetic phenomena in a ferromagnet occupying the domain Ω and are governed by the following coupled system in : where represents the magnetic permeability. The unknown functions m and H denote the magnetization and the magnetic field, respectively. The system (1.3)-(1.4) is supplemented with initial conditions and boundary conditions where n is the unit outward normal vector to ∂Ω.
It is clear that if , the solution m to (1.3) still satisfies the point-wise constraint By (1.2) and the following vector formula: the system (1.3)-(1.4) are equivalent to by noting the fact that the point-wise constraint (1.7) can be deduced from (1.5) and (1.8). Multiplying (1.8) by 2m and setting leads to where we use Denote . Then (1.10) reduces to Testing (1.11) by 2w and using the Gronwall's inequality, we obtainfor any . In the above inequality, we noted from (1.5). Thus, which implies that the constraint (1.7) holds.
The construction of efficiently numerical schemes for the MLL equations is difficult due to the nonlinear character of (1.8) and the point-wise constraint (1.2). The nonlinear implicit finite element schemes were proposed for solving the Maxwell-Landau-Lifshitz-Gilbert (MLLG) equations numerically in [8], [9], where the unit-length constraint of numerical solutions can be preserved at all nodes and the unconditional convergence of the algorithm was proved in [8]. Based on the orthogonal sphere projection method proposed in [4], two linear finite element schemes for the MLLG equations were studied in [10] and the authors proved that the numerical solutions converge towards weak solutions of the MLLG equations. We noted that there have some works on numerical schemes for the coupling of LLG equation with the quasi-static eddy-current formulation of the Maxwell equations, such as the projection-free methods [18], the orthogonal projection methods [19], [22], [23].
In this paper, we propose and study the second-order backward differentiation formula (BDF-2) time-discrete scheme for the approximation of the MLL equations (1.8)-(1.9) with initial and boundary conditions (1.5)-(1.6). Since the point-wise constraint (1.2) can be deduced from (1.8), the proposed BDF-2 scheme is a semi-implicit scheme by using the implicit-explicit and extrapolation methods to linearize the nonlinear terms, and the unit-length of numerical solutions is satisfied approximately. The first-order Euler semi-implicit time-discrete scheme has been studied in [14], where the author proved the optimal convergence rate for the magnetization in -norm and the sub-optimal convergence rate for the magnetization and the magnetic field in -norm and -norm, respectively. For the proposed BDF-2 scheme in this paper, the optimal temporal convergence rate is derived for the magnetization and the magnetic field in -norm and -norm, respectively, by using the method of mathematical induction, where -norm is defined in next section.
This paper is organized as follows. In next section, we present the BDF-2 time-discrete scheme for (1.8)-(1.9) with (1.5)-(1.6), and state the main result on the temporal convergence rate under some regularity assumptions. In Section 3, we recall some known inequalities used in the proof of main result, and give the proof by the method of mathematical induction. In Section 4, we provide numerical results to confirm the theoretical result on the temporal convergence rate . Finally, a conclusion section is given.
Section snippets
Second-order BDF scheme
For and , let denote the Sobolev space. For , we use to denote . The boldface notations and are used to denote the vector-value Sobolev spaces and , respectively. In particular, denotes or inner product. The norms in and are denoted by , and , respectively. Throughout this paper, we use the symbol to denote a general positive constant which is independent of
Error analysis
In this section, we give the proof of Theorem 2.1 by using the method of mathematical induction. Firstly, we recall some inequalities frequently used in error analysis. The following interpolation inequalities and Agmon's inequality hold (cf. [2]):
The discrete version of Gronwall's inequality established in [21] is essential in error analysis.
Lemma 3.1 Let , and , for integers , and B
Numerical results
In this section, we perform numerical results to confirm our theoretical analysis. We solve (1.8)-(1.9) with artificial right-hand sides f and g, i.e., we solve the following MLL equations: where . Furthermore, we take the appropriate right-hand side functions f and g such that the exact solutions m and H to (4.1)-(4.2) are determined by It
Conclusions
In this paper, a linearized second-order BDF-2 time-discrete scheme for the approximations of the MLL equations (1.8)-(1.9). By a rigorous analysis, the second-order temporal convergence rate is derived for the magnetization and magnetic field in -norm and -norm, respectively. Numerical results in Section 4 also confirm our theoretical analysis. In future work, we will report the spatial error analysis for such BDF scheme and the key difficulty lies in the spatial convergence
Acknowledgements
This work was supported by National Natural Science Foundation of China (No. 11771337).
References (27)
An efficient multigrid preconditioner for Maxwell's equations in micromagnetism
Math. Comput. Simul.
(2010)Convergence result for the constraint preserving mid-point scheme for micromagnetism
J. Comput. Appl. Math.
(2009)- et al.
A convergent finite element approximation for the quasi-static Maxwell-Landau-Lifshitz-Gilbert equations
Comput. Math. Appl.
(2013) - et al.
Spin-polarized transport in ferromagnetic multilayers: an unconditionally convergent FEM integrator
Comput. Math. Appl.
(2015) - et al.
Sobolev Spaces
(2009) - et al.
Higher-order linearly implicit full discretization of the Landau-Lifshitz-Gilbert equation
Math. Comput.
(2021) - et al.
Convergence of a finite element discretization for the Landau–Lifshitz equations in micromagnetism
Math. Models Methods Appl. Sci.
(2006) Optimal error estimates of linearized Crank–Nicolson Galerkin method for Landau–Lifshitz equation
J. Sci. Comput.
(2016)- et al.
Optimal error analysis of Euler and Crank-Nicolson projection schemes for Landau-Lifshitz equation
SIAM J. Numer. Anal.
(2021) - et al.
Analysis of projection FEM for the Landau-Lifshitz equation
IMA J. Numer. Anal.
(2021)