4.7 Article

Fast stray field computation on tensor grids

Journal

JOURNAL OF COMPUTATIONAL PHYSICS
Volume 231, Issue 7, Pages 2840-2850

Publisher

ACADEMIC PRESS INC ELSEVIER SCIENCE
DOI: 10.1016/j.jcp.2011.12.030

Keywords

Micromagnetics; Stray field; Tensor grids; Low-rank; Canonical format; Tucker tensor

Funding

  1. Austrian Science Fund (FWF) [SFB-ViCoM F41]

Ask authors/readers for more resources

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.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.7
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available