Title of article :
Two new modified Gauss–Seidel methods for linear system with -matrices
Author/Authors :
Zheng، نويسنده , , Bing and Miao، نويسنده , , Shu-Xin، نويسنده ,
Issue Information :
روزنامه با شماره پیاپی سال 2009
Pages :
9
From page :
922
To page :
930
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 max [H. Kotakemori, K. Harada, M. Morimoto, H. Niki, A comparison theorem for the iterative method with the preconditioner ( I + S max ) 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 n th 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.
Keywords :
Preconditioned linear system , Preconditioning , Convergence , M -matrix , splitting , Comparison theorem
Journal title :
Journal of Computational and Applied Mathematics
Serial Year :
2009
Journal title :
Journal of Computational and Applied Mathematics
Record number :
1555395
Link To Document :
بازگشت