Abstract
In this paper we study the convergence of a Newton–Steffensen type method for solving nonlinear equations in R , introduced by Sharma [J.R. Sharma, A composite third order Newton–Steffensen method for solving nonlinear equations, Appl. Math. Comput. 169 (2005), 242–246]. Under simplified assumptions regarding the smoothness of the nonlinear function, we show that the q -convergence order of the iterations is 3. The efficiency index of the method is 3 3 , and is larger than I 2 = 2 , which corresponds to the Newton method or the Steffensen method. Moreover, we show that if the nonlinear function maintains the same monotony and convexity on an interval containing the solution, and the initial approximation satisfies the Fourier condition, then the iterations converge monotonically to the solution. We also obtain a posteriori formulas for controlling the errors. The numerical examples confirm the theoretical results.
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.
