Abstract
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).
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
