Big Chemical Encyclopedia

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

Articles Figures Tables About

Design computation scheme

Computational Scheme for Gas-Phase PFRs. A general procedure for solving the reactor design equations for a piston flow reactor using the marching-ahead technique (Euler s method) has seven steps ... [Pg.90]

In the preceding section, we observed the slow basis-set convergence of the doubles contributions to the AE of CO. In the present section, we shall make an attempt at understanding the reasons for the slow convergence and to see if this insight can help us design better computational schemes. [Pg.12]

From the core design we are now able to construct a general computation scheme in which we omit all the 1 and introduce a common factor, z0, as well as the interaction of pairs of factors, e.g. ziz2. The factor z0 is assumed to be present independently of the variation of the planned factors z and z2. It may, e.g., be considered as a blank value or a basic level of contamination. The interaction of factors is expected to be important in antagonistic or synergistic effects. [Pg.80]

Not all molecular properties are, however, of local nature, which lend themselves to efficient computational schemes. Molecular vibrations are typically non-local and delocalized. Nevertheless, it is possible even in such cases to design a tailored quantum chemical method, the Mode-Tracking protocol [164], for the selective calculation of only those vibrations relevant for a certain scientific context. For the selective calculation of various types of vibrational spectra we refer the interested reader to the reviews in Refs. [165, 166]. It should be mentioned that molecular dynamics simulations offer different routes to spectra through autocorrelation functions. [Pg.441]

Bloor, M. I. G., Wilson, M. J., and Hagen, H. The Smoothing Properties of Variational Schemes for Surface Design, Computer Aided Geometric Design, vol. 12 (1995) pp. 381-394. [Pg.319]

For very large sets of algebraic equations, typical in plant design problems, it is worthwhile to seek sequential computational schemes. However, for small sets of equations (less than 50 equations to a set), simultaneous solution to the describing equations becomes practical and advantageous. This is especially true when the equations are linear and matrix techniques can be applied. [Pg.47]

Perform a structural analysis for a flash distillation unit (Figure 2.41) that is flashing a feed stream with three components. Assume that the pressure and temperture of the flash unit is known. Determine a best set of design variables for this problem. Next assume that you specify the input conditions (flow and compoisition) and determine a best computational scheme for this problem without design variable choice. [Pg.122]

It is well known that Hartree-Fock (HF) theory not only has been proven to be quite suitable for calculations of ground state (GS) properties of electronic systems, but has also served as a starting point to develop many-parti-cle approaches which deal with electronic correlation, like perturbation theory, configuration interaction methods and so on (see e.g., [1]). Therefore, a large number of sophisticated computational approaches have been developed for the description of the ground states based on the HF approximation. One of the most popular computational tools in quantum chemistry for GS calculations is based on the effectiveness of the HF approximation and the computational advantages of the widely used many-body Mpller-Plesset perturbation theory (MPPT) for correlation effects. We designate this scheme as HF + MPPT, here after denoted HF -f- MP2. ... [Pg.185]

The choice of parameterization and the design of a discretization method are not independent Some choices of parameters will facilitate symplec-tic/reversible discretization while others may make this task very difficult or render the resulting scheme practically useless because of the computational expense involved. [Pg.351]

Most calculations today are done by choosing an existing segmented GTO basis set. These basis sets are identihed by one of a number of notation schemes. These abbreviations are often used as the designator for the basis set in the input to ah initio computational chemistry programs. The following is a look at the notation for identifying some commonly available contracted GTO basis sets. [Pg.81]


See other pages where Design computation scheme is mentioned: [Pg.440]    [Pg.440]    [Pg.226]    [Pg.127]    [Pg.32]    [Pg.881]    [Pg.153]    [Pg.285]    [Pg.3263]    [Pg.85]    [Pg.120]    [Pg.2]    [Pg.366]    [Pg.127]    [Pg.338]    [Pg.287]    [Pg.401]    [Pg.644]    [Pg.186]    [Pg.477]    [Pg.103]    [Pg.26]    [Pg.32]    [Pg.382]    [Pg.118]    [Pg.188]    [Pg.15]    [Pg.350]    [Pg.32]    [Pg.162]    [Pg.137]    [Pg.541]    [Pg.503]    [Pg.421]    [Pg.635]    [Pg.75]    [Pg.103]   
See also in sourсe #XX -- [ Pg.80 ]




SEARCH



Computation scheme

Computer design

Design computational

© 2024 chempedia.info