TY  - JOUR
AB  - 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.
DA  - 1991
DO  - 10.1007/BF01385772
LA  - eng
IS  - 1
M2  - 91
PY  - 1991
SN  - 0029-599X
SP  - 91-106
T2  - Numerische Mathematik
TI  - Convergence properties of ART and SOR algorithms
UR  - https://nbn-resolving.org/urn:nbn:de:0070-pub-17749165
Y2  - 2024-11-22T07:22:53
ER  -