کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
4641609 | 1341314 | 2008 | 13 صفحه PDF | دانلود رایگان |
In recent years, a number of preconditioners have been applied to linear systems [A.D. Gunawardena, S.K. Jain, L. Snyder, Modified iterative methods for consistent linear systems, Linear Algebra Appl. 154–156 (1991) 123–143; T. Kohno, H. Kotakemori, H. Niki, M. Usui, Improving modified Gauss–Seidel method for Z-matrices, Linear Algebra Appl. 267 (1997) 113–123; H. Kotakemori, K. Harada, M. Morimoto, H. Niki, A comparison theorem for the iterative method with the preconditioner (I+Smax)(I+Smax), J. Comput. Appl. Math. 145 (2002) 373–378; H. Kotakemori, H. Niki, N. Okamoto, Accelerated iteration method for ZZ-matrices, J. Comput. Appl. Math. 75 (1996) 87–97; M. Usui, H. Niki, T.Kohno, Adaptive Gauss-Seidel method for linear systems, Internat. J. Comput. Math. 51(1994)119–125 [10]]. Since these preconditioners are constructed from the elements of the upper triangular part of the coefficient matrix, the preconditioning effect is not observed on the nnth row of matrix A. In the present paper, in order to deal with this drawback, we propose a new preconditioner. In addition, the convergence and comparison theorems of the proposed method are established. Simple numerical examples are also given, and we show that the convergence rate of the proposed method is better than that of the optimum SOR.
Journal: Journal of Computational and Applied Mathematics - Volume 219, Issue 1, 15 September 2008, Pages 59–71