Analysis of an efficient algorithm for the hard-sphere problem

DOI10.1145/235025.235030MaRDI QIDQ4369952zbMATH OpenOpenAlexFDO

Authors Alan T. Krantz

Publication date 14 January 1998

Published in ACM Transactions on Modeling and Computer Simulation (Search for Journal in Brave)

Full work available at URL http://www.acm.org/pubs/contents/journals/tomacs/

zbMATH Keywords

simulations of hard-sphere systems

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10)

Recommendations

• Cluster algorithm for hard spheres and related systems
• On a modification of the molecular dynamics method
• Parallelized event chain algorithm for dense hard sphere and polymer systems
• Algorithms for particle-field simulations with collisions
• Event-driven molecular dynamics in parallel.

Cited in

(8)

• A nonsmooth program for jamming hard spheres
• Hard sphere simulation by event-driven molecular dynamics: breakthrough, numerical difficulty, and overcoming the issues
• Neighbor list collision-driven molecular dynamics simulation for nonspherical hard particles. I: Algorithmic details
• A GENERALIZED CELL METHOD FOR HARD DISK MOLECULAR DYNAMICS SIMULATION OF POLYDISPERSE SYSTEMS
• A complexity O(1) priority queue for event driven molecular dynamics simulations
• COLLISION DETECTION OPTIMIZATION IN A MULTI-PARTICLE SYSTEM
• Parallel discrete molecular dynamics simulation with speculation and in-order commitment
• Cluster algorithm for hard spheres and related systems

This page was built for publication: Analysis of an efficient algorithm for the hard-sphere problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4369952)