TY - JOUR
T1 - The Cost of Kuhn's Algorithm and Complexity Theory
JO - Journal of Computational Mathematics
VL - 2
SP - 152
EP - 163
PY - 1984
DA - 1984/02
SN - 2
DO - http://doi.org/
UR - https://global-sci.org/intro/article_detail/jcm/9649.html
KW - 
AB - <p style="text-align: justify;">A comparison by Wang and Xu between S. Samle&#39;s cost estimation for Newton&#39;s method and that of the author&#39;s for Kuhn&#39;s algorithm, both aiming at the zero finding of complex polynomials, showed improvements the advantage of the latter in finding zeros and approximate zeros. In this paper, important on the above work are made. Furthermore, a probabilistic estimation of the monotonicity of Kuhn&#39;s algorithm is obtained.</p>