Because the expense of estimating the optimal value of the relaxation parameter in the successive overrelaxation (SOR) method is usually prohibitive, the parameter is often adaptively controlled. In this paper, new adaptive SOR methods are presented that are applicable to a variety of symmetric positive definite linear systems and do not require additional matrix-vector products when updating the parameter. To this end, we regard the SOR method as an algorithm for minimising a certain objective function, which yields an interpretation of the relaxation parameter as the step size following a certain change of variables. This interpretation enables us to adaptively control the step size based on some line search techniques, such as the Wolfe conditions. Numerical examples demonstrate the favourable behaviour of the proposed methods.
IntroductionThe successive over-relaxation (SOR) method is one of the most well-known stationary iterative methods for solving linear systemswhere A ∈ R n×n and b b b ∈ R n are given nonsingular matrix and vector, respectively. The SOR method is formulated asHere, the matrix A is expressed as the matrix sumwhere D = diag(a 11 , a 22 , . . . , a nn ), and L and U are strictly lower and upper triangular n × n matrices.The convergence performance of the SOR method depends on the relaxation parameter ω. A necessary condition for the SOR method to converge is that ω ∈ (0, 2), and this condition is also sufficient for a symmetric positive definite matrix A (for further details of SOR theory see, e.g., [4,18]). The relaxation parameter