Skip to main content
SpringerLink
Log in

An Algorithm for Computing the Complete Root Classification of a Parametric Polynomial

  • Conference paper
Artificial Intelligence and Symbolic Computation (AISC 2006)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 4120))

Abstract

The Complete Root Classification for a univariate polynomial with symbolic coefficients is the collection of all the possible cases of its root classification, together with the conditions its coefficients should satisfy for each case. Here an algorithm is given for the automatic computation of the complete root classification of a polynomial with complex symbolic coefficients. The application of complete root classifications to some real quantifier elimination problems is also described.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Arnon, D.S.: On Mechanical Quantifier Elimination for Elementary Algebra and Geometry: Automatic Solution of a Nontrivial Problem. In: Caviness, B.F. (ed.) ISSAC 1985 and EUROCAL 1985. LNCS, vol. 204, pp. 270–271. Springer, Heidelberg (1985)

    Google Scholar 

  2. Arnon, D.S.: Geometric Reasoning with Logic and Algebra. Artificial Intelligence 37, 37–60 (1988)

    Article  MathSciNet  MATH  Google Scholar 

  3. Collins, G.E.: Quantifier Elimination for the Elementary Theory of Real Closed Fields by Cylindrical Algebraic Decomposition. In: Brakhage, H. (ed.) GI-Fachtagung 1975. LNCS, vol. 33, pp. 134–183. Springer, Heidelberg (1975)

    Google Scholar 

  4. Collins, G.E., Hong, H.: Partial Cylindrical Algebraic Decomposition for Quantifier Elimination. Journal of Symbolic Computation 12, 299–328 (1991)

    Article  MathSciNet  MATH  Google Scholar 

  5. Brown, C.W.: QEPCAD B: a Program for Computing with Semi-algebraic Sets Using CADs. ACM SIGSAM Bulletin 37, 97–108 (2003)

    Article  MATH  Google Scholar 

  6. Lan, Y., Wang, L., Zhang, L.: The Finite Checking Method of the Largest Stability Bound for a Class of Uncertain Interval Systems. Journal of Peking University 40, 29–36 (2004)

    MathSciNet  Google Scholar 

  7. Liang, S., Zhang, J.: A Complete Discrimination System for Polynomials with Complex Coefficients and Its Automatic Generation. Science in China (Series E) 42, 113–128 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  8. Winkler, F.: Polynomial Algorithms in Computer Algebra. Springer, Wien (1996)

    MATH  Google Scholar 

  9. Yang, L.: Recent Advances on Determining the Number of Real Roots of Parametric Polynomials. Journal of Symbolic Computation 28, 225–242 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  10. Yang, L., Hou, X., Zeng, Z.: Complete Discrimination System for Polynomials. Science in China (Series E) 39, 628–646 (1996)

    MathSciNet  MATH  Google Scholar 

  11. Yang, L., Zhang, J., Hou, X.: Non-linear Equation Systems and Automated Theorem Proving. Shanghai Press of Science, Technology and Education, Shanghai (1996)

    Google Scholar 

  12. Yang, C., Zhu, S., Liang, Z.: Complete Discrimination of the Roots of Polynomials and Its Applications. Acta Scientiarum Naturalium Universitatis Sunyatseni 42, 5–8 (2003)

    Google Scholar 

  13. Wang, L., Yu, W., Zhang, L.: On the Number of Positive Solutions to a Class of Integral Equations. Preprint in IMA at the University of Minnesota (2004)

    Google Scholar 

  14. Weispfenning, V.: Quantifier Elimination for Real Algebra - the Cubic Case. In: ISSAC, pp. 258–263 (1994)

    Google Scholar 

  15. Lazard, D.: Quantifier Elimination: Optimal Solution for Two Classical Examples. Journal of Symbolic Computation 5, 261–266 (1988)

    Article  MathSciNet  MATH  Google Scholar 

  16. Brown, C.W.: Simple CAD Construction and Its Applications. Journal of Symbolic Computation 31, 521–547 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  17. Grigor’ev, D., Vorobjov, N.: Solving Systems of Polynomial Inequalities in Sub-exponential Time. Journal of Symbolic Computation 5, 37–64 (1988)

    Article  MathSciNet  MATH  Google Scholar 

  18. Aubry, P., Rouillier, F., Safey El Din, M.: Real Solving for Positive Dimensional Systems. Journal of Symbolic Computation 34, 543–560 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  19. Rademacher, H.: On the Partition Function p(n). Proc. London Math. Soc. 43, 241–254 (1937)

    Article  MATH  Google Scholar 

  20. Basu, S., Pollack, R., Roy, M.-F.: Algorithms in Real Algebraic Geometry. Springer, Heidelberg (2003)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Applied Mathematics, The University of Western Ontario, London, Ontario, Canada

    Songxin Liang & David J. Jeffrey

Authors
  1. Songxin Liang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. David J. Jeffrey
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institut für Algorithmen und Kognitive Systeme, Universität Karlsruhe, 76128, Karlsruhe, Germany

    Jacques Calmet

  2. Department of Computer Science, University of Tsukuba, 305-8573, Tsukuba, Japan

    Tetsuo Ida

  3. LMIB – SKLSDE – School of Science, Beihang University, 100083, Beijing, China

    Dongming Wang

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Liang, S., Jeffrey, D.J. (2006). An Algorithm for Computing the Complete Root Classification of a Parametric Polynomial. In: Calmet, J., Ida, T., Wang, D. (eds) Artificial Intelligence and Symbolic Computation. AISC 2006. Lecture Notes in Computer Science(), vol 4120. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11856290_12

Download citation

  • DOI: https://doi.org/10.1007/11856290_12

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-39728-1

  • Online ISBN: 978-3-540-39730-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation