Big Chemical Encyclopedia

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

Articles Figures Tables About

Finite differences solving differential equations

At modeling infinitely small steps of differential equations (3x, dz and dt) are replaced with steps of finite size (Ax, Ay, Az and At). Value change of any function within the range of these finite steps is called finite difference. Therewith differential equations are replaced by algebraic equations, which may be easily solved with a computer. Thus, the derivative of concentration over coordinate x between nodal points x and (x + Ax) becomes equal... [Pg.577]

Use of Computer Simulation to Solve Differential Equations Pertaining to Diffusion Problems. As shown earlier (Section 4.2.11), differential equations used in the solutions of Fick s second law can often be solved analytically by the use of Laplace transform techniques. However, there are some cases in which the equations can be solved more quickly by using an approximate technique known as the finite-difference method (Feldberg, 1968). [Pg.444]

The numerical methods for solving differential equations are based on replacing the differential equations by algebraic equations. In the case of the popular finite difference method, this is done by replacing the derivatives by differences. Below we demonstrate this with both first- and second-order derivatives. But first we give a motivational e.xample. [Pg.308]

The basic principle behind all finite difference techniques for solving differential equations is to replace all the derivatives by appropriate difference-quotient approximations. The differential equations are thus replaced by a set of difference equations which, after the incorporation of the appropriate boundary conditions, can be solved. The solutions obtained for these difference equations are analytical, and therefore, provided that the difference equations are a good approximation to the differential ones, they will represent good approximate solutions to the differential equations. [Pg.420]

The most complex systems of kinetic equations cannot be solved analytically. In addition, when two of the differential equations of these systems describe processes that occur on drastically different timescales, their numerical integration using methods involving finite increments is unstable and unreliable. These methods are inherently deterministic, since their time evolution is continuous and dictated by the system of differential equations. Alternatively, we can apply stochastic methods to determine the rates of these reactions. These methods are based on the probabihty of a reaction occurring within an ensanble of molecules. This prob-abihstic formulation is a reflection either of the random nature of the coUisions that are responsible for bimolecular reactions or of the random decay of molecules undergoing unimolecular processes. Stochastic methods allow us to study complex reactions without either solving differential equations or supplying closed-form rate equations. The method of Markov chains... [Pg.99]

Finite Difference Method (FDM) is one of the methods used to solve differential equations that are difiicult or impossible to solve analytically. The underlying formula is ... [Pg.101]

With the above formulism a method is now defined for forming a finite difference set of equations for a partial differential equation of the initial value type in time and of the boundary value type in a spatial variable. The method can be applied to both linear and nonlinear partial differential equations. The result is an implicit equation which must be solved for the spatial variation of the solution... [Pg.713]

The Poisson equation has been used for both molecular mechanics and quantum mechanical descriptions of solvation. It can be solved directly using numerical differential equation methods, such as the finite element or finite difference methods, but these calculations can be CPU-intensive. A more efficient quantum mechanical formulation is referred to as a self-consistent reaction field calculation (SCRF) as described below. [Pg.209]

Computer simulation of the reactor kinetic hydrodynamic and transport characteristics reduces dependence on phenomenological representations and idealized models and provides visual representations of reactor performance. Modem quantitative representations of laminar and turbulent flows are combined with finite difference algorithms and other advanced mathematical methods to solve coupled nonlinear differential equations. The speed and reduced cost of computation, and the increased cost of laboratory experimentation, make the former increasingly usehil. [Pg.513]

Errors are proportional to At for small At. When the trapezoid rule is used with the finite difference method for solving partial differential equations, it is called the Crank-Nicolson method. The implicit methods are stable for any step size but do require the solution of a set of nonlinear equations, which must be solved iteratively. The set of equations can be solved using the successive substitution method or Newton-Raphson method. See Ref. 36 for an application to dynamic distillation problems. [Pg.473]

Rigorous error bounds are discussed for linear ordinary differential equations solved with the finite difference method by Isaacson and Keller (Ref. 107). Computer software exists to solve two-point boundary value problems. The IMSL routine DVCPR uses the finite difference method with a variable step size (Ref. 247). Finlayson (Ref. 106) gives FDRXN for reaction problems. [Pg.476]

Discretization of the governing equations. In this step, the exact partial differential equations to be solved are replaced by approximate algebraic equations written in terms of the nodal values of the dependent variables. Among the numerous discretization methods, finite difference, finite volume, and finite element methods are the most common. Tlxe finite difference method estimates spatial derivatives in terms of the nodal values and spacing between nodes. The governing equations are then written in terms of... [Pg.673]

Solving Newton s equation of motion requires a numerical procedure for integrating the differential equation. A standard method for solving ordinary differential equations, such as Newton s equation of motion, is the finite-difference approach. In this approach, the molecular coordinates and velocities at a time it + Ait are obtained (to a sufficient degree of accuracy) from the molecular coordinates and velocities at an earlier time t. The equations are solved on a step-by-step basis. The choice of time interval Ait depends on the properties of the molecular system simulated, and Ait must be significantly smaller than the characteristic time of the motion studied (Section V.B). [Pg.44]

In the finite-difference appntach, the partial differential equation for the conduction of heat in solids is replaced by a set of algebraic equations of temperature differences between discrete points in the slab. Actually, the wall is divided into a number of individual layers, and for each, the energy conserva-tk>n equation is applied. This leads to a set of linear equations, which are explicitly or implicitly solved. This approach allows the calculation of the time evolution of temperatures in the wall, surface temperatures, and heat fluxes. The temporal and spatial resolution can be selected individually, although the computation time increa.ses linearly for high resolutions. The method easily can be expanded to the two- and three-dimensional cases by dividing the wall into individual elements rather than layers. [Pg.1067]

This section describes a number of finite difference approximations useful for solving second-order partial differential equations that is, equations containing terms such as d f jd d. The basic idea is to approximate f 2 z. polynomial in x and then to differentiate the polynomial to obtain estimates for derivatives such as df jdx and d f jdx -. The polynomial approximation is a local one that applies to some region of space centered about point x. When the point changes, the polynomial approximation will change as well. We begin by fitting a quadratic to the three points shown below. [Pg.311]

Usually the finite difference method or the grid method is aimed at numerical solution of various problems in mathematical physics. Under such an approach the solution of partial differential equations amounts to solving systems of algebraic equations. [Pg.777]

The partial differential equations describing the catalyst particle are discretized with central finite difference formulae with respect to the spatial coordinate [50]. Typically, around 10-20 discretization points are enough for the particle. The ordinary differential equations (ODEs) created are solved with respect to time together with the ODEs of the bulk phase. Since the system is stiff, the computer code of Hindmarsh [51] is used as the ODE solver. In general, the simulations progressed without numerical problems. The final values of the rate constants, along with their temperature dependencies, can be obtained with nonlinear regression analysis. The differential equations were solved in situ with the backward... [Pg.172]

The basic principles are described in many textbooks [24, 26]. They are thus only sketchily presented here. In a conventional classical molecular dynamics calculation, a system of particles is placed within a cell of fixed volume, most frequently cubic in size. A set of velocities is also assigned, usually drawn from a Maxwell-Boltzmann distribution appropriate to the temperature of interest and selected in a way so as to make the net linear momentum zero. The subsequent trajectories of the particles are then calculated using the Newton equations of motion. Employing the finite difference method, this set of differential equations is transformed into a set of algebraic equations, which are solved by computer. The particles are assumed to interact through some prescribed force law. The dispersion, dipole-dipole, and polarization forces are typically included whenever possible, they are taken from the literature. [Pg.271]

This then provides a physical derivation of the finite-difference technique and shows how the solution to the differential equations can be propagated forward in time from a knowledge of the concentration profile at a series of mesh points. Algebraic derivations of the finite-difference equations can be found in most textbooks on numerical analysis. There are a variety of finite-difference approximations ranging from the fully explicit method (illustrated above) via Crank-Nicolson and other weighted implicit forward. schemes to the fully implicit backward method, which can be u.sed to solve the equations. The methods tend to increase in stability and accuracy in the order given. The difference scheme for the cylindrical geometry appropriate for a root is... [Pg.340]

Export processes are often more complicated than the expression given in Equation 7, for many chemicals can escape across the air/water interface (volatilize) or, in rapidly depositing environments, be buried for indeterminate periods in deep sediment beds. Still, the majority of environmental models are simply variations on the mass-balance theme expressed by Equation 7. Some codes solve Equation 7 directly for relatively large control volumes, that is, they operate on "compartment" or "box" models of the environment. Models of aquatic systems can also be phrased in terms of continuous space, as opposed to the "compartment" approach of discrete spatial zones. In this case, the partial differential equations (which arise, for example, by taking the limit of Equation 7 as the control volume goes to zero) can be solved by finite difference or finite element numerical integration techniques. [Pg.34]

Equation yx + l- yx = 4>(x) This equation states that the first difference of the unknown function is equal to the given function (p(x). The solution by analogy with solving the differential equation dy/dx = 0(x) by integration is obtained by finite integration or summation. When there are only a finite number of data points, this is easily accomplished by writing yx = y0 + X =i 0(f - 1), where the data points are numbered from 1 to x. This is the only situation considered here. [Pg.35]

Packages to solve boundary value problems are available on the Internet. On the NIST web page http //gams.nist.gov/, choose problem decision tree and then differential and integral equations and then ordinary differential equations and multipoint boundary value problems. On the Netlibweb site http //www.netlib.org/, search on boundary value problem. Any spreadsheet that has an iteration capability can be used with the finite difference method. Some packages for partial differential equations also have a capability for solving one-dimensional boundary value problems [e.g. Comsol Multiphysics (formerly FEMLAB)]. [Pg.54]

Digital simulation is a powerful tool for solving the equations describing chemical engineering systems. The principal difficulties are two (1) solution of simultaneous nonlinear algebraic equations (usually done by some iterative method), and (2) numerical integration of ordinary differential equations (using discrete finite-difference equations to approximate continuous differential equations). [Pg.89]

Transient is a C-program for solving systems of generally non-linear, parabolic partial differential equations in two variables (that is, space and time), in particular, reaction-diffusion equations within the generalized Crank-Nicolson Finite Difference Method. [Pg.303]

The general case must be solved by numerical integration with finite-difference schemes or other approaches to the solution of Equation 5-2 for the species of interest. As written, this equation requires that the partial-differential equation be solved for each species in the reactive... [Pg.208]

Although convection, axial diffusion, and radial diffusion actually occur simultaneously, a multistep procedure was adopted in the finite-difference calculation. For each 5-cm increment in tidal volume and for each time increment At, the differential mass-balance equations were solved for convection, axial difihision, and radial diffusion in that order. This method may slightly underestimate the dosage for weakly soluble gases, because the concentration gradient in the airway may be decreased. [Pg.307]

As indicated above, there are a large number of modeling packages on the market. Some of those are mentioned below. In the vast majority, differential equations that describe the electrochemical setup are solved using numeric methods. Two of the most common methods are the finite-difference method and the finite-elements method. These are discussed in some detail in this chapter, including example calculations in Section 15.3. We begin with a few general remarks. [Pg.249]

Method of Lines. The method of lines is used to solve partial differential equations (12) and was already used by Cooper (I3.) and Tsuruoka (l4) in the derivation of state space models for the dynamics of particulate processes. In the method, the size-axis is discretized and the partial differential a[G(L,t)n(L,t)]/3L is approximated by a finite difference. Several choices are possible for the accuracy of the finite difference. The method will be demonstrated for a fourth-order central difference and an equidistant grid. For non-equidistant grids, the Lagrange interpolation formulaes as described in (15 ) are to be used. [Pg.148]

The simulation of a continuous, evaporative, crystallizer is described. Four methods to solve the nonlinear partial differential equation which describes the population dynamics, are compared with respect to their applicability, accuracy, efficiency and robustness. The method of lines transforms the partial differential equation into a set of ordinary differential equations. The Lax-Wendroff technique uses a finite difference approximation, to estimate both the derivative with respect to time and size. The remaining two are based on the method of characteristics. It can be concluded that the method of characteristics with a fixed time grid, the Lax-Wendroff technique and the transformation method, give satisfactory results in most of the applications. However, each of the methods has its o%m particular draw-back. The relevance of the major problems encountered are dicussed and it is concluded that the best method to be used depends very much on the application. [Pg.159]

The reason for constructing this rather complex model was that even though the mathematical equations may be easily set up using the dispersion model, the numerical solutions are quite involved and time consuming. Deans and Lapidus were actually concerned with the more complicated case of mass and heat dispersion with chemical reactions. For this case, the dispersion model yields a set of coupled nonlinear partial differential equations whose solution is quite formidable. The finite-stage model yields a set of differential-double-difference equations. These are ordinary differential equations, which are easier to solve than the partial differential equations of the dispersion model. The stirred-tank equations are of an initial-value type rather than the boundary-value type given by the dispersion model, and this fact also simplifies the numerical work. [Pg.156]


See other pages where Finite differences solving differential equations is mentioned: [Pg.220]    [Pg.572]    [Pg.1313]    [Pg.1089]    [Pg.17]    [Pg.153]    [Pg.99]    [Pg.468]    [Pg.272]    [Pg.316]    [Pg.103]    [Pg.525]    [Pg.526]    [Pg.265]    [Pg.58]    [Pg.8]    [Pg.171]    [Pg.155]    [Pg.756]    [Pg.4]   
See also in sourсe #XX -- [ Pg.231 , Pg.572 ]




SEARCH



Difference equation

Difference equations, finite

Equation Solving

Solving Differential Equations

© 2024 chempedia.info