A note on the preconditioned Gauss-Seidal (GS) method for linear systems
Journal of Computational and Applied Mathematics
On optimal improvements of classical iterative schemes for Z-matrices
Journal of Computational and Applied Mathematics
Preconditioned AOR iterative method for linear systems
Applied Numerical Mathematics
Comparison results on preconditioned SOR-type iterative method for Z-matrices linear systems
Journal of Computational and Applied Mathematics
Some preconditioning techniques for linear systems
WSEAS Transactions on Mathematics
On the improved Gauss-Seidel method for linear systems
CISST'09 Proceedings of the 3rd WSEAS international conference on Circuits, systems, signal and telecommunications
Hi-index | 0.09 |
In 1997, Kohno et al. [Toshiyuki Kohno, Hisashi Kotakemori, Hiroshi Niki, Improving the modified Gauss-Seidel method for Z-matrices, Linear Algebra Appl. 267 (1997) 113-123] proved that the convergence rate of the preconditioned Gauss-Seidel method for irreducibly diagonally dominant Z-matrices with a preconditioner I+S"@a is superior to that of the basic iterative method. In this paper, we present a new preconditioner I+K"@b which is different from the preconditioner given by Kohno et al. [Toshiyuki Kohno, Hisashi Kotakemori, Hiroshi Niki, Improving the modified Gauss-Seidel method for Z-matrices, Linear Algebra Appl. 267 (1997) 113-123] and prove the convergence theory about two preconditioned iterative methods when the coefficient matrix is an H-matrix. Meanwhile, two novel sufficient conditions for guaranteeing the convergence of the preconditioned iterative methods are given.