Abstract

The convergence balls as well as the dynamical characteristics of two sixth order Jarratt-like methods (JLM1 and JLM2) are compared. First, the ball analysis theorems for these algorithms are proved by applying generalized Lipschitz conditions on derivative of the first order. As a result, significant information on the radii of convergence and the regions of uniqueness for the solution are found along with calculable error distances. Also, the scope of utilization of these algorithms is extended. Then, we compare the dynamical properties, using the attraction basin approach, of these iterative schemes. At the end, standard application problems are considered to demonstrate the efficacy of our theoretical findings on ball convergence. For these problems, the convergence balls are computed and compared. From these comparisons, it is confirmed that JLM1 has the bigger convergence balls than JLM2. Also, the attraction basins for JLM1 are larger in comparison to JLM2. Thus, for numerical applications, JLM1 is better than JLM2.

Full Text
Published version (Free)

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