Big Chemical Encyclopedia

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

Articles Figures Tables About

Space computational scaling

The computational scaling properties of the Fourier method are a result of the scaling properties of the FFT algorithm which scales as 0(Nf, log Ng). As a result the phase space volume determines the scaling of the computational effort 0(Y log T). [Pg.195]

As an adequate choice of the a parameter in the Ewald sums allows the computation time of the contribution to the energy coming from the series in r-space to scale hnearly with N, several methods have been devised to reduce the computation time of the series of terms in fc-space. The latter is a Fomier transform depending on the particle positions, which, obviously in continuous systems, have disordered locations. The disorder of the particle positions seems to preclude the use of a fast Fourier transform (FFT) algorithm for the computation of the fc-space series. Adequate numerical schemes have, however, been devised to overcome this difficulty. In the particle-particle... [Pg.178]

This view on technology and the kind of bounds they impose upon humans could also be well illustrated by a concrete situation in another space-time scale. You are an engineer working in a leading world industry can you refuse to use a computer Can here means several things (a) Do you have the material possibility to do it (b) Do you have the social possibility to do it (c) Do you even have the mental possibility to do it Technological worldmaking characteristically entails this kind of modal situation in which human actions are materially and socially necessary, possible or impossible (Lavelle 2009). [Pg.259]

The key to reducing the computational scaling of MP2 calculations via PS methods is in the elimination of the conventional four index transform from the AO space (/xva/3) to the orbital space (ijpq) ... [Pg.2293]

The disadvantage of ah initio methods is that they are expensive. These methods often take enormous amounts of computer CPU time, memory, and disk space. The HF method scales as N, where N is the number of basis functions. This means that a calculation twice as big takes 16 times as long (2" ) to complete. Correlated calculations often scale much worse than this. In practice, extremely accurate solutions are only obtainable when the molecule contains a dozen electrons or less. However, results with an accuracy rivaling that of many experimental techniques can be obtained for moderate-size organic molecules. The minimally correlated methods, such as MP2 and GVB, are often used when correlation is important to the description of large molecules. [Pg.28]

There are basically two different computer simulation techniques known as molecular dynamics (MD) and Monte Carlo (MC) simulation. In MD molecular trajectories are computed by solving an equation of motion for equilibrium or nonequilibrium situations. Since the MD time scale is a physical one, this method permits investigations of time-dependent phenomena like, for example, transport processes [25,61-63]. In MC, on the other hand, trajectories are generated by a (biased) random walk in configuration space and, therefore, do not per se permit investigations of processes on a physical time scale (with the dynamics of spin lattices as an exception [64]). However, MC has the advantage that it can easily be applied to virtually all statistical-physical ensembles, which is of particular interest in the context of this chapter. On account of limitations of space and because excellent texts exist for the MD method [25,61-63,65], the present discussion will be restricted to the MC technique with particular emphasis on mixed stress-strain ensembles. [Pg.22]

The properties of the periodic surfaces studied in the previous sections do not depend on the discretization procedure in the hmit of small distance between the lattice points. Also, the symmetry of the lattice does not seem to influence the minimization, at least in the limit of large N and small h. In the computer simulations the quantities which vary on the scale larger than the lattice size should have a well-defined value for large N. However, in reality we work with a lattice of a finite size, usually small, and the lattice spacing is rather large. Therefore we find that typical simulations of the same model may give diffferent quantitative results although quahtatively one obtains the same results. Here we compare in detail two different discretization... [Pg.712]


See other pages where Space computational scaling is mentioned: [Pg.190]    [Pg.11]    [Pg.210]    [Pg.43]    [Pg.349]    [Pg.175]    [Pg.245]    [Pg.6]    [Pg.265]    [Pg.146]    [Pg.182]    [Pg.247]    [Pg.157]    [Pg.212]    [Pg.396]    [Pg.1771]    [Pg.5]    [Pg.15]    [Pg.80]    [Pg.298]    [Pg.497]    [Pg.352]    [Pg.129]    [Pg.165]    [Pg.170]    [Pg.105]    [Pg.537]    [Pg.111]    [Pg.469]    [Pg.349]    [Pg.1176]    [Pg.80]    [Pg.80]    [Pg.315]    [Pg.205]    [Pg.103]    [Pg.11]    [Pg.289]    [Pg.134]    [Pg.30]    [Pg.207]   
See also in sourсe #XX -- [ Pg.165 ]




SEARCH



Computational space

Space scales

© 2024 chempedia.info