Simple recursive implementation of fast multipole method
Simple recursive implementation of fast multipole method
复制标题
快速多极子法的简单递归实现
DOI：
10.1016/j.jmmm.2009.09.033
复制
发表时间：
2010
影响因子：
2.7
通讯作者：
D. Apalkov
中科院分区：
文献类型：
--
作者：
P. Visscher;D. Apalkov
在本文中，我们提出了一个众所周知的“快速多极”方法（FMM）的实现，用于偶极子场的有效计算。当前实现的主要优点是简单——我们认为缺少fmm使用的一个主要原因是它们的复杂性。其中一个简化是在笛卡尔坐标中使用多项式而不是球谐函数。我们已经在任意的细胞分层系统中实现了它——不需要周期性网格，就像FFT（快速傅里叶变换）方法一样。实现是通过递归函数实现的。给出了在微磁仿真中的应用结果。本文提供了该方法的开源实现的完整源代码，以及生成的程序的安装程序。
In this paper we present an implementation of the well known “fast multipole” method (FMM) for the efficient calculation of dipole fields. The main advantage of the present implementation is simplicity—we believe that a major reason for the lack of use of FMMs is their complexity. One of the simplifications is the use of polynomials in the Cartesian coordinates rather than spherical harmonics. We have implemented it in the context of an arbitrary hierarchical system of cells—no periodic mesh is required, as it is for FFT (fast Fourier transform) methods. The implementation is in terms of recursive functions. Results are given for application to micromagnetic simulation. Complete source code is provided for an open-source implementation of this method, as well as an installer for the resulting program.