Canonical structure of the LLG equation for exponential updates in micromagnetism
Jörg Schröder, Maximilian Vorwerk
TL;DR
The paper addresses accurate and structure-preserving time integration for the Landau-Lifshitz-Gilbert equation in micromagnetism by deriving a canonical form ${\partial_t{\bm{m}} = {\bm{W}} \cdot {\bm{m}}}$ with a skew-symmetric generator ${\bm{W}}$. It develops an exponential update algorithm that computes ${\bm{m}}_{n+1} = \exp[{\bm{W}}^{\Delta t}_{n+1}] \cdot {\bm{m}}_n$ within SO(3), leveraging a closed-form representation ${\exp[{\bm{W}}^{\Delta t}]} = {\bf 1} + {\alpha_1}{\bm{W}}^{\Delta t} + {\alpha_2}({\bm{W}}^{\Delta t})^2$ and stable variants for small $w$. The work compares the exponential method to Backward Euler and Midpoint rules, showing superior unit-length preservation, rotation accuracy, and robustness to large time steps in representative micromagnetic tests based on realistic material parameters. This canonical, geometric approach enables efficient, structure-preserving simulations of magnetization dynamics with potential impact on large-scale micromagnetic modeling.
Abstract
In this contribution we propose an exponential update algorithm for magnetic moments appearing in the framework of micromagnetics and the Landau-Lifshitz-Gilbert (LLG) equation. This algorithm can be interpreted as the geometric integration on spheres, that a priori satisfy the unit length constraint of the normalized magnetization vector. Even though the geometric structures for this are obvious and some works already use an exponential algorithm, to the best of the authors' knowledge, there is no canonical structure of the LLG equation for the exponential update algorithm in micromagnetism. Tensor algebraic reformulations of the LLG equation allow the canonical representation of the evolution equation for the magnetization, which serves as the basis for different integrators. Based on the specific structure of the exponential of skew symmetric matrices an efficient update scheme is derived. The excellent performance of the proposed exponential update algorithm is demonstrated in representative examples.
