Can SOR be an efficient method for solving nonsymmetric linear systems?

✍ Scribed by Zbigniew I. Woźnicki

• Publisher: Elsevier Science
• Year: 2001
• Tongue: English
• Weight: 736 KB
• Volume: 47
• Category: Article
• ISSN: 0362-546X
• DOI: 10.1016/s0362-546x(01)00544-2

✦ Synopsis

The main aim of this paper is to examine the performance of SOR algorithms for solving linear systems of the type arising from the difference approximation of nonself-adjoint two-dimensional elliptic partial differential equations. A special attention is paid to the development of efficient techniques for determining the optimum relaxation parameter providing the maximum rate of convergence. The comparison of results of the line-SOR method with the results obtained from different GMRES algorithms shows that with the computational work comparable for both algorithms, the line-SOR method provides the solutions of considered problems with the second norm of the error vector a few orders lesser in the magnitude.