ART algorithms with relaxation parameters are studied for general (consistent or inconsistent) linear algebraic systems Rx = f, and a general convergence theorem is formulated. The advantage of severe underrelaxation is re-examined and clarified. The relationship to solutions obtained by applying SOR methods to the equation RR(T)y = f is investigated.