Big Chemical Encyclopedia

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

Articles Figures Tables About

Stepping methods computer program

Fault Tree Solution. Solving the fault tree means obtaining the minimal cut sets. The minimal cut sets are all the combinations of equipment failures that can result in the fault tree TOP event. Computer programs are requked to determine the minimal cut sets for large fault trees (72). The solution method has four steps ... [Pg.84]

Normally, we stop the step-size determination here and we proceed to perform another iteration of Gauss-Newton method. This is what has been implemented in the computer programs accompanying this book. [Pg.140]

To apply Eq. 22-36, you need a method for evaluating the integral in the numerator from the temperature data and lake areas which are available at discrete depths only. You know that in the age of computers nobody would really execute such a computation by hand anymore. Yet, even if you use a computer program you make a certain choice as to how you are going to approximate the integral, although in many cases you are not aware of it. Thus it may be instructive to learn from a simple example, step by step, how the calculation proceeds. [Pg.1026]

Typical plots of AE vs. a dimensionless function of tV2 in Fig. 7 are reproduced from a discussion of the potentialities of the galvanostatic step method given by Kooijman and Sluyters [32], It is seen that, at sufficiently large times, AE becomes a linear function of t1/2. At first [31], analysis procedures of the complex AE vs. tvl relation were based on extrapolation of this linear section to tyl = 0, yielding the intercepts indicated in Fig. 7. However, it has been shown that, in this way, the content of information about the kinetic parameters, k and a, is not optimally utilized [32], Therefore, numerical analysis of the complete AE vs. t response with the aid of suitable computer programs has to be advocated. In principle, such an analysis yields the values of X, R , and Cd as well as a check on the validity of eqn. (30). [Pg.224]

The Erwin two-film (ETF) tray efficiency method is listed in the following four steps. This is a program subroutine copied from the fractionation tray computer program Chemcalc 13 [1], This tray efficiency method has been used successfully for over a decade and has hundreds of successful applications. It is presented here for you to apply as a supplemental to the other, more expensive computer simulation programs to make them more complete. Key variable nomenclatures follow. [Pg.92]

Equations 6-94 and 6-97 are first order differential equations, and it is possible to solve for both the conversion and temperature of hydrogenation of nitrobenzene relative to the reactor length of 25 cm. A computer program PLUG61 has been developed employing the Runge-Kutta fourth order method to determine the temperature and conversion using a catalyst bed step size of 0.5 cm. Table 6-6 shows... [Pg.489]

Several methods have been published to simulate the time-evolution of an ionization track in water. Monte Carlo (with the IRT method or step-by-step) and deterministic programs including spur diffusion are the main approaches. With the large memory and powerful computer now available, simulation has become more efficient. The modeling of a track structure and reactivity is more and more precise and concepts can now be embedded in complex simulation programs. Therefore corrections of rate constants with high concentrations of solutes in the tracks and the concept of multiple ionizations have improved the calculation of G-values and their dependence on time. [Pg.247]

Use method (iv) to find p and Y. Make an initial estimate of T b, e.g., using a psychrometric chart, or (for air-water system) by estimating adiabatic saturation temperature Findpwb from psychrometer equation (12-11). Calculate new value corresponding to p b by reversing Eq. (12-4) or using the Antoine equation (12-5). Repeat last two steps to solve iteratively for T b (computer program is preferable method). [Pg.1335]


See other pages where Stepping methods computer program is mentioned: [Pg.180]    [Pg.506]    [Pg.103]    [Pg.45]    [Pg.85]    [Pg.140]    [Pg.10]    [Pg.72]    [Pg.56]    [Pg.133]    [Pg.184]    [Pg.63]    [Pg.253]    [Pg.165]    [Pg.330]    [Pg.165]    [Pg.97]    [Pg.119]    [Pg.266]    [Pg.300]    [Pg.203]    [Pg.292]    [Pg.247]    [Pg.451]    [Pg.194]    [Pg.191]    [Pg.170]    [Pg.40]    [Pg.345]    [Pg.36]    [Pg.409]    [Pg.273]    [Pg.192]    [Pg.248]    [Pg.58]    [Pg.718]    [Pg.2757]    [Pg.176]    [Pg.62]    [Pg.10]    [Pg.606]   


SEARCH



12-step programs

Computational methods

Computational methods Computer program

Computer methods

Computer programming

Programming Method

Step methods

© 2024 chempedia.info