QEPCAD
QEPCAD B: A program for computing with semi-algebraic sets using CADs. QEPCAD is an implementation of quantifier elimination by partial cylindrical algebraic decomposition due orginally to Hoon Hong, and subsequently added on to by many others. It is an interactive command-line program written in C/C++, and based on the SACLIB library. Presented here is QEPCAD B version 1.x, the ”B” designating a substantial departure from the original QEPCAD and distinguishing it from any development of the original that may proceed in a different direction. QEPCAD and the SACLIB library are the result of a program of research by George Collins and his PhD students that has spanned several decades ... and continues still! I extended and improved QEPCAD for several years. Improvements that didn’t involve changes to the way the program interacted with the user I’d just go ahead and make. However, changes that affected the interaction of QEPCAD and the user, or changes that added new features were ”tacked on” to the program, requiring the user to know about extra commands. Moreover, there was no cannonical source for QEPCAD distribution or documentation, and no internet accessible source at all. This branch of QEPCAD, QEPCAD ”B”, was introduced to address those problems - to make QEPCAD easily accessable through the internet, to provide good documentation, and to incorporate many improvements and extensions in a way that makes them most accessible to the user.
This software is also peer reviewed by journal TOMS.
This software is also peer reviewed by journal TOMS.
Keywords for this software
References in zbMATH (referenced in 283 articles , 1 standard article )
Showing results 1 to 20 of 283.
Sorted by year (- Á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)
- Grigoriev, Dima; Iosif, Alexandru; Rahkooy, Hamid; Sturm, Thomas; Weber, Andreas: Efficiently and effectively recognizing toricity of steady state varieties (2021)
- Kruff, Niclas; Lüders, Christoph; Radulescu, Ovidiu; Sturm, Thomas; Walcher, Sebastian: Algorithmic reduction of biological networks with multiple time scales (2021)
- Saminger-Platz, Susanne; Kolesárová, Anna; Šeliga, Adam; Mesiar, Radko; Klement, Erich Peter: The impact on the properties of the EFGM copulas when extending this family (2021)
- Seiler, Werner M.; Seiß, Matthias; Sturm, Thomas: A logic based approach to finding real singularities of implicit ordinary differential equations (2021)
- Šeliga, Adam; Kauers, Manuel; Saminger-Platz, Susanne; Mesiar, Radko; Kolesárová, Anna; Klement, Erich Peter: Polynomial bivariate copulas of degree five: characterization and some particular inequalities (2021)
- 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)
- Davenport, James H. (ed.); England, Matthew (ed.); Griggio, Alberto (ed.); Sturm, Thomas (ed.); Tinelli, Cesare (ed.): Editorial: Symbolic computation and satisfiability checking (2020)
- England, Matthew; Bradford, Russell; Davenport, James H.: Cylindrical algebraic decomposition with equational constraints (2020)
- Kremer, Gereon; Ábrahám, Erika: Fully incremental cylindrical algebraic decomposition (2020)
- Uray, Marcell János: On proving inequalities by cylindrical algebraic decomposition (2020)
- Conradi, Carsten; Iosif, Alexandru; Kahle, Thomas: Multistationarity in the space of total concentrations for systems that admit a monomial parametrization (2019)
- England, Matthew; Florescu, Dorian: Comparing machine learning models to choose the variable ordering for cylindrical algebraic decomposition (2019)
- Fukasaku, Ryoya; Iwane, Hidenao; Sato, Yosuke: On multivariate Hermitian quadratic forms (2019)
- Huang, Zongyan; England, Matthew; Wilson, David J.; Bridge, James; Davenport, James H.; Paulson, Lawrence C.: Using machine learning to improve cylindrical algebraic decomposition (2019)
- Li, Wenda; Passmore, Grant Olney; Paulson, Lawrence C.: Deciding univariate polynomial problems using untrusted certificates in Isabelle/HOL (2019)
- McCallum, Scott; Parusiński, Adam; Paunescu, Laurentiu: Validity proof of Lazard’s method for CAD construction (2019)
- Verdière, N.; Orange, S.: A systematic approach for doing an a priori identifiability study of dynamical nonlinear models (2019)
- Wang, Chu; Yang, Zhi-Hong; Zhi, Lihong: Global optimization of polynomials over real algebraic sets (2019)
- Brambilla, Maria Chiara; Staglianò, Giovanni: On the algebraic boundaries among typical ranks for real binary forms (2018)