اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدSelf-learning kinetic Monte Carlo model for arbitrary surface orientations
208
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
While the self-learning kinetic Monte Carlo (SLKMC) method enables the calculation of transition rates from a realistic potential, implementations of it were usually limited to one specific surface orientation. An example is the fcc (111) surface in Latz et al. 2012, J. Phys.: Condens. Matter 24, 485005. This work provides an extension by means of detecting the local orientation, and thus allows for the accurate simulation of arbitrarily shaped surfaces. We applied the model to the diffusion of Ag monolayer islands and voids on a Ag(111) and Ag(001) surface, as well as the relaxation of a three-dimensional spherical particle.
قيم البحث
اقرأ أيضاً
The reliability of kinetic Monte Carlo (KMC) simulations depends on accurate transition rates. The self-learning KMC method (Trushin et al 2005 Phys. Rev. B 72 115401) combines the accuracy of rates calculated from a realistic potential with the effi
ciency of a rate catalog, using a pattern recognition scheme. This work expands the original two-dimensional method to three dimensions. The concomitant huge increase in the number of rate calculations on the fly needed can be avoided by setting up an initial database, containing exact activation energies calculated for processes gathered from a simpler KMC model. To provide two representative examples, the model is applied to the diffusion of Ag monolayer islands on Ag(111), and the homoepitaxial growth of Ag on Ag(111) at low temperatures.
We present a new efficient method for Monte Carlo simulations of diffusion-reaction processes. First introduced by us in [Phys. Rev. Lett., 97:230602, 2006], the new algorithm skips the traditional small diffusion hops and propagates the diffusing pa
rticles over long distances through a sequence of super-hops, one particle at a time. By partitioning the simulation space into non-overlapping protecting domains each containing only one or two particles, the algorithm factorizes the N-body problem of collisions among multiple Brownian particles into a set of much simpler single-body and two-body problems. Efficient propagation of particles inside their protective domains is enabled through the use of time-dependent Greens functions (propagators) obtained as solutions for the first-passage statistics of random walks. The resulting Monte Carlo algorithm is event-driven and asynchronous; each Brownian particle propagates inside its own protective domain and on its own time clock. The algorithm reproduces the statistics of the underlying Monte-Carlo model exactly. Extensive numerical examples demonstrate that for an important class of diffusion-reaction models the new algorithm is efficient at low particle densities, where other existing algorithms slow down severely.
We introduce an algorithm for treating growth on surfaces which combines important features of continuum methods (such as the level-set method) and Kinetic Monte Carlo (KMC) simulations. We treat the motion of adatoms in continuum theory, but attach
them to islands one atom at a time. The technique is borrowed from the Dielectric Breakdown Model. Our method allows us to give a realistic account of fluctuations in island shape, which is lacking in deterministic continuum treatments and which is an important physical effect. Our method should be most important for problems close to equilibrium where KMC becomes impractically slow.
We develop an asynchronous event-driven First-Passage Kinetic Monte Carlo (FPKMC) algorithm for continuous time and space systems involving multiple diffusing and reacting species of spherical particles in two and three dimensions. The FPKMC algorith
m presented here is based on the method introduced in [Phys. Rev. Lett., 97:230602, 2006] and is implemented in a robust and flexible framework. Unlike standard KMC algorithms such as the n-fold algorithm, FPKMC is most efficient at low densities where it replaces the many small hops needed for reactants to find each other with large first-passage hops sampled from exact time-dependent Greens functions, without sacrificing accuracy. We describe in detail the key components of the algorithm, including the event-loop and the sampling of first-passage probability distributions, and demonstrate the accuracy of the new method. We apply the FPKMC algorithm to the challenging problem of simulation of long-term irradiation of metals, relevant to the performance and aging of nuclear materials in current and future nuclear power plants. The problem of radiation damage spans many decades of time-scales, from picosecond spikes caused by primary cascades, to years of slow damage annealing and microstructure evolution. Our implementation of the FPKMC algorithm has been able to simulate the irradiation of a metal sample for durations that are orders of magnitude longer than any previous simulations using the standard Object KMC or more recent asynchronous algorithms.
In this thesis we present a kinetic Monte Carlo model for the description of epitaxial graphene growth. Experimental results suggest a growth mechanism by which clusters of 5 carbon atoms are an intermediate species necessary for nucleation and islan
d growth. This model is proposed by experimentally studying the velocity of growth of islands which is a highly nonlinear function of adatom concentration. In our simulation we incorporate this intermediate species and show that it can explain all other experimental observations: the temperature dependence of the adatom nucleation density, the equilibrium adatom density and the temperature dependence of the equilibrium island density. All these processes are described only by the kinematics of the system.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
