Big Chemical Encyclopedia

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

Articles Figures Tables About

Discretization method, desired

Accurate solvation procedures can be found in the family of continuum methods as well as in that of discrete methods. Now, the number of cases in which the application of methods belonging to the two families has given very similar results (with a good agreement with experimental data) is large. Continuum methods must take into account all the components of G, and they must use a realistic description of the cavity. Ad hoc parametriza-tions of cavities of simpler shapes such as to reproduce, for example, the desired value of an energy difference, often lead to considerable deformations of the reaction potential, and thus of the solute properties, which the interpretation of the phenomenon depends on. On the other side, discrete methods depend on the quality of the intermolecular potential as well as of the simulation procedure both are critical parameters. The simulation should also include the solvent electronic polarization, or some estimates of its effect. [Pg.92]

When deriving these expressions, it was assumed that velocity at all the cell faces is positive. In other cases, suitable modifications to include appropriate upstream nodes (in place of 0ww and 0ss) should be made. It can be seen that the continuity equation indicates that the last term inside the bracket of Eq. (6.19) will always be zero for constant density flows. The behavior of numerical methods depends on the source term linearization employed and interpolation practices. Before these practices are discussed, a brief discussion of the desired characteristics of discretization methods will be useful. The most important properties of the discretization method are ... [Pg.157]

Source term linearization and interpolation practices to estimate cell face values are discussed with reference to these desirable properties of the discretization method. [Pg.158]

Equation (8.22) for a(0) is also special because, due to symmetry, there is only one adjacent point, a(l). The overall set may be solved by any desired method. Euler s method is discussed below and is illustrated in Example 8.5. There are a great variety of commercial and freeware packages available for solving simultaneous ODEs. Most of them even work. Packages designed for stiff equations are best. The stiffness arises from the fact that VJJ) becomes very small near the tube waU. There are also software packages that will handle the discretization automatically. [Pg.274]

Citrus Fruit Types. The method previously described 11) consisted essentially of scrubbing the fruits with a warm 10% trisodium phosphate solution, rinsing with distilled water, halving each fruit, and reaming the juice and pulp from each half with a power juicer. Pieces of pulp adhering to the insides of the individual hemispheres of peel were carefully scraped free and combined with the remainder of the pulp and juice. Independent analyses were then completed on the discrete peel and pulp-juice samples. Whenever desirable the flavedo and albedo components of the peel were separated with peeling tools, and each was pooled and analyzed. [Pg.129]

The region between the walls is first divided into bins, and the density at the midpoint of each bin is treated as an independent variable. If the density is desired at M discrete points, then the numerical method reduces to simultaneously solving M equations in M unknowns ... [Pg.126]

Under dynamic or quasi-steady-state conditions, a continuously monitored process will reveal changes in the operating conditions. When the process is sampled regularly, at discrete periods of time, then along with the spatial redundancy previously defined, we will have temporal redundancy. If the estimation methods presented in the previous chapters were used, the estimates of the desired process variables calculated for two different times, t and t2, are obtained independently, that is, no previous information is used in the generation of estimates for other times. In other words, temporal redundancy is ignored and past information is discarded. [Pg.156]

Conceptually, the value for a given sample reflects the extremeness of that sample s response within the PCA model space, whereas the Q valne reflects the amonnt of the sample s response that is outside of the PCA model space. Therefore, both metrics are necessary to fnlly assess the abnormality of a response. In practice, before one can nse a PCA model as a monitor, one mnst set a confidence limit on each of these metrics. There are several methods for determining these confidence limits [30,31], bnt these nsually require two sets of information (1) the set of and Q values that are obtained when the calibration data (or a suitable set of independent test data) is applied to the PCA model, and (2) a user-specified level of confidence (e.g. 95%, 99%, or 99.999%). Of conrse, the latter is totally at the discretion of the nser, and is driven by the desired sensitivity and specificity of the monitoring application. [Pg.366]

Below is a brief review of the published calculations of yttrium ceramics based on the ECM approach. In studies by Goodman et al. [20] and Kaplan et al. [25,26], the embedded quantum clusters, representing the YBa2Cu307 x ceramics (with different x), were calculated by the discrete variation method in the local density approximation (EDA). Although in these studies many interesting results were obtained, it is necessary to keep in mind that the EDA approach has a restricted applicability to cuprate oxides, e.g. it does not describe correctly the magnetic properties [41] and gives an inadequate description of anisotropic effects [42,43]. Therefore, comparative ab initio calculations in the frame of the Hartree-Fock approximation are desirable. [Pg.144]

In a discrete convolution such as a = b (x) g, where a and g are stored in similar-sized arrays, the ends of the a array are often not used. This occurs if a elements are computed only for those positions at which a full set of N nonvanishing g values are available, where N is the number of nonvanishing b values being used. It is thus possible to use only one array to store both a and g. One replaces g1 with the first value of a obtained, continuing in an ascending sequence in the indices. When the operation is complete, the a result may be shifted back to the desired position. The values of g are lost by this method. The loss of g is of no consequence in some cases. [Pg.77]

With the aid of Eq. (48), we can show that 6ik (o) = (k + l)N(co) for t(co) = 0. The object estimate consists of noise at frequencies that t does not pass. The noise grows with each iteration. This problem can be alleviated if we bandpass-filter the data to the known extent of z to reject frequencies that t is incapable of transmitting. Practical applications of relaxation methods typically employ such filtering. Least-squares polynomial filters, applied by finite discrete convolution, approximate the desired characteristics (Section III.C.5). For k finite and t 0, but nevertheless small,... [Pg.84]

Chemical and biological analyses of trace organic mixtures in aqueous environmental samples typically require that some type of isolation-concentration method be used prior to testing these residues the inclusion of bioassay in a testing scheme often dictates that large sample volumes (20-500 L) be processed. Discrete chemical analysis only requires demonstration that the isolation technique yields the desired compounds with known precision. However, chemical and/or toxicological characterization of the chemical continuum of molecular properties represented by the unknown mixtures of organics in environmental samples adds an extra dimension of the ideal isolation technique ... [Pg.542]

These analysis methods are relatively fast, require only a few grams of sample, provide discrete fractions which can be characterized in as much detail as desired with available techniques, and provide comparative compositional profiles for fuels from various sources, both natural and synthetic. The methods have limitations, as indicated throughout the paper. However, as new procedures are developed to take care of these limitations, they can readily be incorporated. [Pg.51]


See other pages where Discretization method, desired is mentioned: [Pg.60]    [Pg.235]    [Pg.270]    [Pg.284]    [Pg.180]    [Pg.1092]    [Pg.1148]    [Pg.1689]    [Pg.166]    [Pg.519]    [Pg.388]    [Pg.378]    [Pg.486]    [Pg.765]    [Pg.174]    [Pg.670]    [Pg.322]    [Pg.93]    [Pg.179]    [Pg.134]    [Pg.273]    [Pg.275]    [Pg.15]    [Pg.234]    [Pg.386]    [Pg.74]    [Pg.137]    [Pg.278]    [Pg.60]    [Pg.82]    [Pg.223]    [Pg.166]    [Pg.112]    [Pg.34]    [Pg.139]    [Pg.166]   


SEARCH



Desired

Desires

Discrete method

© 2024 chempedia.info