Fast stray field computation on tensor grids
arXiv:1109.5878 · doi:10.1016/j.jcp.2011.12.030
Abstract
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.
16 pages, 1 figure, submitted to the Journal of Computational Physics
Cited by in corpus (13)
- Micromagnetics and spintronics: Models and numerical methods
- magnum.fe: A micromagnetic finite-element simulation code based on FEniCS
- Numerical Methods for the Stray-Field Calculation: A Comparison of recently developed Algorithms
- MagTense: a micromagnetic framework using the analytical demagnetization tensor
- Accurate and efficient computation of nonlocal potentials based on Gaussian-sum approximation
- The mimetic finite difference method for the Landau-Lifshitz equation
- Non-uniform FFT for the finite element computation of the micromagnetic scalar potential
- Hybrid FFT algorithm for fast demagnetization field calculations on non-equidistant magnetic layers
- Highly Parallel Demagnetization Field Calculation Using the Fast Multipole Method on Tetrahedral Meshes with Continuous Sources
- FFT-based Kronecker product approximation to micromagnetic long-range interactions
- The extrapolated explicit midpoint scheme for variable order and step size controlled integration of the Landau-Lifschitz-Gilbert equation
- Efficient computation of demagnetising fields for magnetic multilayers using multilayered convolution
- Higher order stray field computation on tensor product domains