Accelerating the Kaczmarz algorithm convergence in the case of input process time correlation

Reference [1] has proposed a modification of the Kaczmarz algorithm which increases the rate of convergence in the case of input signal time correlation and does not increase the estimate sensitivity to measurement errors. It is shown that 1) the modified algorithm in some cases (when the correlation is not too large) can converge slower than the Kaczmarz algorithm does and 2) the modification can be easily augmented so that the convergence rate increases in any case.