The generalized Sturm sequence is used to determine the number of real root
s of a polynomial f(x) subject to h(x) > 0 where h(x) is another polynomial
. To construct this sequence, the original procedure is almost the same as
Euclidean algorithm, so it is terribly inefficient for polynomials with sym
bolic coefficients. A new method is developed instead, which succeeds in av
oiding the high computational complexity caused by the division algorithm.