“…Remark In order to reduce the chaotic behaviour and improve numerical parameters of approximation for lower order polynomials, in and damped Newton's methods have been considered. More precisely, letting λ be the damping parameter, one defines and as follows: and It is easy to observe, by inspection, that Lemma and Theorem remain true if and replace and, respectively, , for arbitrary damping parameter , hence the chaotic behaviour characterised by existence of periodic points of any prime period, as well as the uncountability of the set of points of divergence of iteration of , remain unaltered by damping, for the class of functions considered in Theorem .…”