A Cartesian treecode for screened coulomb interactions
A Cartesian treecode for screened coulomb interactions
复制标题
DOI：
10.1016/j.jcp.2009.02.022
复制
发表时间：
2009-06-01
影响因子：
4.1
通讯作者：
Krasny, Robert
中科院分区：
文献类型：
--
作者：
Li, Peijun;Johnston, Hans;Krasny, Robert
提出了一种用于计算三维屏蔽库仑相互作用的带电粒子系统静电势的树形编码算法。该方法使用笛卡尔坐标下的Farfield Taylor展开来计算粒子-团簇相互作用。使用新的递推关系来计算泰勒系数，这种递推关系允许高效地计算高阶近似。考虑了两种类型的簇，均匀立方体和自适应矩形框。报告了树码误差、CPU时间和内存使用率，并与立方体内部、球体表面和8球体配置上随机分布的粒子的直接求和进行了比较。对于给定的泰勒近似阶，树编码CPU的时间尺度为O(N Log N)，内存使用量尺度为O(N)，其中N是粒子的数量。结果表明，树形编码非常适合于球体和8球体测试用例中的非均匀粒子分布。由爱思唯尔公司出版。
A treecode algorithm is presented for evaluating electrostatic potentials in a charged particle system undergoing screened Coulomb interactions in 3D. The method uses a farfield Taylor expansion in Cartesian coordinates to compute particle-cluster interactions. The Taylor coefficients are evaluated using new recurrence relations which permit efficient computation of high order approximations. Two types of clusters are considered, uniform cubes and adapted rectangular boxes. The treecode error, CPU time and memory usage are reported and compared with direct summation for randomly distributed particles inside a cube, on the surface of a sphere and on an 8-sphere configuration. For a given order of Taylor approximation, the treecode CPU time scales as O(N log N) and the memory usage scales as O(N), where N is the number of particles. Results show that the treecode is well suited for non-homogeneous particle distributions as in the sphere and 8-sphere test cases. Published by Elsevier Inc.