.png){kind=icon}
Return
Robust Exact Pole Placement via an LMI-Based Algorithm
.png){kind=icon}
PRE
AI
DOI：10.1109/TAC.2008.2008358.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
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.
Keywords:
Condition number
global optimization
linear matrix inequality (LMI)
pole placement
Sylvester equation
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
7
Papers:
1.3W
Citations:
6.7W
Organization
Cited Papers
ShareSave
ChemInform Abstract: Supramolecular Chemistry of Benzoxazines: From Simple, Selective, Effective, and Efficient Macrocyclization Pathways to Host—Guest Properties.png)
ChemInform
ChemInformIF0
PREAI
ShareSaveShareSave
View more