Series control algorithm

One final note While the techniques used here were applied to control temperature In large, semi-batch polymerization reactors, they are by no means limited to such processes. The Ideas employed here --designing pilot plant control trials to be scalable, calculating transfer functions by time series analysis, and determining the stochastic control algorithm appropriate to the process -- can be applied In a variety of chemical and polymerization process applications. 

A DCS is also used to control Area 400. The DCS monitors and controls the cycling of the TRBPs, the preheaters, the GPCR reactors, the scrubbers, and the product gas handling system. Each of these subsystems is controlled with a series of control loops tied to the individual control functions through input devices linked to output devices via control algorithms within the DCS. 

There are a variety of specifications that we can impose on the closed-loop response y(z) for a given step change in ySp(z). It is clear that depending on the response specifications, we can derive a series of alternative digital control algorithms. Let us now examine the most commonly used among them. 

The resistance-in-series concept. The outward movement of a solute molecule under non-particle resuspending conditions is potentially controlled by transport resistances on both sides of the interface. Water is the continuous phase from the particle surface where the local equilibrium assumption (LEA) applies, through the bed porewater pathways and then through the interface to the water column. Derived elsewhere (9) the resistance-in-series flux algorithm is shown below. Using a concentration in solution difference it is... 

Algorithm A method of calculation that produces a control output by operating on an error signal or a time series of error signals. 

Thus, the way the algorithm works is to set an initial value for the control parameter. At this setting of the control parameter, a series of random moves are made. Equation 3.11 dictates whether an individual move is accepted or rejected. The control parameter (annealing temperature) is lowered and a new series of random moves is made, and so on. As the control parameter (annealing temperature) is lowered, the probability of accepting deterioration in the objective function, as dictated by Equation 3.11, decreases. In this way, the acceptability for the search to move uphill in a minimization or downhill during maximization is gradually withdrawn. 

A statistical algorithm, also known as linear regression analysis, for systems where Y (the random variable) is linearly dependent on another quantity X (the ordinary or controlled variable). The procedure allows one to fit a straight line through points xi, y0, X2,yi), x, ys),..., ( n,yn) where the values jCi are defined before the experiment and y values are obtained experimentally and are subject to random error. The best fit line through such a series of points is called a least squares fit , and the protocol provides measures of the reliability of the data and quality of the fit. 

In order to characterize the interaction between different clusters, it is necessary to consider the mechanism of cluster identification during the process of the DA algorithm. As the temperature (Tk) is reduced after every iteration, the system undergoes a series of phase transitions (see (18) for details). In this annealing process, at high temperatures that are above a pre-computable critical value, all the lead compounds are located at the centroid of the entire descriptor space, thereby there is only one distinct location for the lead compounds. As the temperature is decreased, a critical temperature value is reached where a phase transition occurs, which results in a greater number of distinct locations for lead compounds and consequently finer clusters are formed. This provides us with a tool to control the number of clusters we want in our final selection. It is shown (18) for a square Euclidean distance d(xi,rj) = x, — rj that a cluster Rj splits at a critical temperature Tc when twice the maximum eigenvalue of the posterior covariance matrix, defined by Cx rj =... 

The objective of this paper is to illustrate, by simulation of the vinyl acetate system, the utility of the analytical predictor algorithm for dead-time compensation to regulatory control of continuous emulsion polymerization in a series of CSTR s utilizing initiator flow rate as the manipulated variable. 

---