Abstract

The paper presents a dynamic and feasible approach to the successive over-relaxation (SOR) method for solving large scale linear system through iteration. Based on the maximal orthogonal projection technique, the optimal relaxation parameter is obtained by minimizing a derived merit function in terms of right-hand side vector, the coefficient matrix and the previous step values of unknown variables. At each iterative step, we can quickly determine the optimal relaxation value in a preferred interval. When the theoretical optimal value is hard to be achieved, the new method provides an alternative choice of the relaxation parameter at each iteration. Numerical examples confirm that the dynamic optimal successive over-relaxation (DOSOR) method outperforms the classical SOR method.

This work is licensed under a Creative Commons Attribution 4.0 License.