arXiv · 1109.5878
Fast stray field computation on tensor grids
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.
Explore related subjects
Keep this discovery
Lukas Exl, Winfried Auzinger, Simon Bance, Markus Gusenbauer, Franz Reichel, Thomas Schrefl. 2011-09-27. Fast stray field computation on tensor grids. https://doi.org/10.1016/j.jcp.2011.12.030
Cite the original work for its findings. Save a collection to share your selection of sources.