Big Chemical Encyclopedia

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

Articles Figures Tables About

Euler solution

Program DGC01 is direct Euler solution of carbon dioxide exchange... [Pg.11]

Implicit Euler solutions for a cooling amorphous thermoplastic plate. [Pg.417]

At this point it is useful to make comparisons to the Euler solution of the reaction-diffusion equation. If we measure time in units of At so that t/At —> t, we can write Eq. [2] (dropping the subscript X) as,... [Pg.233]

Consequently, the midpoint method increases accuracy by one order. Obviously the increased order of accuracy leads to a better approximation than the Euler solution, as shown in Figure 6.5. [Pg.85]

FIGURE 5.7 Euler solution for three simultaneous ODE-IVPs. [Pg.111]

It is a property of this family of differential equations that the sum or difference of two solutions is a solution and that a constant (including the constant i = / ) times a solution is also a solution. This accounts for the acceptability of forms like A (t) = Acoscot, where the constant A is an amplitude factor governing the maximum excursion of the mass away from its equilibrium position. The exponential form comes from Euler s equation... [Pg.95]

Starting with an initial value of and knowing c t), Eq. (8-4) can be solved for c t + At). Once c t + At) is known, the solution process can be repeated to calciilate c t + 2At), and so on. This approach is called the Euler integration method while it is simple, it is not necessarily the best approach to numerically integrating nonlinear differential equations. To achieve accurate solutions with an Eiiler approach, one often needs to take small steps in time. At. A number of more sophisticated approaches are available that allow much larger step sizes to be taken but require additional calculations. One widely used approach is the fourth-order Bunge Kutta method, which involves the following calculations ... [Pg.720]

Solution of Batch-Mill Equations In general, the grinding equation can be solved by numerical methods—for example, the Luler technique (Austin and Gardner, l.st Furopean Symposium on Size Reduction, 1962) or the Runge-Kutta technique. The matrix method is a particiilarly convenient fornmlation of the Euler technique. [Pg.1836]

An alternative procedure is the dynamic programming method of Bellman (1957) which is based on the principle of optimality and the imbedding approach. The principle of optimality yields the Hamilton-Jacobi partial differential equation, whose solution results in an optimal control policy. Euler-Lagrange and Pontrya-gin s equations are applicable to systems with non-linear, time-varying state equations and non-quadratic, time varying performance criteria. The Hamilton-Jacobi equation is usually solved for the important and special case of the linear time-invariant plant with quadratic performance criterion (called the performance index), which takes the form of the matrix Riccati (1724) equation. This produces an optimal control law as a linear function of the state vector components which is always stable, providing the system is controllable. [Pg.272]

Cambray, P., B. Deshaies, and P. Clavin. 1979. Solution des equations d Euler associees a I expansion d une sphere a vitesse constante. Journal de Physique. Coll. C8, 40(ll) 19-24. [Pg.138]

Euler s equation is thus recovered as a direct consequence of momentum conservation, but only via the zeroth-order approximation to the full solution to the Boltzman-equation. [Pg.483]

The theory for this problem is well known. The following necessary condition, which must be satisfied, is Euler s equation for isoperimetric problems (usually used to construct the solution) ... [Pg.306]

In this chapter we described Euler s method for solving sets of ordinary differential equations. The method is extremely simple from a conceptual and programming viewpoint. It is computationally inefficient in the sense that a great many arithmetic operations are necessary to produce accurate solutions. More efficient techniques should be used when the same set of equations is to be solved many times, as in optimization studies. One such technique, fourth-order Runge-Kutta, has proved very popular and can be generally recommended for all but very stiff sets of first-order ordinary differential equations. The set of equations to be solved is... [Pg.77]

The right-hand sides of these equations are evaluated using the old values that correspond to position z. A similar Euler-type solution is used for one of Equations (3.14), (3.15), or (3.17) to calculate P e and an ODE from Chapter 5 is solved in the same way to calculate T ew... [Pg.90]

Flow in a Slit. Turning to a slit geometry, a flat velocity profile gives the simplest possible solution using Euler s method. The stability limit is independent of y ... [Pg.288]

The overall solution is based on the method of lines discussed in Chapter 8. The resulting DDEs can then be solved by any convenient method. Appendix 13.2 gives an Excel macro that solves the DDEs using Euler s method. Figure 13.9 shows the behavior of the streamlines. [Pg.501]

When the IRP is traced, successive points are obtained following the energy gradient. Because there is no external force or torque, the path is irrotational and leaves the center of mass fixed. Sets of points coming from separate geometry optimizations (as in the case of the DC model) introduce the additional problem of their relative orientation. In fact, the distance in MW coordinates between adjacent points is altered by the rotation or translation of their respeetive referenee axes. The problem of translation has the trivial solution of centering the referenee axes at the eenter of mass of the system. On the other hand for non planar systems, the problem of rotations does not have an analytical solution and must be solved by numeiieal minimization of the distanee between sueeessive points as a funetion of the Euler angles of the system [16,24]. [Pg.253]

Figure 10.1 Schematic diagram of the sequential solution of model and sensitivity equations. The order is shown for a three parameter problem. Steps l, 5 and 9 involve iterative solution that requires a matrix inversion at each iteration of the fully implicit Euler s method. All other steps (i.e., the integration of the sensitivity equations) involve only one matrix multiplication each. Figure 10.1 Schematic diagram of the sequential solution of model and sensitivity equations. The order is shown for a three parameter problem. Steps l, 5 and 9 involve iterative solution that requires a matrix inversion at each iteration of the fully implicit Euler s method. All other steps (i.e., the integration of the sensitivity equations) involve only one matrix multiplication each.
Eq. 23 is the so-called Bernoulli-Euler beam equation. The solution to this fourth-order equation contains four constants and is written in the form,... [Pg.147]


See other pages where Euler solution is mentioned: [Pg.233]    [Pg.233]    [Pg.455]    [Pg.473]    [Pg.475]    [Pg.1350]    [Pg.24]    [Pg.422]    [Pg.40]    [Pg.40]    [Pg.44]    [Pg.61]    [Pg.121]    [Pg.126]    [Pg.272]    [Pg.570]    [Pg.473]    [Pg.209]    [Pg.414]    [Pg.416]    [Pg.155]    [Pg.174]    [Pg.124]    [Pg.260]    [Pg.32]    [Pg.241]    [Pg.49]    [Pg.49]    [Pg.51]   
See also in sourсe #XX -- [ Pg.233 ]




SEARCH



Comparison of Euler and backward Eulers methods with exact solution

Comparison of Eulers method with exact solution

Euler

MRM solution of the Euler equation

Solutions of Eulers equations

© 2024 chempedia.info