Abstract
In this paper, based on a block splitting of the coe‐cient matrix, we present a new generalized iterative method for solving the linear system Ax = b. This method is well-deflned even when some elements on the diagonal of A are zero. Convergence analysis and comparison theorems of the proposed method are provided. Specially, the results show that our new generalized AOR iterative method also, converges when A is an H-matrix. And for L-matrices, our new generalized Jacobi iterative method is faster than the classical Jacobi. The Numerical examples are also given to illustrate our results.
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 callMore From: International Journal of Applied Mathematical Research
Disclaimer: 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.
