Iterative methods problems

In this section we deal with the simplified nonpenetration condition of the crack faces considered in the previous section. We formulate the model of a plate with a crack accounting for only horizontal displacements and construct approximate equations using penalty and iterative methods. The convergence of these solutions is proved and its application to the onedimensional problem is discussed. Analytical solutions for the model of a bar with a cut are obtained. The results of this section can be found in (Kovtunenko, 1996c, 1996d). 

Kovtunenko V.A. (1993) An iterative methods for solving variational inequalities of the contact elastoplastic problem by the penalty method. Comp. Maths. Math. Phys. 33 (9), 1245-1249. 

Computer solutions entail setting up component equiUbrium and component mass and enthalpy balances around each theoretical stage and specifying the required design variables as well as solving the large number of simultaneous equations required. The expHcit solution to these equations remains too complex for present methods. Studies to solve the mathematical problem by algorithm or iterational methods have been successflil and, with a few exceptions, the most complex distillation problems can be solved. 

Elliptic Equations Elhptic equations can be solved with both finite difference and finite element methods. One-dimensional elhptic problems are two-point boundary value problems. Two- and three-dimensional elliptic problems are often solved with iterative methods when the finite difference method is used and direct methods when the finite element method is used. So there are two aspects to consider howthe equations are discretized to form sets of algebraic equations and howthe algebraic equations are then solved. 

Example 4 Shortcut Calculation Case B Let iis solve the problem in Example 2 hy assuming case B. The solute (acetic acid) concentration is low enough in the extract so that we may assume that the mutual solubilities of the solvents remain nearly constant. The material balance can be calculated by an iterative method. 

As illustrated above, even quite small systems at the CISD level results in millions of CSFs. The variational problem is to extract one or possibly a few of the lowest eigenvalues and -veetors of a matrix the size of millions squared. This cannot be done by standard diagonalization methods where all the eigenvalues are found. There are, however, iterative methods for extraeting one, or a few, eigenvalues and -veetors of a large matrix. The Cl problem eq. (4.6) may be written as... 

Remark Quite often, the Dirichlet problem is approximated by the method based on the difference approximation at the near-boundary nodes of the Laplace operator on an irregular pattern, with the use of formulae (14) instead of (16) at the nodes x G However, in some cases the difference operator so constructed does not possess several important properties intrinsic to the initial differential equation, namely, the self-adjointness and the property of having fixed sign, For this reason iterative methods are of little use in studying grid equations and will be excluded from further consideration. 

Other iterative methods apply equally well to problem (2). Among them the method with the recurrence relation... 

Direct and iterative methods. Recall that the final results of the difference approximation of boundary-value problems associated with elliptic equations from Chapter 4 were various systems of linear algebraic equations (difference or grid equations). The sizes of the appropriate matrices are extra large and equal the total number N of the grid nodes. For... 

Iterative methods of successive approximation are in common usage for rather complicated cases of arbitrary domains, variable coefficients, etc. Throughout the entire section, the Dirichlet problem for Poisson s equation is adopted as a model one in the rectangle G = 0 < x < l, a = 1,2 with the boundary P ... 

A model problem. Comparison of methods. Further comparison of various iterative methods will be conducted by having recourse to the Dirichlet problem associated with Poisson s equation in the square 0 < < 1,... 

Recall that it is fairly common to write the iteration number k over the sought function y within the frameworks of iterative methods available for difference equations. The same procedure works in the simple iteration scheme (SIS) which has been designed for problem (37) ... 

Some situations, however result in the form of second-order diffferential equations, which often give rise to problems of the split boundary type. In order to solve this type of problem, an iterative method of solution is required, in which an unknown condition at the starting point is guessed, the differential equation integrated twice and the resulting solution compared with a known boundary condition, obtained at the end point of the calculation. Any error between the known value and the calculated value can then be used to revise the initial starting guess for the next iteration. This procedure is then repeated until... 

The minimization of this functional presents a problem which for many component mixtures can be quite timeconsuming if the truly optimal form of the interface and free energy is to be found. One may use an iterative method of solution much like the famous scheme used to solve for the Hartree-Fock wave function in electronic structure calculations [4]. An alternative, much to be preferred when sufficiently accurate, is to use a simple parametrized form for the particle densities through the interface and then determine the optimal values of these parameters. The simplest possible scheme is, of course, to take the profile to be a step function. 

We use a method that implements the Unbiased Prediction Risk criterion [13] to provide a data-driven approach for the selection of the regularization parameter. The equality constraints are handled with LQ factorization [14] and an iterative method suggested by Villalobos and Wahba [15] is used to incorporate the inequality constraints [10]. The method is well suited for the relatively large-scale problem associated with analyzing each image voxel as no user intervention is required and all the voxels can be analyzed in parallel. 

But, computational difficulties can arise due to the iterative methods used to solve recycle problems and obtain convergence. A major limitation of modular-sequential simulators is the inability to simulate the dynamic, time dependent, behaviour of a process. 

Because Eq. (22) is implicit in /, an iterative method of solution must be employed. However, the convergence of this iteration usually presents no difficulty (B5, D2). Bending and Hutchison (B5) noted that in pipeline network calculations it was not necessary to calculate exact friction factors for each overall network iteration. In their experience the problem could be solved satisfactorily with single updating of factors for each overall iteration. This truncation results in significant reduction of computing time. In all... 

Iterative Methods for Steady-State Pipeline Network Problems... 

On the subject of comparing iterative methods a word of caution is in order. Clearly in any quantitative comparison, the termination criteria should be comparable and the benchmark problems should be run on the same computer. Yet even for simple problems and methods, these two requirements prove to be difficult to enforce and insufficient to ensure meaningful comparisons. To allow for the fact that different methods do not terminate at exactly the same point even when the same termination criterion is used, Broyden (B13) introduced a mean convergence rate, R, which is... 

Finally, a special point to look for in comparing iterative methods for pipeline network problems is to use the same problem formulation for both methods otherwise the results may reflect differences in formulations as well as iterative methods. 

Sparse matrices are ones in which the majority of the elements are zero. If the structure of the matrix is exploited, the solution time on a computer is greatly reduced. See Duff, I. S., J. K. Reid, and A. M. Erisman (eds.), Direct Methods for Sparse Matrices, Clarendon Press, Oxford (1986) Saad, Y., Iterative Methods for Sparse Linear Systems, 2d ed., Society for Industrial and Applied Mathematics, Philadelphia (2003). The conjugate gradient method is one method for solving sparse matrix problems, since it only involves multiplication of a matrix times a vector. Thus the sparseness of the matrix is easy to exploit. The conjugate gradient method is an iterative method that converges for sure in n iterations where the matrix is an n x n matrix. 

The examples in the previous section demonstrate that nonunique solutions to the equilibrium problem can occur when the modeler constrains the calculation by assuming equilibrium between the fluid and a mineral or gas phase. In each example, the nonuniqueness arises from the nature of the multicomponent equilibrium problem and the variety of species distributions that can exist in an aqueous fluid. When more than one root exists, the iteration method and its starting point control which root the software locates. 

An iterative method of solution of problem (5.35) was designed by Crowe (1986), and we have discussed, in the previous chapter, the strategy for the case when Q-R orthogonal factorizations are applied. The stages of the procedure are as follows ... 

Those equilibrium processes that can be resolved explicitly are straightforwardly modelled in Excel. While it is possible to solve equilibrium problems of essentially any complexity in Excel, it is virtually impossible to develop a reasonable spreadsheet for the modelling of a complex titration. Iterative methods are generally difficult to implement in Excel. 

---