Fast stray field computation on tensor grids

Details Fast stray field computation on tensor grids Fast stray field computation on tensor grids

2011-09-27

arxiv.org/abs/1109.5878v2

J. Comput. Phys. 231 (2012) 2840-2850

Physics

Computational Physics

16 pages, 1 figure, submitted to the Journal of Computational Physics

Scientific paper

10.1016/j.jcp.2011.12.030

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.

Affiliated with

Also associated with

No associations

Rating

Fast stray field computation on tensor grids does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Fast stray field computation on tensor grids, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Fast stray field computation on tensor grids will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-62849