SAMPLS algorithm

A weight factor WCF) may be introduced in the MC sampling algorithm, to generate a modified, or weighted , distribution. 

For many applications, it may be reasonable to assume that the system behaves classically, that is, the trajectories are real particle trajectories. It is then not necessary to use a quantum distribution, and the appropriate ensemble of classical thermodynamics can be taken. A typical approach is to use a rnicrocanonical ensemble to distribute energy into the internal modes of the system. The normal-mode sampling algorithm [142-144], for example, assigns a desired energy to each normal mode, as a harmonic amplitude... 

IlyperChem provides three types ofpotential energy surface sampling algorithms. These are found m the IlyperChem Compute menu Single Point, Ceometry Optimization, and Molecular Dynamics. 

Lee, C. Y. Scott, H. L., The surface tension of water a Monte Carlo calculation using an umbrella sampling algorithm, J. Chem. Phys. 1980, 73, 4591 1596... 

It is ironic that in the N —> oo limit the Tsallis sampling algorithm has the main feature for which the multicanonical algorithm was designed - it performs a random walk in energy - while the multicanonical algorithm loses this feature. 

This section is used to introduce the momentum-enhanced hybrid Monte Carlo (MEHMC) method that in principle converges to the canonical distribution. This ad hoc method uses averaged momenta to bias the initial choice of momenta at each step in a hybrid Monte Carlo (HMC) procedure. Because these average momenta are associated with essential degrees of freedom, conformation space is sampled effectively. The relationship of the method to other enhanced sampling algorithms is discussed. 

Rahman, J.A. Tully, J.C., Puddle-jumping A flexible sampling algorithm for rare event systems, Chem. Phys. 2002, 285, 277-287... 

In the NVT ensemble one cannot compute the chemical potential or entropy of the system two properties which are of critical importance for interfacial systems. The choice of an ensemble also determines the sampling algorithm used to generate molecular configurations from random moves of the molecules. 

A double spike technique is essential for TIMS analyses of Se and Cr, and may also be useful in MC-ICP-MS analysis. Briefly, two spike isotopes with a known ratio are added to each sample, and the measured ratio of the spike isotopes is used to determine and correct for instrumental bias. Examples of Se and Cr double spikes currently in use are given in Table 1. The fact that small amounts of the spike isotopes are present in the samples and small amormts of nominally unspiked isotopes are found in the spikes is not a problem, as the measurements allow highly precise mathematical separation of spike from samples. Algorithms for such calculations are described by Albarede and Beard (2004) and, specifically for Se, by Johnson etal. (1999). 

Ding, Y. and Lawrence, C. E. (2003). A statistical sampling algorithm for RNA secondary structure prediction. Nucleic Acids Res. 31,7280-7301. 

The algorithm developments that support these system processes are summarized, and sample algorithms are provided in the appendix to illustrate supporting system processes in areas of registration, substructure searching, and interconversions. 

Our group has coupled the MST (PCM) method to Metropolis Monte Carlo sampling algorithms (MC-MST [78]). Within this approach cavitation and van der Waals terms are computed as in normal MST, while a semiclassical approach [79, 80] is used to compute the electrostatic component of solvation (see Equation (4.37)). Solute-solute energy terms are computed using a classical force field and Metropolis is then applied to the effective energy shown in Equation (4.38). 

Divide the underlying data set into training and test sets through the use of diversity sampling algorithms. 

In practice, one must compromise the number of molecules in the simulation and/or the number of configurations calculated to conserve computer cycles. Two essential techniques that are utilized are periodic boundary conditions and sampling algorithms, which we discuss separately. 

The literature is full of examples of many types of conformational sampling algorithms [17-20]. Some of the principal ones are the model building approach [21], genetic algorithms [22, 23], the Monte Carlo (MC) [24] and simulated annealing [25] protocols. 

---