Regular splittings and the discrete Neumann problem

Summary Iterative methods are discussed for approximating a solution to a singular but consistent square linear systemAx=b. The methods are based upon splittingA=M–N withM nonsingular. Monotonicity and the concept of regular splittings, introduced by Varga, are used to determine some necessary and some sufficient conditions in order that the iterationxⁱ⁺¹=M^–1Nxⁱ+M^–1b converge to a solution to the linear system. Finally, applications are given to solving the discrete Neumann problem by iteration which are based upon the inherent monotonicity in the formulation.This research was supported by the U. S. Army Research Office-Durham under contract no. DAHCO4 74 C 0019.