The Kalman-Yakubovich-Popov Lemma for Discrete-Time Positive Linear Systems

被引：0

作者：

Najson, Federico ^{[1
]}

机构：

[1] Univ Republica, Fac Ingn, Inst Ingn Elect, Montevideo, Uruguay

来源：

2012 AMERICAN CONTROL CONFERENCE (ACC) | 2012年

关键词：

D O I：

暂无

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

A theorem of alternatives on the feasibility of linear matrix inequalities (LMIs) is used in order to provide a simple proof of the Kalman-Yakubovich-Popov (KYP) Lemma for discrete-time positive linear systems. It is further shown that for some classes of positive linear systems the KYP Lemma can also be equivalently stated in terms of an associated system matrix (which is only composed by the four system matrices) by requiring its spectral radius being smaller than one. A recursive method, to determine whether a positive matrix is or is not Schur, is obtained as an application of the aforementioned equivalence.

引用

页码：5188 / 5193

页数：6

共 9 条

[1]

[Anonymous], 2000, PUR AP M-WI

[2] Semidefinite programming duality and linear time-invariant systems [J].

Balakrishnan, V ;

Vandenberghe, L .

IEEE TRANSACTIONS ON AUTOMATIC CONTROL, 2003, 48 (01) :30-41

[3]

BALAKRISHNAN V, 2002, TRECE0202 PURD U SCH

[4]

Dullerud G.E., 2000, A Course in Robust Control Theory: A Convex Approach, VVolume 6

[5]

Horn R.A., 2012, Matrix Analysis

[6] On the Kalman-Yakubovich-Popov lemma [J].

Rantzer, A .

SYSTEMS & CONTROL LETTERS, 1996, 28 (01) :7-10

[7]

Skelton R., 1998, A Unified Algebraic Approach to Linear Control Design

[8]

Tanaka T., 2010, P 2010 AM CONTR C

[9]

Yiping C., 2007, P 26 CHIN CONTR C

← 1 →