Abstract
Kuhn's rootfinding algorithm is revised to be a zerofinding algorithm for any continuous complex function in one complex variable. A sufficient condition for the convergence is set up, and it leads to a result on zero distribution of a class of continuous functions. More concretely, this paper supplies a constructive proof to the following theorem: Suppose f(Z) is a continuous complex function in one complex variable and there exists a positive integer n, a complex Z0
, a nonzero complex a and a positive r such that lim and |Z–Z00|> r implies
then the algebraic number of zeros of f(z) inside |z—z0
|≤ r is at least n
∗This work is supported in part by the Foundation of Zhongshan University Advanced Research Centre.
∗This work is supported in part by the Foundation of Zhongshan University Advanced Research Centre.
Notes
∗This work is supported in part by the Foundation of Zhongshan University Advanced Research Centre.