.png){kind=icon}
返回
A Cartesian treecode for screened coulomb interactions
.png){kind=icon}
PRE
AI
DOI：10.1016/j.jcp.2009.02.022.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
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.
Keyword:
Screened coulomb potential
Yukawa potential
Cartesian treecode
Particle-cluster interaction
Recurrence relations
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.8
论文数:
1.6W
被引数:
7.4W
机构
引用论文
.png){kind=icon}
分享收藏
查看更多内容