A new treecode for long-range force calculation
- Authors
- Ahn, Cheol-O; Lee, Sang Hwan
- Issue Date
- Jan-2008
- Publisher
- ELSEVIER SCIENCE BV
- Keywords
- tree data structure; treecode; octtree; long-range force
- Citation
- COMPUTER PHYSICS COMMUNICATIONS, v.178, no.2, pp.121 - 127
- Indexed
- SCIE
SCOPUS
- Journal Title
- COMPUTER PHYSICS COMMUNICATIONS
- Volume
- 178
- Number
- 2
- Start Page
- 121
- End Page
- 127
- URI
- https://scholarworks.bwise.kr/hanyang/handle/2021.sw.hanyang/172184
- DOI
- 10.1016/j.cpc.2007.08.006
- ISSN
- 0010-4655
- Abstract
- We propose a new hierarchical tree algorithm with high adaptivity to various particle distributions for long-range force calculations. This algorithm divides parent cells into k daughter cells using the k-means algorithm. The tree structure provided by this algorithm is independent of the coordinate system used. This method also includes a unique procedure for determining cell sizes adjusted to particle distributions. We investigated the characteristics of the tree structure and the effect on the long-range force calculation performance of various branching ratios k. The results of numerical experiments using various particle distributions showed that the number of interactions between particles and cells grows with k, but the number of distance evaluations between particles and cells decreased when k is around 5. We can therefore select an optimized value of k according to the characteristics of the problem to be analyzed. Comparing the algorithm to Barnes-Hut treecode using gravitational calculations at the same error level, we found that the calculation cost could be decreased remarkably.
- Files in This Item
-
Go to Link
- Appears in
Collections - 서울 공과대학 > 서울 기계공학부 > 1. Journal Articles
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.