|
rootbound - compute bound on complex roots of a polynomial
|
|
Calling Sequence
|
|
rootbound(p, x)
|
|
|
Parameters
|
|
|
p
|
-
|
polynomial in x with numeric coefficients
|
|
x
|
-
|
name
|
|
|
|
|
|
Description
|
|
|
•
|
Returns a positive integer N such that  for all complex roots r of p. In general, this bound is better than Cauchy's bound of
|
|
|
 .
|
|
|
|
Examples
|
|
|
>
|
|
|
>
|
|
|
| (1) |
|
>
|
|
|
| (2) |
|
>
|
|
|
| (3) |
|
>
|
|
|
>
|
|
|
| (4) |
|
>
|
|
|
| (5) |
|
|
|
References
|
|
|
|
Monagan, M.B. "A Heuristic Irreducibility Test for Univariate Polynomials." J. of Symbolic Comp. Vol. 13 No. 1. Academic Press, (1992): 47-57.
|
|
|
Download Help Document
Was this information helpful?
