Cylindrical algebraic sub-decompositions

DOI10.1007/s11786-014-0191-zzbMath1309.68232arXiv1401.0647OpenAlexW3098379678WikidataQ59399761 ScholiaQ59399761MaRDI QIDQ475412

Matthew England, David J. Wilson, James H. Davenport, Russell J. Bradford

Publication date: 27 November 2014

Published in: Mathematics in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1401.0647

zbMATH Keywords

symbolic computationcomputer algebraMaplecylindrical algebraic decompositioncomplexity analysisreal algebraic geometryequational constraints

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30) Semialgebraic sets and related spaces (14P10) Effectivity, complexity and computational aspects of algebraic geometry (14Q20)

Related Items

Recent Advances in Real Geometric Reasoning, An approximate characterisation of the set of feasible trajectories for constrained flat systems, Deciding the consistency of non-linear real arithmetic constraints with a conflict driven search using cylindrical algebraic coverings, Using machine learning to improve cylindrical algebraic decomposition, Identifying the parametric occurrence of multiple steady states for some biological networks, Truth table invariant cylindrical algebraic decomposition, Need Polynomial Systems Be Doubly-Exponential?, Cylindrical algebraic decomposition with equational constraints, The Complexity of Cylindrical Algebraic Decomposition with Respect to Polynomial Degree

Uses Software

• Maple
• MetiTarski
• QEPCAD
• BranchCuts

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the Piano Movers problem. II: General techniques for computing topological properties of real algebraic manifolds
• Real quantifier elimination is doubly exponential
• Partial cylindrical algebraic decomposition for quantifier elimination
• Solving systems of strict polynomial inequalities
• Cylindrical algebraic decomposition using validated numerics
• Algorithmic methods for investigating equilibria in epidemic modeling
• An Incremental Algorithm for Computing Cylindrical Algebraic Decompositions
• Optimising Problem Formulation for Cylindrical Algebraic Decomposition
• Understanding Branch Cuts of Expressions
• Computing cylindrical algebraic decomposition via triangular decomposition
• MetiTarski: Past and Future
• Computation with semialgebraic sets represented by cylindrical algebraic formulas
• 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
• Solving Polynomial Strict Inequalities Using Cylindrical Algebraic Decomposition
• A :20piano movers' '
• Efficient projection orders for CAD
• QEPCAD B
• Geometry of branch cuts
• Cylindrical Algebraic Decomposition I: The Basic Algorithm
• Solving polynomial systems over semialgebraic sets represented by cylindrical algebraic formulas
• On using bi-equational constraints in CAD construction
• Improved projection for cylindrical algebraic decomposition
• Truth table invariant cylindrical algebraic decomposition