• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • No language data
  • Tagged with
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
1

Examining Saddle Point Searches in the Context of Off-Lattice Kinetic Monte Carlo

Hicks, Jonathan, Schulze, Timothy P. 01 January 2021 (has links)
In calculating the time evolution of an atomic system on diffusive timescales, off-lattice kinetic Monte Carlo (OLKMC) can sometimes be used to overcome the limitations of Molecular Dynamics. OLKMC relies on the harmonic approximation to Transition State Theory, in which the rate of rare transitions from one energy minimum to a neighboring minimum scales exponentially with an energy barrier on the potential energy surface. This requires locating the index-1 saddle point, commonly referred to as a transition state, that separates two neighboring energy minima. In modeling the evolution of an atomic system, it is desirable to find all the relevant transitions surrounding the current minimum. Due to the large number of minima on the potential energy surface, exhaustively searching the landscape for these saddle points is a challenging task. In examining the particular case of isolated Lennard-Jones clusters of around 50 particles, we observe very slow convergence of the total number of saddle points found as a function of successful searches. We seek to understand this behavior by modeling the distribution of successful searches and sampling this distribution to create a stochastic process that mimics this behavior. Finally, we will discuss an improvement to a rejection scheme for OLKMC where we terminate searches that appear to be failing early in the search process.

Page generated in 0.0209 seconds