The task of root-finding of the non-linear equations is perhaps, one of the most complicated problems in applied mathematics especially in a diverse range of engineering applications. The characteristics of the root-finding methods such as convergence rate, performance, efficiency, etc., is directly rely upon the initial guess of the solution to execute the process in most of the systems of non-linear equations. Keeping these facts into mind, based on Taylor's series expansion, we present some new modifications of Halley, Househölder and Golbabai and Javidi's methods and then making them second derivative free by applying Taylor's series. The convergence analysis of the suggested methods is discussed. It is established that the proposed methods possess convergence of orders five and six. Several numerical problems have been tested to demonstrate the validity and applicability of the proposed methods. These test examples also include some real-life problems associated with the chemical and civil engineering such as open channel flow problem, the adiabatic flame temperature equation, conversion of nitrogen-hydrogen feed to ammonia and the van der Wall's equation whose numerical results prove the better performance of the suggested method as compared to other well known existing methods of the same kind in literature. Finally, the dynamics of the presented algorithms in the form of polynomiographs have been shown with the aid of computer program by considering some complex polynomials and compared them with the other wellknown iterative algorithms that revealed the convergence speed and other dynamical aspects of the presented methods.