COMP-PHDec 14, 2018Code
Computational micromagnetics with CommicsCarl-Martin Pfeiler, Michele Ruggeri, Bernhard Stiftner et al.
We present our open-source Python module Commics for the study of the magnetization dynamics in ferromagnetic materials via micromagnetic simulations. It implements state-of-the-art unconditionally convergent finite element methods for the numerical integration of the Landau-Lifshitz-Gilbert equation. The implementation is based on the multiphysics finite element software Netgen/NGSolve. The simulation scripts are written in Python, which leads to very readable code and direct access to extensive post-processing. Together with documentation and example scripts, the code is freely available on GitLab.
COMP-PHSep 30, 2011
Fast stray field computation on tensor gridsLukas Exl, Winfried Auzinger, Simon Bance et al.
A direct integration algorithm is described to compute the magnetostatic field and energy for given magnetization distributions on not necessarily uniform tensor grids. We use an analytically-based tensor approximation approach for function-related tensors, which reduces calculations to multilinear algebra operations. The algorithm scales with N^(4/3) for N computational cells used and with N^(2/3) (sublinear) when magnetization is given in canonical tensor format. In the final section we confirm our theoretical results concerning computing times and accuracy by means of numerical examples.
COMP-PHDec 14, 2012
FFT-based Kronecker product approximation to micromagnetic long-range interactionsLukas Exl, Claas Abert, Norbert J. Mauser et al.
We derive a Kronecker product approximation for the micromagnetic long range interactions in a collocation framework by means of separable sinc quadrature. Evaluation of this operator for structured tensors (Canonical format, Tucker format, Tensor Trains) scales below linear in the volume size. Based on efficient usage of FFT for structured tensors, we are able to accelerate computations to quasi linear complexity in the number of collocation points used in one dimension. Quadratic convergence of the underlying collocation scheme as well as exponential convergence in the separation rank of the approximations is proved. Numerical experiments on accuracy and complexity confirm the theoretical results.
COMP-PHJan 19, 2015
Accurate and efficient computation of nonlocal potentials based on Gaussian-sum approximationLukas Exl, Norbert J. Mauser, Yong Zhang
We introduce an accurate and efficient method for a class of nonlocal potential evaluations with free boundary condition, including the 3D/2D Coulomb, 2D Poisson and 3D dipolar potentials. Our method is based on a Gaussian-sum approximation of the singular convolution kernel and Taylor expansion of the density. Starting from the convolution formulation, for smooth and fast decaying densities, we make a full use of the Fourier pseudospectral (plane wave) approximation of the density and a separable Gaussian-sum approximation of the kernel in an interval where the singularity (the origin) is excluded. Hence, the potential is separated into a regular integral and a near-field singular correction integral, where the first integral is computed with the Fourier pseudospectral method and the latter singular one can be well resolved utilizing a low-order Taylor expansion of the density. Both evaluations can be accelerated by fast Fourier transforms (FFT). The new method is accurate (14-16 digits), efficient ($O(N \log N)$ complexity), low in storage, easily adaptable to other different kernels, applicable for anisotropic densities and highly parallelable.
COMP-PHJul 23, 2018
A magnetostatic energy formula arising from the $L^2$-orthogonal decomposition of the stray fieldLukas Exl
A formula for the magnetostatic energy of a finite magnet is proven. In contrast to common approaches, the new energy identity does not rely on evaluation of a nonlocal boundary integral inside the magnet or the solution of an equivalent Dirichlet problem. The formula is therefore computationally efficient, which is also shown numerically. Algorithms for the simulation of magnetic materials could benefit from incorporating the presented representation of the energy. In addition, a natural analogue for the energy via the magnetic induction is given. Proofs are carried out within a setting which is suitable for common discretizations in computational micromagnetics.
LGApr 6, 2021
Conditional physics informed neural networksAlexander Kovacs, Lukas Exl, Alexander Kornell et al.
We introduce conditional PINNs (physics informed neural networks) for estimating the solution of classes of eigenvalue problems. The concept of PINNs is expanded to learn not only the solution of one particular differential equation but the solutions to a class of problems. We demonstrate this idea by estimating the coercive field of permanent magnets which depends on the width and strength of local defects. When the neural network incorporates the physics of magnetization reversal, training can be achieved in an unsupervised way. There is no need to generate labeled training data. The presented test cases have been rigorously studied in the past. Thus, a detailed and easy comparison with analytical solutions is made. We show that a single deep neural network can learn the solution of partial differential equations for an entire class of problems.