Year: 1984
Journal of Computational Mathematics, Vol. 2 (1984), Iss. 2 : pp. 152–163
Abstract
A comparison by Wang and Xu between S. Samle's cost estimation for Newton's method and that of the author's for Kuhn'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's algorithm is obtained.
You do not have full access to this article.
Already a Subscriber? Sign in as an individual or via your institution
Journal Article Details
Publisher Name: Global Science Press
Language: English
DOI: https://doi.org/1984-JCM-9649
Journal of Computational Mathematics, Vol. 2 (1984), Iss. 2 : pp. 152–163
Published online: 1984-01
AMS Subject Headings:
Copyright: COPYRIGHT: © Global Science Press
Pages: 12