Efficient Implementation of Cluster Expansion Models in Surface Kinetic Monte Carlo Simulations with Lateral Interactions: Subtraction Schemes, Supersites, and the Supercluster Contraction
While lateral interaction models for reactions at surfaces have steadily gained popularity and grown in terms of complexity, their use in chemical kinetics has been impeded by the low performance of current kinetic Monte Carlo (KMC) algorithms. The origins of the additional computational cost in KMC simulations with lateral interactions are traced back to the more elaborate cluster expansion Hamiltonian, the more extensive rate updating, and to the impracticality of rate‐catalog‐based algorithms for interacting adsorbate systems. Favoring instead site‐based algorithms, we propose three ways to reduce the cost of KMC simulations: (1) representing the lattice energy by a smaller Supercluster Hamiltonian without loss of accuracy, (2) employing the subtraction schemes for updating key quantities in the simulation that undergo only small, local changes during a reaction event, and (3) applying efficient search algorithms from a set of established methods (supersite approach). The cost of the resulting algorithm is fixed with respect to the number of lattice sites for practical lattice sizes and scales with the square of the range of lateral interactions. The overall added cost of including a complex lateral interaction model amounts to less than a factor 3. Practical issues in implementation due to finite numerical accuracy are discussed in detail, and further suggestions for treating long‐range lateral interactions are made. We conclude that, while KMC simulations with complex lateral interaction models are challenging, these challenges can be overcome by modifying the established variable step‐size method by employing the supercluster, subtraction, and supersite algorithms (SSS‐VSSM). © 2019 Wiley Periodicals, Inc.