Remote Access Mathematics of Computation
Green Open Access

Mathematics of Computation

ISSN 1088-6842(online) ISSN 0025-5718(print)



The sigma-SOR algorithm and the optimal strategy for the utilization of the SOR iterative method

Author: Zbigniew I. Woźnicki
Journal: Math. Comp. 62 (1994), 619-644
MSC: Primary 65F10; Secondary 65B99
Corrigendum: Math. Comp. 66 (1997), 1769-1769.
MathSciNet review: 1212270
Full-text PDF

Abstract | References | Similar Articles | Additional Information

Abstract: The paper describes, discusses, and numerically illustrates the method for obtaining a priori estimates of the optimum relaxation factor in the SOR iteration method. The computational strategy of this method uses the so-called Sigma-SOR algorithm based on the theoretical result proven in the paper. The method presented is especially efficient for problems with slowly convergent iteration process and in this case is strongly competitive with adaptive procedures used for determining dynamically the optimum relaxation factor during the course of the SOR solution.

References [Enhancements On Off] (What's this?)

Similar Articles

Retrieve articles in Mathematics of Computation with MSC: 65F10, 65B99

Retrieve articles in all journals with MSC: 65F10, 65B99

Additional Information

Keywords: SOR iteration method, power method, acceleration of convergence, eigenvalues of iteration matrix, estimation of optimum relaxation factor
Article copyright: © Copyright 1994 American Mathematical Society

American Mathematical Society