TY - JOUR
T1 - The Monotonicity Problem in Finding Roots of Polynomials by Kuhn's Algorithm
AU - Xu , Sen-Lin
AU - Wang , Ze-Ke
JO - Journal of Computational Mathematics
VL - 3
SP - 203
EP - 210
PY - 1983
DA - 1983/01
SN - 1
DO - http://doi.org/
UR - https://global-sci.org/intro/article_detail/jcm/9696.html
KW - 
AB - <p style="text-align: justify;">In this paper the problem proposed by Kuhn on the presence of a monotonicity property related to the Kuhn&#39;s algorithm for finding roots of a polynomials is solved in the affirmative. Furthermore, an estimate of the threshold number D in the above-mentioned monotonicity problem expressed in terms of the complex coefficients of the polynomial is obtained.</p>