# Convergence of Preconditioned Gauss-Seidel Iterative Method For Matrices

## Keywords:

Gauss-Seidel iterative method, Preconditioning, L--matrix, Splitting, Nonnegative matrix## Abstract

**Communication in Physical Sciences, 2020, 6(1): 803-808**

**Authors: Abdulrahman Ndanusa**

**Received 21 September 2020/Accepted 03 December 2020**

A great many real-life situations are often modeled as linear system of equations, . Direct methods of solution of such systems are not always realistic, especially where the coefficient matrix is very large and sparse, hence the recourse to iterative solution methods. The Gauss-Seidel, a basic iterative method for linear systems, is one such method. Although convergence is rarely guaranteed for all cases, it is established that the method converges for some situations depending on properties of the entries of the coefficient matrix and, by implication, on the algebraic structure of the method. However, as with all basic iterative methods, when it does converge, convergence could be slow. In this research, a preconditioned version of the Gauss-Seidel method is proposed in order to improve upon its convergence and robustness. For this purpose, convergence theorems are advanced and established. Numerical experiments are undertaken to validate results of the proved theorems

### Downloads

## References

Allahviranloo, T., Moghaddam, R. G. & Afshar, M. (2012). Comparison theorem with modified Gauss-Seidel and modified Jacobi methods by M-matrix. Journal of Interpolation and Approximation in Scientific Computing, pp.1-8, doi:10.5899/2012/jiasc-00017.

Gunawardena, A. D., Jain, S. K. & Snyder, L. (1991). Modified iterative methods for consistent linear systems. Linear Algebra and its Applications, 154, 156, pp. 123-143.

Hadjidimos, A., Noutsos, D. & Tzoumas, M. (2003). More on modifications and improvements of classical iterative schemes for M-matrices. Linear Algebra and its Applications, 364, pp. 256-279.

Kohno, T., Kotakemori, H., Niki, H. & Usui, M. (1997). Improving modified Gauss–Seidel method for Z-matrices. Linear Algebra and its Applications, 267, pp. 113–123.

Li, W. (2005). Comparison results for solving preconditioned linear systems. Journal of Computational and Applied Mathematics, 176, pp. 319-329.

Li, W. & Sun, W. (2000). Modified Gauss–Seidel type methods and Jacobi type methods for Z - matrices. Linear Algebra and its Applications, 317, pp. 227-240.

Milaszewicz, J. P. (1987). Improving Jacobi and Gauss-Seidel iterations. Linear Algebra and its Applications, 93, pp. 161-170.

Nazari, A. & Borujeni, S. Z. (2012). A modified precondition in the Gauss-Seidel method. Advances in Linear Algebra and Matrix Theory, 1, pp. 31 – 37.

Ndanusa, A. & Adeboye, K. R. (2012). Preconditioned SOR iterative methods for L-matrices. American Journal of Computational and Applied Mathematics, 2, 6, pp.300-305.

Noutsos, D. & Tzoumas, M. (2006). On optimal improvements of classical iterative schemes for Z-matrices. Journal of Computational and Applied Mathematics, 188, pp. 89-106.

Varga, R. S. (1981). Matrix Iterative Analysis. (2nd ed.). Englewood Cliffs, New Jersey:Prentice-Hall.

Mayaki, Z. & Ndanusa, A., (2019). Modified successive overrelaxation (SOR) type methods for M-matrices. Science World Journal, 14, 4, pp. 1-5.

Zhang, C., Ye, D., Zhong, C. & Shuanghua, S. (2015). Convergence on Gauss-Seidel iterative methods for linear systems with general H-matrices. Electronic Journal of Linear Algebra, 30, pp. 843-870.

Zheng, B. & Miao, S. (2009). Two new modified Gauss-Seidel methods for linear system with M-matrices. Journal of Computational and Applied Mathematics, 233, pp. 922-930.

## Downloads

## Published

## Issue

## Section

## License

Copyright (c) 2010 The Journal and the author

This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.