Numerical Methods for the Stray-Field Calculation: A Comparison of recently developed Algorithms

Abstract

Different numerical approaches for the stray-field calculation in the context of micromagnetic simulations are investigated. We compare finite difference based fast Fourier transform methods, tensor grid methods and the finite-element method with shell transformation in terms of computational complexity, storage requirements and accuracy tested on several benchmark problems. These methods can be subdivided into integral methods (fast Fourier transform methods, tensor-grid method) which solve the stray field directly and in differential equation methods (finite-element method), which compute the stray field as the solution of a partial differential equation. It turns out that for cuboid structures the integral methods, which work on cuboid grids (fast Fourier transform methods and tensor grid methods) outperform the finite-element method in terms of the ratio of computational effort to accuracy. Among these three methods the tensor grid method is the fastest. However, the use of the tensor grid method in the context of full micromagnetic codes is not well investigated yet. The finite-element method performs best for computations on curved structures.

References in corpus (1)

• Fast stray field computation on tensor grids

Cited by in corpus (24)

• Micromagnetics and spintronics: Models and numerical methods
• 3D Printing of Polymer Bonded Rare-Earth Magnets With a Variable Magnetic Compound Density for a Predefined Stray Field
• magnum.fe: A micromagnetic finite-element simulation code based on FEniCS
• Boris Computational Spintronics -- High Performance Multi-Mesh Magnetic and Spin Transport Modelling Software
• Polymer-bonded anisotropic SrFe${}_{\text{12}}$O${}_{\text{19}}$ filaments for fused filament fabrication
• MagTense: a micromagnetic framework using the analytical demagnetization tensor
• Linear second-order IMEX-type integrator for the (eddy current) Landau-Lifshitz-Gilbert equation
• The mimetic finite difference method for the Landau-Lifshitz equation
• A fast finite-difference algorithm for topology optimization of permanent magnets
• An O(N) and parallel approach to integral problems by a kernel-independent fast multipole method: Application to polarization and magnetization of interacting particles
• Non-uniform FFT for the finite element computation of the micromagnetic scalar potential
• Computational micromagnetics with Commics
• Physics-informed machine learning and stray field computation with application to micromagnetic energy minimization
• Machine learning methods for the prediction of micromagnetic magnetization dynamics
• Highly Parallel Demagnetization Field Calculation Using the Fast Multipole Method on Tetrahedral Meshes with Continuous Sources
• Learning time-stepping by nonlinear dimensionality reduction to predict magnetization dynamics
• Prediction of magnetization dynamics in a reduced dimensional feature space setting utilizing a low-rank kernel method
• The extrapolated explicit midpoint scheme for variable order and step size controlled integration of the Landau-Lifschitz-Gilbert equation
• A magnetostatic energy formula arising from the $L^2$-orthogonal decomposition of the stray field
• A Gauss-Seidel projection method with the minimal number of updates for stray field in micromagnetic simulations
• Topology optimization of permanent magnets for stellarators
• A framework for the automation of generalised stability theory
• Higher order stray field computation on tensor product domains
• Efficient computation of demagnetising fields for magnetic multilayers using multilayered convolution