  In this paper we analyse the Kaczmarz projection algorithm with remotest set
control of projection indices. According to this procedure, in each iteration
the projection index is one which gives the maximal absolute value of the
corresponding residual. We prove that for underdetermined full row rank systems
and under some assumptions valid for problems arising in algebraic
reconstruction of images in computerized tomography, this selection procedure
has the property that each row index is selected at least once during the
Kaczmarz algorithm iterations.
