.png){kind=icon}
返回
Structured coprime factor model reduction based on LMIs
.png){kind=icon}
OA
AI
DOI：10.1016/j.automatica.2004.09.003.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this paper we discuss dynamic model reduction methods which preserve a certain structure in the underlying system. Specifically. we consider the situation where the reduction must be consistent with a partition of the system states. This is motivated, for instance, in situations where state variables are associated with the topology of a networked system, and the reduction should preserve this. We build on the observation that imposing block structure to generalized controllability and observability gramians automatically yields such state-partitioned model reduction. The difficulty lies in ensuring feasibility of the resulting Lyapunov inequalities, which is in general very restrictive. To overcome this, we consider coprime factor model reduction. We derive an LMI characterization of expansive and contractive coprime factorizations that preserve structure, and use this to build a more flexible method for structured model reduction. An example is given to illustrate the method. (C) 2004 Elsevier Ltd. All rights reserved.
Keyword:
model reduction
structure preserving
coprime factorization
linear matrix inequality (LMI)
algebraic Riccati inequality
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
5.9
论文数:
1.2W
被引数:
5.2W
机构
暂无机构信息
引用论文
.png){kind=icon}
分享收藏
分享收藏
查看更多内容