检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]Department of Mechanics and Engineering Science Peking University,Beijing 100871, P. R. China [2]P. O. Box 1303-15, Beijing 100073, P. R. China [3]Department of Applied Mathematics Shanghai Normal University,Shanghai 200234, P. R. China [4]P. O. Box 1303-15 Beijing 100073, P. R. China [5]P. O. Box 53-601 Lanzhou 730070, P. R. China
出 处:《Applied Mathematics and Mechanics(English Edition)》2006年第2期207-213,共7页应用数学和力学(英文版)
基 金:Project supported by Post-Doctoral Science Foundation of China
摘 要:The problem of checking robust D-stability of multi-in and multi-out (MIMO) systems was studied. Three system models were introduced, i.e. multilinear polynomial matrix, polytopic polynomial matrix and feedback system model. Furthermore, the convex property of each model with respect to the parametric uncertainties was estabilished respectively. Based on this, sufficient conditions for D-stability were expressed in terms of linear matrix inequalities (LMIs) involving only the convex vertices. Therefore, the robust D-stability was tested by solving an LMI optimal problem.The problem of checking robust D-stability of multi-in and multi-out (MIMO) systems was studied. Three system models were introduced, i.e. multilinear polynomial matrix, polytopic polynomial matrix and feedback system model. Furthermore, the convex property of each model with respect to the parametric uncertainties was estabilished respectively. Based on this, sufficient conditions for D-stability were expressed in terms of linear matrix inequalities (LMIs) involving only the convex vertices. Therefore, the robust D-stability was tested by solving an LMI optimal problem.
关 键 词:polynomial matrix robust D-stability Linear matrix inequalities parametric uncertainty
分 类 号:O232[理学—运筹学与控制论]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.33