.png){kind=icon}
返回
Robust matrix DU-stability analysis
.png){kind=icon}
PRE
AI
DOI：10.1002/rnc.736.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this paper, the problem of robust matrix root-clustering is addressed. The studied matrices are subject to both polytopic and unstructured uncertainties. An original point is the large choice of clustering regions enabled by the proposed approach since these regions can be unions of possibly disjoint and nonsymmetric subregions of the complex plane. The precise purpose is, considering a specified polytope, to determine the greatest robustness bound on the unstructured uncertainty such that robust matrix root-clustering is ensured. To reduce conservatism in the derivation of the bound, the reasoning relies on a framework based upon parameter-dependent Lyapunov functions. The bound value is computed by solving an L M J problem. Copyright (C) 2003 John Wiley Sons, Ltd.
Keyword:
LMI parameter-dependent Lyapunov functions
robust matrix root-clustering
D-U-stability
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.2
论文数:
7.0K
被引数:
1.4W
机构
暂无机构信息
引用论文
.png){kind=icon}
查看更多内容