  This paper is to explore a model of the ABS Algorithms for dealing with a
class of systems of linear stochastic equations A xi=eta satisfying eta sim
N_m(v, I_{m}). It is shown that the iteration step alpha_{i} is N(V,\pi) and
approximation solutions is xi_{i} \sim N_n(U,\Sigma) for this algorithm model.
And some properties of (V,\pi)$ and $(U,\Sigma) are given.
