LMIs in Control/KYP Lemma (Bounded Real Lemma)

From testwiki
Revision as of 01:32, 2 December 2019 by imported>Eoskowro (Created page with "<big><big>'''KYP Lemma (Bounded Real Lemma)'''</big></big> The Kalman–Popov–Yakubovich (KYP) Lemma is a widely used lemma in control theory. It is sometimes also referred...")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

KYP Lemma (Bounded Real Lemma)

The Kalman–Popov–Yakubovich (KYP) Lemma is a widely used lemma in control theory. It is sometimes also referred to as the Bounded Real Lemma. The KYP lemma can be used to determine the H norm of a system and is also useful for proving many LMI results.

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 Optimization Problem

The following optimization problem must be solved.

minimizeγ,XγsubjecttoX>0[ATX+XAXBBTXγI]+1γ[CTDT][CD]<0

The LMI: The KYP or Bounded Real Lemma

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

1)GHγ
2)There exists aX>0such that
[ATX+XAXBBTXγI]+1γ[CTDT][CD]<0

Conclusion:

The KYP Lemma can be used to find the bound γ on the H norm of a system. 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)

Positive Real Lemma


Return to Main Page:

Template:BookCat