The RegularChains library in Maple 10. The RegularChains library provides facilities for symbolic computations with systems of polynomial equations. In particular, it allows to compute modulo a set of algebraic relations. Automatic case discussion (and recombination) handles zero-divisors and parameters. This permits triangular decomposition of polynomial equations

References in zbMATH (referenced in 75 articles , 1 standard article )

Showing results 1 to 20 of 75.
Sorted by year (citations)

1 2 3 4 next

  1. Ábrahám, Erika; Davenport, James H.; England, Matthew; Kremer, Gereon: Deciding the consistency of non-linear real arithmetic constraints with a conflict driven search using cylindrical algebraic coverings (2021)
  2. Dong, Rina; Wang, Dongming: Computing strong regular characteristic pairs with Gröbner bases (2021)
  3. Bradford, Russell; Davenport, James H.; England, Matthew; Errami, Hassan; Gerdt, Vladimir; Grigoriev, Dima; Hoyt, Charles; Košta, Marek; Radulescu, Ovidiu; Sturm, Thomas; Weber, Andreas: Identifying the parametric occurrence of multiple steady states for some biological networks (2020)
  4. England, Matthew; Bradford, Russell; Davenport, James H.: Cylindrical algebraic decomposition with equational constraints (2020)
  5. Guo, Feng; Phạm, Ti’ên-Son: On types of degenerate critical points of real polynomial functions (2020)
  6. Kremer, Gereon; Ábrahám, Erika: Fully incremental cylindrical algebraic decomposition (2020)
  7. Lange-Hegermann, Markus; Robertz, Daniel: Thomas decomposition and nonlinear control systems (2020)
  8. Quadrat, Alban (ed.); Zerz, Eva (ed.): Algebraic and symbolic computation methods in dynamical systems. Based on articles written for the invited sessions of the 5th symposium on system structure and control, IFAC, Grenoble, France, February 4--6, 2013 and of the 21st international symposium on mathematical theory of networks and systems (MTNS 2014), Groningen, the Netherlands, July 7--11, 2014 (2020)
  9. Amzallag, Eli; Sun, Mengxiao; Pogudin, Gleb; Vo, Thieu N.: Complexity of triangular representations of algebraic sets (2019)
  10. England, Matthew; Florescu, Dorian: Comparing machine learning models to choose the variable ordering for cylindrical algebraic decomposition (2019)
  11. Harris, Corey; Michałek, Mateusz; Sertöz, Emre Can: Computing images of polynomial maps (2019)
  12. Huang, Zongyan; England, Matthew; Wilson, David J.; Bridge, James; Davenport, James H.; Paulson, Lawrence C.: Using machine learning to improve cylindrical algebraic decomposition (2019)
  13. Schreck, Pascal: On the mechanization of straightedge and compass constructions (2019)
  14. Montes, Antonio: The Gröbner cover (2018)
  15. Cifuentes, Diego; Parrilo, Pablo A.: Chordal networks of polynomial ideals (2017)
  16. Corless, Robert M.; Moreno Maza, Marc; Thornton, Steven E.: Jordan canonical form with parameters from Frobenius form with parameters (2017)
  17. Davenport, James H.: What does “without loss of generality” mean, and how do we detect it (2017)
  18. Dong, Rina; Mou, Chenqi: Decomposing polynomial sets simultaneously into Gröbner bases and normal triangular sets (2017)
  19. Han, Jingjun; Dai, Liyun; Hong, Hoon; Xia, Bican: Open weak CAD and its applications (2017)
  20. Liang, Quanyi; She, Zhikun; Wang, Lei; Chen, Michael Z. Q.; Wang, Qing-Guo: Characterizations and criteria for synchronization of heterogeneous networks to linear subspaces (2017)

1 2 3 4 next

Further publications can be found at: