Big Chemical Encyclopedia

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

Articles Figures Tables About

Ordinary differential equations explicit methods

As discussed in the introduction to this chapter, the solution of ordinary differential equations (ODEs) on a digital computer involves numerical integration. We will present several of the simplest and most popular numerical-integration algorithms. In Sec, 4.4.1 we will discuss explicit methods and in Sec. 4.4.2 we will briefly describe implicit algorithms. The differences between the two types and their advantages and disadvantages will be discussed. [Pg.105]

Depending on the numerical techniques available for integration of the model equations, model reformulation or simplified version of the original model has always been the first step. In the Sixties and Seventies simplified models as sets of ordinary differential equations (ODEs) were developed. Explicit Euler method or explicit Runge-Kutta method (Huckaba and Danly, 1960 Domenech and Enjalbert, 1981 Coward, 1967 Robinson, 1969, 1970 etc) were used to integrate such model equations. The ODE models ignored column holdup and therefore non-stiff integration techniques were suitable for those models. [Pg.108]

In ref 146 the authors present a non-standard (nonlinear) two-step explicit P-stable method of fourth algebraic order and 12th phase-lag order for solving second-order linear periodic initial value problems of ordinary differential equations. The proposed method can be extended to be vector-applicable for multi-dimensional problem based on a special vector arithmetic with respect to an analytic function. [Pg.399]

A few examples will be demonstrated in the following section. Each feature was incorporated in the software because it has been found necessary or useful in some modelling project. All the modelling tasks that previously required tailor made solutions in each project can now be solved in a unified manner in the ModEst environment. ModEst is able to deal with explicit algebraic, implicit algebraic (systems of nonlinear equations) and ordinary differential equations. As the standard way to handle PDE systems, the Numerical Method of Lines, which transforms a PDE system to a number of ODE components is used. In addition, any model with a solver provided may be dealt with as an algebraic system. The basic numerical tools are contained in the well tested public domain software (Bias, Linpack, Eispack, LSODE). [Pg.457]

The modern methods for numerical solution of the initial-value problem for systems of ordinary differential equations (ODE) suppose usually the explicit dependence of the derivative of the solution [7]... [Pg.94]

By this means, the partial differential equation is transferred into an ordinary differential equation in the discrete cosine space. A semi-implicit method is used to trade-off the stability, computing time, and accuracy [39,40]. In order to remove the shortcomings with the small time-step size associated with the exphcit Euler scheme to achieve convergence, the linear fourth-order operators can be treated implicitly while the nonlinear terms can be treated explicitly. The resulting first-order semi-implicit Fourier scheme is ... [Pg.469]

There are explicit and implicit numerical methods for the finite-difference version of Eqs. 9.27 and 9.28. There are also approximate numerical methods in which the radial derivatives are replaced by the functions obtained by differentiating assumed trial functions for the radial profiles, essentially transforming the equations into ordinary differential equations in z. The cell model (Hlavacek and Votruba, 1977) can also be used for the solution. [Pg.422]

Numerical integration techniques are necessary in modeling and simulation of batch and bio processing. In this chapter we described error and stability criteria for numerical techniques. Various numerical techniques for solution of stiff and non-stiff problems are discussed. These methods include one-step and multi-step explicit methods for non-stiff and implicit methods for stiff systems, and orthogonal collocation method for ordinary as well as partial differential equations. These methods are an integral part of some of the packages like MATLAB. However, it is important to know the theory so that appropriate method for simulation can be chosen. [Pg.18]

Solution of a set of nonlinear ordinary differential equations by the explicit Euler method. [Pg.566]

Equations (9.1), (9.2), and (9.3) are ordinary differential equations in which distance is the independent variable. The technique of integration is to start from a perturbed full equilibrium condition at the hot boundary of the ffame and integrate backwards across the ffame by an explicit method. Dixon-Lewis et al. (1979a,b 1981) used a fourth-order Runge-Kutta procedure with variable step size for this purpose. We continue here by reviewing brieffy the application of the method with both partial equilibrium and quasi-steady-state assumptions. [Pg.108]

In ref. 145 the authors develop two families of explicit and implicit BDF methods (Backward Differentiation Methods), for the accurate integration of differential equations with solutions any linear combinations of exponential of matrices, products of the exponentials by polynomials and products of those matrices by ordinary polynomials. More specifically, the authors study the numerical solution of the problem ... [Pg.261]


See other pages where Ordinary differential equations explicit methods is mentioned: [Pg.67]    [Pg.1090]    [Pg.381]    [Pg.317]    [Pg.314]    [Pg.1957]    [Pg.30]    [Pg.232]    [Pg.1343]    [Pg.90]    [Pg.369]    [Pg.518]    [Pg.399]    [Pg.177]    [Pg.221]    [Pg.56]    [Pg.2434]    [Pg.263]    [Pg.383]    [Pg.90]    [Pg.422]   
See also in sourсe #XX -- [ Pg.96 , Pg.97 , Pg.98 ]




SEARCH



Differential equations method

Differential method

Explicit equations

Explicit method

Explicitness

Ordinary differential equation

© 2024 chempedia.info