Abstract
We present a fast computer simulation algorithm for high dimensional barrier crossing simulations. The algorithm is described with reference to the Graham and Olmsted (GO) model of flow-induced nucleation in polymers [R. S. Graham and P. D. Olmsted, Phys. Rev Lett. 103, 115702 (2009)]. Inspired by Chandler's barrier crossing algorithm [D. Chandler, J. Chem. Phys 68, 2959 (1978)], our algorithm simulates only the region around the top of the nucleation barrier, where the system deviates most strongly from equilibrium. When applied to the kinetic Monte Carlo (kMC) routine used in the GO model, our algorithm has two advantages: it requires very little additional coding; and it is simple enough to be applied to any barrier crossing problem that can be written in terms of a kMC simulation. Our fast nucleation algorithm is shown to vastly decrease the computer time required to perform the kMC simulations of high barrier crossing.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
