Extended three step sixth order Jarratt-like methods under generalized conditions for nonlinear equations

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.

A New Adaptive Eleventh-Order Memory Algorithm for Solving Nonlinear Equations

“…Recent innovations have improved a variety of numerical methods, including the Adomian decomposition Newton-Raphson [1], bisection [3], Chebyshev-Halley [4], Chun-Neta [5], collocation [6], Galerkin [7], and Jarratt methods [8], as well as the Nash-Moser iteration [9], Thukral method [10], Osada method [11], Ostrowski method [12], Picard iteration [13], diverse quadrature formulas [14,15], super-Halley method [16], and Traub-Steffensen method [17].…”

Derivative-Free Families of With- and Without-Memory Iterative Methods for Solving Nonlinear Equations and Their Engineering Applications

“…There are a variety of numerical strategies that can be applied and were recently updated, i.e., Adomian decomposition [1], Aitken extrapolation [2], bisection [3], Chebyshev-Halley [4], Chun-Neta [5], collocation [6], Galerkin [7], homotopy perturbation [8] and Jarratt [9] methods, Nash-Moser iteration [10], Newton-Raphson [11], Osada [12] and Ostrowski [13] methods, Picard iteration [14], quadrature formulas [15,16], super-Halley [17] and Thukral [18] and Traub-Steffensen [19] methods.…”

Derivative Free Three-Step Iterative Method to Solve Nonlinear Equations

“…Gerald and Wheatley [7, p.42] stated that one of the most widely used iterative methods for solving nonlinear equations is Newton's method. Recently, some researchers have modified Newton's method to obtain sixth-order convergence such as [8], [9], [12], [13], [14], and [15]. One of the modified methods is the sixthorder method which requires two evaluations of the function and two evaluations of the first derivative of each iteration proposed by Parhi and Gupta [6].…”