Adaptive spatial decomposition in fast multipole method
Adaptive spatial decomposition in fast multipole method
复制标题
DOI：
10.1016/j.jcp.2007.03.032
复制
发表时间：
2007-09
期刊：
影响因子：
--
通讯作者：
Jianming Zhang;Masataka Tanaka
中科院分区：
文献类型：
--
作者：
Jianming Zhang;Masataka Tanaka
这项工作提出了一种用于快速多极子方法的新的自适应节点簇算法。在算法中，我们使用矩形框而不是立方体，根据框的形状细分框，并在每个细分步骤收紧子框。更重要的是，我们根据两个交互框之间的距离确定多极到局部平移中扩展项的数量。我们的方法使用三维潜在问题的基准示例进行了测试。得到的结果表明，新算法可以在大约20分钟内解决10万个节点的问题，并且运行速度比标准算法快近3倍。该算法特别适合处理细长和壳状结构。
This work presents a new adaptive node-cluster algorithm for fast multipole method. In the algorithm, we use rectangular boxes instead of cubes, subdivide a box based on its shape, and tighten the child boxes at each subdivision step. More importantly, we determine the number of expansion terms in multipole to local translations according to the distance between the two interaction boxes. Our method is tested using benchmark examples for three-dimensional potential problems. The results obtained show that the new algorithm can solve a problem with 100 thousands nodes in about 20min, and runs nearly three times faster than the standard algorithm. The proposed algorithm is especially suitable for treating slender and shell-like structures.