Efficient implementation of the Barnes-Hut octree algorithm for Monte Carlo simulations of charged systems
From MaRDI portal
Publication:477104
Abstract: Computer simulation with Monte Carlo is an important tool to investigate the function and equilibrium properties of many systems with 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 divide-and-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 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.
Recommendations
- A Cartesian treecode for screened Coulomb interactions
- A treecode algorithm for simulating electron dynamics in a Penning-Malmberg trap
- DEM simulations of toner particles with an \(O(N \log N)\) hierarchical tree code algorithm
- A modified tree code: Don't laugh; it runs
- Treecode algorithms for computing nonbonded particle interactions
Cites work
- scientific article; zbMATH DE number 41859 (Why is no real title available?)
- scientific article; zbMATH DE number 46777 (Why is no real title available?)
- scientific article; zbMATH DE number 1069612 (Why is no real title available?)
- scientific article; zbMATH DE number 1082719 (Why is no real title available?)
- A Cartesian treecode for screened Coulomb interactions
- A fast adaptive multipole algorithm in three dimensions
- A fast algorithm for particle simulations
- A kernel-independent adaptive fast multipole algorithm in two and three dimensions
- A particle method and adaptive treecode for vortex sheet motion in three-dimensional flow
- A pedestrian introduction to fast multipole methods
- A treecode-accelerated boundary integral Poisson-Boltzmann solver for electrostatics of solvated biomolecules
- Equation of state calculations by fast computing machines
- Fast analytical methods for macroscopic electrostatic models in biomolecular simulations
- Mellin transform and image charge method for dielectric sphere in an electrolyte
- \(K\)-means clustering for optimal partitioning and dynamic load balancing of parallel hierarchical \(N\)-body simulations
- tabipb
Cited in
(5)- Fast updating multipole coulombic potential calculation
- A new algorithm for electrostatic interactions in Monte Carlo simulations of charged particles
- Comparison of efficient techniques for the simulation of dielectric objects in electrolytes
- A GPU-based large-scale Monte Carlo simulation method for systems with long-range interactions
- Effective computer simulation of strongly coupled Coulomb fluids
This page was built for publication: Efficient implementation of the Barnes-Hut octree algorithm for Monte Carlo simulations of charged systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q477104)
