References
- Chen , D. 1989 . On the convergence of a class of generalized Steffensen's iterative procedures and error analysis . Int. J. Comput. Math. , 31 : 195 – 203 .
- Dehghan , M. and Hajarian , M. A variant of Steffensen's method with a better approximation to the derivative . Appl. Math. Comput. , doi:10.1016/j.amc.2007.12.046
- Dong , C. 1987 . A family of one-point iteration formulae for finding roots . Int. J. Comput. Math. , 14 : 363 – 367 .
- Gander , W. 1985 . On Halley's iteration method . Am. Math. Monthly , 92 : 131 – 134 .
- Halley , E. Methodus nova, accurata & facilis inveniendi radices aequationum quarumcumque generaliter, sine praevia reductione . Philos. Trans. R. Soc. Lond. , 18 ( 1694 ) 136 – 148 .
- Özban , A. Y. 2004 . Some new variants of Newton's method . Appl. Math. Lett. , 17 : 677 – 682 .
- Popovski , D. B. 1980 . A family of one-point iteration formulae for finding roots . Int. J. Comput. Math. , 8 : 85 – 88 .
- Scavo , T. R. and Thoo , J. B. 1995 . On the geometry of Halley's method . Am. Math. Monthly , 102 : 417 – 426 .
- Shaw , R. E. and Garey , L. E. 1999 . A new cubic method for computing a root . Int. J. Comput. Math. , 73 : 243 – 251 .
- Traub , J. F. 1964 . Iterative Methods for the Solution of Equations , Englewood Cliffs, NJ : Prentice-Hall .
- Weerakoon , S. and Fernando , T. G.I. 2000 . A variant of Newton's method with accelerated third-order convergence . Appl. Math. Lett. , 13 : 87 – 93 .