Abstract
The Accelerated Overrelaxation (AOR) and the Generalized AOR (GAOR) iterative methods for the solution of linear systems of algebraic equations (Ax=b,A∈Cn×n,det(A)≠0,b∈Cn) have been around for about four decades and a plethora of variations of them have been proposed. In this work a novel algorithm is introduced, the Matrix Analogue of the AOR (MAAOR) iterative method, which is analysed and studied. The MAAOR method generalizes both the AOR and the GAOR. Sufficient convergence conditions for the GAOR method are determined when the coefficient matrix A of the linear system to be solved is a Hermitian matrix with positive diagonal elements. Similarly, sufficient convergence conditions for the MAAOR method are determined when A is a nonsingular H-matrix. The new convergence conditions are the most general ones so far. Numerical examples are presented in support of the theory developed.
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.
