Abstract
We revisit a one-step intermediate Newton method for the iterative computation of a zero of the sum of two nonlinear operators that was analyzed by Uko and Velasquez (Rev. Colomb. Mat. 35:21–27, 2001). By utilizing weaker hypotheses of the Zabrejko-Nguen kind and a modified majorizing sequence we perform a semilocal convergence analysis which yields finer error bounds and more precise information on the location of the solution that the ones obtained in Rev. Colomb. Mat. 35:21–27, 2001. This error analysis is obtained at the same computational cost as the analogous results of Uko and Velasquez (Rev. Colomb. Mat. 35:21–27, 2001). We also give two generalizations of the well-known Kantorovich theorem on the solvability of nonlinear equations and the convergence of Newton’s method. Finally, we provide a numerical example to illustrate the predicted-by-theory performance of the Newton iterates involved in this paper.
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.
