An energy basin finding algorithm for kinetic Monte Carlo acceleration.
We present an energy basin finding algorithm for identifying the states in absorbing Markov chains used for accelerating kinetic Monte Carlo (KMC) simulations out of trapping energy basins. The algorithm saves groups of states corresponding to basic energy basins in which there is (i) a minimum energy saddle point and (ii) in moving away from the minimum the saddle point energies do not decrease between successive moves. When necessary, these groups are merged to help the system escape basins of basins. Energy basins are identified either as the system visits states, or by exploring surrounding states before the system visits them. We review exact and approximate methods for accelerating KMC simulations out of trapping energy basins and implement them within our algorithm. Its flexibility to store varying numbers of states, and ability to merge sets of saved states as the program runs, allows it to efficiently escape complicated trapping energy basins. Through simulations of vacancy-As cluster dissolution in Si, we demonstrate our algorithm can be several orders of magnitude faster than standard KMC simulations.
Puchala
Brian
B
Department of Materials Science and Engineering, University of Michigan, Ann Arbor, Michigan 48109, USA. puchala@wisc.edu
Falk
Michael L
ML
Garikipati
Krishna
K