Algorithms to Compute the Largest Invariant Set Contained in an Algebraic Set for Continuous-Time and Discrete-Time Nonlinear Systems

In this paper, some computational tools are proposed to determine the largest invariant set, with respect to either a continuous-time or a discrete-time system, that is contained in an algebraic set. In particular, it is shown that if the vector field governing the dynamics of the system is polynomial and the considered analytic set is a variety, then algorithms from algebraic geometry can be used to solve the considered problem. Examples of applications of the method(spanning from the characterization of the stability to the computation of the zero dynamics) are given all throughout the paper.