Big Chemical Encyclopedia

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

Articles Figures Tables About

Runge-Kutta implicit

The IE and IM methods described above turn out to be quite special in that IE s damping is extreme and IM s resonance patterns are quite severe relative to related symplectic methods. However, success was not much greater with a symplectic implicit Runge-Kutta integrator examined by Janezic and coworkers [40],... [Pg.244]

D. Janezic and B. Orel. Implicit Runge-Kutta method for molecular dynamics integration. J. Chem. Info. Comp. Sd., 33 252-257, 1993. [Pg.259]

Janezic, D., Orel, B. Implicit Runge-Kutta Method for Molecular Dynamics Integration. J. Chem. Inf. Comput. Sci. 33 (1993) 252-257 Janezic, D., Orel, B. Improvement of Methods for Molecular Dynamics Integration. Int. J. Quant. Chem. 51 (1994) 407-415... [Pg.346]

To check the effect of integration, the following algorithms were tried Euler, explicit Runge-Kutta, semi-implicit and implicit Runge-Kutta with stepwise adjustment. All gave essentially identical results. In most cases, equations do not get stiff before the onset of temperature runaway. Above that, results are not interesting since tubular reactors should not be... [Pg.168]

Note that potential control profile discontinuities are allowed at each element location with error restrictions directly enforced for each element. For a sufficient number of elements (which can be determined by the algorithm in the previous section), the element can be as large as allowed by an active error constraint, or it can act as a degree of freedom for the control profile discontinuity, with its corresponding error constraint inactive. Otherwise, (35) is based on the implicit Runge-Kutta (IRK) or collocation... [Pg.239]

For simultaneous solution of (16), however, the equivalent set of DAEs (and the problem index) changes over the time domain as different constraints are active. Therefore, reformulation strategies cannot be applied since the active sets are unknown a priori. Instead, we need to determine a maximum index for (16) and apply a suitable discretization, if it exists. Moreover, BDF and other linear multistep methods are also not appropriate for (16), since they are not self-starting. Therefore, implicit Runge-Kutta (IRK) methods, including orthogonal collocation, need to be considered. [Pg.240]

Ascher, U. M., and Petzold, L. R., Projected implicit Runge-Kutta methods for differential algebraic equations, SIAM J. Num. Anal. 28(4), 1097 (1991). [Pg.252]

Petzold, L. R., Order results for implicit Runge-Kutta methods applied to differential/algebraic," SIAM Journal on Numerical Analysis, No. 4, pp. 837-852 (1986). [Pg.256]

M72 Solution of stiff differential equations semi-implicit Runge-Kutta method with backsteps Rosenbrock-Gottwa1d-Wanner 7200 7416... [Pg.14]

The basic formula of the semi-implicit Runge-Kutta methods is similar to... [Pg.273]

This method often requires very small integration step sizes to obtain a desired level of accuracy. Runge-Kutta integration has a higher level of accuracy than Euler. It is also an explicit integration technique, since the state values at the next time step are only a function of the previous time step. Implicit methods have state variable values that are a function of both the beginning and end of the current... [Pg.132]

M is a singular Matrix. Zero entries on the main diagonal of this matrix identify the algebraic equations, and all other entries which have the value 1 represent the differential equation. The vector x describes the state of the system. As numeric tools for the solution of the DAE system, MATLAB with the solver odel5s was used. In this solver, a Runge Kutta procedure is coupled with a BDF procedure (Backward Difference Formula). An implicit numeric scheme is used by the solver. [Pg.479]

One-step algorithms have been developed and used by Prothero et al. [146, 166], Cdme et al. [156, 168], Pratt [177], Villadsen et al. [178] and Layokun and Slater [179]. Embedded semi-implicit Runge—Kutta algorithms have been discussed by Lapidus and co-workers [180]. [Pg.307]

In general, a Rosenbrock method consists of a number s of stages. At each stage, a Runge-Kutta-type ki value is calculated, from explicit rearrangement of implicit equations for these. At stage i, the equation is... [Pg.69]

Various integration methods were tested on the dynamic model equations. They included an implicit iterative multistep method, an implicit Euler/modified Euler method, an implicit midpoint averaging method, and a modified divided difference form of the variable-order/variable-step Adams PECE formulas with local extrapolation. However, the best integrator for our system of equations turned out to be the variable-step fifth-order Runge-Kutta-Fehlberg method. This explicit method was used for all of the calculations presented here. [Pg.344]


See other pages where Runge-Kutta implicit is mentioned: [Pg.236]    [Pg.236]    [Pg.475]    [Pg.475]    [Pg.478]    [Pg.1343]    [Pg.27]    [Pg.259]    [Pg.51]    [Pg.51]    [Pg.54]    [Pg.222]    [Pg.241]    [Pg.273]    [Pg.622]    [Pg.213]    [Pg.68]    [Pg.134]    [Pg.166]    [Pg.167]    [Pg.259]    [Pg.302]    [Pg.302]    [Pg.305]    [Pg.1166]    [Pg.426]   


SEARCH



Implicit

Runge

Runge-Kutta

Rungs

© 2024 chempedia.info