Article

New preconditioned AOR iterative method for Z-matrices

Journal of Applied Mathematics and Computing 01/2011; 37(1):103-117. DOI: 10.1007/s12190-010-0423-6

ABSTRACT In this paper, we present a new preconditioned AOR-type iterative method for solving the linear system Ax=b, where A is a Z-matrix, and prove its convergence. Then we give some comparison theorems to show that the rate of convergence of the In this paper, we present a new preconditioned AOR-type iterative method for solving the linear system Ax=b, where A is a Z-matrix, and prove its convergence. Then we give some comparison theorems to show that the rate of convergence of the
preconditioned AOR-type iterative method is faster than the rate of convergence of the AOR-type iterative method. Finally, preconditioned AOR-type iterative method is faster than the rate of convergence of the AOR-type iterative method. Finally,
we give two numerical examples to illustrate our results. we give two numerical examples to illustrate our results.

KeywordsZ-matrix–AOR-type iterative method–Precondition–Comparison theorem–Linear system KeywordsZ-matrix–AOR-type iterative method–Precondition–Comparison theorem–Linear system

1 Bookmark
 · 
197 Views
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: This paper investigates the comparisons of asymptotic rates of convergence of two iteration matrices. On the basis of nonnegative matrix theory, comparisons between two nonnegative splittings and between two parallel multisplitting methods are derived. When the coefficient matrix A is Hermitian positive (semi)definite, comparison theorems about two P-regular splittings and two parallel multisplitting methods are proved.
    Numerische Mathematik 01/2002; 92(3):563-591. · 1.33 Impact Factor
  • [Show abstract] [Hide abstract]
    ABSTRACT: In order to improve the convergence rates of iterative method solving the linear system Ax=b, a preconditioned AOR iterative method with a multi-parameters preconditioner I+S∼α is proposed. Some convergence and comparison results for αi∈[0,1] are given when A is an L-matrix. When A is an H-matrix, the convergence of the corresponding methods is discussed for αi∈[0,αi′), where αi>1. Furthermore, effectiveness of the new preconditioner method is shown by numerical experiments. Numerical experiments show that our methods are superior to the basic AOR iterative methods.
    Applied Mathematics and Computation. 01/2008; 206:465-473.
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: In this paper, we present the convergence analysis for some modified Gauss–Seidel and Jacobi type iterative methods and provide a comparison of spectral radius among the Gauss– Seidel iterative method and these modified methods. Some recent results are improved.
    Linear Algebra and its Applications 01/2000; · 0.97 Impact Factor