Abstract
Solving non-linear equation is perhaps one of the most difficult problems in all of numerical computations, especially in a diverse range of engineering applications. The convergence and performance characteristics can be highly sensitive to the initial guess of the solution for most numerical methods such as Newton's method. However, it is very difficult to select reasonable initial guess of the solution for most systems of non-linear equations. Besides, the computational efficiency is not high enough. Taking this into account, based on variational iteration technique, we develop some new iterative algorithms for solving one-dimensional non-linear equations. The convergence criteria of these iterative algorithms has also been discussed. The superiority of the proposed iterative algorithms is illustrated by solving some test examples and comparing them with other well-known existing iterative algorithms in literature. In the end, the graphical comparison of the proposed iterative algorithms with other well-known iterative algorithms have been made by means of polynomiographs of different complex polynomials which reflect the fractal behavior and dynamical aspects of the proposed iterative algorithms.