🔢 mathematics

A priori error analysis of a mass-lumped midpoint finite element method with a structure-preserving solver for the Landau--Lifshitz--Gilbert equation with Dzyaloshinskii--Moriya interaction

This paper presents an a priori error analysis for a mass-lumped midpoint finite element method combined with a structure-preserving fixed-point solver for the Landau–Lifshitz–Gilbert equation with Dzyaloshinskii–Moriya interaction, proving optimal first-order spatial and second-order temporal convergence while exactly preserving the nodal unit-length constraint and discrete energy law.

Original authors: Agus L. Soenjaya

Published 2026-06-16

📖 5 min read🧠 Deep dive

CC BY 4.0

Original authors: Agus L. Soenjaya

Original paper licensed under CC BY 4.0 (http://creativecommons.org/licenses/by/4.0/). ✨ This is an AI-generated explanation of the paper below. It is not written or endorsed by the authors. For technical accuracy, refer to the original paper. Read full disclaimer

The Big Picture: Simulating Tiny Magnets

Imagine a piece of metal, like a fridge magnet. Inside, it's made of billions of tiny atomic magnets (spins) all pointing in specific directions. When you heat the metal up too much, these spins get chaotic. But if it's cold enough, they line up and create a magnetic field.

Scientists use a complex math equation called the Landau–Lifshitz–Gilbert (LLG) equation to predict how these tiny magnets move and change direction over time. This is crucial for designing better hard drives, sensors, and future computers.

However, there's a catch: these tiny magnets are like rigid arrows. No matter how they spin, they must always stay the same length (they can't stretch or shrink). In the real world, this is a law of physics. In computer simulations, keeping this "rigid length" rule is incredibly difficult. If the computer makes a tiny mistake, the arrow might stretch, and the whole simulation falls apart.

The New Ingredient: The "Twist" (DMI)

Most simulations only look at magnets that want to line up straight with their neighbors. But in some special materials (called chiral magnetic materials), there is a hidden force called Dzyaloshinskii–Moriya Interaction (DMI).

Think of DMI as a twist. Instead of neighbors wanting to point in the exact same direction, they want to twist slightly relative to each other. This creates cool, swirling patterns called skyrmions (which look like tiny magnetic tornadoes). These are very promising for storing data in the future.

The problem is that adding this "twist" makes the math even harder to solve on a computer, especially when you also have to keep the magnets from stretching.

The Solution: A "Midpoint" Strategy with a Safety Net

The author of this paper, Agus L. Soenjaya, developed a new way to simulate these magnets on a computer. Here is how it works, broken down simply:

1. The "Midpoint" Trick
Imagine you are walking from point A to point B.

Old way: You guess where you will be at the end, check if you made a mistake, and correct it. This often leads to errors piling up.
This paper's way (Midpoint): You look at the exact middle of your step. You calculate the forces acting on you right there in the middle. This is much more accurate and stable. It's like balancing a broom on your hand by constantly adjusting based on the center of gravity rather than waiting until it falls.

2. The "Mass-Lumping" Shortcut
To make the math fast enough for computers, the author uses a technique called "mass-lumping."

Analogy: Imagine a smooth, heavy blanket (the real magnet). Calculating the weight of every single thread is slow. "Mass-lumping" is like cutting the blanket into squares and putting a single heavy weight in the center of each square. It's an approximation, but it makes the math much faster while keeping the results accurate enough.

3. The "Structure-Preserving" Solver
Because the "Midpoint" method is so accurate, it creates a very tricky math puzzle (a nonlinear system) that the computer has to solve at every single step.

The Problem: If you use a standard computer solver to solve this puzzle, it might accidentally stretch the magnet arrows, breaking the physical laws.
The Fix: The author invented a special "fixed-point iteration" (a step-by-step guessing game). This solver is designed with a safety guardrail. No matter how many times it guesses, it forces the magnet arrows to stay exactly the right length at every single step. It's like a dance instructor who corrects your posture instantly so you never lose your balance.

What Did They Prove?

The paper isn't just about writing code; it's about proving that this code works mathematically.

Accuracy: They proved that as you make the computer grid smaller and the time steps shorter, the simulation gets closer to the real physics at a predictable speed (first-order in space, second-order in time).
Robustness: They proved that even if the computer solver stops early (because it's "good enough" rather than perfect), the simulation is still accurate, provided the solver doesn't get too lazy.
Firsts: This is the first time anyone has proven these specific error rates for this type of method when the "twist" (DMI) is included. Previously, this was only known for simpler magnets without the twist.

The Experiments

The author ran several tests to show the method works:

Convergence: They showed that the math gets more accurate exactly as predicted by their theory.
Skyrmion Survival: They simulated a magnetic tornado (skyrmion). The method kept the tornado spinning and intact without the magnets stretching or the energy behaving weirdly.
The "Bubbling" Test: They simulated a scenario where a magnetic bubble tries to collapse. They found that the "twist" (DMI) acts like a brake or an accelerator depending on its direction. If the twist matches the bubble's spin, it helps it relax; if it opposes it, the bubble gets squeezed tighter.

Summary

In short, this paper presents a new, highly accurate, and stable way to simulate magnetic materials that have a "twist" in them. It solves the difficult problem of keeping the magnets from stretching during the simulation, ensuring that the computer model respects the laws of physics while being fast enough to be useful. It provides a mathematical guarantee that the results are trustworthy.

Technical Summary: A Priori Error Analysis of a Mass-Lumped Midpoint Finite Element Method for the LLG Equation with DMI

1. Problem Statement
The paper addresses the numerical approximation of the Landau–Lifshitz–Gilbert (LLG) equation governing magnetisation dynamics in ferromagnetic materials at temperatures below the Curie point. Specifically, the study focuses on the inclusion of the bulk Dzyaloshinskii–Moriya interaction (DMI), which introduces a first-order term to the effective field and induces a natural chiral boundary condition. The primary mathematical challenges are the pointwise unit-length constraint ( $|m|=1$ ), the non-convex geometry of the solution space, and the strongly nonlinear structure of the equation. While the exchange-only model has been extensively studied, the inclusion of DMI modifies the variational structure and boundary behavior, making the construction of stable, accurate, and structure-preserving finite element schemes particularly delicate.

2. Methodology
The authors propose and analyze a fully discrete, mass-lumped midpoint finite element scheme. The methodology involves the following components:

Discretization: The spatial domain is discretized using lowest-order conforming Lagrange finite elements ( $P_1$ ). The time integration employs the implicit midpoint rule.
Mass-Lumping: A reduced-integration (mass-lumped) inner product is utilized. This technique is crucial as it allows the nodal unit-length constraint to be enforced exactly at every node, a property that standard $L^2$ -inner products often fail to preserve in nonlinear schemes.
Effective Field Operator: The discrete effective field incorporates both the exchange stiffness and the bulk DMI. The DMI term is handled via a discrete bilinear form that respects the chiral boundary condition naturally. To facilitate the analysis, a shifted effective field operator is introduced to ensure uniform coercivity of the discrete bilinear form.
Solver Strategy: Since the midpoint scheme results in a nonlinear algebraic system at each time step, the paper proposes a structure-preserving fixed-point iteration. Unlike generic solvers, this iteration is designed to preserve the nodal unit-length constraint at every iterate.
Error Analysis Framework: The analysis compares the numerical solution against the elliptic projection of the exact solution. The proof relies on geometric cancellations inherent to the midpoint method, careful estimation of the first-order DMI contribution, and stability estimates derived from a discrete energy law.

3. Key Contributions
The paper makes three primary contributions to the literature on computational micromagnetics:

Formulation and Stability: The authors formulate a fully discrete mass-lumped midpoint scheme for the LLG equation with exchange and bulk DMI. They prove that this scheme exactly preserves the nodal unit-length constraint and satisfies a discrete energy identity, providing a foundation for stability without requiring geometric mesh restrictions (such as acute angles) or strict CFL-type conditions often found in other structure-preserving methods.
Optimal A Priori Error Estimates (Ideal Scheme): Under suitable regularity assumptions on the exact solution, the paper proves an optimal-order convergence estimate for the ideal scheme (assuming exact solution of the nonlinear system). The error converges with order $O(h + k^2)$ in the energy norm ( $H^1$ ), representing first-order accuracy in space and second-order in time. To the authors' knowledge, this is the first such a priori error estimate for the mass-lumped midpoint method, even in the absence of DMI.
Analysis of Inexact Solvers: Recognizing that the nonlinear system must be solved iteratively in practice, the paper analyzes the impact of solver errors. It proves that if the fixed-point iteration is terminated based on a specific residual stopping criterion, the resulting inexact scheme retains the same convergence rate as the ideal scheme, provided the solver tolerance is sufficiently small relative to the discretization parameters.

4. Results

Theoretical Bounds: The main theoretical result (Theorem 3.7 and Theorem 4.8) establishes that the error in the energy norm is bounded by $C(h + k^2)$ plus a term dependent on the solver tolerance. Specifically, for a uniform solver tolerance $\varepsilon_{fp}$ , the condition $\varepsilon_{fp} = O(h)$ is sufficient to maintain the optimal convergence rate.
Numerical Experiments:
- Convergence Rates: Numerical tests on a smooth solution confirm the theoretical convergence rates: approximately first-order in $H^1$ and second-order in $L^2$ for spatial refinement, and second-order for temporal refinement.
- Solver Tolerance: Experiments varying the fixed-point tolerance demonstrate that the error scales linearly with $\varepsilon_{fp}/h$ , validating the theoretical prediction regarding solver-induced errors.
- Structure Preservation: Simulations involving a Bloch-type skyrmion and a high-gradient "bubbling" experiment confirm that the method preserves the nodal unit-length constraint up to machine precision and correctly captures the dissipative energy behavior.
- DMI Effects: The experiments illustrate the asymmetric influence of the DMI sign ( $\kappa_d$ ) on the dynamics. Negative $\kappa_d$ accelerates gradient concentration (bubble formation), while positive $\kappa_d$ tends to suppress concentration and promote relaxation, consistent with the chiral nature of the interaction.

5. Significance and Claims
The paper claims to provide the first rigorous a priori error analysis for the mass-lumped midpoint finite element method applied to the LLG equation with bulk DMI. Its significance lies in bridging the gap between the known stability properties of this method (exact constraint preservation and energy dissipation) and quantitative convergence rates.

The authors emphasize that their analysis does not rely on restrictive mesh conditions (e.g., angle conditions) or stringent time-step constraints that often plague other structure-preserving schemes. Furthermore, by proving that the practical inexact solver does not degrade the convergence rate, the work provides a rigorous justification for the use of this computationally efficient, structure-preserving algorithm in simulating complex chiral magnetic phenomena such as skyrmions. The results support the method's robustness in handling the delicate interplay between exchange, DMI, and chiral boundary conditions.