Comment on: ``On the Kung-Traub conjecture for iterative methods for solving quadratic equations'' (Q1736788)

Summary: 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 [Algorithms (Basel) 9, No. 1, Paper No. 1, 16 p. (2016; Zbl 1461.65074)], \textit{D. K. R. Babajee} 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.