LMIs in Control/KYP Lemmas/Positive Real Lemma

From testwiki
Revision as of 14:10, 2 July 2021 by 188.130.155.156 (talk) (fixed url typo)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

Positive Real Lemma

The Positive Real Lemma is a variation of the Kalman–Popov–Yakubovich (KYP) Lemma. The Positive Real Lemma can be used to determine if a system is passive (positive real).

The System

x˙(t)=Ax(t)+Bu(t)y(t)=Cx(t)+Du(t)x(0)=x0

where x(t)n, y(t)m, u(t)q, at any t.

The Data

The matrices A,B,C,D are known.

The LMI: The Positive Real Lemma

Suppose G^(s)(A,B,C,D) is the system. Then the following are equivalent.

1)Gis passive, i.e.u,GuL20(G^(s)+G^(s)*0)
2)There exists aX>0such that
[ATX+XAXBCTBTXCDTD]0

Conclusion:

The Positive Real Lemma can be used to determine if the system G is passive. Note from the (1,1) block of the LMI we know that A is Hurwitz.

Implementation

A link to CodeOcean or other online implementation of the LMI (in progress)

KYP Lemma (Bounded Real Lemma)

A list of references documenting and validating the LMI.


Return to Main Page:

Template:BookCat