Skip to main content

Solving Parametric Polynomial Systems by RealComprehensiveTriangularize

  • Conference paper
Mathematical Software – ICMS 2014 (ICMS 2014)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 8592))

Included in the following conference series:

Abstract

In the authors’ previous work, the concept of comprehensive triangular decomposition of parametric semi-algebraic systems (RCTD for short) was introduced. For a given parametric semi-algebraic system, say S, an RCTD partitions the parametric space into disjoint semi-algebraic sets, above each of which the real solutions of S are described by a finite family of triangular systems. Such a decomposition permits to easily count the number of distinct real solutions depending on different parameter values as well as to conveniently describe the real solutions as continuous functions of the parameters. In this paper, we present the implementation of RCTD in the RegularChains library, namely the RealComprehensiveTriangularize command. The use of RCTD is illustrated by the stability analysis of several biological systems.

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

Access this chapter

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. Basu, S., Pollack, R., Roy, M.-F.: Algorithms in real algebraic geometry. Algorithms and Computations in Mathematics, vol. 10. Springer (2006)

    Google Scholar 

  2. Caviness, B., Johnson, J. (eds.): Quantifier Elimination and Cylindical Algebraic Decomposition. Texts and Mongraphs in Symbolic Computation. Springer (1998)

    Google Scholar 

  3. Chen, C.: Solving Polynomial Systems via Triangular Decomposition. PhD thesis, University of Western Ontario (2011)

    Google Scholar 

  4. Chen, C., Davenport, J.H., May, J., Maza, M.M., Xia, B., Xiao, R.: Triangular decomposition of semi-algebraic systems. J. Symb. Comp. 49, 3–26 (2013)

    Article  MATH  Google Scholar 

  5. Chen, C., Golubitsky, O., Lemaire, F., Moreno Maza, M., Pan, W.: Comprehensive triangular decomposition. In: Ganzha, V.G., Mayr, E.W., Vorozhtsov, E.V. (eds.) CASC 2007. LNCS, vol. 4770, pp. 73–101. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  6. Chen, C., Maza, M.M.: Semi-algebraic description of the equilibria of dynamical systems. In: Gerdt, V.P., Koepf, W., Mayr, E.W., Vorozhtsov, E.V. (eds.) CASC 2011. LNCS, vol. 6885, pp. 101–125. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  7. Chen, C., Moreno Maza, M.: Algorithms for computing triangular decomposition of polynomial systems. J. Symb. Comput. 47(6), 610–642 (2012)

    Article  MATH  MathSciNet  Google Scholar 

  8. Cinquin, O., Demongeot, J.: Positive and negative feedback: striking a balance between necessary antagonists (2002)

    Google Scholar 

  9. Collins, G.E.: Quantifier elimination for real closed fields by cylindrical algebraic decomposition. In: Brakhage, H. (ed.) GI-Fachtagung 1975. LNCS, vol. 33, pp. 515–532. Springer, Heidelberg (1975)

    Google Scholar 

  10. Kalkbrener, M.: Three contributions to elimination theory. PhD thesis, Johannes Kepler University, Linz (1991)

    Google Scholar 

  11. Lazard, D., Rouillier, F.: Solving parametric polynomial systems. J. Symb. Comput. 42(6), 636–667 (2007)

    Article  MATH  MathSciNet  Google Scholar 

  12. Niu, W., Wang, D.M.: Algebraic approaches to stability analysis of biological systems. Mathematics in Computer Science 1, 507–539 (2008)

    Article  MATH  MathSciNet  Google Scholar 

  13. Tyson, J., Novak, B.: Regulation of the eukaryotic cell cycle: Molecular antagonism, hysteresis, and irreversible transitions. Journal of Theoretical Biology 210(2), 249–263 (2001)

    Article  Google Scholar 

  14. Weispfenning, V.: Comprehensive Gröbner bases. J. Symb. Comp. 14, 1–29 (1992)

    Article  MATH  MathSciNet  Google Scholar 

  15. Yang, L., Hou, X.R., Xia, B.: A complete algorithm for automated discovering of a class of inequality-type theorems. Science in China, Series F 44(6), 33–49 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  16. Yang, L., Zhang, J.: Searching dependency between algebraic equations: an algorithm applied to automated reasoning. Technical Report IC/89/263, International Atomic Energy Agency, Miramare, Trieste, Italy (1991)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Chen, C., Maza, M.M. (2014). Solving Parametric Polynomial Systems by RealComprehensiveTriangularize . In: Hong, H., Yap, C. (eds) Mathematical Software – ICMS 2014. ICMS 2014. Lecture Notes in Computer Science, vol 8592. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-44199-2_76

Download citation

  • DOI: https://doi.org/10.1007/978-3-662-44199-2_76

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-662-44198-5

  • Online ISBN: 978-3-662-44199-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics