Abstract
Motivated by Chen [On the convergence of SOR methods for nonsmooth equations. Numer. Linear Algebra Appl. 9 (2002), pp. 81–92], in this paper, we further investigate a modified SOR–Newton (MSOR–Newton) method for solving a system of nonlinear equations F(x)=0, where F is strongly monotone and locally Lipschitz continuous but not necessarily differentiable. The convergence interval of the parameter in the MSOR–Newton method is given. Compared with that of the SOR–Newton method, this interval can be enlarged. Furthermore, when the B-differential of F(x) is difficult to compute, a simple replacement can be used, which can reduce the computational load. Numerical examples show that at the same cost of computational complexity, this MSOR–Newton method can converge faster than the corresponding SOR–Newton method by choosing a suitable parameter.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
