Abstract
The preconditioned Gauss-Seidel type iterative method for solving linear systems, with the proper choice of the preconditioner, is presented. Convergence of the preconditioned method applied to Z-matrices is discussed. Also the optimal parameter is presented. Numerical results show that the proper choice of the preconditioner can lead to effective by the preconditioned Gauss-Seidel type iterative methods for solving linear systems.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Li Wen. Preconditioned AOR iterative methods for linear systems[J]. Intern J Computer Math, 2002, 79(1):89–101.
Young D M. Iterative Solution of Large Linear Systems[M]. Academic Press, New York, 1971.
Varga R S. Matrix Iterative Analysis[M]. Englewood Cliffs, Prentice-Hall, NJ, 1981.
Berman A, Plemmons R J. Nonnegative Matrices in the Mathematical Sciences[M]. Academic Press, London, 1979.
Schneider Hans. Which depend on graph structure[J]. Lin Alg Appl, 1984, 58:407–424.
Evans D J, Martins M M, Trigo M E. The AOR iterative method for new preconditioned linear systems[J]. J Comp Appl Math, 2001, 132:461–466.
Author information
Authors and Affiliations
Corresponding author
Additional information
Communicated by GU Yuan-xian
Project supported by MOE’s 2004 New Century Excellent Talent Program (NCET) and the Applied Basic Research Foundations of Sichuan Province (No.05JY029-068-2)
Rights and permissions
About this article
Cite this article
Cheng, Gh., Huang, Tz. & Cheng, Xy. Preconditioned Gauss-Seidel type iterative method for solving linear systems. Appl Math Mech 27, 1275–1279 (2006). https://doi.org/10.1007/s10483-006-0915-1
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/s10483-006-0915-1