An iterative method along with its convergence analysis is developed for solving singular linear systems with index one. Necessary and sufficient conditions along with the estimation of error bounds for the unique solution are derived. Four numerical examples including singular square M-matrix, randomly generated singular square matrices, sparse symmetric and nonsymmetric singular matrices obtained from discretization of the special partial differential equations are worked out. A comparison between proposed method and method from Chen (Appl Math Comput 86:171–184, 1997) is given in terms of number of iterations, mean CPU time and error bounds. It is observed that proposed iterative method is superior and gives improved performance when compared with the method from Chen (Appl Math Comput 86:171–184, 1997).
Dr. Shwetabh Srivastava, Gupta, D. K., and Singh, A., “An Iterative method for Solving Singular Linear Systems with Index One”, Afrika Matematika, vol. 27, pp. 815–824, 2016.