Fast stray field computation on tensor grids
Computational Physics
2012-03-21 v2 Numerical Analysis
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.
Cite
@article{arxiv.1109.5878,
title = {Fast stray field computation on tensor grids},
author = {Lukas Exl and Winfried Auzinger and Simon Bance and Markus Gusenbauer and Franz Reichel and Thomas Schrefl},
journal= {arXiv preprint arXiv:1109.5878},
year = {2012}
}
Comments
16 pages, 1 figure, submitted to the Journal of Computational Physics