Subproper splitting for rectangular matrices

In this paper iterative schemes for approximating a solution to a rectangular but consistent linear system Ax = b are studied. Let A?C^{m × n}_r. The splitting A = M ? N is called subproper if R(A) ? R(M) and $\text{R(A}{}^1\text{) ?R(M}{}^1\text{)}$. Consider the iteration $\text{x}{}_{\mathrm{i}}\text{= M}{}^2\text{Nx}{}_{\mathrm{i}}{}_{\mathrm{?1}}\text{+ M}{}^2\text{b}$. We characterize the convergence of this scheme to a solution of the linear system. When A?R^m×ⁿ_r, monotonicity and the concept of subproper regular splitting are used to determine a necessary and a sufficient condition for the scheme to converge to a solution.