Cylindrical algebraic decomposition with equational constraints
From MaRDI portal
Publication:2307622
DOI10.1016/j.jsc.2019.07.019zbMath1432.68599arXiv1903.08999OpenAlexW2963334000MaRDI QIDQ2307622
Matthew England, Russell J. Bradford, James H. Davenport
Publication date: 24 March 2020
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1903.08999
Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30)
Related Items
Curtains in CAD: Why Are They a Problem and How Do We Fix Them?, A Machine Learning Based Software Pipeline to Pick the Variable Ordering for Algorithms with Polynomial Inputs, Lazard-style CAD and Equational Constraints, Kac-Rice formulas and the number of solutions of parametrized systems of polynomial equations, Faster real root decision algorithm for symmetric polynomials, Explainable AI insights for symbolic computation: a case study on selecting the variable ordering for cylindrical algebraic decomposition, Levelwise construction of a single cylindrical algebraic cell, Deciding the consistency of non-linear real arithmetic constraints with a conflict driven search using cylindrical algebraic coverings, Improved Cross-Validation for Classifiers that Make Algorithmic Choices to Minimise Runtime Without Compromising Output Correctness, New heuristic to choose a cylindrical algebraic decomposition variable ordering motivated by complexity analysis
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Cylindrical algebraic sub-decompositions
- On using Lazard's projection in CAD construction
- On the Piano Movers problem. II: General techniques for computing topological properties of real algebraic manifolds
- Iterated discriminants
- Real quantifier elimination is doubly exponential
- Le formalisme du résultant. (The formalism of resultant)
- Partial cylindrical algebraic decomposition for quantifier elimination
- Factors of iterated resultants and discriminants
- Machine learning for mathematical software
- TheoryGuru: a Mathematica package to apply quantifier elimination technology to economics
- Symbolic versus numerical computation and visualization of parameter regions for multistationarity of biological networks
- Validity proof of Lazard's method for CAD construction
- The complexity of the word problems for commutative semigroups and polynomial ideals
- Dimension-dependent bounds for Gröbner bases of polynomial ideals
- Using machine learning to improve cylindrical algebraic decomposition
- Identifying the parametric occurrence of multiple steady states for some biological networks
- Bruno Buchberger's PhD thesis 1965: An algorithm for finding the basis elements of the residue class ring of a zero dimensional polynomial ideal. Translation from the German
- Cylindrical algebraic decomposition using validated numerics
- Algorithmic methods for investigating equilibria in epidemic modeling
- Real quantifier elimination for the synthesis of optimal numerical algorithms (case study: square root computation)
- $$\mathsf {SC}^\mathsf{2} $$ : Satisfiability Checking Meets Symbolic Computation
- Open Non-uniform Cylindrical Algebraic Decompositions
- Improving the Use of Equational Constraints in Cylindrical Algebraic Decomposition
- Real Quantifier Elimination by Computation of Comprehensive Gröbner Systems
- The Complexity of Cylindrical Algebraic Decomposition with Respect to Polynomial Degree
- Optimising Problem Formulation for Cylindrical Algebraic Decomposition
- What Is New in CoCoA?
- Using the Regular Chains Library to Build Cylindrical Algebraic Decompositions by Projecting and Lifting
- Truth Table Invariant Cylindrical Algebraic Decomposition by Regular Chains
- On delineability of varieties in CAD-based quantifier elimination with two equational constraints
- Computing cylindrical algebraic decomposition via triangular decomposition
- Speeding Up Cylindrical Algebraic Decomposition by Gröbner Bases
- Solving Non-linear Arithmetic
- MetiTarski: Past and Future
- On propagation of equational constraints in CAD-based quantifier elimination
- An effective implementation of a symbolic-numeric cylindrical algebraic decomposition for quantifier elimination
- Cylindrical algebraic decompositions for boolean combinations
- Constructing a single open cell in a cylindrical algebraic decomposition
- Explicit factors of some iterated resultants and discriminants
- Constructing fewer open cells by GCD computation in CAD projection
- Efficient projection orders for CAD
- QEPCAD B
- A Symbiosis of Interval Constraint Propagation and Cylindrical Algebraic Decomposition
- A Case Study on the Parametric Occurrence of Multiple Steady States
- On using bi-equational constraints in CAD construction
- Problem Formulation for Truth-Table Invariant Cylindrical Algebraic Decomposition by Incremental Triangular Decomposition
- Applying Machine Learning to the Problem of Choosing a Heuristic to Select the Variable Ordering for Cylindrical Algebraic Decomposition
- Algorithms in real algebraic geometry
- Improved projection for cylindrical algebraic decomposition
- Truth table invariant cylindrical algebraic decomposition
- Cylindrical algebraic decomposition using local projections
