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.
[1]
Michael S. Warren,et al.
Skeletons from the treecode closet
,
1994
.
[2]
Piet Hut,et al.
A hierarchical O(N log N) force-calculation algorithm
,
1986,
Nature.
[3]
John F. Wallin,et al.
A Performance Comparison of Tree Data Structures for N-Body Simulation
,
2002
.
[4]
David H. Porter,et al.
A tree code with logarithmic reduction of force terms, hierarchical regularization of all variables, and explicit accuracy controls
,
1989
.
[5]
William H. Press,et al.
Dynamic mass exchange in doubly degenerate binaries I
,
1990
.
[6]
Grégoire Winckelmans,et al.
Contributions to vortex particle methods for the computation of three-dimensional incompressible unsteady flows
,
1993
.
[7]
Junichiro Makino.
Comparison of two different tree algorithms
,
1990
.
[8]
Pangfeng Liu,et al.
Experiences with Parallel N-Body Simulation
,
2000,
IEEE Trans. Parallel Distributed Syst..
[9]
John Dubinski.
A parallel tree code
,
1996
.