The authors consider a recursive procedure to construct iterative processes with increasing convergence order . It is based on approximating the tangent to the curve at a point , giving rise to the function
A Newton sequence is then found for . Rather than find from , another function is introduced in such a form as to obtain order of convergence for the iteration . Computational efficiency is analysed and the paper concludes with some numerical examples.