arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1109.5878physics.comp-phcs.NAmath.NA
收藏

张量网格上的快速杂散场计算

Fast stray field computation on tensor grids

University of Applied Sciences(应用科学大学);Department of Technology(技术系);Vienna University of Technology(维也纳工业大学);Institute for Analysis and Scientific Computing(分析与科学计算研究所)

Lukas Exl, Winfried Auzinger, Simon Bance, Markus Gusenbauer, Franz Reichel, Thomas Schrefl

AI总结:

提出一种直接积分算法,利用基于解析的张量逼近方法,在非均匀张量网格上高效计算磁化分布产生的静磁场和能量,计算复杂度为N^(4/3),当磁化以规范张量格式给出时复杂度为N^(2/3)。

摘要:

描述了一种直接积分算法,用于在不一定均匀的张量网格上计算给定磁化分布的静磁场和能量。我们使用基于解析的张量逼近方法处理与函数相关的张量,将计算简化为多重线性代数运算。该算法对于N个计算单元的计算复杂度为N^(4/3),当磁化以规范张量格式给出时复杂度为N^(2/3)(次线性)。在最后一节中,我们通过数值例子验证了关于计算时间和精度的理论结果。

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑