Analysis of an efficient algorithm for the hard-sphere problem

DOI10.1145/235025.235030zbMath0885.68076OpenAlexW1980849854MaRDI QIDQ4369952

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)

Related Items (5)

COLLISION DETECTION OPTIMIZATION IN A MULTI-PARTICLE SYSTEM ⋮ A complexity O(1) priority queue for event driven molecular dynamics simulations ⋮ A GENERALIZED CELL METHOD FOR HARD DISK MOLECULAR DYNAMICS SIMULATION OF POLYDISPERSE SYSTEMS ⋮ Parallel discrete molecular dynamics simulation with speculation and in-order commitment ⋮ Neighbor list collision-driven molecular dynamics simulation for nonspherical hard particles. I: Algorithmic details

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