A Complexity O(1) Priority Queue for Event Driven Molecular Dynamics Simulations
arXiv:physics/0606226 · doi:10.1016/j.jcp.2006.06.042
Abstract
We propose and implement a priority queue suitable for use in event driven molecular dynamics simulations. All operations on the queue take on average O(1) time per collision. In comparison, previously studied queues for event driven molecular dynamics simulations require O(log ) time per collision for systems of particles.
Accepted for publication in Journal of Computational Physics
References in corpus (1)
Cited by in corpus (12)
- Event-chain Monte Carlo algorithms for hard-sphere systems
- DynamO: A free O(N) general event-driven molecular-dynamics simulator
- Colloidal Hard Spheres: Triumphs, Challenges and Mysteries
- Complex Crystals from Size-disperse Spheres
- Stable algorithm for event detection in event-driven particle dynamics
- Event-Driven Dynamics of Rigid Bodies Interacting via Discretized Potentials
- Velocity and energy distributions in microcanonical ensembles of hard spheres
- Structure and stability of helices in square-well homopolymers
- Transport properties of highly asymmetric hard sphere mixtures
- Optimizing Event-Driven Simulations
- Modelling inelastic granular media using Dynamical Density Functional Theory
- An Efficient Implementation of the Robust Tabu Search Heuristic for Sparse Quadratic Assignment Problems