Big Chemical Encyclopedia

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

Articles Figures Tables About

Computational methods Computer program

Using computer programs compiicates the problem because the calculation accuracy is never given for commercial reasons. Furthermore, the ways in which the methods are executed are not explicit and the data banks are often considered secret and inaccessible. [Pg.106]

Empirical conformational energy program for peptides (ECEPP) is the name of both a computer program and the force field implemented in that program. This is one of the earlier peptide force fields that has seen less use with the introduction of improved methods. It uses three valence terms that are fixed, a van der Waals term, and an electrostatic term. [Pg.54]

Parameter Estimation. WeibuU parameters can be estimated using the usual statistical procedures however, a computer is needed to solve readily the equations. A computer program based on the maximum likelihood method is presented in Reference 22. Graphical estimation can be made on WeibuU paper without the aid of a computer however, the results caimot be expected to be as accurate and consistent. [Pg.13]

The most recent developments in computational stmctural analysis are almost all based on the direct stiffness matrix method. As a result, piping stress computer programs such as SIMPLEX, ADLPIPE, NUPIPE, PIPESD, and CAESAR, to name a few, use the stiffness method. [Pg.63]

The best approach is to have a computer program check a series of pressure drops and see how energy requirements decrease as surface increases. If this Option is not available, the following simple method can be used to obtain specification sheet values. Start with a pressure drop of 6.9 kPa (1 psi), and anolv three correction factors, F and F, as follows. [Pg.89]

The simulation models of the flow-sheeting system must make frequent requests for properties at specific temperatures, pressures, and compositions. Computer-program calls for such data are usually made in a rigorously defined manner, which is independent of both the point data generation models and the particular components. These point generation routines provide the property values, using selected methods that base their calculations on a set of parameters for each component. [Pg.76]

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]

McAdams (Heat Transmission, 3d ed., McGraw-HiU, New York, 1954) gives various forms of transient difference equations and methods of solving transient conduction problems. The availabihty of computers and a wide variety of computer programs permits virtually routine solution of complicated conduction problems. [Pg.557]

One way of overcoming these disadvantages of the (DCFRR) method is to make estimates of the times required to reach certain values of (DCFRR). For example, how many years will it take to reach (DCFRR)s of 10 percent, 15 percent, 20 percent per year, etc. Although (DCFRR) trial-and-error calculations and (NPV) calculations are tedious if done manually, computer programs which are suitable for programmable pocket calculators can readily be written to make calculations easier. [Pg.815]

However, the total number of equilibrium stages N, N/N,n, or the external-reflux ratio can be substituted for one of these three specifications. It should be noted that the feed location is automatically specified as the optimum one this is assumed in the Underwood equations. The assumption of saturated reflux is also inherent in the Fenske and Underwood equations. An important limitation on the Underwood equations is the assumption of constant molar overflow. As discussed by Henley and Seader (op. cit.), this assumption can lead to a prediction of the minimum reflux that is considerably lower than the actual value. No such assumption is inherent in the Fenske equation. An exact calculational technique for minimum reflux is given by Tavana and Hansen [Jnd. E/ig. Chem. Process Des. Dev., 18, 154 (1979)]. A computer program for the FUG method is given by Chang [Hydrocarbon Process., 60(8), 79 (1980)]. The method is best applied to mixtures that form ideal or nearly ideal solutions. [Pg.1274]

A number of papers have explored methods for the solution of Eqs. (26-29) and (26-31), especially for the two-phase conditions. The reader is referred to the DIERS Project Manual for a more detailed review and list of appropriate references and available computer programs. [Pg.2293]

It was indicated that the original method can be extended on systems where two or three analytes can be determined from a single titration curve. The shifts DpH affected by j-th PT addition should be sufficiently high it depends on pH value, a kind and concentration of the buffer chosen and its properties. The criterion of choice of the related conditions of analysis has been proposed. A computer program (written in MATLAB and DELPHI languages), that enables the pH-static titration to be done automatically, has also been prepared. [Pg.83]

Two standard estimation methods for heat of reaction and CART are Chetah 7.2 and NASA CET 89. Chetah Version 7.2 is a computer program capable of predicting both thermochemical properties and certain reactive chemical hazards of pure chemicals, mixtures or reactions. Available from ASTM, Chetah 7.2 uses Benson s method of group additivity to estimate ideal gas heat of formation and heat of decomposition. NASA CET 89 is a computer program that calculates the adiabatic decomposition temperature (maximum attainable temperature in a chemical system) and the equilibrium decomposition products formed at that temperature. It is capable of calculating CART values for any combination of materials, including reactants, products, solvents, etc. Melhem and Shanley (1997) describe the use of CART values in thermal hazard analysis. [Pg.23]


See other pages where Computational methods Computer program is mentioned: [Pg.283]    [Pg.18]    [Pg.111]    [Pg.156]    [Pg.157]    [Pg.657]    [Pg.95]    [Pg.105]    [Pg.535]    [Pg.255]    [Pg.94]    [Pg.506]    [Pg.559]    [Pg.103]    [Pg.191]    [Pg.209]    [Pg.51]    [Pg.35]    [Pg.195]    [Pg.280]    [Pg.331]    [Pg.364]    [Pg.255]    [Pg.239]    [Pg.161]    [Pg.494]    [Pg.408]    [Pg.45]    [Pg.61]    [Pg.240]    [Pg.62]    [Pg.160]    [Pg.166]    [Pg.481]    [Pg.652]    [Pg.1281]    [Pg.1338]    [Pg.1823]    [Pg.2337]    [Pg.39]   


SEARCH



Computational methods

Computer methods

Computer programming

Fenske-Underwood-Gilliland method computer program

Methods and Computer Programs

Programming Method

Stepping methods computer program

UNIFAC, computer program method

Wang-Henke method computer program

© 2024 chempedia.info