full
search.png

Search

close.png

Cancel

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

Sen-Lin Xu

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

Published online: 1984-02

Preview Full PDF 2595 25426

Cited by

google scholar semantic scholar
Export citation
  • 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.

  • Keywords

  • AMS Subject Headings

  • Copyright

COPYRIGHT: © Global Science Press

  • Email address
  • BibTex
  • RIS
  • TXT
@Article{JCM-2-152, author = {Sen-Lin Xu}, title = {The Cost of Kuhn's Algorithm and Complexity Theory}, journal = {Journal of Computational Mathematics}, year = {1984}, volume = {2}, number = {2}, pages = {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.

}, issn = {1991-7139}, doi = {https://doi.org/}, url = {http://global-sci.org/intro/article_detail/jcm/9649.html} }
TY - JOUR T1 - The Cost of Kuhn's Algorithm and Complexity Theory AU - Sen-Lin Xu 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 -

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.

Sen-Lin Xu. (1984). The Cost of Kuhn's Algorithm and Complexity Theory. Journal of Computational Mathematics. 2 (2). 152-163. doi:
Copy to clipboard
BibteX RIS TXT
The citation has been copied to your clipboard