Skip to main content
SpringerLink
Log in

A recursive algorithm for constructing generalized Sturm sequence

  • Published:
Science in China Series E: Technological Sciences Aims and scope Submit manuscript

Abstract

The generalized Sturm sequence is used to determine the number of real roots of a polynomialf(x) subject toh(x)>0 whereh(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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Tarski, A., A Decision Method for Elementary Algebra and Geometry, 2nd ed., Univ. of California Press, 1951.

  2. González-Vega, L., Lombardi, H., Recio, T. et al., Sturm-Habicht sequence, ISSAC-89 Proceedings, ACM Press, 1989, 136–146.

  3. González-Vega, L., Recio, T., Lombardi, H. et al., Sturm-Habicht sequence, determinants and real roots of univariate polynomials, Quantifier Elimination and Cylindrical Algebraic Decomposition (eds. Caviness, B. F., Johnson, J. R.), Berlin: Springer-Verlag, 1998, 300–316.

    Google Scholar 

  4. Habicht, W., Eine Verallgemeinerung des Sturmschen Wurzelzählverfahrens, Comm. Math. Helvetici, 1948, 21: 99.

    Article  MATH  MathSciNet  Google Scholar 

  5. Yang, L., Hou, X. R., Zeng, Z. B., A complete discrimination system for polynomials, Science in China, Ser. E, 1996, 39(6): 628.

    MATH  MathSciNet  Google Scholar 

  6. Yang, L., Xia, B. C., Explicit criterion to determine the number of positive roots of a polynomial, MM Research Preprints, 1997, (15): 134.

    Google Scholar 

  7. Yang, L., Zhang, J. Z., Hou, X. R., Nonlinear Algebraic Equation System and Automated Theorem Proving (in Chinese), Shanghai: Shanghai Scientific and Technological Education Publishing House, 1996.

    Google Scholar 

  8. Liang, S. X., Zhang, J. Z., A complete discrimination system for polynomials with complex coefficients and its automatic generation, Science in China, Ser. E, 1999, 42(2): 113.

    Article  MATH  MathSciNet  Google Scholar 

  9. Loos, R., Generalized polynomial remainder sequence, Computer Algebra: Symbolic and Algebraic Computation (ed. Buchberger, B.), Berlin: Springer-Verlag, 1983, 115–137.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Chengdu Institute of Computer Application, Chinese Academy of Sciences, 610041, Chengdu, China

    Hongguang Fu, Lu Yang & Zhenbing Zeng

Authors
  1. Hongguang Fu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Lu Yang
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Zhenbing Zeng
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Fu, H., Yang, L. & Zeng, Z. A recursive algorithm for constructing generalized Sturm sequence. Sci. China Ser. E-Technol. Sci. 43, 32–41 (2000). https://doi.org/10.1007/BF02917135

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02917135

Keywords

Search

Navigation