Finite precision behavior of stationary iteration for solving singular systems (Q1311321)

This paper examines the behavior of stationary iteration for solving singular systems in finite precision arithmetic, gives a perturbation bound for singular systems and deduces the conditions under which the iterative method is numerically forward or backward stable. Then two specific methods -- Richardson iteration and Gauss-Seidel iteration are discussed, followed by two numerical examples. The scalloping behavior of the error curve in one of the examples is left unexplained.