Newton's Cube Root Finding Data Sequence

One of the main objectives of this paper is to study, analyze and develop Newton’s root finding algorithm. The proposed method provides an iterative procedure which systematically creating a sequence of approximations of a root which that converge to a root. The experimental result with a positive number-based cube root algorithm shows that the developed algorithm has converged to with three decimal points of the desired cube root in only four iterations.