Author:
Argyros I.K.,Sharma D.,Argyros C.I.,Parhi S.K.,Sunanda S.K.,Argyros M.I.
Abstract
In the earlier work, expensive Taylor formula and conditions on derivatives up to the eighthorder have been utilized to establish the convergence of a derivative free class of seventh orderiterative algorithms. Moreover, no error distances or results on uniqueness of the solution weregiven. In this study, extended ball convergence analysis is derived for this class by imposingconditions on the first derivative. Additionally, we offer error distances and convergence radiustogether with the region of uniqueness for the solution. Therefore, we enlarge the practicalutility of these algorithms. Also, convergence regions of a specific member of this class are displayedfor solving complex polynomial equations. At the end, standard numerical applicationsare provided to illustrate the efficacy of our theoretical findings.
Publisher
Ivan Franko National University of Lviv
Reference28 articles.
1. S. Amat, S. Busquier, Advances in iterative methods for nonlinear equations, Cham, Springer, 2016.
2. I. Argyros, Computational theory of iterative methods, New York, CRC Press, 2007.
3. I.K. Argyros, Convergence and application of Newton-type iterations, Berlin, Springer, 2008.
4. I.K. Argyros, Polynomial operator equations in abstract spaces and applications, New York, CRC Press, 1998.
5. I.K. Argyros, S. George, Local convergence for an almost sixth order method for solving equations under weak conditions, SeMA J., 75 (2017), №2, 163–171.