Abstract
Kinetic Monte Carlo (KMC) simulations are used to simulate epitaxial crystal growth. Presently, the fastest reported methods use binary trees to search through a list of rates in O(log(2) M) time, where M is the number of rates. These methods are applicable to an arbitrary set of rates, but typical KMC bond-counting schemes involve only a finite set of distinct rates. This allows one to construct a faster list-based algorithm with a computation time that is essentially independent of M. It is found that this algorithm typically reduces computation time by between 30% and 50% for typical simulations, with this factor increasing for larger simulations.
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.
