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 71 articles , 1 standard article )

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

1 2 3 4 next

  1. 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)
  2. England, Matthew; Bradford, Russell; Davenport, James H.: Cylindrical algebraic decomposition with equational constraints (2020)
  3. Guo, Feng; Phạm, Ti’ên-Son: On types of degenerate critical points of real polynomial functions (2020)
  4. Kremer, Gereon; Ábrahám, Erika: Fully incremental cylindrical algebraic decomposition (2020)
  5. Lange-Hegermann, Markus; Robertz, Daniel: Thomas decomposition and nonlinear control systems (2020)
  6. 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)
  7. Amzallag, Eli; Sun, Mengxiao; Pogudin, Gleb; Vo, Thieu N.: Complexity of triangular representations of algebraic sets (2019)
  8. England, Matthew; Florescu, Dorian: Comparing machine learning models to choose the variable ordering for cylindrical algebraic decomposition (2019)
  9. Harris, Corey; Michałek, Mateusz; Sertöz, Emre Can: Computing images of polynomial maps (2019)
  10. Huang, Zongyan; England, Matthew; Wilson, David J.; Bridge, James; Davenport, James H.; Paulson, Lawrence C.: Using machine learning to improve cylindrical algebraic decomposition (2019)
  11. Schreck, Pascal: On the mechanization of straightedge and compass constructions (2019)
  12. Montes, Antonio: The Gröbner cover (2018)
  13. Cifuentes, Diego; Parrilo, Pablo A.: Chordal networks of polynomial ideals (2017)
  14. Corless, Robert M.; Moreno Maza, Marc; Thornton, Steven E.: Jordan canonical form with parameters from Frobenius form with parameters (2017)
  15. Davenport, James H.: What does “without loss of generality” mean, and how do we detect it (2017)
  16. Dong, Rina; Mou, Chenqi: Decomposing polynomial sets simultaneously into Gröbner bases and normal triangular sets (2017)
  17. Han, Jingjun; Dai, Liyun; Hong, Hoon; Xia, Bican: Open weak CAD and its applications (2017)
  18. 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)
  19. Alvandi, Parisa; Kazemi, Mahsa; Maza, Marc Moreno: Computing limits with the RegularChains and PowerSeries libraries: from rational functions to Zariski closure (2016)
  20. Bradford, Russell; Davenport, James H.; England, Matthew; McCallum, Scott; Wilson, David: Truth table invariant cylindrical algebraic decomposition (2016)

1 2 3 4 next

Further publications can be found at: