Comparison theorems between the preconditioned Gauss-Seidel method and the AOR method for M-matrices
Authors
Shi-Guang Zhang, Ting Zhou
Corresponding Author
Shi-Guang Zhang
Available Online July 2017.
- DOI
- 10.2991/icadme-17.2017.84How to use a DOI?
- Keywords
- Preconditioned Gauss-Seidel iterative method; AOR iterative method; convergence .
- Abstract
In this paper, we study a preconditioned Gauss-Seidel iterative method with the preconditioner which proposed in [1] for solving a linear system whose coefficient matrix is a M-matrix. Some corresponding comparison results between the preconditioned Gauss-Seidel iterative method and the basic AOR iterative method are obtained. Finally, a numerical example is given to illustrate our results.
- Copyright
- © 2017, the Authors. Published by Atlantis Press.
- Open Access
- This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).
Cite this article
TY - CONF AU - Shi-Guang Zhang AU - Ting Zhou PY - 2017/07 DA - 2017/07 TI - Comparison theorems between the preconditioned Gauss-Seidel method and the AOR method for M-matrices BT - Proceedings of the 2017 7th International Conference on Advanced Design and Manufacturing Engineering (ICADME 2017) PB - Atlantis Press SP - 446 EP - 449 SN - 2352-5401 UR - https://doi.org/10.2991/icadme-17.2017.84 DO - 10.2991/icadme-17.2017.84 ID - Zhang2017/07 ER -