@Article{JCM-1-203,
author = {Xu , Sen-Lin and Wang , Ze-Ke},
title = {The Monotonicity Problem in Finding Roots of Polynomials by Kuhn's Algorithm},
journal = {Journal of Computational Mathematics},
year = {1983},
volume = {1},
number = {3},
pages = {203--210},
abstract = {<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>},
issn = {1991-7139},
doi = {https://doi.org/},
url = {http://global-sci.org/intro/article_detail/jcm/9696.html}
}