Abstract

It is well known that the optimal iterative methods are of more significance than the non-optimal ones in view of their efficiency and convergence speed. There are only a few number of optimal iterative methods for finding multiple zeros with eighth order of convergence. In this paper, we propose a new family of optimal eighth order convergent iterative methods for multiple roots with known multiplicity. We present an extensive convergence analysis which confirms theoretically eighth-order convergence of the presented scheme. Moreover, we consider several real life problems that contain simple as well as multiple zeros in order to compare our proposed methods with the existing eighth-order iterative schemes. Some dynamical aspects of the presented methods are also discussed. Finally, we conclude on the basis of obtained numerical results that the proposed family of iterative methods perform better than the existing methods in terms of residual error, computational order of convergence and difference between the two consecutive iterations.

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 call

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.