A recursive algorithm for constructing generalized Sturm sequence

Citation
Hg. Fu et al., A recursive algorithm for constructing generalized Sturm sequence, SCI CHINA E, 43(1), 2000, pp. 32-41
Citations number
9
Categorie Soggetti
Engineering Management /General
Journal title
SCIENCE IN CHINA SERIES E-TECHNOLOGICAL SCIENCES
ISSN journal
20950624 → ACNP
Volume
43
Issue
1
Year of publication
2000
Pages
32 - 41
Database
ISI
SICI code
2095-0624(200002)43:1<32:ARAFCG>2.0.ZU;2-C
Abstract
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.