Reversible Simulations of Elastic Collisions
Kalyan S. Perumalla, Vladimir A. Protopopescu

TL;DR
This paper introduces a novel algorithm for reversible simulation of elastic collisions among particles, achieving perfect reversibility with minimal memory by combining pseudo-randomization and constrained phase space sampling.
Contribution
The authors develop a new method that enables reversible elastic collision simulations without extensive memory overhead, addressing complex geometrical and dynamic constraints.
Findings
Achieved perfect reversibility for n <= 3, d=2 and n=2, d=3 collisions.
Demonstrated zero memory accumulation in reversible collision simulations.
Uncovered issues of irreversibility in conventional models.
Abstract
Consider a system of N identical hard spherical particles moving in a d-dimensional box and undergoing elastic, possibly multi-particle, collisions. We develop a new algorithm that recovers the pre-collision state from the post-collision state of the system, across a series of consecutive collisions, with essentially no memory overhead. The challenge in achieving reversibility for an n-particle collision (where, n << N) arises from the presence of nd-d-1 degrees of freedom during each collision, and from the complex geometrical constraints placed on the colliding particles. To reverse the collisions in a traditional simulation setting, all of the particular realizations of these degrees of freedom during the forward simulation must be saved. This limitation is addressed here by first performing a pseudo-randomization of angles, ensuring determinism in the reverse path for any values of…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
