We develop simulation algorithms with superior performance:
An important task in the simulation of hard spheres and other hard particles is structure prediction via equilibration. Event-driven molecular dynamics is efficient because its Newtonian dynamics equilibrates fluctuations with the speed of sound. Monte Carlo simulation is efficient if performed with correlated position updates in event chains. We combined the core concepts of molecular dynamics and event chains into a new algorithm involving Newtonian event chains (NEC). NEC scale well to large systems and can be extended to anisotropic hard particles without approximations. NEC is currently the fastest available hard particle simulation algorithm.
- Efficient Equilibration of Hard Spheres with Newtonian Event Chains
M. Klement, M. Engel
Journal of Chemical Physics 150, 174108 (2019)
Large-scale parallel Monte Carlo simulations
Current trends in parallel processors call for the design of efficient massively parallel algorithms for scientific computing. Parallel algorithms for Monte Carlo simulations of thermodynamic ensembles of particles have received little attention because of the inherent serial nature of the statistical sampling. With Joshua Anderson we devised a massively parallel method that obeys detailed balance and implement it for a system of hard disks on the graphics processors (GPUs). We applied the method to elucidate the nature of the two-dimensional melting transition of hard disks and polygons.
- Fluid-to-Solid Transition of Hard Regular Polygons
J.A. Anderson, J. Antonaglia, J.A. Millan, M. Engel, S.C. Glotzer
Physical Review X 7, 021001 (2017)
- Massively Parallel Monte Carlo for Many-Particle Simulations on GPUs
J.A. Anderson, E. Jankowski, T.L. Grubb, M. Engel, S.C. Glotzer
Journal of Computational Physics 254, 27-38 (2013)
- Hard-Disk Equation of State: First-Order Liquid-Hexatic Transition in Two Dimensions with Three Simulation Methods
M. Engel, J.A. Anderson, S.C. Glotzer, M. Isobe, E.P. Bernard, W. Krauth
Physical Review E 87, 042134 (2013)
Maximization of packing density
A packing problem is an optimization problem that asks how to pack objects in space. Packing problems are easy to grasp and notoriously hard to solve. Recent work on nanoparticle and colloidal self-assembly, jammed granular matter, and biological cell aggregation and crowding further motivated the study of packings. Packing in containers has applications in operations research, such as optimal storage, packaging, and transportation. We discovered the densest packing of tetrahedra and studied a three-parameter family of symmetric polyhedra using a simulated annealing algorithm.
- Complexity in Surfaces of Densest Packings for Families of Polyhedra
E.R. Chen, D. Klotsa, M. Engel, P.F. Damasceno, S.C. Glotzer
Physical Review X 4, 011024 (2014)
- Dense crystalline Dimer Packings of Regular Tetrahedra
E.R. Chen, M. Engel, S.C. Glotzer
Discrete and Computational Geometry 44, 253-280 (2010)