Main convergence theorems for the improved sor method with orderings

Abstract

To solve non-symmetric linear equations, we have already proposed a generalized SOR method, named the “improved SOR method with orderings”, and if we use special relaxation parameters and proper orderings, then our method converges more rapidly and with fewer iterations than the usual SOR method. In this paper, we consider main convergence theorems for the improved SOR method with orderings and obtain useful convergence theorems for the cases of tridiagonal matrices and also block tridiagonal matrices which are “decomposable to the tridiagonal matrices”.

Keywords:

• Main convergence theorems
• improved SOR method with orderings

C.R. Categories:

• G.1.3