Efficient implementation of the Barnes-Hut octree algorithm for Monte Carlo simulations of charged systems
- 243 Downloads
Computer simulation with Monte Carlo is an important tool to investigate the function and equilibrium properties of many biological and soft matter materials solvable in solvents. The appropriate treatment of long-range electrostatic interaction is essential for these charged systems, but remains a challenging problem for large-scale simulations. We have developed an efficient Barnes-Hut treecode algorithm for electrostatic evaluation in Monte Carlo simulations of Coulomb many-body systems. The algorithm is based on a divideand-conquer strategy and fast update of the octree data structure in each trial move through a local adjustment procedure. We test the accuracy of the tree algorithm, and use it to perform computer simulations of electric double layer near a spherical interface. It has been shown that the computational cost of the Monte Carlo method with treecode acceleration scales as log N in each move. For a typical system with ten thousand particles, by using the new algorithm, the speed has been improved by two orders of magnitude from the direct summation.
Keywordselectrostatics Monte Carlo fast algorithms octree colloidal interfaces
MSC(2010)41A58 82D15 68P05
Unable to display preview. Download preview PDF.
- 1.Allen M P, Tildesley D J. Computer Simulations of Liquids. Oxford: Oxford University Press, 1987Google Scholar
- 12.Frenkel D, Smit B. Understanding Molecular Simulation: From Algorithms to Applications. New York: Academic Press, 2002Google Scholar
- 20.Kabadshow I, Dachsel H. The error-controlled fast multipole method for open and periodic boundary conditions. In: Fast Methods for Long-Range Interactions in Complex Systems, vol. 6. Jülich: Forschungszentrum Jülich, 2011, 85–114Google Scholar