1,950
Views
1
CrossRef citations to date
0
Altmetric
Research Article

Newton-type iterative methods for finding zeros having higher multiplicity

& | (Reviewing Editor)
Article: 1277463 | Received 16 Sep 2016, Accepted 25 Dec 2016, Published online: 12 Jan 2017

References

  • Farmer, M. R., & Loizou, G. (1985). Locating multiple zeros interactively. Computers & Mathematics with Application, 11, 595–603.
  • Gander, W. (1985). On Halley’s iterative method. The American Mathematical Monthly, 92, 131–134.
  • Jain, P. (2007). Steffensen type methods for solving nonlinear equations. Applied Mathematics and Computation, 194, 527–533.
  • Jain, D. (2013). Families of Newton like method with fourth order convergence. International Journal of Computer Mathematics, 90, 1072–1082.
  • Kasturiarachi, A. B. (2002). Leap-frogging Newton’s method. International Journal of Mathematical Education in Science and Technology, 33, 521–527.
  • Li, S., Liao, X., & Cheng, L. (2009). A new fourth-order iterative method for finding multiple roots of nonlinear equations. Applied Mathematics and Computation, 215, 1282–1292.
  • Petković, M. S., & Milošević, M. (2012). Efficient Halley-like methods for the inclusion of multiple zeros of polynomials. Computational Methods in Applied Mathematics, 12, 351–366.
  • Petković, M. S., Petković, L. D., & Džunić, J. (2014). On an efficient method for the simultaneous approximation of polynomial multiple roots. Applicable Analysis and Discrete Mathematics, 8, 73–94.
  • Sharma, J. R. (2007). A one parameter family of second order iteration method. Applied Mathematics and Computation, 186, 1402–1406.
  • Wu, X. (1999). A significant improvement on Newton’s iterative method. Applied Mathematics and Mechanics, 20, 924–927.