中国科学院机构知识库网格
Chinese Academy of Sciences Institutional Repositories Grid
Algorithms to Compute the Largest Invariant Set Contained in an Algebraic Set for Continuous-Time and Discrete-Time Nonlinear Systems

文献类型:期刊论文

作者Laura Menini; Corrado Possieri; Antonio Tornambè
刊名IEEE/CAA Journal of Automatica Sinica
出版日期2020
卷号7期号:1页码:57-69
关键词Asymptotic stability discrete-time systems invariance nonlinear systems
ISSN号2329-9266
DOI10.1109/JAS.2019.1911819
英文摘要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.
源URL[http://ir.ia.ac.cn/handle/173211/42922]  
专题自动化研究所_学术期刊_IEEE/CAA Journal of Automatica Sinica
推荐引用方式
GB/T 7714
Laura Menini,Corrado Possieri,Antonio Tornambè. Algorithms to Compute the Largest Invariant Set Contained in an Algebraic Set for Continuous-Time and Discrete-Time Nonlinear Systems[J]. IEEE/CAA Journal of Automatica Sinica,2020,7(1):57-69.
APA Laura Menini,Corrado Possieri,&Antonio Tornambè.(2020).Algorithms to Compute the Largest Invariant Set Contained in an Algebraic Set for Continuous-Time and Discrete-Time Nonlinear Systems.IEEE/CAA Journal of Automatica Sinica,7(1),57-69.
MLA Laura Menini,et al."Algorithms to Compute the Largest Invariant Set Contained in an Algebraic Set for Continuous-Time and Discrete-Time Nonlinear Systems".IEEE/CAA Journal of Automatica Sinica 7.1(2020):57-69.

入库方式: OAI收割

来源:自动化研究所

浏览0
下载0
收藏0
其他版本

除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。