.png){kind=icon}
返回
Robust Exact Pole Placement via an LMI-Based Algorithm
.png){kind=icon}
PRE
AI
DOI：10.1109/TAC.2008.2008358.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This technical note deals with the robust exact pole placement problem: pole placement algorithms that guarantee a small variation of the assigned poles against possible perturbations. The solution to this problem is related to the solvability of a Sylvester-like equation. Thus, the main issue is to compute a well-conditioned solution to this equation. Also, the best candidate solution must possess the minimal condition number, to reduce sensitivity to perturbation. This problem is cast as a global optimization under linear matrix inequality constraints, for which a numerical convergent algorithm is provided and compared with the most attractive methods in the literature.
Keyword:
Condition number
global optimization
linear matrix inequality (LMI)
pole placement
Sylvester equation
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7
论文数:
1.3W
被引数:
6.7W
机构
引用论文
分享收藏
ChemInform Abstract: Supramolecular Chemistry of Benzoxazines: From Simple, Selective, Effective, and Efficient Macrocyclization Pathways to Host—Guest Properties.png)
ChemInform
ChemInformIF0
PREAI
分享收藏
查看更多内容