Triangular decomposition of semi-algebraic systems
نویسندگان
چکیده
منابع مشابه
Computing Equilibria of Semi-algebraic Economies Using Triangular Decomposition and Real Solution Classification
In this paper, we are concerned with the problem of determining the existence of multiple equilibria in economic models. We propose a general and complete approach for identifying multiplicities of equilibria in semi-algebraic economies, which may be expressed as semi-algebraic systems. The approach is based on triangular decomposition and real solution classification, two powerful tools of alg...
متن کاملSolving Parametric Semi-Algebraic Systems
Let Q be the field of rational numbers and Q[u1, ..., ud, x1, ..., xs] the ring of polynomials in n indeterminates with coefficients in Q and d + s = n (0 ≤ d < n). The indeterminates are divided into two groups: u = (u1, ..., ud) and x = (x1, ..., xs), which are called parameters and variables, respectively. A polynomial set is a finite set of nonzero polynomials in Q[u,x]. The following syste...
متن کاملSemi-decidable Synthesis for Triangular Hybrid Systems
The algorithmic design of least restrictive controllers for hybrid systems that satisfy reachability specifications has received much attention recently. Despite the importance of algorithmic approaches to controller design for hybrid systems, results that guarantee termination of the algorithms have been limited. In this paper, we extend recent decidability results on controller synthesis for ...
متن کاملChoosing a Variable Ordering for Truth-Table Invariant Cylindrical Algebraic Decomposition by Incremental Triangular Decomposition
Cylindrical algebraic decomposition (CAD) is a key tool for solving problems in real algebraic geometry and beyond. In recent years a new approach has been developed, where regular chains technology is used to first build a decomposition in complex space. We consider the latest variant of this which builds the complex decomposition incrementally by polynomial and produces CADs on whose cells a ...
متن کاملProblem Formulation for Truth-Table Invariant Cylindrical Algebraic Decomposition by Incremental Triangular Decomposition
Cylindrical algebraic decompositions (CADs) are a key tool for solving problems in real algebraic geometry and beyond. We recently presented a new CAD algorithm combining two advances: truth-table invariance, making the CAD invariant with respect to the truth of logical formulae rather than the signs of polynomials; and CAD construction by regular chains technology, where first a complex decomp...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Symbolic Computation
سال: 2013
ISSN: 0747-7171
DOI: 10.1016/j.jsc.2011.12.014