Comment on: "On the Kung-Traub Conjecture for iterative methods for solving quadratic equations" Algorithms 2016, 9, 1
Rights accessOpen Access
Kung-Traub conjecture states that an iterative method without memory for finding the simple zero of a scalar equation could achieve convergence order 2(d-1), and d is the total number of function evaluations. In an article Babajee, D.K.R. On the Kung-Traub Conjecture for Iterative Methods for Solving Quadratic Equations, Algorithms 2016, 9, 1, doi:10.3390/a9010001, the author has shown that Kung-Traub conjecture is not valid for the quadratic equation and proposed an iterative method for the scalar and vector quadratic equations. In this comment, we have shown that we first reported the aforementioned iterative method.
CitationAhmad, F. Comment on: "On the Kung-Traub Conjecture for iterative methods for solving quadratic equations" Algorithms 2016, 9, 1. "Journal of algorithms", Juny 2016, vol. 9, núm. 2, p. 1-11.