ABSTRACT
In this paper we consider a recursive method of Robbins–Monro type to estimate the solution of the linear problem Ax = u, in which the second member is measured with α-mixing errors. We also show the almost complete convergence (a.co) of this algorithm specifying its convergence rate.
MATHEMATICS SUBJECT CLASSIFICATION: