.png){kind=icon}
.png){kind=icon}
Return
Fast stray field computation on tensor grids
.png){kind=icon}
OA
AI
DOI：10.1016/j.jcp.2011.12.030.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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. (C) 2012 Elsevier Inc. All rights reserved.
Keywords:
Micromagnetics
Stray field
Tensor grids
Low-rank
Canonical format
Tucker tensor
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
3.8
Papers:
1.5W
Citations:
7.4W