Big Chemical Encyclopedia

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

Articles Figures Tables About

Finite algorithm method

There are many algorithms for integrating the equations of motion using finite difference methods, several of which are commonly used in molecular dynamics calculations. All algorithms assume that the positions and dynamic properties (velocities, accelerations, etc.) can be approximated as Taylor series expansions ... [Pg.369]

The commercial CFD codes use the finite volume method, which was originally developed as a special finite difference formulation. The numerical algorithm consists of the following steps ... [Pg.785]

Although only approximate analytical solutions to this partial differential equation have been available for x(s,D,r,t), accurate numerical solutions are now possible using finite element methods first introduced by Claverie and coworkers [46] and recently generalized to permit greater efficiency and stabihty [42,43] the algorithm SEDFIT [47] employs this procedure for obtaining the sedimentation coefficient distribution. [Pg.223]

Many diffusion problems cannot be solved anal3dically, such as concentration-dependent D, complicated initial and boundary conditions, and irregular boundary shape. In these cases, numerical methods can be used to solve the diffusion equation (Press et al., 1992). There are many different numerical algorithms to solve a diffusion equation. This section gives a very brief introduction to the finite difference method. In this method, the differentials are replaced by the finite differences ... [Pg.231]

The finite volume methods have been used to discretised the partial differential equations of the model using the Simple method for pressure-velocity coupling and the second order upwind scheme to interpolate the variables on the surface of the control volume. The segregated solution algorithm was selected. The Reynolds stress turbulence model was used in this model due to the anisotropic nature of the turbulence in cyclones. Standard fluent wall functions were applied and high order discretisation schemes were also used. [Pg.11]

P 61] The numerical simulations were based on the solution of the incompressible Navier-Stokes equation and a convection-diffusion equation for a concentration field by means of the finite-volume method [152], The Einstein convention of summation over repeated indices was used. For pressure-velocity coupling, the SIMPLEC algorithm and for discretization of the species concentration equation the QUICK differencing scheme were applied. Hybrid and the central differencing schemes referred to velocities and pressure, respectively (commercial flow solvers CFX4 and CFX5). [Pg.194]

The solution methodology of the determinants is similar to that of the well-known Thomas algorithm used for the numerical solution of a differential equation with the finite-difference method [50]. An essential difference from the Thomas algorithm is that the first step ofthe algorithm here is a so-called backward process. This means that the calculation of T starts from the last sublayer, that is, from the Mth sublayer ofthe determinant and it is continued down to the 1st sublayer. Thus, the value of Ti is obtained directly, in the fist calculation step. Then, applying the known value of Ti, the value of Pi can be obtained by means of the fist boundary condition at X= 0, namely ... [Pg.331]

The computational fluid dynamics investigations listed here are all based on the so-called volume-of-fluid method (VOF) used to follow the dynamics of the disperse/ continuous phase interface. The VOF method is a technique that represents the interface between two fluids defining an F function. This function is chosen with a value of unity at any cell occupied by disperse phase and zero elsewhere. A unit value of F corresponds to a cell full of disperse phase, whereas a zero value indicates that the cell contains only continuous phase. Cells with F values between zero and one contain the liquid/liquid interface. In addition to the above continuity and Navier-Stokes equation solved by the finite-volume method, an equation governing the time dependence of the F function therefore has to be solved. A constant value of the interfacial tension is implemented in the summarized algorithm, however, the diffusion of emulsifier from continuous phase toward the droplet interface and its adsorption remains still an important issue and challenge in the computational fluid-dynamic framework. [Pg.487]

In general case Eqs. (4.60) and (4.61) present infinite sets of the five-term (pentadiagonal) recurrence relations with respect to the index l. In certain special cases (t - 0 or a - 0), they reduce to three-term (tridiagonal) recurrence relations. In this section the sweep procedure for solving such relations is described. This method, also known as the Thomas algorithm, is widely used for recurrence relations entailed by the finite-difference approximation in the solution of differential equations (e.g., see Ref. 61). In our case, however, the recurrence relation follows from the exact expansion (4.60) of the distribution function in the basis of orthogonal spherical functions and free of any seal of proximity, inherent to finite-difference method. Moreover, in our case, as explained below, the sweep method provides the numerical representation of the exact solution of the recurrence relations. [Pg.441]

The equations of motion are integrated by means of the finite-difference methods, most often employing either the original Verlet algorithm, in which... [Pg.233]

Coupled methods (transport model coupled with hydrogeochemical code) For coupled models solving the transport equation can be done by means of the finite-difference method (and finite volumes) and of the finite-elements method. Algorithms based on the principle of particle tracking (or random walk), as for instance the method of characteristics (MOC), have the advantage of not being prone to numerical dispersion (see 1.3.3.4.1). [Pg.63]

Methods applying reverse differences in time are called implicit. Generally these implicit methods, as e.g. the Crank-Nicholson method, show high numerical stability. On the other side, there are explicit methods, and the methods of iterative solution algorithms. Besides the strong attenuation (numeric dispersion) there is another problem with the finite differences method, and that is the oscillation. [Pg.64]

In conclusion, I should note that modern seismic migration algorithms are based mostly on finite-difference methods of the solution of back propagation problems. However, a description of these methods lies beyond the scope of this book. [Pg.518]

A reactor engineer frequently encounters turbulent, multiphase and reactive flows, which are more complex than those discussed in the previous chapter. In this chapter, modifications or special techniques/algorithms required to extend the finite volume method to handle such complexities are discussed. In addition, some of the practical issues involved in carrying out numerical simulations of complex flow models are also discussed. [Pg.191]

In this approach, the finite volume methods discussed in the previous chapter can be applied to simulate the continuous fluid (in a Eulerian framework). Various algorithms for treating pressure-velocity coupling, and the discussion on other numerical issues like discretization schemes are applicable. The usual interpolation practices (discussed in the previous chapter) can be used. When solving equations of motion for a continuous fluid in the presence of the dispersed phase, the major differences will be (1) consideration of phase volume fraction in calculation of convective and diffusive terms, and (2) calculation of additional source terms due to the presence of dispersed phase particles. For the calculation of phase volume fraction and additional source terms due to dispersed phase particles, it is necessary to calculate trajectories of the dispersed phase particles, in addition to solving the equations of motion of the continuous phase. [Pg.204]


See other pages where Finite algorithm method is mentioned: [Pg.248]    [Pg.248]    [Pg.358]    [Pg.209]    [Pg.308]    [Pg.180]    [Pg.296]    [Pg.110]    [Pg.299]    [Pg.270]    [Pg.121]    [Pg.194]    [Pg.213]    [Pg.65]    [Pg.537]    [Pg.75]    [Pg.217]    [Pg.464]    [Pg.492]    [Pg.166]    [Pg.99]    [Pg.64]    [Pg.248]    [Pg.251]    [Pg.281]    [Pg.248]    [Pg.17]    [Pg.359]    [Pg.366]    [Pg.220]    [Pg.5]    [Pg.6]    [Pg.153]    [Pg.166]    [Pg.197]   


SEARCH



Algorithm methods

© 2024 chempedia.info