Computer Science – Symbolic Computation
Scientific paper
2011-02-03
Computer Science
Symbolic Computation
28 pages
Scientific paper
In this paper, we consider an extended concept of invariant for polynomial dynamical system (PDS) with domain and initial condition, and establish a sound and complete criterion for checking semi-algebraic invariants (SAI) for such PDSs. The main idea is encoding relevant dynamical properties as conditions on the high order Lie derivatives of polynomials occurring in the SAI. A direct consequence of this criterion is a relatively complete method of SAI generation based on template assumption and semi-algebraic constraint solving. Relative completeness means if there is an SAI in the form of a predefined template, then our method can indeed find one using this template.
Liu Jiang
Zhan Naijun
Zhao Hengjun
No associations
LandOfFree
Computing Semi-algebraic Invariants for Polynomial Dynamical 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 Computing Semi-algebraic Invariants for Polynomial Dynamical Systems, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Computing Semi-algebraic Invariants for Polynomial Dynamical Systems will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-427908