In this paper, we have obtained three optimal order Newton’s like methods of order four, eight, and sixteen for solving nonlinear algebraic equations. The convergence analysis of all the optimal order methods is discussed separately. We have discussed the corresponding conjugacy maps for quadratic polynomials and also obtained the extraneous fixed points. We have considered several test functions to examine the convergence order and to explain the dynamics of our proposed methods. Theoretical results, numerical results, and fractal patterns are in support of the efficiency of the optimal order methods.

The objective of the current work is to invent and introduce the continuous version of Newton’s method. This scheme is used to establish some interesting properties with examples. We have plotted the fractal pattern graphs for a Newton-like method and a Damped Newton-like method in the discrete case and hence we have introduced a new concept of streamline for the continuous version of the Newton-like method. The graph and streamlines of these patterns are in agreement with numerical results and describe the convergence and stability of the proposed method to different roots when the Newton method fails.

The motive of the present work is to introduce and investigate the quadratically convergent Newton’s like method for solving the non-linear equations. We have studied some new properties of a Newton’s like method with examples and obtained a derivative-free globally convergent Newton’s like method using forward difference operator and bisection method. Finally, we have used various numerical test functions along with their fractal patterns to show the utility of the proposed method. These patterns support the numerical results and explain the compactness regarding the convergence, divergence and stability of the methods to different roots.