We solve polynomials algebraically in order to determine the roots - where a curve cuts the \(x\)-axis. A root of a polynomial function, \(f(x)\), is a value for \(x\) for which \(f(x) = 0\).

In this paper we propose the two kinds of different criterions and use them to judge the convergence of Durand-Kerner method and to compare the obtained results with other methods. Journal Information ...

The amount of time it takes for an algorithm to solve a polynomial function, which is a mathematical expression that does not contain fractions or negative numbers. The time is proportional to the ...