Triangular Decomposition of Semi-algebraic Systems

Details Triangular Decomposition of Semi-algebraic Systems Triangular Decomposition of Semi-algebraic Systems

2010-02-25

arxiv.org/abs/1002.4784v2

Computer Science

Symbolic Computation

8 pages, accepted by ISSAC 2010

Scientific paper

Regular chains and triangular decompositions are fundamental and well-developed tools for describing the complex solutions of polynomial systems. This paper proposes adaptations of these tools focusing on solutions of the real analogue: semi-algebraic systems. We show that any such system can be decomposed into finitely many {\em regular semi-algebraic systems}. We propose two specifications of such a decomposition and present corresponding algorithms. Under some assumptions, one type of decomposition can be computed in singly exponential time w.r.t.\ the number of variables. We implement our algorithms and the experimental results illustrate their effectiveness.

Affiliated with

Also associated with

No associations

Rating

Triangular Decomposition of Semi-algebraic Systems does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Triangular Decomposition of Semi-algebraic Systems, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Triangular Decomposition of Semi-algebraic Systems will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-380020