اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدLongtime convergence of the Temperature-Accelerated Molecular Dynamics Method
153
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
The equations of the temperature-accelerated molecular dynamics (TAMD) method for the calculations of free energies and partition functions are analyzed. Specifically, the exponential convergence of the law of these stochastic processes is established, with a convergence rate close to the one of the limiting, effective dynamics at higher temperature obtained with infinite acceleration. It is also shown that the invariant measures of TAMD are close to a known reference measure, with an error that can be quantified precisely. Finally, a Central Limit Theorem is proven, which allows the estimation of errors on properties calculated by ergodic time averages. These results not only demonstrate the usefulness and validity range of the TAMD equations, but they also permit in principle to adjust the parameter in these equations to optimize their efficiency.
قيم البحث
اقرأ أيضاً
We present a new method, called SISYPHUS (Stochastic Iterations to Strengthen Yield of Path Hopping over Upper States), for extending accessible time-scales in atomistic simulations. The method proceeds by separating phase space into basins, and tran
sition regions between the basins based on a general collective variable (CV) criterion. The transition regions are treated via traditional molecular dynamics (MD) while Monte Carlo (MC) methods are used to (i) estimate the expected time spent in each basin and (ii) thermalize the system between two MD episodes. In particular, an efficient adiabatic switching based scheme is used to estimate the time spent inside the basins. The method offers various advantages over existing approaches in terms of (i) providing an accurate real time scale, (ii) avoiding reliance on harmonic transition state theory and (iii) avoiding the need to enumerate all possible transition events. Applications of SISYPHUS to low temperature vacancy diffusion in BCC Ta and adatom island ripening in FCC Al are presented. A new CV appropriate for such condensed phases, especially for transitions involving collective motions of several atoms, is also introduced.
We prove the uniform in space and time convergence of the scaled heights of large classes of deterministic growth models that are monotone and equivariant under translations by constants. The limits are unique viscosity solutions of first- or second-
order partial differential equations depending on whether the growth models are scaled hyperbolically or parabolically. The results simplify and extend a recent work by the first author to more general surface growth models. The proofs are based on the methodology developed by Barles and the second author to prove convergence of approximation schemes.
The net charge of solvated entities, ranging from polyelectrolytes and biomolecules to charged nanoparticles and membranes, depends on the local dissociation equilibrium of individual ionizable groups. Incorporation of this phenomenon, emph{charge re
gulation}, in theoretical and computational models requires dynamic, configuration-dependent recalculation of surface charges and is therefore typically approximated by assuming constant net charge on particles. Various computational methods exist that address this. We present an alternative, particularly efficient charge regulation Monte Carlo method (CR-MC), which explicitly models the redistribution of individual charges and accurately samples the correct grand-canonical charge distribution. In addition, we provide an open-source implementation in the LAMMPS molecular dynamics (MD) simulation package, resulting in a hybrid MD/CR-MC simulation method. This implementation is designed to handle a wide range of implicit-solvent systems that model discreet ionizable groups or surface sites. The computational cost of the method scales linearly with the number of ionizable groups, thereby allowing accurate simulations of systems containing thousands of individual ionizable sites. By matter of illustration, we use the CR-MC method to quantify the effects of charge regulation on the nature of the polyelectrolyte coil--globule transition and on the effective interaction between oppositely charged nanoparticles.
The Self-Healing Umbrella Sampling (SHUS) algorithm is an adaptive biasing algorithm which has been proposed to efficiently sample a multimodal probability measure. We show that this method can be seen as a variant of the well-known Wang-Landau algor
ithm. Adapting results on the convergence of the Wang-Landau algorithm, we prove the convergence of the SHUS algorithm. We also compare the two methods in terms of efficiency. We finally propose a modification of the SHUS algorithm in order to increase its efficiency, and exhibit some similarities of SHUS with the well-tempered metadynamics method.
We consider a generalization of the discrete-time Self Healing Umbrella Sampling method, which is an adaptive importance technique useful to sample multimodal target distributions. The importance function is based on the weights (namely the relative
probabilities) of disjoint sets which form a partition of the space. These weights are unknown but are learnt on the fly yielding an adaptive algorithm. In the context of computational statistical physics, the logarithm of these weights is, up to a multiplicative constant, the free energy, and the discrete valued function defining the partition is called the collective variable. The algorithm falls into the general class of Wang-Landau type methods, and is a generalization of the original Self Healing Umbrella Sampling method in two ways: (i) the updating strategy leads to a larger penalization strength of already visited sets in order to escape more quickly from metastable states, and (ii) the target distribution is biased using only a fraction of the free energy, in order to increase the effective sample size and reduce the variance of importance sampling estimators. The algorithm can also be seen as a generalization of well-tempered metadynamics. We prove the convergence of the algorithm and analyze numerically its efficiency on a toy example.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
