Big Chemical Encyclopedia

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

Articles Figures Tables About

Time subinterval

Targeting is performed by cascading water from one concentration interval to the next, until the last concentration interval. Within each concentration interval, water is cascaded from one time subinterval to the next without degradation. This appears to be the mass transfer version of the targeting procedure presented for heat exchangers. [Pg.251]

Secondly, the network layout showed in Fig. 12.7 shows that 12.5 t of water should be supplied to Process 3, instead of 25 t stipulated in the problem specification. This can only be true if this process does not have flowrate constraints, but has a fixed mass load. The assumption of fixed mass loads was never mentioned in the analysis. This variation of flowrate is contrary to the assumption made in targeting. During targeting it was implicitly assumed that the flowrates were fixed as shown by the calculation of water demand in each of the time subintervals. [Pg.253]

It is worthy of note that the problem solution is such that in each time subinterval, the concentration constraints is met. This implies that, as long as water is available at the right time, it can safely be reused in any of the time subintervals within the concentration interval, i.e. the secondary constraints (concentration) is met in every step of the analysis, and the primary constraints (time) guides the formulation of the final solution (target design network). [Pg.256]

Figure 12.11 represents targeting in interval (0.25-0.51 kg salt/kg water). This interval, as shown in Fig. 12.8, has the B and the C reactions with an overall water demand of 560 kg. Since both these reactions start before the completion of the washing operation of product A, no reusable water is available in the reaction time subintervals. This implies that fresh water will have to be used. The accumulated fresh water demand is, therefore, 1560 kg. As this is the last concentration interval, this quantity presents itself as the target for the optimal design. This is equivalent to a 34% reduction in freshwater demand compared to the base case. [Pg.258]

Instead of splitting the problem into concentration intervals and time subintervals, the problem is split into time intervals and concentration subintervals, with water demand plotted on the horizontal axis. The boundaries for time intervals and concentration subintervals are set by the process end-points. However, unlike in a case where time is taken as a primary constraints, the streams that are required or available for reuse in each concentration subinterval are plotted separately. This approach has proven to ease the analysis as will be shown later in this section. [Pg.264]

A = is the dimensionless thickness parameter, p is the number of time subintervals, and / is the series number of time subintervals (see Appendix). [Pg.132]

The applicability of the foregoing procednre has been tested by modeling simple reaction under semi-infinite diffusion conditions (reaction 1.1) and EC mechanism coupled to adsorption of the redox couple (reaction (2.177)) [2]. The solutions derived by the original and modified step-function method have been compared in order to evaluate the error involved by the proposed modification. As expected, the precision of the modified step-function method depends solely on the value of p, i.e., the number of time subintervals. For instance, for the complex EC mechanism, the error was less than 2% for p>20. This slight modification of the mathematical procedure has opened the gate toward modeling of very complex electrode mechanisms such as those coupled to adsorption equilibria and regenerative catalytic reactions [2] and various mechanisms in thin-film voltammetry [5-7]. [Pg.188]

In the sequential strategy, a control (manipulated) variable profile is discretized over a time interval. The discretized control profile can be represented as a piecewise constant, a piecewise linear, or a piecewise polynomial function. The parameters in such functions and the length of time subinterval become decision variables in optimization problem. This strategy is also referred to a control vector parameterization (CVP). [Pg.105]

The principle of matrix addressing is shown in Fig. 4.18 [94]. The rows of the matrix are subsequently addressed in equal time subintervals (T/3) by pulses of the amplitude C/s- In each time subinterval all the columns of the matrix display are addressed simultaneously with pulses of the amplitude C/d. The sign of the column pulse depends on whether an element of the matrix display (pixel) should be in the off or on state. Sometimes on and off states of the pixel are called selected and nonselected states. Figure 4.18 demonstrates that the effective (root mean square) voltages on... [Pg.166]

Figure 12.13 represents targeting interval (0.25-0.51 kg salt/kg water) with water from the B wash reused in the C wash. Note that there is no longer any available water in the (4-5.5 h) subinterval, since it was transferred to the (6-7.5 h) subinterval, where it was used in the C wash. The amount of water remaining from the A wash is now 600 kg, since only 400 kg was reused for the washes. Nonetheless, there is still a need for 560 kg of fresh water due to the time constraints as mentioned previously. [Pg.259]

Available water from one concentration subinterval in a specific time interval is cascaded throughout the subsequent concentration subintervals, either within the same or subsequent time intervals without degeneration. This simply means that water which is available in any concentration subinterval can never be reused within the same concentration subinterval, irrespective of the time interval. If possible any surplus is transferred to higher concentration subintervals in the same time interval for reuse, or stored for reuse in later time intervals. However, this water cannot be reused in lower concentration subintervals or previous time intervals. Any shortfall within any concentration subinterval can be made up from lower concentration subintervals from previous time intervals, or from fresh water. As in the previous case, the eventual surplus becomes the system effluent and the accumulated fresh water make up constitutes the system intake. [Pg.264]

The first term on the right hand side of Eq. (1) gives the amount of particles of / th size at the moment of time tn which neither moved forwards nor broke during one time step of simulation. The second term represents those particles of the same size that moved backwards from the second section. The third term expresses the amount of particles that remained in the first section and have broken from some size higher than x, to that subinterval of size. Term ai(tn) denotes the amount of particles of the / th size that freshly enters the system. Finally, the last term ( Vf - Vb) f(xi-( 1/2)) p(yj, Xi, tn-d) is the fraction of particles of the /th size that left the mill at the moment of time tn-d and was classified by the classifier to recycle into the mill for further grinding. Here, function ///,. 0 < x/j, = t (x,) < 1, describes the operation of the classifier, whilst parameter d denotes the discrete time delay in the recirculation line. [Pg.275]

To pose the optimal control problem as a nonlinear programming (NLP) problem the controls u t) are approximated by a finite dimensional representation. The time interval [t0, r r] is divided into a finite number of subintervals (Ns), each with a set of basis functions involving a finite number of parameters u(t) = t, zj), te[( tj.i, tj), j = 1,2,. . J ], where tj = tF. The functions switching time tpj = 1,2,..., J. The control constraints now become ... [Pg.137]

On the other hand, if the position r(n) of the particle is smaller than the decay length of the interaction potential, the external foroe experienced by the particle during the time interval t < t < cannot be assumed constant because the interaction potential is a strong function of position. In order to discretize the generalized Langevin equation, the time interval t < t < t +i is further subdivided into K subintervals such that the... [Pg.37]

Finally, there is another mode of operation for ees. If one considers the total simulation time as a single step, this can be subdivided into a number of exponentially expanding subintervals in the same manner as the above description of subdivision of the first interval. This was first suggested by Peaceman and Rachford in 1955 [436], in their famous paper describing the ADI method (see Chap. 12), and was used later [236,355]. It is routinely used by Svir and coworkers [538, 540]. These workers tend to use strong expansion with 7 = 2, which has been found not to be optimal [149], The method requires a large number of recalculations of the coefficients and thus uses more computer time than equal intervals with a damping device applied to the first interval. [Pg.129]

Signal-noise separation (SNS) by Froissart doublets within the FPT<+) and FPT( ) is illustrated in Figures 4.10 and 4.11 for the noise-free and noise-corrupted time signals, respectively. Only a small number of all the obtained Froissart doublets appears in the shown frequency window in Figure 4.10. The selected subinterval 0-6 ppm is important because all the MR-detectable brain metabolites lie within this chemical shift domain of the full Nyquist range. Froissart doublets as spurious resonances are detected by the confluence of poles and zeros in the list of the Pade-reconstructed spectral parameters. [Pg.247]

In our current work, expectation values of exp(-AV/ 7) are calculated by performing MD simulations (50 ps with a 0.5 fs time step) at individual steps defined by A. = i(AX). It was determined that in order to establish an ensemble of clay/water systems at each step, it was sufficient to select several hundred ( 400) instantaneous molecular configurations at random from the second half of each MD run. The collection of molecular configurations in each ensemble was then used to compute, according to Eq. [16], AG for each subinterval (X + 5A or A - 8A,) along the mutation path. [Pg.271]

The probability that the particle will not decay in a small time interval is then 1 — d t). If we now divide the interval (r) — t ) into n subintervals of length d, the probability that the particle will not decay in any of these subintervals is (1 — d ). Taking the limit as d 0, show that (17.8) becomes... [Pg.913]


See other pages where Time subinterval is mentioned: [Pg.220]    [Pg.256]    [Pg.272]    [Pg.100]    [Pg.205]    [Pg.98]    [Pg.403]    [Pg.182]    [Pg.220]    [Pg.256]    [Pg.272]    [Pg.100]    [Pg.205]    [Pg.98]    [Pg.403]    [Pg.182]    [Pg.270]    [Pg.122]    [Pg.123]    [Pg.315]    [Pg.41]    [Pg.106]    [Pg.109]    [Pg.23]    [Pg.164]    [Pg.38]    [Pg.112]    [Pg.100]    [Pg.65]    [Pg.67]    [Pg.67]    [Pg.69]    [Pg.2762]    [Pg.85]    [Pg.87]    [Pg.791]    [Pg.125]   
See also in sourсe #XX -- [ Pg.133 , Pg.182 ]

See also in sourсe #XX -- [ Pg.133 , Pg.182 ]




SEARCH



Subintervals

© 2024 chempedia.info