Big Chemical Encyclopedia

Chemical substances, components, reactions, process design ...

Articles Figures Tables About

Dynamic Monte Carlo scheme

Maroudas and co-workers have described a hierarchical scheme for atomistic simulations involving the use of electronic structure calculations to develop and test semiempirical potentials that are in turn used for MD simulations. These results can sometimes be used to develop elementary step transition probabilities for use in dynamic Monte Carlo schemes. With Monte Carlo techniques, the well-known length and time scale limitations of MD can be greatly extended. This hierarchical approach appears to have great promise for the development of simulation strategies that will allow studies of a wide range of practical surface and thin-film chemical and physical processes. [Pg.161]

The forces on the atoms are contributed by all three parts. Hpp acts on the primary atoms, Hee on the environment atoms and Hpe on both. With all forces evaluated, all atoms are propagated classically to their next position using the chosen molecular dynamics, stochastic dynamics, or Monte Carlo scheme. [Pg.55]

While the two methods are, at face value, quite different in the ways in which full quantum dynamics is reduced to quantum-classical dynamics, there are common elements in the manner in which they are simulated. The Trotter-based scheme for QCL dynamics makes use of the adiabatic basis and is based on surface-hopping trajectories where transitions are sampled by a Monte Carlo scheme that requires reweighting. Similarly, ILDM calculations make use of the mapping hamiltonian basis and also involve a similar Monte Carlo sampling with reweighting of trajectories in the ensemble used to obtain the expectation values of quantum operators. [Pg.433]

When applying a SA approach to crystal structure prediction, a Metropolis Monte Carlo scheme [20], rather than molecular dynamics [28], is usually chosen to sample the configurational space (different possible candidate structures). In practice, this scheme proceeds by comparing the quality (value of the cost function) of a new candidate structure with the current candidate structure. The new candidate is either rejected or used to replace the current candidate struc-... [Pg.99]

The main characteristic of cellulcir automata is that each cell, which corresponds to a grid point in our model of the surface, is updated simultaneously. This allows for an efl cient implementation on massive parallel computers. It also facilitates the simulation of pattern formation, which is much harder to simulate with some asynchronous updating scheme as in dynamic Monte Carlo. [42] The question is how realistic a simultaneous update is, as a reaction seems to be a stochastic process. One has tried to incorporate this randomness by using so-called probabilistic cellular automata, in which updates are done with some probability. These cellular... [Pg.759]

In this part of the chapter, our aim is to describe a few of the highlights of both the molecular dynamics and Monte Carlo approaches to computational statistical mechanics. We begin with a review of the notion of microstate, this time with the idea of identifying how one might treat such states from the perspective of the computer. Having identified the nature of such states, we will take up in turn the alternatives offered by the molecular dynamics and Monte Carlo schemes for effecting the averages over these microstates. [Pg.139]

On the basis of the model of a heterogeneous membrane, it is possible to create a simulation scheme based on dynamic Monte Carlo computer simulations of the adsorption and desorption process on heterogeneous surfaces to extract the involved rate constants as a function of the calcium ion concentration. A simple simulation based on a modified, partly reversible, random sequential adsorption (RSA) algorithm provides very good accordance between experiment and measurement. Figure 8 schematically depicts the assumed model. [Pg.291]

In the second subsection (Section V, B), we describe the two-dimensional motion and collisions of dozens of receptors and effectors that results in activated effectors and thus the initial stages of signal transduction. For simplicity, receptors and effectors are constrained to move on a lattice the random motion of each is determined by choosing random numbers according to a Monte Carlo scheme, yielding a dynamic computer simulation. [Pg.93]

In this section, we extend our treatment on ionic bonding to include covalent contributions and their relevance to oxidation catalysis. We provide a more detailed molecular orbital analysis of the properties of these oxides by relating the electronic structure of cations at the surface of the oxide with that found in corresponding organometallic cluster complexes. As such, we can use more classical hybridization schemes to understand their reactivity. Accurate calculations are available for the Ru02 system that have been used as input to dynamic Monte Carlo simulations of the CO oxidation reaction to be discussed in the next subsection. [Pg.223]

In this section, we present a pseudocode for an FEP alchemical transformation based on the dual-topology paradigm. The steps followed in this algorithm, specifically (c)-(f), may be implemented independently of the core of the program that generates an ensemble of configurations at a given A state - either Monte Carlo or molecular dynamics. This is probably the simplest scheme, which may be improved in several ways, as will be discussed in Sect. 2.9. [Pg.60]

In formalism, many aspects of free-energy simulations lend themselves more to implementation within a Monte Carlo sampling scheme than within a molecular dynamics scheme. Unfortunately, MC schemes applied to large flexible molecules (e.g., proteins) tend to be very inefficient, since most proposed moves of the large molecule are rejected as being too energetically unreasonable, so MD simulations remain the standard. Innovative attempts to combine some of the best features of both have been described, as already noted in Chapter 3. [Pg.444]


See other pages where Dynamic Monte Carlo scheme is mentioned: [Pg.2382]    [Pg.65]    [Pg.260]    [Pg.249]    [Pg.149]    [Pg.31]    [Pg.403]    [Pg.419]    [Pg.245]    [Pg.62]    [Pg.2382]    [Pg.456]    [Pg.287]    [Pg.295]    [Pg.92]    [Pg.20]    [Pg.349]    [Pg.565]    [Pg.144]    [Pg.1753]    [Pg.1874]    [Pg.2024]    [Pg.162]    [Pg.7]    [Pg.312]    [Pg.319]    [Pg.593]    [Pg.90]    [Pg.116]    [Pg.47]    [Pg.311]    [Pg.288]    [Pg.343]    [Pg.447]    [Pg.447]    [Pg.423]    [Pg.426]   
See also in sourсe #XX -- [ Pg.245 ]




SEARCH



© 2024 chempedia.info