Two new modified Gauss-Seidel methods for linear system with M-matrices

  • Authors:
  • Bing Zheng;Shu-Xin Miao

  • Affiliations:
  • School of Mathematics and Statistics, Lanzhou University, Lanzhou 730000, PR China;School of Mathematics and Statistics, Lanzhou University, Lanzhou 730000, PR China and College of Mathematics and Information Science, Northwest Normal University, Lanzhou 730070, PR China

  • Venue:
  • Journal of Computational and Applied Mathematics
  • Year:
  • 2009

Quantified Score

Hi-index 7.29

Visualization

Abstract

In 2002, H. Kotakemori et al. proposed the modified Gauss-Seidel (MGS) method for solving the linear system with the preconditioner P=I+S"m"a"x [H. Kotakemori, K. Harada, M. Morimoto, H. Niki, A comparison theorem for the iterative method with the preconditioner (I+S"m"a"x) J. Comput. Appl. Math. 145 (2002) 373-378]. Since this preconditioner is constructed by only the largest element on each row of the upper triangular part of the coefficient matrix, the preconditioning effect is not observed on the nth row. In the present paper, to deal with this drawback, we propose two new preconditioners. The convergence and comparison theorems of the modified Gauss-Seidel methods with these two preconditioners for solving the linear system are established. The convergence rates of the new proposed preconditioned methods are compared. In addition, numerical experiments are used to show the effectiveness of the new MGS methods.