ABSTRACT
In this chapter we examine two well known iterative algorithms for solving square systems of linear equations, the Jacobi method and the Gauss-Seidel method, in terms of averaged and paracontractive operators. Both these algorithms are easy to describe and to motivate. They both require not only that the system be square, that is, have the same number of unknowns as equations, but satisfy additional constraints needed for convergence.
