The Barnes–Hut simulation (Josh Barnes and Piet Hut) is an algorithm for performing an n-body simulation. It is notable for having order O(n log n) compared to a direct-sum algorithm which would be O(n2).
The simulation volume is usually divided up into cubic cells via an octree (in a three-dimensional space), so that only particles from nearby cells need to be treated individually, and particles in distant cells can be treated as a single large particle centered at the cell's center of mass (or as a low-order multipole expansion). This can dramatically reduce the number of particle pair interactions that must be computed.
The Barnes-Hut tree
In a two-dimensional n-body simulation, the Barnes-Hut algorithm recursively divides the n bodies into groups by storing them in a quad-tree. Each node in this tree represents a region of the two-dimensional space. The topmost node represents the whole space, and its four children represent the four quadrants of the space and each quadrant can again be divided into four quadrants. The space is recursively subdivided into quadrants until each subdivision contains 0 or 1 bodies (some regions do not have bodies in all of their quadrants). There are two types of nodes in the quad-tree: internal and external nodes. An external node has no children and is either empty or represents a single body. Each internal node represents the group of bodies beneath it, and stores the center of mass and the total mass of all its children bodies.
Calculating the force acting on a body
To calculate the net force on a particular body, the nodes of the tree are traversed, starting from the root. If the center of mass of an internal node is sufficiently far from the body, the bodies contained in that part of the tree are treated as a single body whose position and mass is respectively the center of mass and total mass of the internal node. If the internal node is not sufficiently far from the body, the process is repeated for each of its children.
Whether a node is or isn't sufficiently far away from a body, depends on the quotient s / d, where s is the width of the region represented by the internal node, and d is the distance between the body and the node’s center of mass. The node is sufficiently far away when this ratio is smaller than a threshold value θ. The parameter θ determines the accuracy of the simulation; larger values of θ increase the speed of the simulation but decreases its accuracy. If θ = 0, no internal node is treated as a single body and the algorithm degenerates to a direct-sum algorithm.
- J. Barnes and P. Hut (December 1986). "A hierarchical O(N log N) force-calculation algorithm". Nature 324 (4): 446–449. doi:10.1038/324446a0.
- J. Dubinski (October 1996). "A Parallel Tree Code". New Astronomy 1 (2): 133–147. doi:10.1016/S1384-1076(96)00009-7. arXiv:astro-ph/9603097v1.
- U. Becciani, R. Ansalonib, V. Antonuccio-Delogua, G. Erbaccic, M. Gamberaa, and A. Pagliarod (October 1997). "A parallel tree code for large N-body simulation: dynamic load balance and data distribution on a CRAY T3D system". Computer Physics Communications 106 (1–2): 105–113. doi:10.1016/S0010-4655(97)00102-1.
- T. Ventimiglia, and K. Wayne. "The Barnes-Hut Algorithm". Retrieved 30 March 2012.
- Treecodes, J. Barnes
- Parallel TreeCode
- PEPC - The Pretty Efficient Parallel Coulomb solver, an open-source parallel Barnes-Hut tree code with exchangeable interaction kernel for a multitude of applications