Efficient implementation of the Barnes-Hut octree algorithm for Monte Carlo simulations of charged systems (Q477104)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Efficient implementation of the Barnes-Hut octree algorithm for Monte Carlo simulations of charged systems |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Efficient implementation of the Barnes-Hut octree algorithm for Monte Carlo simulations of charged systems |
scientific article |
Statements
Efficient implementation of the Barnes-Hut octree algorithm for Monte Carlo simulations of charged systems (English)
0 references
2 December 2014
0 references
The authors develop an efficient Barnes-Hut treecode algorithm for electrostatic evaluation in Monte Carlo simulations of Coulomb many-body systems. The proposed algorithm is based on a divide and conquer strategy and fast update of the octree data structure in each trial move through a local adjustment procedure. The accuracy of the tree algorithm is tested, and it is used to perform computer simulations of electric double layer near a spherical interface. The authors are able to show the computational cost of the Monte Carlo method with treecode acceleration scales as \(\log N \) in every move.
0 references
electrostatics
0 references
Monte Carlo
0 references
fast algorithms
0 references
octree
0 references
colloidal interfaces
0 references
0 references
0 references
0 references
0.7683654427528381
0 references
0.7571821808815002
0 references
0.7459735870361328
0 references
0.7312738299369812
0 references
0.7286839485168457
0 references