Hostname: page-component-76fb5796d-22dnz Total loading time: 0 Render date: 2024-04-27T15:17:08.127Z Has data issue: false hasContentIssue false
  • English
  • Français

A modified AOR-type iterative method for L-matrix linear systems

Published online by Cambridge University Press:  17 February 2009

Shiliang Wu  and
Tingzhu Huang
Shiliang Wu
Affiliation:
School of Applied Mathematics University of Electronic Science and Technology of China, Chengdu Sichuan 610054 P. R. China; email: wushiliang1999@126.com tzhuang@uestc.edu.cn tingzhuhuang@126.com
Tingzhu Huang
Affiliation:
School of Applied Mathematics University of Electronic Science and Technology of China, Chengdu Sichuan 610054 P. R. China; email: wushiliang1999@126.com tzhuang@uestc.edu.cn tingzhuhuang@126.com
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

Both Evans et al. and Li et al. have presented preconditioned methods for linear systems to improve the convergence rates of AOR-type iterative schemes. In this paper, we present a new preconditioner. Some comparison theorems on preconditioned iterative methods for solving L-matrix linear systems are presented. Comparison results and a numerical example show that convergence of the preconditioned Gauss-Seidel method is faster than that of the preconditioned AOR iterative method.

Keywords

preconditionerL-matrixAOR methodspectral radius.
Type
Articles
Information
The ANZIAM Journal , Volume 49 , Issue 2 , October 2007 , pp. 281 - 292
Copyright
Copyright © Australian Mathematical Society 2007

References

[1] Berman, A. and Plemmons, R. J., Nonnegative matrices in the mathematical sciences (SIAM, Philadelphia, PA, 1994).CrossRefGoogle Scholar
[2] Evans, D. J., Martins, M. M. and Trigo, M. E., “The AOR iterative method for new preconditioned linear systems”, J Comput Appl Math 132 (2001) 461–466.CrossRefGoogle Scholar
[3] Gunawardena, A. D., Jain, S. K. and Snyder, L., “Modified iteration methods for consistent linear systems”, Linear Algerbra Appl 154(1991) 123–143.CrossRefGoogle Scholar
[4] Hadjimos, A., “Accelerated overelaxation method”, Math Comp 32 (1978) 149–157.CrossRefGoogle Scholar
[5] Huang, T. Z., Cheng, G. H. and Cheng, X. Y., “Modified SOR-type iterative method for Z-matrices”, Appl Math Comput 175 (2006) 258–268.Google Scholar
[6] Li, Y. T., Li, C. X. and Wu, S. L., “Improving AOR method for consistent linear systems”, Appl Math Comput 186 (2007) 379–388.Google Scholar
[7] Milaszewicz, J. P., “Improving Jacobi and Gauss-Seidel iterations”, Linear Algebra Appl 93 (1987) 161–170.CrossRefGoogle Scholar
[8] Varga, R. S., Matrix iterative analysis (Prentice-Hall, Englewood Cliffs, New York, 1962).Google Scholar
[9] Wang, Z. D. and Huang, T. Z., “The upper Jacobi and upper Gauss-Seidel type iterative methods for preconditoned linear systems”, Appl Math Lett 19 (2006) 1029–1036.CrossRefGoogle Scholar
[10] Young, D. M., Iterative solution of large linear systems (Academic Press, New York-London, 1971)Google Scholar