Solving the linear system Ax = b is an active area of research in engineering. Many researchers have applied preconditioners to the linear system Ax = b. In this work, we introduce two new preconditioners for solving linear systems. The best property of the introduced preconditioners is that they can be used under weaker conditions than the previous preconditioners in the literature. We propose preconditioned associated accelerated overrelaxation (AOR) iterative methods with these two new preconditioners, and give the corresponding convergence results. Numerical examples show an improvement in the convergence rate of the AOR preconditioned iterative matrices.
BermanAPlemmonsRJ (1994) Nonnegative Matrices in the Mathematical Sciences, Philadelphia: SIAM.
2.
DattaBN (1995) Numerical Linear Algebra and Applications, Pacific Grove: Cole Publishing Co.
3.
DehghanMHajarianM (2010a) The general coupled matrix equations over generalized bisymmetric matrices. Linear Algebra and its Applications432: 15311552.
4.
DehghanMHajarianM (2010b) An efficient algorithm for solving general coupled matrix equations and its application. Mathematical and Computer Modelling51: 11181134.
5.
DehghanMHajarianM (2011a) On the generalized bisymmetric and skew-symmetric solutions of the system of generalized Sylvester matrix equations. Linear and Multilinear Algebra59: 12811309.
6.
DehghanMHajarianM (2011b) Analysis of an iterative algorithm to solve the generalized coupled Sylvester matrix equations. Applied Mathematical Modelling35: 32853300.
7.
DingFChenT (2005a) Iterative least squares solutions of coupled Sylvester matrix equations. Systems & Control Letters54: 95107.
8.
DingFChenT (2005b) Hierarchical least squares identification methods for multivariable systems. IEEE Transactions on Automatic Control50: 397402.
9.
DingFChenT (2006) On iterative solutions of general coupled matrix equations. SIAM Journal on Control and Optimization44: 22692284.
10.
EvansDJMartinsMM (1992) On the convergence of the extrapolated AOR method. International Journal of Computer Mathematics43: 161171.
11.
EvansDJMartinsMMTrigoME (2001) The AOR iterative method for new preconditioned linear systems. Journal of Computational and Applied Mathematics132: 461466.
12.
HadjidimosA (1978) Accelerated overrelaxation method. Mathematics of Computation32: 149157.
13.
LiW (2002) Preconditioned AOR iterative methods for linear systems. International Journal of Computer Mathematics79: 89101.
14.
LiWSunW (2000) Modified Gauss–Seidel type methods and Jacobi type methods forZ-matrices. Linear Algebra and its Applications317: 227240.
15.
LiYTLiCXWuSL (2007) Improvements of preconditioned AOR iterative method forL-matrices. Journal of Computational and Applied Mathematics206: 656665.
16.
MilaszewicsJP (1987) Improving Jacobi and Gauss–Seidel iterations. Linear Algebra and its Applications93: 161170.
17.
SchneiderH (1977) The concepts of irreducibility and full indecomposability of a matrix in the works of Frobenius, König and Markov. Linear Algebra and its Applications18: 139162.
WangXZHuangTZFuYD (2007) Comparison results on preconditioned SOR-type iterative method forZ-matrices linear systems. Journal of Computational and Applied Mathematics206: 726732.
20.
WuMWangLSongY (2007) Preconditioned AOR iterative method for linear systems. Applied Numerical Mathematics57: 672685.
21.
YunJHKimSW (2008) Convergence of the preconditioned AOR method for irreducibleL-matrices. Applied Mathematics and Computation201: 5664.
