Abstract
Based on the Steffensen-type method, we develop fourth-, eighth-, and sixteenth-order algorithms for solving one-variable equations. The new methods are fourth-, eighth-, and sixteenth-order converging and require at each iteration three, four, and five function evaluations, respectively. Therefore, all these algorithms are optimal in the sense of Kung–Traub conjecture; the new schemes have an efficiency index of 1.587, 1.682, and 1.741, respectively. We have given convergence analyses of the proposed methods and also given comparisons with already established known schemes having the same convergence order, demonstrating the efficiency of the present techniques numerically. We also studied basins of attraction to demonstrate their dynamical behavior in the complex plane.
Subject
General Mathematics,Engineering (miscellaneous),Computer Science (miscellaneous)
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献