An eighth-order family of optimal multiple root finders and its dynamics
- 105 Downloads
There is a very small number of higher-order iteration functions for multiple zeros whose order of convergence is greater than four. Some scholars have tried to propose optimal eighth-order methods for multiple zeros. But, unfortunately, they did not get success in this direction and attained only sixth-order convergence. So, as far as we know, there is not a single optimal eighth-order iteration function in the available literature that will work for multiple zeros. Motivated and inspired by this fact, we present an optimal eighth-order iteration function for multiple zeros. An extensive convergence study is discussed in order to demonstrate the optimal eighth-order convergence of the proposed scheme. In addition, we also demonstrate the applicability of our proposed scheme on real-life problems and illustrate that the proposed methods are more efficient among the available multiple root finding techniques. Finally, dynamical study of the proposed schemes also confirms the theoretical results.
KeywordsNonlinear equations Optimal iterative methods Multiple roots Efficiency index Kung-Traub conjecture
Unable to display preview. Download preview PDF.
The authors thank to the anonymous referees for their useful comments and suggestions to improve the final version of the manuscript.
- 4.Petković, M. S., Neta, B., Petković, L. D., Dzunić, J.: Multipoint methods for solving nonlinear equations. Academic Press (2013)Google Scholar
- 7.Chicharro, F.I., Cordero, A., Torregrosa, J.R.: Drawing dynamical and parameters planes of iterative families and methods. Sci World J 2013(Article ID 780153), 11 (2013)Google Scholar