Volume 2, Issue 2
The Cost of Kuhn's Algorithm and Complexity Theory

Sen-Lin Xu

J. Comp. Math., 2 (1984), pp. 152-163

Preview Full PDF BiBTex 0 218
  • 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 improments 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.

  • History

Published online: 1984-02

  • Keywords

  • AMS Subject Headings

  • Cited by