Big Chemical Encyclopedia

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

Articles Figures Tables About

Iterated similarity

It is important to stress that unnecessary thermodynamic function evaluations must be avoided in equilibrium separation calculations. Thus, for example, in an adiabatic vapor-liquid flash, no attempt should be made iteratively to correct compositions (and K s) at current estimates of T and a before proceeding with the Newton-Raphson iteration. Similarly, in liquid-liquid separations, iterations on phase compositions at the current estimate of phase ratio (a)r or at some estimate of the conjugate phase composition, are almost always counterproductive. Each thermodynamic function evaluation (set of K ) should be used to improve estimates of all variables in the system. [Pg.118]

The Guy open conformation model docked structure was minimized in vacuo followed by a 1-ns molecular dynamics simulation of the complex embedded in a phosphatidylethanolamine (POPE) lipid bilayer. Adjustments were made to the model, and simulations were repeated so that very little movement occurred during the hnal iterations. Similar methods were used to dock the two domains in transitional and resting states. However, these results are more tenuous as little experimental data is available. In particular, the position of the S4-S5 linker and its role in opening and closing the pore are uncertain. The supplemental movie accompanying reference 36 illustrates the open-to-close-to-open cycle resulting from the simulations. [Pg.228]

It has been noted that deconvolution methods, most of which were linear, had a propensity to produce solutions that did not make good physical sense. Prominent examples were found when negative values were obtained for light intensity or particle flux. As noted previously, the need to eliminate these negative components was generally accepted. Accordingly, Gold (1964) developed a method of iteration similar to Van Cittert s but used multiplicative corrections instead of additive ones. [Pg.99]

In a previous paper, one of us proposed that it was necessary to arrive at chains of iterations similar to successive approximations but concerning both the framework and the contents of the formation in question. These chains could be represented schematically in the following way ... [Pg.158]

In applied molecular evolution, fitness generally has one of two meanings (i) It can refer specifically to how well a molecule performs a desired function, typically the affinity of a ligand for a given receptor or its catalytic activity for a given reaction, (ii) It can refer to the rate at which a molecule in a population of molecules is copied over one iteration, similar to the notion of enrichment in die molecular diversity literature. This second definition is more complex, as fitness depends not only on the properties of a molecule but also on the properties of the rest of the population. Since fitness then changes each iteration as the population changes, the whole fitness landscape metaphor is weakened. For these reasons, I will restrict myself to the first definition of fitness. [Pg.126]

In the above problem, we require that similar (P.W) criteria, that is, similar similarity criteria, be used for pairs that are near to one another along the sequence. Hence, our task is to assess the similarity of the (P.W) criteria applied to the original objects. It is natural then to regard the similarity criteria as a set of new objects to be compared, and to use the very same method for assessing their similarity. The above scheme can be regarded as an iterated similarity analysis, since some similarity criterion is applied to the very similarity criteria (P,W) used for comparing the n original objects Oj, i = 1,2,. . . n. [Pg.144]

Mezey, P.G. (1994). Iterated Similarity Sequences and Shape ID Numbers for Molecules. J.Chem.Inf.Comput.Sci., 34,244-247. [Pg.617]

This equation can be iterated (similar to the solution (2.76) ofEq. (2.73)) to give the interaction representation of the density operator at time to starting from some time tp in the past... [Pg.694]

Specification of the split ratio (s4/s3 or s5/s3) convergence. This is a recommended practice relative specifications as output flow/input fiow can remove uncertainties due to the variation of the input flow during successive iterations. Similarly, the simulation of some units cannot succeed beeause of inconsistency in... [Pg.91]

While the polynomial method can be used for solving small eigenvalue problems by hand, all computational implementations rely on iterative similarity transform methods for bringing the matrix to a diagonal form. The simplest of these is the Jacobi method, where a sequence of 2 x 2 rotations analogous to eqs (16.28)-(16.30) can be used to bring all the off-diagonal elements below a suitable threshold value. [Pg.524]

Liquid-liquid equilibrium separation calculations are superficially similar to isothermal vapor-liquid flash calculations. They also use the objective function. Equation (7-13), in a step-limited Newton-Raphson iteration for a, which is here E/F. However, because of the very strong dependence of equilibrium ratios on phase compositions, a computation as described for isothermal flash processes can converge very slowly, especially near the plait point. (Sometimes 50 or more iterations are required. )... [Pg.124]

The size of the move at each iteration is governed by the maximum displacement, Sr ax This is an adjustable parameter whose value is usually chosen so that approximately 50/i of the trial moves are accepted. If the maximum displacement is too small then mam moves will be accepted hut the states will be very similar and the phase space will onb he explored very slowly. Too large a value of Sr,, x and many trial moves will be rejectee because they lead to unfavourable overlaps. The maximum displacement can be adjuster automatically while the program is running to achieve the desired acceptance ratio bi keeping a running score of the proportion of moves that are accepted. Every so often thi maximum displacement is then scaled by a few percent if too many moves have beei accepted then the maximum displacement is increased too few and is reduced. [Pg.433]

The maximum dissimilarity algorithm works in an iterative manner at each step one compormd is selected from the database and added to the subset [Kennard and Stone 1969]. The compound selected is chosen to be the one most dissimilar to the current subset. There are many variants on this basic algorithm which differ in the way in which the first compound is chosen and how the dissimilarity is measured. Three possible choices for fhe initial compormd are (a) select it at random, (b) choose the molecule which is most representative (e.g. has the largest sum of similarities to the other molecules) or (c) choose the molecule which is most dissimilar (e.g. has the smallest sum of similarities to the other molecules). [Pg.699]

In general, these quartie equations must then be solved in an iterative manner and are suseeptible to eonvergenee diffieulties that are similar to those that arise in MCSCF-type ealeulations. In any sueh iterative proeess, it is important to start with an approximation (to the t amplitudes, in this ease) whieh is reasonably elose to the final eonverged result. Sueh an approximation is often aehieved, for example, by negleeting all of the terms that are nonlinear in the t amplitudes (beeause these amplitudes are assumed to be less than unity in magnitude). This leads, for the CC working equations obtained by projeeting onto the doubly exeited CSFs, to ... [Pg.497]

The original PCM method uses a cavity made of spherical regions around each atom. The isodensity PCM model (IPCM) uses a cavity that is defined by an isosurface of the electron density. This is defined iteratively by running SCF calculations with the cavity until a convergence is reached. The self-consistent isodensity PCM model (SCI-PCM) is similar to IPCM in theory, but different in implementation. SCI-PCM calculations embed the cavity calculation in the SCF procedure to account for coupling between the two parts of the calculation. [Pg.212]

To linearize the penalty operator in (1.119) we use the following iteration scheme similar to (1.105),... [Pg.44]

This example illustrates the simplified approach to film blowing. Unfortunately in practice the situation is more complex in that the film thickness is influenced by draw-down, relaxation of induced stresses/strains and melt flow phenomena such as die swell. In fact the situation is similar to that described for blow moulding (see below) and the type of analysis outlined in that section could be used to allow for the effects of die swell. However, since the most practical problems in film blowing require iterative type solutions involving melt flow characteristics, volume flow rates, swell ratios, etc the study of these is delayed until Chapter 5 where a more rigorous approach to polymer flow has been adopted. [Pg.268]

As mentioned above, a KS-LCAO calculation adds one additional step to each iteration of a standard HF-LCAO calculation a quadrature to calculate the exchange and correlation functionals. The accuracy of such calculations therefore depends on the number of grid points used, and this has a memory resource implication. The Kohn-Sham equations are very similar to the HF-LCAO ones and most cases converge readily. [Pg.228]


See other pages where Iterated similarity is mentioned: [Pg.514]    [Pg.420]    [Pg.19]    [Pg.1122]    [Pg.133]    [Pg.151]    [Pg.2986]    [Pg.203]    [Pg.514]    [Pg.420]    [Pg.19]    [Pg.1122]    [Pg.133]    [Pg.151]    [Pg.2986]    [Pg.203]    [Pg.125]    [Pg.174]    [Pg.2337]    [Pg.2340]    [Pg.536]    [Pg.219]    [Pg.482]    [Pg.498]    [Pg.550]    [Pg.554]    [Pg.182]    [Pg.165]    [Pg.537]    [Pg.32]    [Pg.455]    [Pg.399]    [Pg.403]    [Pg.129]    [Pg.130]    [Pg.133]    [Pg.814]    [Pg.93]    [Pg.117]   
See also in sourсe #XX -- [ Pg.144 ]




SEARCH



ITER

Iterated

Iteration

Iteration iterator

Iterative

© 2024 chempedia.info