polyroot(z)
z
| the vector of polynomial coefficients in decreasing order. |
p(x) = z1 + z2*x + ... + z[n] * x^(n-1)
z[1:n]
.
polyroot
returns the n-1 complex zeros of p(x) using the
Jenkins-Traub algorithm.
length(z) - 1
.
uniroot
for numerical root finding of arbitray functions;
complex
and the zero
example in the demos directory.