We are devoted to the study of an iterative recursive Traub-Steffensen like method for approximating the simple roots of a nonlinear equation. Using the recursive technique, the R-order of convergence is increased from 4 to 8 without any new function evaluations, which means 100% improvement of the order of the convergence. The theoretical study of the convergence rate is investigated and demonstrated. A few nonlinear problems are presented to justify the theoretical study.