Abstract: In this paper, we present preconditioned generalized
accelerated overrelaxation (GAOR) methods for solving certain
nonsingular linear system. We compare the spectral radii of the
iteration matrices of the preconditioned and the original methods. The
comparison results show that the preconditioned GAOR methods
converge faster than the GAOR method whenever the GAOR method
is convergent. Finally, we give two numerical examples to confirm our
theoretical results.
Abstract: Recently, some convergent results of the generalized AOR iterative (GAOR) method for solving linear systems with strictly diagonally dominant matrices are presented in [Darvishi, M.T., Hessari, P.: On convergence of the generalized AOR method for linear systems with diagonally dominant cofficient matrices. Appl. Math. Comput. 176, 128-133 (2006)] and [Tian, G.X., Huang, T.Z., Cui, S.Y.: Convergence of generalized AOR iterative method for linear systems with strictly diagonally dominant cofficient matrices. J. Comp. Appl. Math. 213, 240-247 (2008)]. In this paper, we give the convergence of the GAOR method for linear systems with strictly doubly diagonally dominant matrix, which improves these corresponding results.