%0 Journal Article %1 Babajee2006659 %A Babajee, D.K.R. %A Dauhoo, M.Z. %D 2006 %J Applied Mathematics and Computation %K 2006 algorithm root-finding %N 1 %P 659 - 684 %R 10.1016/j.amc.2006.05.116 %T An analysis of the properties of the variants of Newton’s method with third order convergence %U http://dx.doi.org/10.1016/j.amc.2006.05.116 %V 183 %X For the last five years, the variants of the Newton’s method with cubic convergence have become popular iterative methods to find approximate solutions to the roots of non-linear equations. These methods both enjoy cubic convergence at simple roots and do not require the evaluation of second order derivatives. In this paper, we investigate about the relationship between these methods which are in fact based on the approximation of the second order derivative present in the third order limited Taylor expansion. We also prove that they are different forms of the Halley method and are all contractive iterative methods in a common neighbourhood. We extend some of these variants to multivariate cases and prove their respective local cubic convergence from their corresponding linear models.

@article{Babajee2006659, abstract = {For the last five years, the variants of the Newton’s method with cubic convergence have become popular iterative methods to find approximate solutions to the roots of non-linear equations. These methods both enjoy cubic convergence at simple roots and do not require the evaluation of second order derivatives. In this paper, we investigate about the relationship between these methods which are in fact based on the approximation of the second order derivative present in the third order limited Taylor expansion. We also prove that they are different forms of the Halley method and are all contractive iterative methods in a common neighbourhood. We extend some of these variants to multivariate cases and prove their respective local cubic convergence from their corresponding linear models. }, added-at = {2014-01-15T18:54:46.000+0100}, author = {Babajee, D.K.R. and Dauhoo, M.Z.}, biburl = {https://www.bibsonomy.org/bibtex/23a8557a8f9ecb61b1f768d806a93c06f/thorade}, description = {An analysis of the properties of the variants of Newton’s method with third order convergence}, doi = {10.1016/j.amc.2006.05.116}, interhash = {4b28840ec8311e05329e49160179f064}, intrahash = {3a8557a8f9ecb61b1f768d806a93c06f}, issn = {0096-3003}, journal = {Applied Mathematics and Computation }, keywords = {2006 algorithm root-finding}, number = 1, pages = {659 - 684}, timestamp = {2014-01-15T18:54:46.000+0100}, title = {An analysis of the properties of the variants of Newton’s method with third order convergence }, url = {http://dx.doi.org/10.1016/j.amc.2006.05.116}, volume = 183, year = 2006 }