Abstract
In this paper, we present firstly several one-step iterative methods including classical Newton’s method and Halley’s method for root-finding problem based on Thiele’s continued fraction. Secondly, by using approximants of the second derivative and the third derivative, we obtain an improved iterative method, which is not only two-step iterative method but also avoids calculating the higher derivatives of the function. Analysis of its convergence shows that the order of convergence of the modified iterative method is four for a simple root of the equation. Finally, to illustrate the efficiency and performance of the proposed method, we give some numerical experiments and comparison.
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 callMore From: Journal of Algorithms & Computational Technology
Disclaimer: 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.
