Sequential updating

[goles90] prove that for symmetric A and an 0, i = 1. n, the transient time for sequential updates is bounded by 

Other details may be found in [fogel83], [goles85b], [goles87b], [goles89], and [goles90]. 

---

VVe may, of course, generalize this sequential updating to entire blocks of m sites at a time. See [golesQO] for discussion. 

Iecaer89] Le Caer, G., Comparison between simultaneous and sequential updating in 2 + — 1 cellular automata , Physica 157A (1989) 669-687. 

Doraiswamy (1974) on a particular variety of silica gel in a fixed-bed reactor. The role of catalyst deactivation was stndied by obtaining kinetic data at various times. Fortunately, by-products were negligible. This case study describes the reaction-deactivation kinetics and proposes a complete model using appropriate statistical methods. The emphasis will be on the use of a suitable algorithm for sequential updating of the models until one of them emerges as the best. ... 

Table 124.5 Sequential update in the legislation on salt lodization in Brazil from 1953 to 2006 ...

A very powerful idea behind Bayesian inference is that statistical inference is simply updating a previous knowledge, assessed by a prior distribution. The obtained posterior distribution, which encodes the current state of knowledge, can be sequentially updated by adding more and more data. To exemphfy this idea, let us consider a very simple problem the Bayesian assessment of an exponential lifetime model, of failure rate X ... 

In this paper we have demonstrated how uncertainty in the data can be easily incorporated into the problem of maintenance optimization and how sequential updating of parameters using Bayesian approach can be applied when maintenance is adjusted according to the available information and possible uncertainty. 

To complete the update, the velocity U (t + jh) is needed to calculate the momentum nansfer to the fluid (200). An explicit update [98] can be done in a single pass since U,(t + h) = U,(t) is already known, but an implicit or semi-imphcit update requires two passes through the boundary nodes. The first pass is used to calculate Fq so that (212) can be solved for U (t + h) [104]. This velocity is used to update the population densities in a second sweep through the boundary nodes. In the present case we calculate U,(t + j/t) by enforcing consistency between the sequential update (211)-(213) and (215) ... 

---