Big Chemical Encyclopedia

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

Articles Figures Tables About

Algorithm the solute

Single step methods, such as the Eulerian forward and backward algorithms, can be regarded as particular cases of multistep methods (Byrne and Hindmarsh, 1975). One of them, developed by Gear (1971) is particularly well adapted to stiff systems. In this algorithm, the solution to (5.2) is approximated by... [Pg.270]

After column 1 had been solved by use of the Almost Band Algorithm, the bif j s so obtained were used to solve column 2 by use of the Almost Band Algorithm. The solutions so obtained for the respective columns were used as the starting values for the system modular method. The final solution values of selected variables for this example are presented in Tables 6-3 through 6-6. [Pg.238]

The solution of the gasoline equation requires the input from the six oil lump equations resulting in seven simultaneous differential equations which can be solved using a Runge-Kutta algorithm. The solution strategy for the eight lump model is presented by Kraemer (1991). [Pg.99]

No a priori information about the unknown profile is used in this algorithm, and the initial profile to start the iterative process is chosen as (z) = 1. Moreover, the solution of the forward problem at each iteration can be obtained with the use of the scattering matrices concept [8] instead of a numerical solution of the Riccati equation (4). This allows to perform reconstruction in a few seconds of a microcomputer time. The whole algorithm can be summarized as follows ... [Pg.129]

Alexander M H and Manolopoulos D E 1987 A stable linear reference potential algorithm for solution of the quantum close-coupled equations in molecular scattering theory J. Chem. Phys. 86 2044-50... [Pg.1086]

The PCM algorithm is as follows. First, the cavity siuface is determined from the van der Waals radii of the atoms. That fraction of each atom s van der Waals sphere which contributes to the cavity is then divided into a nmnber of small surface elements of calculable surface area. The simplest way to to this is to define a local polar coordinate frame at tlie centre of each atom s van der Waals sphere and to use fixed increments of AO and A(p to give rectangular surface elements (Figure 11.22). The surface can also be divided using tessellation methods [Paschual-Ahuir d al. 1987]. An initial value of the point charge for each surface element is then calculated from the electric field gradient due to the solute alone ... [Pg.612]

As described in Chapter 3, Section 5.1 the application of the VOF scheme in an Eulerian framework depends on the solution of the continuity equation for the free boundary (Equation (3.69)) with the model equations. The developed algorithm for the solution of the described model equations and updating of the free surface boundaries is as follows ... [Pg.145]

The right-hand side in Equation (6.18) is known and hence its solution yields the error 5x in the original solution. The procedure can be iterated to improve the solution step-by-step. Note that implementation of this algorithm in the context of finite element computations may be very expensive. A significant advantage of the LU decomposition technique now becomes clear, because using this technique [A] can be decomposed only once and stored. Therefore in the solution of Equation (6.18) only the right-hand side needs to be calculated. [Pg.207]

Validation and Application. VaUdated CFD examples are emerging (30) as are examples of limitations and misappHcations (31). ReaUsm depends on the adequacy of the physical and chemical representations, the scale of resolution for the appHcation, numerical accuracy of the solution algorithms, and skills appHed in execution. Data are available on performance characteristics of industrial furnaces and gas turbines systems operating with turbulent diffusion flames have been studied for simple two-dimensional geometries and selected conditions (32). Turbulent diffusion flames are produced when fuel and air are injected separately into the reactor. Second-order and infinitely fast reactions coupled with mixing have been analyzed with the k—Z model to describe the macromixing process. [Pg.513]

Stability, Bifurcations, Limit Cycles Some aspects of this subject involve the solution of nonlinear equations other aspects involve the integration of ordinaiy differential equations apphcations include chaos and fractals as well as unusual operation of some chemical engineering eqmpment. Ref. 176 gives an excellent introduction to the subject and the details needed to apply the methods. Ref. 66 gives more details of the algorithms. A concise survey with some chemical engineering examples is given in Ref. 91. Bifurcation results are closely connected with stabihty of the steady states, which is essentially a transient phenomenon. [Pg.475]

The concentration profile is steeper for the MacCormack method than for the upstream derivatives, but oscillations can still be present. The flux-corrected transport method can be added to the MacCormack method. A solution is obtained both with the upstream algorithm and the MacCormack method and then they are combinea to add just enough diffusion to ehminate the oscillations without smoothing the solution too much. The algorithm is comphcated and lengthy but well worth the effort (Refs. 37, 107, and 270). [Pg.481]

Finally, to ensure convergence of this algorithm from poor starting points, a step size Ot is chosen along the search direction so that the point at the next iteration z = z- + Ctd) is closer to the solution of the... [Pg.486]

One important class of nonlinear programming techniques is called quadratic programming (QP), where the objective function is quadratic and the constraints are hnear. While the solution is iterative, it can be obtained qmckly as in linear programming. This is the basis for the newest type of constrained multivariable control algorithms called model predic tive control. The dominant method used in the refining industiy utilizes the solution of a QP and is called dynamic matrix con-... [Pg.745]

The solution of these equations requires a root-finding algorithm which iterates on assumed values of T i. At each value of T i, solve Eq. (26-95) (with T]i replacing Ra) foi Find R2 ffom Eq. (26-101), subject also to ... [Pg.2351]


See other pages where Algorithm the solute is mentioned: [Pg.111]    [Pg.47]    [Pg.230]    [Pg.434]    [Pg.111]    [Pg.47]    [Pg.230]    [Pg.434]    [Pg.127]    [Pg.174]    [Pg.264]    [Pg.267]    [Pg.268]    [Pg.255]    [Pg.12]    [Pg.396]    [Pg.495]    [Pg.625]    [Pg.91]    [Pg.92]    [Pg.93]    [Pg.103]    [Pg.105]    [Pg.146]    [Pg.147]    [Pg.153]    [Pg.199]    [Pg.205]    [Pg.209]    [Pg.209]    [Pg.127]    [Pg.101]    [Pg.74]    [Pg.486]    [Pg.1286]    [Pg.334]    [Pg.336]    [Pg.99]    [Pg.99]    [Pg.99]    [Pg.125]   
See also in sourсe #XX -- [ Pg.165 ]




SEARCH



How Does the Genetic Algorithm Find Good Solutions

Representation of a Solution in the Genetic Algorithm

Solution algorithms

Solution algorithms based on the Gaussian elimination method

Strings - the Genetic Algorithm Solution

The Algorithms

© 2024 chempedia.info