| A recursive algorithm
for constructing
generalized Sturm sequence |
| |
| 作者姓名： | 符红光 杨路 曾振柄 |
| |
| 作者单位： | Chengdu Institute of Computer Application, Chinese Academy of Sciences, Chengdu 610041, China
|
| |
| 基金项目： | 科技部科研项目，Key Project on Fundamental Research of the Chinese Academy of Sciences |
| |
| 摘 要： | The generalized Sturm sequence is used to determine the number of real roots 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 symbolic coefficients. A new method is developed instead, which succeeds in avoiding the high computational complexity caused by the division algorithm.
|
A recursive algorithm for constructing generalized Sturm sequence |
| |
| FU Hongguang,YANG Lu,ZENG Zhenbing.A recursive algorithm
for constructing
generalized Sturm sequence[J].Science in China(Technological Sciences),2000,43(1):32-41. |
| |
| Authors: | FU Hongguang YANG Lu ZENG Zhenbing |
| |
| Affiliation: | Chengdu Institute of Computer Application, Chinese Academy of Sciences, Chengdu 610041, China |
| |
| Abstract: | The generalized Sturm sequence is used to determine the number of real roots 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 symbolic coefficients. A new method is developed instead, which succeeds in avoiding the high computational complexity caused by the division algorithm. |
| |
| Keywords: | subresultant polynomial principal subresultant coefficient polynomial remainder sequence |
| 本文献已被 万方数据 SpringerLink 等数据库收录！ |
