Adaptive SOR methods based on the Wolfe conditions
- 21 Downloads
Because the expense of estimating the optimal value of the relaxation parameter in the successive over-relaxation (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.
KeywordsLinear systems SOR methods Discrete gradient methods Optimisation
Mathematics Subject Classification (2010)65F10 65L05 65N22
The authors are grateful for various comments by anonymous referees.
This work has been supported in part by JSPS, Japan KAKENHI Grant Numbers 16K17550, 16KT0016, 17H02829, and 18H05392.
- 7.Hairer, E., Wanner, G.: Solving Ordinary Differential Equations II: Stiff and Diffirential-Algebraic Problems. Springer Series in Computational Mathematics, 2nd edn., vol. 14. Springer, Berlin (1996)Google Scholar
- 10.McLachlan, R.I., Quispel, G.R.W., Robidoux, N.: Unified approach to Hamiltonian systems, Poisson systems, gradient systems, and systems with Lyapunov functions or first integrals. Phys. Rev. Lett. 81, 2399–2403 (1998). https://doi.org/10.1103/PhysRevLett.81.2399 MathSciNetCrossRefzbMATHGoogle Scholar