ABSTRACT
We let x~~ h i = 1, 2, . . . , c, designate the jth iteration to i, + i· For the first iteration (i.e., the first approximation), it is convenient to let x;,1l 1 = x~1l 2 = x~1L = T. Of course, Tis a lower bound on all Xn+i• and we could begin with first approximations that exceed this value. However, in most applications the choice ofT for first approximations is convenient, and it usually results in reasonably rapid convergence to the final estimates.
