首页> 中文期刊> 《自动化学报:英文版》 >Algorithms to Compute the Largest Invariant Set Contained in an Algebraic Set for Continuous-Time and Discrete-Time Nonlinear Systems

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

         

摘要

cqvip: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.

著录项

获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号