On the KalmanYakubovichPopov Lemma and its Application in Model - - PowerPoint PPT Presentation

on the kalman yakubovich popov lemma and its application
SMART_READER_LITE
LIVE PREVIEW

On the KalmanYakubovichPopov Lemma and its Application in Model - - PowerPoint PPT Presentation

Elgersburg Workshop 2013 February 1114, 2013 On the KalmanYakubovichPopov Lemma and its Application in Model Order Reduction Peter Benner Computational Methods in Systems and Control Theory Max Planck Institute for Dynamics of Complex


slide-1
SLIDE 1

MAX PLANCK INSTITUTE FOR DYNAMICS OF COMPLEX TECHNICAL SYSTEMS MAGDEBURG

Elgersburg Workshop 2013 February 11–14, 2013

On the Kalman–Yakubovich–Popov Lemma and its Application in Model Order Reduction

Peter Benner

Computational Methods in Systems and Control Theory Max Planck Institute for Dynamics of Complex Technical Systems Magdeburg, Germany joint work (in parts) with Matthias Voigt and Xin Du, Guanghong Yang, and Dan Ye

Max Planck Institute Magdeburg Peter Benner, KYP and Balanced Truncation 1/35

slide-2
SLIDE 2

Basics Dissipativity KYP Lemma Model Reduction for LTI Systems FD-KYP Numerical Examples Conclusions References

Overview

1

Linear Systems Basics

2

Dissipativity and Structural Properties

3

The Kalman-Yakubovich-Popov Lemma

4

Model Reduction for LTI Systems

5

Frequency-dependent KYP Lemma and Model Reduction

6

Numerical Examples

7

Conclusions and Future Work

Max Planck Institute Magdeburg Peter Benner, KYP and Balanced Truncation 2/35

slide-3
SLIDE 3

Basics Dissipativity KYP Lemma Model Reduction for LTI Systems FD-KYP Numerical Examples Conclusions References

1

Linear Systems Basics

2

Dissipativity and Structural Properties Dissipative Systems Dissipativity in the Frequency Domain

3

The Kalman-Yakubovich-Popov Lemma

4

Model Reduction for LTI Systems Balanced truncation for linear systems

5

Frequency-dependent KYP Lemma and Model Reduction The Frequency-dependent KYP Lemma Frequency-dependent Balanced Truncation

6

Numerical Examples RLC ladder network Butterworth filter

7

Conclusions and Future Work

Max Planck Institute Magdeburg Peter Benner, KYP and Balanced Truncation 3/35

slide-4
SLIDE 4

Basics Dissipativity KYP Lemma Model Reduction for LTI Systems FD-KYP Numerical Examples Conclusions References

Linear Systems

LTI Systems

Σ :

  • ˙

x(t) = Ax(t) + Bu(t), x(0) = x0 y(t) = Cx(t) + Du(t), with A ∈ Rn×n, B ∈ Rn×m, C ∈ Rp×n, D ∈ Rp×m, state vector x(t) ∈ Rn, input vector u(t) ∈ Rm,

  • utput vector y(t) ∈ Rp.

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

Max Planck Institute Magdeburg Peter Benner, KYP and Balanced Truncation 4/35

slide-5
SLIDE 5

Basics Dissipativity KYP Lemma Model Reduction for LTI Systems FD-KYP Numerical Examples Conclusions References

Stability and Controllability

Definitions

The system Σ is called (asymptotically) stable if limt→∞ x(t) = 0 for u ≡ 0; controllable if for all x1 ∈ Rn there exist t1 > 0 and an input signal u(t) such that x(t1) = x1.

  • bservable if y(t) ≡ 0 implies x(t) ≡ 0 (assuming u(t) ≡ 0).

Max Planck Institute Magdeburg Peter Benner, KYP and Balanced Truncation 5/35

slide-6
SLIDE 6

Basics Dissipativity KYP Lemma Model Reduction for LTI Systems FD-KYP Numerical Examples Conclusions References

Stability and Controllability

Definitions

The system Σ is called (asymptotically) stable if limt→∞ x(t) = 0 for u ≡ 0; controllable if for all x1 ∈ Rn there exist t1 > 0 and an input signal u(t) such that x(t1) = x1.

  • bservable if y(t) ≡ 0 implies x(t) ≡ 0 (assuming u(t) ≡ 0).

Equivalent Conditions

The system Σ is (asymptotically) stable ⇐ ⇒ all eigenvalues of A are in the open left half-plane; controllable ⇐ ⇒ rank λIn − A B = n for all λ ∈ C.

  • bservable ⇐

⇒ rank

  • λIn − AT

C T = n for all λ ∈ C. minimal if it is controllable and observable.

Max Planck Institute Magdeburg Peter Benner, KYP and Balanced Truncation 5/35

slide-7
SLIDE 7

Basics Dissipativity KYP Lemma Model Reduction for LTI Systems FD-KYP Numerical Examples Conclusions References

Frequency Domain Analysis

Laplace transform

L{f }(s) := ∞ e−stf (t)dt

Max Planck Institute Magdeburg Peter Benner, KYP and Balanced Truncation 6/35

slide-8
SLIDE 8

Basics Dissipativity KYP Lemma Model Reduction for LTI Systems FD-KYP Numerical Examples Conclusions References

Frequency Domain Analysis

Laplace transform

L{f }(s) := ∞ e−stf (t)dt

Transfer function

Assume x(0) = 0. Then L(Σ) :

  • L{˙

x}(s) = AL{x}(s) + BL{u}(s), L{y}(s) = CL{x}(s) + DL{u}(s),

Max Planck Institute Magdeburg Peter Benner, KYP and Balanced Truncation 6/35

slide-9
SLIDE 9

Basics Dissipativity KYP Lemma Model Reduction for LTI Systems FD-KYP Numerical Examples Conclusions References

Frequency Domain Analysis

Laplace transform

L{f }(s) := ∞ e−stf (t)dt

Transfer function

Assume x(0) = 0. Then L(Σ) :

  • s(L{x}(s) − x(0)) = AL{x}(s) + BL{u}(s),

L{y}(s) = CL{x}(s) + DL{u}(s),

Max Planck Institute Magdeburg Peter Benner, KYP and Balanced Truncation 6/35

slide-10
SLIDE 10

Basics Dissipativity KYP Lemma Model Reduction for LTI Systems FD-KYP Numerical Examples Conclusions References

Frequency Domain Analysis

Laplace transform

L{f }(s) := ∞ e−stf (t)dt

Transfer function

Assume x(0) = 0. Then L(Σ) :

  • sL{x}(s) = AL{x}(s) + BL{u}(s),

L{y}(s) = CL{x}(s) + DL{u}(s),

Max Planck Institute Magdeburg Peter Benner, KYP and Balanced Truncation 6/35

slide-11
SLIDE 11

Basics Dissipativity KYP Lemma Model Reduction for LTI Systems FD-KYP Numerical Examples Conclusions References

Frequency Domain Analysis

Laplace transform

L{f }(s) := ∞ e−stf (t)dt

Transfer function

Assume x(0) = 0. Then L(Σ) :

  • sL{x}(s) = AL{x}(s) + BL{u}(s),

L{y}(s) = CL{x}(s) + DL{u}(s), Then L{y}(s) = C(sIn − A)−1B

  • =:G(s)

L{u}(s).

Max Planck Institute Magdeburg Peter Benner, KYP and Balanced Truncation 6/35

slide-12
SLIDE 12

Basics Dissipativity KYP Lemma Model Reduction for LTI Systems FD-KYP Numerical Examples Conclusions References

Frequency Domain Analysis

Laplace transform

L{f }(s) := ∞ e−stf (t)dt

Transfer function

Assume x(0) = 0. Then L(Σ) :

  • sL{x}(s) = AL{x}(s) + BL{u}(s),

L{y}(s) = CL{x}(s) + DL{u}(s), Then L{y}(s) = C(sIn − A)−1B

  • =:G(s)

L{u}(s). The transfer function G(s) maps inputs to outputs in the frequency domain.

Max Planck Institute Magdeburg Peter Benner, KYP and Balanced Truncation 6/35

slide-13
SLIDE 13

Basics Dissipativity KYP Lemma Model Reduction for LTI Systems FD-KYP Numerical Examples Conclusions References

1

Linear Systems Basics

2

Dissipativity and Structural Properties Dissipative Systems Dissipativity in the Frequency Domain

3

The Kalman-Yakubovich-Popov Lemma

4

Model Reduction for LTI Systems Balanced truncation for linear systems

5

Frequency-dependent KYP Lemma and Model Reduction The Frequency-dependent KYP Lemma Frequency-dependent Balanced Truncation

6

Numerical Examples RLC ladder network Butterworth filter

7

Conclusions and Future Work

Max Planck Institute Magdeburg Peter Benner, KYP and Balanced Truncation 7/35

slide-14
SLIDE 14

Basics Dissipativity KYP Lemma Model Reduction for LTI Systems FD-KYP Numerical Examples Conclusions References

Dissipative Systems

Definition

[Scherer, Weiland ’05]

A dynamical system Σ is called dissipative with respect to a supply function s : Rp × Rm − → R if there exists a storage function V : Rn − → R such that the dissipation inequality V (x(t1)) ≤ V (x(0)) + t1 s(y(t), u(t))dt is fulfilled for all 0 ≤ t1.

Max Planck Institute Magdeburg Peter Benner, KYP and Balanced Truncation 8/35

slide-15
SLIDE 15

Basics Dissipativity KYP Lemma Model Reduction for LTI Systems FD-KYP Numerical Examples Conclusions References

Dissipative Systems

Definition

[Scherer, Weiland ’05]

A dynamical system Σ is called dissipative with respect to a supply function s : Rp × Rm − → R if there exists a storage function V : Rn − → R such that the dissipation inequality V (x(t1)) ≤ V (x(0)) + t1 s(y(t), u(t))dt is fulfilled for all 0 ≤ t1.

Interpretation

t1 s(y(t), u(t))dt can be seen as the energy supplied to the system in the time interval [0, t1]. s(y(t), u(t)) is a measure for the power at time t. V (x(t)) is the internal energy at time t.

Max Planck Institute Magdeburg Peter Benner, KYP and Balanced Truncation 8/35

slide-16
SLIDE 16

Basics Dissipativity KYP Lemma Model Reduction for LTI Systems FD-KYP Numerical Examples Conclusions References

Quadratic Supply Functions

Often, we consider s(y(t), u(t)) =

  • y(t)

u(t) T W S ST R y(t) u(t)

  • with W = W T, R = RT

Max Planck Institute Magdeburg Peter Benner, KYP and Balanced Truncation 9/35

slide-17
SLIDE 17

Basics Dissipativity KYP Lemma Model Reduction for LTI Systems FD-KYP Numerical Examples Conclusions References

Quadratic Supply Functions

Often, we consider s(y(t), u(t)) =

  • y(t)

u(t) T W S ST R y(t) u(t)

  • with W = W T, R = RT

= Cx(t) + Du(t) u(t) T W S ST R Cx(t) + Du(t) u(t)

  • Max Planck Institute Magdeburg

Peter Benner, KYP and Balanced Truncation 9/35

slide-18
SLIDE 18

Basics Dissipativity KYP Lemma Model Reduction for LTI Systems FD-KYP Numerical Examples Conclusions References

Quadratic Supply Functions

Often, we consider s(y(t), u(t)) =

  • y(t)

u(t) T W S ST R y(t) u(t)

  • with W = W T, R = RT

= Cx(t) + Du(t) u(t) T W S ST R Cx(t) + Du(t) u(t)

  • =

x(t) u(t) T C TWC C TWD + C TS DTWC + STC DTWD + DTS + STD + R x(t) u(t)

  • Max Planck Institute Magdeburg

Peter Benner, KYP and Balanced Truncation 9/35

slide-19
SLIDE 19

Basics Dissipativity KYP Lemma Model Reduction for LTI Systems FD-KYP Numerical Examples Conclusions References

Quadratic Supply Functions

Often, we consider s(y(t), u(t)) =

  • y(t)

u(t) T W S ST R y(t) u(t)

  • with W = W T, R = RT

= Cx(t) + Du(t) u(t) T W S ST R Cx(t) + Du(t) u(t)

  • =

x(t) u(t) T C TWC C TWD + C TS DTWC + STC DTWD + DTS + STD + R x(t) u(t)

  • =:
  • x(t)

u(t) T ˜ W ˜ S ˜ ST ˜ R x(t) u(t)

  • Max Planck Institute Magdeburg

Peter Benner, KYP and Balanced Truncation 9/35

slide-20
SLIDE 20

Basics Dissipativity KYP Lemma Model Reduction for LTI Systems FD-KYP Numerical Examples Conclusions References

Quadratic Supply Functions

Often, we consider s(y(t), u(t)) =

  • y(t)

u(t) T W S ST R y(t) u(t)

  • with W = W T, R = RT

= Cx(t) + Du(t) u(t) T W S ST R Cx(t) + Du(t) u(t)

  • =

x(t) u(t) T C TWC C TWD + C TS DTWC + STC DTWD + DTS + STD + R x(t) u(t)

  • =:
  • x(t)

u(t) T ˜ W ˜ S ˜ ST ˜ R x(t) u(t)

  • =: ˜

s(x(t), u(t)).

Max Planck Institute Magdeburg Peter Benner, KYP and Balanced Truncation 9/35

slide-21
SLIDE 21

Basics Dissipativity KYP Lemma Model Reduction for LTI Systems FD-KYP Numerical Examples Conclusions References

Special Cases

Passivity

s(y(t), u(t)) = y(t) u(t) T 0 Im Im y(t) u(t)

  • ,

˜ s(x(t), u(t)) = x(t) u(t) T 0 C T C D + DT x(t) u(t)

  • .

Max Planck Institute Magdeburg Peter Benner, KYP and Balanced Truncation 10/35

slide-22
SLIDE 22

Basics Dissipativity KYP Lemma Model Reduction for LTI Systems FD-KYP Numerical Examples Conclusions References

Special Cases

Passivity

s(y(t), u(t)) = y(t) u(t) T 0 Im Im y(t) u(t)

  • ,

˜ s(x(t), u(t)) = x(t) u(t) T 0 C T C D + DT x(t) u(t)

  • .

Contractivity

s(y(t), u(t)) = y(t) u(t) T −Ip Im y(t) u(t)

  • ,

˜ s(x(t), u(t)) = x(t) u(t) T −C TC −C TD −DTC Im − DTD x(t) u(t)

  • .

Max Planck Institute Magdeburg Peter Benner, KYP and Balanced Truncation 10/35

slide-23
SLIDE 23

Basics Dissipativity KYP Lemma Model Reduction for LTI Systems FD-KYP Numerical Examples Conclusions References

Dissipativity in the Frequency Domain

Definition: Popov function

Φ(s) =

  • (sIn − A)−1B

Im H W S ST R (sIn − A)−1B Im

  • Max Planck Institute Magdeburg

Peter Benner, KYP and Balanced Truncation 11/35

slide-24
SLIDE 24

Basics Dissipativity KYP Lemma Model Reduction for LTI Systems FD-KYP Numerical Examples Conclusions References

Dissipativity in the Frequency Domain

Definition: Popov function

Φ(s) =

  • (sIn − A)−1B

Im H W S ST R (sIn − A)−1B Im

  • Theorem

Let Σ be controllable. Then, Σ is dissipative with respect to ˜ s(x(t), u(t)) =

  • x(t)

u(t) T W S ST R x(t) u(t)

  • if and only if Φ(iω) 0 holds

for all iω ∈ iR\Λ(A).

Max Planck Institute Magdeburg Peter Benner, KYP and Balanced Truncation 11/35

slide-25
SLIDE 25

Basics Dissipativity KYP Lemma Model Reduction for LTI Systems FD-KYP Numerical Examples Conclusions References

Special Cases

Passivity and positive realness

A dynamical system is passive if and only its transfer function G is positive real, i.e., G(s) + G H(s) 0 ∀s ∈ C+.

Max Planck Institute Magdeburg Peter Benner, KYP and Balanced Truncation 12/35

slide-26
SLIDE 26

Basics Dissipativity KYP Lemma Model Reduction for LTI Systems FD-KYP Numerical Examples Conclusions References

Special Cases

Passivity and positive realness

A dynamical system is passive if and only its transfer function G is positive real, i.e., G(s) + G H(s) 0 ∀s ∈ C+.

Contractivity and bounded realness

A dynamical system is contractive if and only its transfer function G is bounded real, i.e., Im − G H(s)G(s) 0 ∀s ∈ C+.

Max Planck Institute Magdeburg Peter Benner, KYP and Balanced Truncation 12/35

slide-27
SLIDE 27

Basics Dissipativity KYP Lemma Model Reduction for LTI Systems FD-KYP Numerical Examples Conclusions References

Special Cases

Passivity and positive realness

A dynamical system is passive if and only its transfer function G is positive real, i.e., G(s) + G H(s) 0 ∀s ∈ C+.

Contractivity and bounded realness

A dynamical system is contractive if and only its transfer function G is bounded real, i.e., Im − G H(s)G(s) 0 ∀s ∈ C+.

Remark

In contrast to general dissipativity, positive and bounded realness are properties of Φ(s) in the whole open right half-plane. It can be shown that for these cases V (x(t)) = x(t)TXx(t) for an X = X T 0.

Max Planck Institute Magdeburg Peter Benner, KYP and Balanced Truncation 12/35

slide-28
SLIDE 28

Basics Dissipativity KYP Lemma Model Reduction for LTI Systems FD-KYP Numerical Examples Conclusions References

Relations to H∞ Optimal Control

Problem setting

[Green, Limebeer ’95]

P w z K u y

Plant P, dynamic compensator K, noise w, estimation error z. Goal: Find K that stabilizes the system and minimizes the influence of w on z! ( = minimizing the H∞-norm of closed-loop transfer function)

Max Planck Institute Magdeburg Peter Benner, KYP and Balanced Truncation 13/35

slide-29
SLIDE 29

Basics Dissipativity KYP Lemma Model Reduction for LTI Systems FD-KYP Numerical Examples Conclusions References

Relations to H∞ Optimal Control

Problem setting

[Green, Limebeer ’95]

P w z K u y

Plant P, dynamic compensator K, noise w, estimation error z. Goal: Find K that stabilizes the system and minimizes the influence of w on z! ( = minimizing the H∞-norm of closed-loop transfer function)

H∞-spaces

Hp×m

(iω) = Banach space of p × m matrix-valued functions which are analytic and bounded in the open right half-plane.

Max Planck Institute Magdeburg Peter Benner, KYP and Balanced Truncation 13/35

slide-30
SLIDE 30

Basics Dissipativity KYP Lemma Model Reduction for LTI Systems FD-KYP Numerical Examples Conclusions References

Relations to H∞ Optimal Control

Problem setting

[Green, Limebeer ’95]

P w z K u y

Plant P, dynamic compensator K, noise w, estimation error z. Goal: Find K that stabilizes the system and minimizes the influence of w on z! ( = minimizing the H∞-norm of closed-loop transfer function)

H∞-spaces

Hp×m

(iω) = Banach space of p × m matrix-valued functions which are analytic and bounded in the open right half-plane.

H∞-norm (in this setting)

GH∞ = sup

s∈C+ σmax(G(s)) = sup ω∈R

σmax(G(iω)) = inf

γ≥0

  • γ2Im − G H(iω)G(iω) 0 ∀ω ∈ R
  • .

Max Planck Institute Magdeburg Peter Benner, KYP and Balanced Truncation 13/35

slide-31
SLIDE 31

Basics Dissipativity KYP Lemma Model Reduction for LTI Systems FD-KYP Numerical Examples Conclusions References

1

Linear Systems Basics

2

Dissipativity and Structural Properties Dissipative Systems Dissipativity in the Frequency Domain

3

The Kalman-Yakubovich-Popov Lemma

4

Model Reduction for LTI Systems Balanced truncation for linear systems

5

Frequency-dependent KYP Lemma and Model Reduction The Frequency-dependent KYP Lemma Frequency-dependent Balanced Truncation

6

Numerical Examples RLC ladder network Butterworth filter

7

Conclusions and Future Work

Max Planck Institute Magdeburg Peter Benner, KYP and Balanced Truncation 14/35

slide-32
SLIDE 32

Basics Dissipativity KYP Lemma Model Reduction for LTI Systems FD-KYP Numerical Examples Conclusions References

Algebraic Characterizations

Dissipativity can be characterized by properties of various algebraic structures such as linear matrix inequalities, quadratic matrix inequalities, algebraic matrix equations (Riccati equations, Lur’e equations), (structured matrices and matrix pencils).

Max Planck Institute Magdeburg Peter Benner, KYP and Balanced Truncation 15/35

slide-33
SLIDE 33

Basics Dissipativity KYP Lemma Model Reduction for LTI Systems FD-KYP Numerical Examples Conclusions References

Kalman-Yakubovich-Popov(-Anderson) Lemma

Consider again the dissipation inequality (in differential form): ˜ s(x(t),u(t)) = x(t) u(t) T W S ST R x(t) u(t)

  • ≥ ˙

V (x(t))˙ x(t) This obviously holds if there exists X = X T such that W S ST R

  • ATX + XA

XB BTX

  • .

Max Planck Institute Magdeburg Peter Benner, KYP and Balanced Truncation 16/35

slide-34
SLIDE 34

Basics Dissipativity KYP Lemma Model Reduction for LTI Systems FD-KYP Numerical Examples Conclusions References

Kalman-Yakubovich-Popov(-Anderson) Lemma

Consider again the dissipation inequality (in differential form): ˜ s(x(t),u(t)) = x(t) u(t) T W S ST R x(t) u(t)

  • ≥ ˙

V (x(t))˙ x(t) (set V (x(t)) = x(t)TXx(t) with X = X T) = 2x(t)TX(Ax(t) + Bu(t)) This obviously holds if there exists X = X T such that W S ST R

  • ATX + XA

XB BTX

  • .

Max Planck Institute Magdeburg Peter Benner, KYP and Balanced Truncation 16/35

slide-35
SLIDE 35

Basics Dissipativity KYP Lemma Model Reduction for LTI Systems FD-KYP Numerical Examples Conclusions References

Kalman-Yakubovich-Popov(-Anderson) Lemma

Consider again the dissipation inequality (in differential form): ˜ s(x(t),u(t)) = x(t) u(t) T W S ST R x(t) u(t)

  • ≥ ˙

V (x(t))˙ x(t) (set V (x(t)) = x(t)TXx(t) with X = X T) = 2x(t)TX(Ax(t) + Bu(t)) = x(t)TXAx(t) + x(t)TXBu(t) + x(t)TATXx(t) + u(t)TBTXx(t) This obviously holds if there exists X = X T such that W S ST R

  • ATX + XA

XB BTX

  • .

Max Planck Institute Magdeburg Peter Benner, KYP and Balanced Truncation 16/35

slide-36
SLIDE 36

Basics Dissipativity KYP Lemma Model Reduction for LTI Systems FD-KYP Numerical Examples Conclusions References

Kalman-Yakubovich-Popov(-Anderson) Lemma

Consider again the dissipation inequality (in differential form): ˜ s(x(t),u(t)) = x(t) u(t) T W S ST R x(t) u(t)

  • ≥ ˙

V (x(t))˙ x(t) (set V (x(t)) = x(t)TXx(t) with X = X T) = 2x(t)TX(Ax(t) + Bu(t)) = x(t)TXAx(t) + x(t)TXBu(t) + x(t)TATXx(t) + u(t)TBTXx(t) = x(t) u(t) T ATX + XA XB BTX x(t) u(t)

  • .

This obviously holds if there exists X = X T such that W S ST R

  • ATX + XA

XB BTX

  • .

Max Planck Institute Magdeburg Peter Benner, KYP and Balanced Truncation 16/35

slide-37
SLIDE 37

Basics Dissipativity KYP Lemma Model Reduction for LTI Systems FD-KYP Numerical Examples Conclusions References

Kalman-Yakubovich-Popov(-Anderson) Lemma

Theorem

[Willems ’72]

Let Σ be controllable. Then Σ is dissipative with respect to s(x(t), u(t)) (or equivalently Φ(iω) 0 ∀iω ∈ iR\Λ(A)) if and only if there exists a symmetric matrix X such that the linear matrix inequality (LMI)

  • ATX + XA − W

XB − S BTX − ST −R

  • is fulfilled.

Max Planck Institute Magdeburg Peter Benner, KYP and Balanced Truncation 17/35

slide-38
SLIDE 38

Basics Dissipativity KYP Lemma Model Reduction for LTI Systems FD-KYP Numerical Examples Conclusions References

Kalman-Yakubovich-Popov(-Anderson) Lemma

Theorem

[Willems ’72]

Let Σ be controllable. Then Σ is dissipative with respect to s(x(t), u(t)) (or equivalently Φ(iω) 0 ∀iω ∈ iR\Λ(A)) if and only if there exists a symmetric matrix X such that the linear matrix inequality (LMI)

  • ATX + XA − W

XB − S BTX − ST −R

  • is fulfilled.

History

’61: Popov’s criterion for stability of a feedback system with a memoryless nonlinearity. ’62/’63: Original version of the lemma by Kalman and Yakubovich. ’67: Anderson’s positive real lemma for multivariate transfer functions. until today: Many generalizations and extensions.

Max Planck Institute Magdeburg Peter Benner, KYP and Balanced Truncation 17/35

slide-39
SLIDE 39

Basics Dissipativity KYP Lemma Model Reduction for LTI Systems FD-KYP Numerical Examples Conclusions References

Special Cases

Positive real lemma

Let Σ be controllable. Then Σ is passive (or equivalently G(s) is positive real) if and only if there exists X = X T 0 such that the LMI ATX + XA XB − C T BTX − C −(D + D)T

  • is fulfilled.

Max Planck Institute Magdeburg Peter Benner, KYP and Balanced Truncation 18/35

slide-40
SLIDE 40

Basics Dissipativity KYP Lemma Model Reduction for LTI Systems FD-KYP Numerical Examples Conclusions References

Special Cases

Positive real lemma

Let Σ be controllable. Then Σ is passive (or equivalently G(s) is positive real) if and only if there exists X = X T 0 such that the LMI ATX + XA XB − C T BTX − C −(D + D)T

  • is fulfilled.

Bounded real lemma

Let Σ be controllable. Then Σ is contractive (or equivalently G(s) is bounded real) if and only if there exists X = X T 0 such that the LMI ATX + XA + C TC XB + C TD BTX + DTC DTD − Im

  • is fulfilled.

Max Planck Institute Magdeburg Peter Benner, KYP and Balanced Truncation 18/35

slide-41
SLIDE 41

Basics Dissipativity KYP Lemma Model Reduction for LTI Systems FD-KYP Numerical Examples Conclusions References

Other Algebraic Characterizations — R nonsingular

Linear Matrix Inequality

  • ATX + XA − W

XB − S BTX − ST −R

  • 0,

X = X T solvable.

Max Planck Institute Magdeburg Peter Benner, KYP and Balanced Truncation 19/35

slide-42
SLIDE 42

Basics Dissipativity KYP Lemma Model Reduction for LTI Systems FD-KYP Numerical Examples Conclusions References

Other Algebraic Characterizations — R nonsingular

Linear Matrix Inequality

  • ATX + XA − W

XB − S BTX − ST −R

  • 0,

X = X T solvable.

  • Quadratic Matrix Inequality

ATX +XA−W +(XB − S) R−1 BTX − ST 0, X = X T solvable.

Max Planck Institute Magdeburg Peter Benner, KYP and Balanced Truncation 19/35

slide-43
SLIDE 43

Basics Dissipativity KYP Lemma Model Reduction for LTI Systems FD-KYP Numerical Examples Conclusions References

Other Algebraic Characterizations — R nonsingular

Linear Matrix Inequality

  • ATX + XA − W

XB − S BTX − ST −R

  • 0,

X = X T solvable.

  • Quadratic Matrix Inequality

ATX +XA−W +(XB − S) R−1 BTX − ST 0, X = X T solvable.

  • Algebraic Riccati Equation

ATX +XA−W +(XB − S) R−1 BTX − ST = 0, X = X T solvable.

Max Planck Institute Magdeburg Peter Benner, KYP and Balanced Truncation 19/35

slide-44
SLIDE 44

Basics Dissipativity KYP Lemma Model Reduction for LTI Systems FD-KYP Numerical Examples Conclusions References

Other Algebraic Characterizations — R singular

Linear Matrix Inequality

  • ATX + XA − W

XB − S BTX − ST −R

  • 0,

X = X T solvable.

Max Planck Institute Magdeburg Peter Benner, KYP and Balanced Truncation 20/35

slide-45
SLIDE 45

Basics Dissipativity KYP Lemma Model Reduction for LTI Systems FD-KYP Numerical Examples Conclusions References

Other Algebraic Characterizations — R singular

Linear Matrix Inequality

  • ATX + XA − W

XB − S BTX − ST −R

  • 0,

X = X T solvable.

  • Quadratic Matrix Inequality

ATX + XA − W + (XB − S) R−1 BTX − ST 0, X = X T cannot be formulated!

Max Planck Institute Magdeburg Peter Benner, KYP and Balanced Truncation 20/35

slide-46
SLIDE 46

Basics Dissipativity KYP Lemma Model Reduction for LTI Systems FD-KYP Numerical Examples Conclusions References

Other Algebraic Characterizations — R singular

Linear Matrix Inequality

  • ATX + XA − W

XB − S BTX − ST −R

  • 0,

X = X T solvable.

  • Lur’e Equation

ATX + XA − W = −K TK, XB − S = −K TL, −R = −LTL, X = X T solvable for (X, K, L) ∈ Rn×n × Rp×n × Rp×m and p as small as possible.

first formulated in [Lur’e ’57] More on KYP and Lur’e equations in M. Voigt’s talk on Wednesday!

Max Planck Institute Magdeburg Peter Benner, KYP and Balanced Truncation 20/35

slide-47
SLIDE 47

Basics Dissipativity KYP Lemma Model Reduction for LTI Systems FD-KYP Numerical Examples Conclusions References

Some Remarks on Numerical Aspects

In the control literature, one often finds statements:

We have reduced the problem to an LMI = ⇒ problem solved!

Good reference for LMI formulaion of control problems:

  • V. Balakrishnan, L. Vandenberghe, ”Semidefinite programming duality and linear

time-invariant systems”, IEEE TAC, 2003.

Max Planck Institute Magdeburg Peter Benner, KYP and Balanced Truncation 21/35

slide-48
SLIDE 48

Basics Dissipativity KYP Lemma Model Reduction for LTI Systems FD-KYP Numerical Examples Conclusions References

Some Remarks on Numerical Aspects

In the control literature, one often finds statements:

We have reduced the problem to an LMI = ⇒ problem solved!

Good reference for LMI formulaion of control problems:

  • V. Balakrishnan, L. Vandenberghe, ”Semidefinite programming duality and linear

time-invariant systems”, IEEE TAC, 2003.

True for small dimensions, say n < 10.

Max Planck Institute Magdeburg Peter Benner, KYP and Balanced Truncation 21/35

slide-49
SLIDE 49

Basics Dissipativity KYP Lemma Model Reduction for LTI Systems FD-KYP Numerical Examples Conclusions References

Some Remarks on Numerical Aspects

In the control literature, one often finds statements:

We have reduced the problem to an LMI = ⇒ problem solved!

Good reference for LMI formulaion of control problems:

  • V. Balakrishnan, L. Vandenberghe, ”Semidefinite programming duality and linear

time-invariant systems”, IEEE TAC, 2003.

True for small dimensions, say n < 10. But: numerical solution of LMIs requires Semidefinite Programming (SDP) methods, this requires generically O(n6) floating point

  • perations (flops), with some tricks and exploiting structures

O(n4.5).

Max Planck Institute Magdeburg Peter Benner, KYP and Balanced Truncation 21/35

slide-50
SLIDE 50

Basics Dissipativity KYP Lemma Model Reduction for LTI Systems FD-KYP Numerical Examples Conclusions References

Some Remarks on Numerical Aspects

In the control literature, one often finds statements:

We have reduced the problem to an LMI = ⇒ problem solved!

Good reference for LMI formulaion of control problems:

  • V. Balakrishnan, L. Vandenberghe, ”Semidefinite programming duality and linear

time-invariant systems”, IEEE TAC, 2003.

True for small dimensions, say n < 10. But: numerical solution of LMIs requires Semidefinite Programming (SDP) methods, this requires generically O(n6) floating point

  • perations (flops), with some tricks and exploiting structures

O(n4.5). Methods based on Lyapunov or Riccati equations, invariant subspaces of Hamiltonian matrices or even pencils generically require

  • nly O(n3) flops, and can be implemented in O(nmp) flops for some

large-scale problems with sparse state matrix A.

Max Planck Institute Magdeburg Peter Benner, KYP and Balanced Truncation 21/35

slide-51
SLIDE 51

Basics Dissipativity KYP Lemma Model Reduction for LTI Systems FD-KYP Numerical Examples Conclusions References

Some Remarks on Numerical Aspects

Complexity of Numerical Linear Algebra (NLA) and SDP Solutions to Control Problems

Max Planck Institute Magdeburg Peter Benner, KYP and Balanced Truncation 21/35

slide-52
SLIDE 52

Basics Dissipativity KYP Lemma Model Reduction for LTI Systems FD-KYP Numerical Examples Conclusions References

1

Linear Systems Basics

2

Dissipativity and Structural Properties Dissipative Systems Dissipativity in the Frequency Domain

3

The Kalman-Yakubovich-Popov Lemma

4

Model Reduction for LTI Systems Balanced truncation for linear systems

5

Frequency-dependent KYP Lemma and Model Reduction The Frequency-dependent KYP Lemma Frequency-dependent Balanced Truncation

6

Numerical Examples RLC ladder network Butterworth filter

7

Conclusions and Future Work

Max Planck Institute Magdeburg Peter Benner, KYP and Balanced Truncation 22/35

slide-53
SLIDE 53

Basics Dissipativity KYP Lemma Model Reduction for LTI Systems FD-KYP Numerical Examples Conclusions References

Model Reduction for LTI Systems

Balanced truncation for linear systems

Idea

Σ : ( ˙ x(t) = Ax(t) + Bu(t), y(t) = Cx(t) + Du(t), with A stable, i.e., Λ (A) ⊂ C−, is balanced, if system Gramians, i.e., solutions P, Q of the Lyapunov equations AP + PAT + BBT = 0, ATQ + QA + C TC = 0, satisfy: P = Q = diag(σ1, . . . , σn) with σ1 ≥ σ2 ≥ . . . ≥ σn > 0.

Max Planck Institute Magdeburg Peter Benner, KYP and Balanced Truncation 23/35

slide-54
SLIDE 54

Basics Dissipativity KYP Lemma Model Reduction for LTI Systems FD-KYP Numerical Examples Conclusions References

Model Reduction for LTI Systems

Balanced truncation for linear systems

Idea

Σ : ( ˙ x(t) = Ax(t) + Bu(t), y(t) = Cx(t) + Du(t), with A stable, i.e., Λ (A) ⊂ C−, is balanced, if system Gramians, i.e., solutions P, Q of the Lyapunov equations AP + PAT + BBT = 0, ATQ + QA + C TC = 0, satisfy: P = Q = diag(σ1, . . . , σn) with σ1 ≥ σ2 ≥ . . . ≥ σn > 0. {σ1, . . . , σn} are the Hankel singular values (HSVs) of Σ.

Max Planck Institute Magdeburg Peter Benner, KYP and Balanced Truncation 23/35

slide-55
SLIDE 55

Basics Dissipativity KYP Lemma Model Reduction for LTI Systems FD-KYP Numerical Examples Conclusions References

Model Reduction for LTI Systems

Balanced truncation for linear systems

Idea

Σ : ( ˙ x(t) = Ax(t) + Bu(t), y(t) = Cx(t) + Du(t), with A stable, i.e., Λ (A) ⊂ C−, is balanced, if system Gramians, i.e., solutions P, Q of the Lyapunov equations AP + PAT + BBT = 0, ATQ + QA + C TC = 0, satisfy: P = Q = diag(σ1, . . . , σn) with σ1 ≥ σ2 ≥ . . . ≥ σn > 0. {σ1, . . . , σn} are the Hankel singular values (HSVs) of Σ. Compute balanced realization of the system via state-space transformation T : (A, B, C, D) → (TAT −1, TB, CT −1, D) = „» A11 A12 A21 A22 – , » B1 B2 – , ˆ C1 C2 ˜ , D « .

Max Planck Institute Magdeburg Peter Benner, KYP and Balanced Truncation 23/35

slide-56
SLIDE 56

Basics Dissipativity KYP Lemma Model Reduction for LTI Systems FD-KYP Numerical Examples Conclusions References

Model Reduction for LTI Systems

Balanced truncation for linear systems

Idea

Σ : ( ˙ x(t) = Ax(t) + Bu(t), y(t) = Cx(t) + Du(t), with A stable, i.e., Λ (A) ⊂ C−, is balanced, if system Gramians, i.e., solutions P, Q of the Lyapunov equations AP + PAT + BBT = 0, ATQ + QA + C TC = 0, satisfy: P = Q = diag(σ1, . . . , σn) with σ1 ≥ σ2 ≥ . . . ≥ σn > 0. {σ1, . . . , σn} are the Hankel singular values (HSVs) of Σ. Compute balanced realization of the system via state-space transformation T : (A, B, C, D) → (TAT −1, TB, CT −1, D) = „» A11 A12 A21 A22 – , » B1 B2 – , ˆ C1 C2 ˜ , D « . Truncation (ˆ A, ˆ B, ˆ C, ˆ D) = (A11, B1, C1, D).

Max Planck Institute Magdeburg Peter Benner, KYP and Balanced Truncation 23/35

slide-57
SLIDE 57

Basics Dissipativity KYP Lemma Model Reduction for LTI Systems FD-KYP Numerical Examples Conclusions References

Model Reduction for LTI Systems

Balanced truncation for linear systems

Motivation:

HSV are system invariants: they are preserved under T and determine the energy transfer given by the Hankel map H : L2(−∞, 0) → L2(0, ∞) : u− → y+. ”functional analyst’s point of view”

Max Planck Institute Magdeburg Peter Benner, KYP and Balanced Truncation 23/35

slide-58
SLIDE 58

Basics Dissipativity KYP Lemma Model Reduction for LTI Systems FD-KYP Numerical Examples Conclusions References

Model Reduction for LTI Systems

Balanced truncation for linear systems

Motivation:

HSV are system invariants: they are preserved under T and determine the energy transfer given by the Hankel map H : L2(−∞, 0) → L2(0, ∞) : u− → y+. ”functional analyst’s point of view”

In balanced coordinates, energy transfer from u− to y+ is E := sup

u∈L2(−∞,0] x(0)=x0

R y(t)Ty(t) dt R

−∞

u(t)Tu(t) dt = 1 ||x0||2

n

X

j=1

σ2

j x2 0,j.

”engineer’s point of view”

Max Planck Institute Magdeburg Peter Benner, KYP and Balanced Truncation 23/35

slide-59
SLIDE 59

Basics Dissipativity KYP Lemma Model Reduction for LTI Systems FD-KYP Numerical Examples Conclusions References

Model Reduction for LTI Systems

Balanced truncation for linear systems

Motivation:

HSV are system invariants: they are preserved under T and determine the energy transfer given by the Hankel map H : L2(−∞, 0) → L2(0, ∞) : u− → y+. ”functional analyst’s point of view”

In balanced coordinates, energy transfer from u− to y+ is E := sup

u∈L2(−∞,0] x(0)=x0

R y(t)Ty(t) dt R

−∞

u(t)Tu(t) dt = 1 ||x0||2

n

X

j=1

σ2

j x2 0,j.

”engineer’s point of view” = ⇒ Truncate states corresponding to “small” HSVs = ⇒ analogy to best approximation via SVD, therefore balancing-related methods are sometimes called SVD methods.

Max Planck Institute Magdeburg Peter Benner, KYP and Balanced Truncation 23/35

slide-60
SLIDE 60

Basics Dissipativity KYP Lemma Model Reduction for LTI Systems FD-KYP Numerical Examples Conclusions References

Model Reduction for LTI Systems

Balanced truncation for linear systems

Implementation: SR Method

1

Compute (Cholesky) factors of the solutions of the Lyapunov equations, P = STS, Q = RTR.

Max Planck Institute Magdeburg Peter Benner, KYP and Balanced Truncation 23/35

slide-61
SLIDE 61

Basics Dissipativity KYP Lemma Model Reduction for LTI Systems FD-KYP Numerical Examples Conclusions References

Model Reduction for LTI Systems

Balanced truncation for linear systems

Implementation: SR Method

1

Compute (Cholesky) factors of the solutions of the Lyapunov equations, P = STS, Q = RTR.

2

Compute SVD SRT = [ U1, U2 ]

  • Σ1

Σ2 V T

1

V T

2

  • .

Max Planck Institute Magdeburg Peter Benner, KYP and Balanced Truncation 23/35

slide-62
SLIDE 62

Basics Dissipativity KYP Lemma Model Reduction for LTI Systems FD-KYP Numerical Examples Conclusions References

Model Reduction for LTI Systems

Balanced truncation for linear systems

Implementation: SR Method

1

Compute (Cholesky) factors of the solutions of the Lyapunov equations, P = STS, Q = RTR.

2

Compute SVD SRT = [ U1, U2 ]

  • Σ1

Σ2 V T

1

V T

2

  • .

3

Set W = RTV1Σ−1/2

1

, V = STU1Σ−1/2

1

.

4

Reduced model is (W TAV , W TB, CV ).

Max Planck Institute Magdeburg Peter Benner, KYP and Balanced Truncation 23/35

slide-63
SLIDE 63

Basics Dissipativity KYP Lemma Model Reduction for LTI Systems FD-KYP Numerical Examples Conclusions References

Model Reduction for LTI Systems

Balanced truncation for linear systems

Implementation: SR Method

1

Compute (Cholesky) factors of the solutions of the Lyapunov equations, P = STS, Q = RTR.

2

Compute SVD SRT = [ U1, U2 ]

  • Σ1

Σ2 V T

1

V T

2

  • .

3

Set W = RTV1Σ−1/2

1

, V = STU1Σ−1/2

1

.

4

Reduced model is (W TAV , W TB, CV ).

Note: T := Σ− 1

2 V TR yields balancing state-space transformation with

T −1 = STUΣ− 1

2 , so that T =

» W T ∗ – and T −1 = ˆ V ∗ ˜ .

Max Planck Institute Magdeburg Peter Benner, KYP and Balanced Truncation 23/35

slide-64
SLIDE 64

Basics Dissipativity KYP Lemma Model Reduction for LTI Systems FD-KYP Numerical Examples Conclusions References

Model Reduction for LTI Systems

Balanced truncation for linear systems

Properties:

Reduced-order model is stable with HSVs σ1, . . . , σr.

Max Planck Institute Magdeburg Peter Benner, KYP and Balanced Truncation 23/35

slide-65
SLIDE 65

Basics Dissipativity KYP Lemma Model Reduction for LTI Systems FD-KYP Numerical Examples Conclusions References

Model Reduction for LTI Systems

Balanced truncation for linear systems

Properties:

Reduced-order model is stable with HSVs σ1, . . . , σr. Adaptive choice of r via computable error bound: ||y − ˆ y||2 ≤

  • 2

n

k=r+1 σk

  • =:δ

||u||2 .

Max Planck Institute Magdeburg Peter Benner, KYP and Balanced Truncation 23/35

slide-66
SLIDE 66

Basics Dissipativity KYP Lemma Model Reduction for LTI Systems FD-KYP Numerical Examples Conclusions References

Model Reduction for LTI Systems

Balanced truncation for linear systems

Relation to KYP

Structural properties of reduced-order models can be proved using KYP. Error bound can be proved using KYP as follows: E(s) = ˆ C −ˆ C ˜ „ sIn+r − »A ˆ A –«−1 »B ˆ B – =: ˜ C “ sIn+r − ˜ A ”−1 ˜ B. is a stable transfer function, i.e., E ∈ H∞.

Max Planck Institute Magdeburg Peter Benner, KYP and Balanced Truncation 23/35

slide-67
SLIDE 67

Basics Dissipativity KYP Lemma Model Reduction for LTI Systems FD-KYP Numerical Examples Conclusions References

Model Reduction for LTI Systems

Balanced truncation for linear systems

Relation to KYP

Structural properties of reduced-order models can be proved using KYP. Error bound can be proved using KYP as follows: E(s) = ˆ C −ˆ C ˜ „ sIn+r − »A ˆ A –«−1 »B ˆ B – =: ˜ C “ sIn+r − ˜ A ”−1 ˜ B. is a stable transfer function, i.e., E ∈ H∞. Hence, EH∞ < δ ⇐ ⇒ Φδ(iω) 0 ∀ω for Popov function Φδ(s) = » (sIn+r − ˜ A)−1 ˜ B Im –H » −˜ C T ˜ C δ2Im – » (sIn+r − ˜ A)−1 ˜ B Im – .

Max Planck Institute Magdeburg Peter Benner, KYP and Balanced Truncation 23/35

slide-68
SLIDE 68

Basics Dissipativity KYP Lemma Model Reduction for LTI Systems FD-KYP Numerical Examples Conclusions References

Model Reduction for LTI Systems

Balanced truncation for linear systems

Relation to KYP

Structural properties of reduced-order models can be proved using KYP. Error bound can be proved using KYP as follows: E(s) = ˆ C −ˆ C ˜ „ sIn+r − »A ˆ A –«−1 »B ˆ B – =: ˜ C “ sIn+r − ˜ A ”−1 ˜ B. is a stable transfer function, i.e., E ∈ H∞. Hence, EH∞ < δ ⇐ ⇒ Φδ(iω) 0 ∀ω for Popov function Φδ(s) = » (sIn+r − ˜ A)−1 ˜ B Im –H » −˜ C T ˜ C δ2Im – » (sIn+r − ˜ A)−1 ˜ B Im – . Using KYP and properties of balanced realizations, one can prove existence of symmetric solution of corresponding LMI.

Max Planck Institute Magdeburg Peter Benner, KYP and Balanced Truncation 23/35

slide-69
SLIDE 69

Basics Dissipativity KYP Lemma Model Reduction for LTI Systems FD-KYP Numerical Examples Conclusions References

1

Linear Systems Basics

2

Dissipativity and Structural Properties Dissipative Systems Dissipativity in the Frequency Domain

3

The Kalman-Yakubovich-Popov Lemma

4

Model Reduction for LTI Systems Balanced truncation for linear systems

5

Frequency-dependent KYP Lemma and Model Reduction The Frequency-dependent KYP Lemma Frequency-dependent Balanced Truncation

6

Numerical Examples RLC ladder network Butterworth filter

7

Conclusions and Future Work

Max Planck Institute Magdeburg Peter Benner, KYP and Balanced Truncation 24/35

slide-70
SLIDE 70

Basics Dissipativity KYP Lemma Model Reduction for LTI Systems FD-KYP Numerical Examples Conclusions References

Motivation

Disadvantages of Balanced Truncation

Global error bound can be pessimistic in relevant frequency bands, e.g., in mechanical systems, often only frequencies 0 ≤ 2πω ≤ 1000 (in Hz) are relevant, in VLSI design only an operating frequency, e.g., 2.6 GHz, may be of interest.

Remedies

1

Frequency-weighted BT (FWBT): aim at minimizing Go(G − ˆ G)GiH∞, where Gi, Go are rational transfer functions, e.g., lowpass/highpass filters.

Max Planck Institute Magdeburg Peter Benner, KYP and Balanced Truncation 25/35

slide-71
SLIDE 71

Basics Dissipativity KYP Lemma Model Reduction for LTI Systems FD-KYP Numerical Examples Conclusions References

Motivation

Disadvantages of Balanced Truncation

Global error bound can be pessimistic in relevant frequency bands, e.g., in mechanical systems, often only frequencies 0 ≤ 2πω ≤ 1000 (in Hz) are relevant, in VLSI design only an operating frequency, e.g., 2.6 GHz, may be of interest.

Remedies

1

Frequency-weighted BT (FWBT): aim at minimizing Go(G − ˆ G)GiH∞, where Gi, Go are rational transfer functions, e.g., lowpass/highpass filters.

2

Use Frequency-limited Gramians: recall that the Gramians of stable systems satisfy AP + PAT + BBT = 0 ATQ + QA + C TC = 0

Max Planck Institute Magdeburg Peter Benner, KYP and Balanced Truncation 25/35

slide-72
SLIDE 72

Basics Dissipativity KYP Lemma Model Reduction for LTI Systems FD-KYP Numerical Examples Conclusions References

Motivation

Disadvantages of Balanced Truncation

Global error bound can be pessimistic in relevant frequency bands, e.g., in mechanical systems, often only frequencies 0 ≤ 2πω ≤ 1000 (in Hz) are relevant, in VLSI design only an operating frequency, e.g., 2.6 GHz, may be of interest.

Remedies

1

Frequency-weighted BT (FWBT): aim at minimizing Go(G − ˆ G)GiH∞, where Gi, Go are rational transfer functions, e.g., lowpass/highpass filters.

2

Use Frequency-limited Gramians: recall that the Gramians of stable systems satisfy AP + PAT + BBT = 0 ⇔ P = Z ∞ eAtBBTeAT t dt ATQ + QA + C TC = 0 ⇔ P = Z ∞ eAT tC TCeAt dt

Max Planck Institute Magdeburg Peter Benner, KYP and Balanced Truncation 25/35

slide-73
SLIDE 73

Basics Dissipativity KYP Lemma Model Reduction for LTI Systems FD-KYP Numerical Examples Conclusions References

Motivation

Disadvantages of Balanced Truncation

Global error bound can be pessimistic in relevant frequency bands, e.g., in mechanical systems, often only frequencies 0 ≤ 2πω ≤ 1000 (in Hz) are relevant, in VLSI design only an operating frequency, e.g., 2.6 GHz, may be of interest.

Remedies

1

Frequency-weighted BT (FWBT): aim at minimizing Go(G − ˆ G)GiH∞, where Gi, Go are rational transfer functions, e.g., lowpass/highpass filters.

2

Use Frequency-limited Gramians: recall that the Gramians of stable systems satisfy AP + PAT + BBT = 0 ⇔ P = 1 2π Z ∞

−∞

(ωI − A)−1BBT(ωI − A)−Hdt ATQ + QA + C TC = 0 ⇔ Q = 1 2π Z ∞

−∞

(ωI − A)−HC TC(ωI − A)−1dt

Max Planck Institute Magdeburg Peter Benner, KYP and Balanced Truncation 25/35

slide-74
SLIDE 74

Basics Dissipativity KYP Lemma Model Reduction for LTI Systems FD-KYP Numerical Examples Conclusions References

Motivation

Disadvantages of Balanced Truncation

Global error bound can be pessimistic in relevant frequency bands, e.g., in mechanical systems, often only frequencies 0 ≤ 2πω ≤ 1000 (in Hz) are relevant, in VLSI design only an operating frequency, e.g., 2.6 GHz, may be of interest.

Remedies

1

Frequency-weighted BT (FWBT): aim at minimizing Go(G − ˆ G)GiH∞, where Gi, Go are rational transfer functions, e.g., lowpass/highpass filters.

2

Use Frequency-limited Gramians: P(̟) := 1 2π Z ̟

−̟

(ωI − A)−1BBT(ωI − A)−Hdt Q(̟) := 1 2π Z ̟

−̟

(ωI − A)−HC TC(ωI − A)−1dt

Max Planck Institute Magdeburg Peter Benner, KYP and Balanced Truncation 25/35

slide-75
SLIDE 75

Basics Dissipativity KYP Lemma Model Reduction for LTI Systems FD-KYP Numerical Examples Conclusions References

Motivation

Disadvantages of Balanced Truncation

Global error bound can be pessimistic in relevant frequency bands, e.g., in mechanical systems, often only frequencies 0 ≤ 2πω ≤ 1000 (in Hz) are relevant, in VLSI design only an operating frequency, e.g., 2.6 GHz, may be of interest.

Remedies

1

Frequency-weighted BT (FWBT): aim at minimizing Go(G − ˆ G)GiH∞, where Gi, Go are rational transfer functions, e.g., lowpass/highpass filters.

2

Use Frequency-limited Gramians: P(̟) := 1 2π Z ̟

−̟

(ωI − A)−1BBT(ωI − A)−Hdt Q(̟) := 1 2π Z ̟

−̟

(ωI − A)−HC TC(ωI − A)−1dt Both approaches yield good local approximation properties, but error bounds are still global and stability preservation often requires some modifications!

Max Planck Institute Magdeburg Peter Benner, KYP and Balanced Truncation 25/35

slide-76
SLIDE 76

Basics Dissipativity KYP Lemma Model Reduction for LTI Systems FD-KYP Numerical Examples Conclusions References

The Frequency-dependent KYP Lemma

Theorem

[Iwasaki/Hara ’05]

Consider G(ω) = C(ωI − A)−1B + D, ̟ ∈ R such that ̟ is not a pole of G, and let Π = ΠT ∈ Rn×n. Then TFAE: a) G(̟) I ∗ Π G(̟) I

  • 0.

b) There exist symmetric matrices P and Q ≻ 0 of appropriate dimensions, satisfying A I C −Q P + ̟Q P − ̟Q −̟2Q A I C T + B D I

  • Π

B D I T 0.

Note: in standard KYP, we used −Π = " W S ST R # .

Max Planck Institute Magdeburg Peter Benner, KYP and Balanced Truncation 26/35

slide-77
SLIDE 77

Basics Dissipativity KYP Lemma Model Reduction for LTI Systems FD-KYP Numerical Examples Conclusions References

The Frequency-dependent KYP Lemma

A family of frequency-dependent systems

Given ǫ, ̟ ∈ R, we define ˙ x(t) = A̟x(t) + B̟u(t), y(t) = C̟x(t) + D̟u(t), by A̟ := ̟I − ǫ((ǫ + ̟)I − A)−1(̟I − A), B̟ := ǫ((ǫ + ̟)I − A)−1B, C̟ := ǫC((ǫ + ̟)I − A)−1, D̟ := D + C((ǫ + ̟I) − A)−1B. The associated transfer function is G̟(ω) = C̟(ωI − A̟)−1B̟ + D̟.

Max Planck Institute Magdeburg Peter Benner, KYP and Balanced Truncation 27/35

slide-78
SLIDE 78

Basics Dissipativity KYP Lemma Model Reduction for LTI Systems FD-KYP Numerical Examples Conclusions References

The Frequency-dependent KYP Lemma

Properties of the frequency-dependent systems

Theorem 1

a) G stable = ⇒ G̟ is stable for all ǫ > 0.

Max Planck Institute Magdeburg Peter Benner, KYP and Balanced Truncation 28/35

slide-79
SLIDE 79

Basics Dissipativity KYP Lemma Model Reduction for LTI Systems FD-KYP Numerical Examples Conclusions References

The Frequency-dependent KYP Lemma

Properties of the frequency-dependent systems

Theorem 1

a) G stable = ⇒ G̟ is stable for all ǫ > 0. b) If G is unstable, then G̟ is stable for 0 < ǫ < ˆ ǫ̟, where ˆ ǫ̟ = min

λu∈Λ (A)∩C+

(̟ − ℑ(λu))2 ℜ(λu) + ℜ(λu)

  • .

Max Planck Institute Magdeburg Peter Benner, KYP and Balanced Truncation 28/35

slide-80
SLIDE 80

Basics Dissipativity KYP Lemma Model Reduction for LTI Systems FD-KYP Numerical Examples Conclusions References

The Frequency-dependent KYP Lemma

Properties of the frequency-dependent systems

Theorem 1

a) G stable = ⇒ G̟ is stable for all ǫ > 0. b) If G is unstable, then G̟ is stable for 0 < ǫ < ˆ ǫ̟, where ˆ ǫ̟ = min

λu∈Λ (A)∩C+

(̟ − ℑ(λu))2 ℜ(λu) + ℜ(λu)

  • .

c) (A, B) controllable = ⇒ (A̟, B̟) controllable. d) (A, C) observable = ⇒ (A̟, C̟) observable.

Max Planck Institute Magdeburg Peter Benner, KYP and Balanced Truncation 28/35

slide-81
SLIDE 81

Basics Dissipativity KYP Lemma Model Reduction for LTI Systems FD-KYP Numerical Examples Conclusions References

The Frequency-dependent KYP Lemma

Properties of the frequency-dependent systems

Theorem 1

a) G stable = ⇒ G̟ is stable for all ǫ > 0. b) If G is unstable, then G̟ is stable for 0 < ǫ < ˆ ǫ̟, where ˆ ǫ̟ = min

λu∈Λ (A)∩C+

(̟ − ℑ(λu))2 ℜ(λu) + ℜ(λu)

  • .

c) (A, B) controllable = ⇒ (A̟, B̟) controllable. d) (A, C) observable = ⇒ (A̟, C̟) observable. e) (A, B, C, D) is a minimal realization of G = ⇒ (A̟, B̟, C̟, D̟) is a minimal realization of G̟.

Max Planck Institute Magdeburg Peter Benner, KYP and Balanced Truncation 28/35

slide-82
SLIDE 82

Basics Dissipativity KYP Lemma Model Reduction for LTI Systems FD-KYP Numerical Examples Conclusions References

The Frequency-dependent KYP Lemma

Properties of the frequency-dependent systems

Theorem 1

a) G stable = ⇒ G̟ is stable for all ǫ > 0. b) If G is unstable, then G̟ is stable for 0 < ǫ < ˆ ǫ̟, where ˆ ǫ̟ = min

λu∈Λ (A)∩C+

(̟ − ℑ(λu))2 ℜ(λu) + ℜ(λu)

  • .

c) (A, B) controllable = ⇒ (A̟, B̟) controllable. d) (A, C) observable = ⇒ (A̟, C̟) observable. e) (A, B, C, D) is a minimal realization of G = ⇒ (A̟, B̟, C̟, D̟) is a minimal realization of G̟. f) G̟(̟) = G(̟).

Max Planck Institute Magdeburg Peter Benner, KYP and Balanced Truncation 28/35

slide-83
SLIDE 83

Basics Dissipativity KYP Lemma Model Reduction for LTI Systems FD-KYP Numerical Examples Conclusions References

The Frequency-dependent KYP Lemma

Properties of the frequency-dependent systems

Theorem 1

a) G stable = ⇒ G̟ is stable for all ǫ > 0. b) If G is unstable, then G̟ is stable for 0 < ǫ < ˆ ǫ̟, where ˆ ǫ̟ = min

λu∈Λ (A)∩C+

(̟ − ℑ(λu))2 ℜ(λu) + ℜ(λu)

  • .

c) (A, B) controllable = ⇒ (A̟, B̟) controllable. d) (A, C) observable = ⇒ (A̟, C̟) observable. e) (A, B, C, D) is a minimal realization of G = ⇒ (A̟, B̟, C̟, D̟) is a minimal realization of G̟. f) G̟(̟) = G(̟). g) GH∞ ≤ γ = ⇒ G̟H∞ ≤ γ.

Max Planck Institute Magdeburg Peter Benner, KYP and Balanced Truncation 28/35

slide-84
SLIDE 84

Basics Dissipativity KYP Lemma Model Reduction for LTI Systems FD-KYP Numerical Examples Conclusions References

The Frequency-dependent KYP Lemma

Properties of the frequency-dependent systems

Theorem 1

a) G stable = ⇒ G̟ is stable for all ǫ > 0. b) If G is unstable, then G̟ is stable for 0 < ǫ < ˆ ǫ̟, where ˆ ǫ̟ = min

λu∈Λ (A)∩C+

(̟ − ℑ(λu))2 ℜ(λu) + ℜ(λu)

  • .

c) (A, B) controllable = ⇒ (A̟, B̟) controllable. d) (A, C) observable = ⇒ (A̟, C̟) observable. e) (A, B, C, D) is a minimal realization of G = ⇒ (A̟, B̟, C̟, D̟) is a minimal realization of G̟. f) G̟(̟) = G(̟). g) GH∞ ≤ γ = ⇒ G̟H∞ ≤ γ. h) G̟H∞ ≤ γ̟ = ⇒ σmax (G(̟)) ≤ γ̟.

Max Planck Institute Magdeburg Peter Benner, KYP and Balanced Truncation 28/35

slide-85
SLIDE 85

Basics Dissipativity KYP Lemma Model Reduction for LTI Systems FD-KYP Numerical Examples Conclusions References

The Frequency-dependent KYP Lemma

Properties of the frequency-dependent systems

Theorem 2

Suppose the LTI system (A, B, C, D) is Hurwitz and minimal, and denote its controllability, observability, and balanced Gramians as P, Q, Σ, then for any ̟-dependent extended system (A̟, B̟, C̟, D̟) with Gramians P̟, Q̟, Σ̟: a) P ≻ P̟, Q ≻ Q̟, Σ ≻ Σ̟. b) limε→0 P̟ = 0, limε→0 Q̟ = 0, limε→0 Σ̟ = 0. c) limε→∞ P̟ = P, limε→∞ Q̟ = Q, limε→∞ Σ̟ = Σ.

Max Planck Institute Magdeburg Peter Benner, KYP and Balanced Truncation 29/35

slide-86
SLIDE 86

Basics Dissipativity KYP Lemma Model Reduction for LTI Systems FD-KYP Numerical Examples Conclusions References

Frequency-dependent Balanced Truncation (FDBT)

Apply the generic balancing procedure to (A̟, B̟, C̟, D̟), i.e., solve A̟P̟ + P̟AH

̟ + B̟BH ̟ = 0,

AH

̟Q̟ + Q̟A̟ + C H ̟C̟ = 0,

and compute the balancing transformation T̟ so that T̟P̟T H

̟ = T −H ̟ Q̟T −1 ̟ = Σ̟ = diag (σ̟,1, . . . , σ̟,n),

with σ̟,k ≥ σ̟,k+1.

Max Planck Institute Magdeburg Peter Benner, KYP and Balanced Truncation 30/35

slide-87
SLIDE 87

Basics Dissipativity KYP Lemma Model Reduction for LTI Systems FD-KYP Numerical Examples Conclusions References

Frequency-dependent Balanced Truncation (FDBT)

Apply the generic balancing procedure to (A̟, B̟, C̟, D̟), i.e., solve A̟P̟ + P̟AH

̟ + B̟BH ̟ = 0,

AH

̟Q̟ + Q̟A̟ + C H ̟C̟ = 0,

and compute the balancing transformation T̟ so that T̟P̟T H

̟ = T −H ̟ Q̟T −1 ̟ = Σ̟ = diag (σ̟,1, . . . , σ̟,n),

with σ̟,k ≥ σ̟,k+1. Balance the system: (T̟A̟T −1

̟ , T̟B̟, C̟T −1 ̟ , D̟)

= „» A̟,11 A̟,12 A̟,21 A̟,22 – , » B̟,1 B̟,2 – , ˆ C̟,1 C̟,2 ˜ , D̟ « .

Max Planck Institute Magdeburg Peter Benner, KYP and Balanced Truncation 30/35

slide-88
SLIDE 88

Basics Dissipativity KYP Lemma Model Reduction for LTI Systems FD-KYP Numerical Examples Conclusions References

Frequency-dependent Balanced Truncation (FDBT)

Balance the system: (T̟A̟T −1

̟ , T̟B̟, C̟T −1 ̟ , D̟)

= „» A̟,11 A̟,12 A̟,21 A̟,22 – , » B̟,1 B̟,2 – , ˆ C̟,1 C̟,2 ˜ , D̟ « . Reduced-order model is then obtained by truncation and back transformation: select r such that σ̟,r > σ̟,r+1 and set ˆ A = ̟Ir − ǫ(̟Ir − A̟,11) ((ǫ − ̟)Ir + A̟,11)−1 , ˆ B = 1 ǫ ((ǫ + ̟)Ir − ˆ A)B̟,1, ˆ C = 1 ǫ C̟,1((ǫ + ̟)Ir − ˆ A), ˆ D = D̟ − 1 ǫ2 C̟,1((ǫ + ̟)Ir − ˆ A)B̟,1.

Max Planck Institute Magdeburg Peter Benner, KYP and Balanced Truncation 30/35

slide-89
SLIDE 89

Basics Dissipativity KYP Lemma Model Reduction for LTI Systems FD-KYP Numerical Examples Conclusions References

Frequency-dependent Balanced Truncation (FDBT)

Reduced-order model is then obtained by truncation and back transformation: select r such that σ̟,r > σ̟,r+1 and set ˆ A = ̟Ir − ǫ(̟Ir − A̟,11) ((ǫ − ̟)Ir + A̟,11)−1 , ˆ B = 1 ǫ ((ǫ + ̟)Ir − ˆ A)B̟,1, ˆ C = 1 ǫ C̟,1((ǫ + ̟)Ir − ˆ A), ˆ D = D̟ − 1 ǫ2 C̟,1((ǫ + ̟)Ir − ˆ A)B̟,1.

Theorem 3 (Local Error Bound)

The reduced-order transfer function ˆ G(s) = ˆ C(sIr − ˆ A)−1 ˆ B + ˆ D satisfies: σmax

  • G(̟) − ˆ

G(̟)

  • ≤ 2

n

  • k=r+1

σ̟,k.

Proof: use proof for BT error bound based on FD-KYP instead of KYP.

Max Planck Institute Magdeburg Peter Benner, KYP and Balanced Truncation 30/35

slide-90
SLIDE 90

Basics Dissipativity KYP Lemma Model Reduction for LTI Systems FD-KYP Numerical Examples Conclusions References

1

Linear Systems Basics

2

Dissipativity and Structural Properties Dissipative Systems Dissipativity in the Frequency Domain

3

The Kalman-Yakubovich-Popov Lemma

4

Model Reduction for LTI Systems Balanced truncation for linear systems

5

Frequency-dependent KYP Lemma and Model Reduction The Frequency-dependent KYP Lemma Frequency-dependent Balanced Truncation

6

Numerical Examples RLC ladder network Butterworth filter

7

Conclusions and Future Work

Max Planck Institute Magdeburg Peter Benner, KYP and Balanced Truncation 31/35

slide-91
SLIDE 91

Basics Dissipativity KYP Lemma Model Reduction for LTI Systems FD-KYP Numerical Examples Conclusions References

Numerical Examples

RLC ladder network

Simple example of electronic circuit from [Sorensen ’05]

input ≡ voltage u, output ≡ current y, scaled inductances, capacities, and resistance: Lj = 1, Cj = 1 for all j; R1 = 0.5 , R2 = 0.2. n = 5, m = p = 1.

Max Planck Institute Magdeburg Peter Benner, KYP and Balanced Truncation 32/35

slide-92
SLIDE 92

Basics Dissipativity KYP Lemma Model Reduction for LTI Systems FD-KYP Numerical Examples Conclusions References

Numerical Examples

RLC ladder network

Comparison of FDBT and BT (¯ ω = 0, ε = 1)

r FDBT BT bound true error bound true error 4 1.2201 × 10−7 1.2201 × 10−7 0.0006 0.0006 3 8.7426 × 10−5 8.7182 × 10−5 0.1752 0.1740 2 5.5028 × 10−4 3.7568 × 10−4 0.3914 0.0421 1 0.0584 0.0582 0.6311 0.1975

Max Planck Institute Magdeburg Peter Benner, KYP and Balanced Truncation 32/35

slide-93
SLIDE 93

Basics Dissipativity KYP Lemma Model Reduction for LTI Systems FD-KYP Numerical Examples Conclusions References

Numerical Examples

RLC ladder network

Comparison of FDBT and BT (¯ ω = 0, varying ε)

100 200 300 400 0.2 0.4 0.6 0.8 ε r=1 100 200 300 400 0.1 0.2 0.3 0.4 ε r=2 FDBT BT 100 200 300 400 0.05 0.1 0.15 0.2 ε r=3 FDBT BT 100 200 300 400 2 4 6 x 10

−4

ε r=4 FDBT BT FDBT BT Max Planck Institute Magdeburg Peter Benner, KYP and Balanced Truncation 32/35

slide-94
SLIDE 94

Basics Dissipativity KYP Lemma Model Reduction for LTI Systems FD-KYP Numerical Examples Conclusions References

Numerical Examples

Butterworth filter

Bandstop filter [A,B,C,D]= butter(50,[90 110],stop,s)

Hankel singular values

Max Planck Institute Magdeburg Peter Benner, KYP and Balanced Truncation 33/35

slide-95
SLIDE 95

Basics Dissipativity KYP Lemma Model Reduction for LTI Systems FD-KYP Numerical Examples Conclusions References

Numerical Examples

Butterworth filter

Bandstop filter [A,B,C,D]= butter(50,[90 110],stop,s)

Transfer functions

60 70 80 90 100 110 120 130 140 0.5 1 1.5 2 2.5 ω The sigma plot of the continuous−time bandstop filter and the reduced systems Original BT FDBT ε=100 FDBT ε=1000 MM Multipoint MM (90,100,110) Multipoint MM (80,100,120)

Max Planck Institute Magdeburg Peter Benner, KYP and Balanced Truncation 33/35

slide-96
SLIDE 96

Basics Dissipativity KYP Lemma Model Reduction for LTI Systems FD-KYP Numerical Examples Conclusions References

Conclusions and Future Work

Summary: Relations of KYP lemma to balanced truncation. Frequency-dependent KYP lemma suggests new frequency-dependent balanced truncation (FDBT) method. FDBT offers alternative to interpolation-based method if good local approximation quality is desired. Continuous- and discrete-time FDBT derived. FDBT is stability preserving and has local error bound, which is

  • ften much better than global BT bound.

Max Planck Institute Magdeburg Peter Benner, KYP and Balanced Truncation 34/35

slide-97
SLIDE 97

Basics Dissipativity KYP Lemma Model Reduction for LTI Systems FD-KYP Numerical Examples Conclusions References

Conclusions and Future Work

Summary: Relations of KYP lemma to balanced truncation. Frequency-dependent KYP lemma suggests new frequency-dependent balanced truncation (FDBT) method. FDBT offers alternative to interpolation-based method if good local approximation quality is desired. Continuous- and discrete-time FDBT derived. FDBT is stability preserving and has local error bound, which is

  • ften much better than global BT bound.

Future work: Details for non-minimal systems. Large-scale implementation and testing. Computational feasible method for frequency bands. Extension to descriptor systems.

Max Planck Institute Magdeburg Peter Benner, KYP and Balanced Truncation 34/35

slide-98
SLIDE 98

Basics Dissipativity KYP Lemma Model Reduction for LTI Systems FD-KYP Numerical Examples Conclusions References

References

  • V. Balakrishnan and L. Vandenberghe.

Semidefinite programming duality and linear time-invariant systems. IEEE Transactions on Automatic Control 48(1):30–41, 2003. doi: 10.1109/TAC.2002.806652

  • X. Du, P. Benner, G. Yang, and D. Ye.

Balanced Truncation of Linear Time-Invariant Systems at a Single Frequency. Max Planck Institute Magdeburg Preprints, MPIMD/13–02, January 2013.

  • T. Iwasaki and S. Hara.

Generalized KYP lemma: unified frequency domain inequalities with design applications. IEEE Transactions on Automatic Control 50(1):41–59, 2005.

  • J. Willems.

Dissipative dynamical systems. Archive for Rationale Mechanics Analysis 45:321–393, 1972.

Max Planck Institute Magdeburg Peter Benner, KYP and Balanced Truncation 35/35