Under relaxation

As in chronoamperograms, the fraction of the overall oxidation charge involved in relaxation processes is quite small in the absence of any external stress. The share of the overall current at every potential between electrochemical processes occurring under relaxation control and those driven by swelling-diffusion control can be observed in Fig. 66. I(r) has... 

A pressure correction scheme based on such an approximation is known as the SIMPLEC algorithm [89]. The SIMPLEC algorithm does not require under relaxation of the pressure correction, is efficient and has found widespread applications. 

The kinetic of adsorption charging of the surface of semiconductor under relaxation of biographic surfacing charge... 

In Fig. 8 of Ref. [8], different nearly-degenerate textured states evolved under relaxational dynamics are shown. In scores of such relaxations, we have found a uniform state only once, for a particular initial-state random seed. 

When uj < 1, we have so-called under-relaxation technique, often used with nonlinear problems. For example, when solving for the non-linear velocity distribution using a shear thinning power law model, the fastest solution is achieved when to = n since n < 1. When to > 1, SOR becomes an over-relaxation technique. 

The above equations can be used to simulate the flow of non-Newtonian fluids with a shear thinning viscosity. This requires an iterative under-relexation scheme where a Newtonian solution is found first. The initial velocity field is used to compute rates of deformation and viscosity. Next, a corrected velocity field is computed with the updated velocities, at which point an under-relaxation is performed using... 

The relaxation of orientation of segments is intrisinsigly included in the theory from the very beginning. Indeed, in Chapter 3, discussing the main assumption of the theory, we assumed that there is an underlying relaxation process, which is described by relaxation equation (3.14), that is... 

Eq. (8.142) is applied sequentially at all internal nodal points, i.e., all points that are not on a wall, to find new values of ft, tJ. The right-hand side of this equation is found using the assumed values of the variables. Under-relaxation is actually used so the updated values of ftjj are actually taken as ... 

Eqs. (8.152) to (8.155) are then used to get updated values of ft on the boundary points. Under-relaxation is also used for these points so the updated values of fli.y at the wall points are actually taken as ... 

The right-hand side of this equation is calculated using the most recent values of the variables. Under-relaxation is actually used so the updated value of 6 is given by ... 

The Kohlrausch Williams-Watts and Havriliak Negami formalisms are equally capable of representing real experimental data, and this is their main value, rather than an ability to explain the underlying relaxation processes. They are rooted in the time and frequency domains, respectively, and there is no analytical way of transforming from one to the other, but their effective equivalence has been convincingly demonstrated by numerical methods (Alvarez, Alegria and Colmenero, 1991). 

T2] H. R. Thieme (1993), Persistence under relaxed point-dissipativity (with an application to an epidemic model), SIAM Journal on Mathematical Analysis 24 407-35. 

Given knowledge of the covalent geometry and fundamental constants underlying relaxation, the spectral densities, J(co), remain to be defined. Here, we adopt the so-called model free treatment due to Lipari and Szabo (1982a,b) which seeks to encapsulate the unique motional character expressed in observed relaxation behavior by defining the spectral density in terms of two local parameters ... 

Even though these two experiments do repr ent evaluations of Ct from H (t) for different parts of the spectrum, it is not safe to conclude from data confined to linear polymers that an underlying relaxation process dominates both molecular processes. Thus, other expressions for H (r) could yield much the same result, except that now the quantity we denote would, perhaps take on new significance. The data on... 

It must be remembered that linear algebraic equations of the form (6.31) are approximate forms of the original non-linear discretized equations. The overall iterative procedure of repeatedly solving linearized equations to obtain solutions of non-linear equations is susceptible to divergence, especially when these are coupled with equations of other variables. In order to control the magnitude of change during each iteration, an under-relaxation parameter, is introduced ... 

The overall algorithm is exactly the same as that of SIMPLE, the only exception being that Eq. (6.43) is used instead of Eq. (6.40) to derive the discretized pressure correction equation. The more consistent approximation proposed in SIMPLEC reduces the need for under-relaxing the pressure. 

Since no terms are omitted when deriving the pressure equation used by SIMPLER, the resulting pressure field corresponds with the velocity field. Therefore, unlike SIMPLE, the correct velocity field results in the correct pressure field. Consequently, SIMPLER does not require under-relaxation of pressure and performs significantly better than SIMPLE. 

---