Efficient implementation of the Barnes-Hut octree algorithm for Monte Carlo simulations of charged systems (Q477104): Difference between revisions

From MaRDI portal
Changed an Item
Importer (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3100051489 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1305.1825 / rank
 
Normal rank

Latest revision as of 15:07, 18 April 2024

scientific article
Language Label Description Also known as
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
    0 references
    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
    0 references
    0 references
    0 references
    0 references
    0 references
    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 references
    0 references