Upload
alan-greer
View
212
Download
0
Embed Size (px)
Citation preview
Introduction to the Hankel -based model order reduction for linear systems
D.Vasilyev
Massachusetts Institute of Technology, 2004
State-space description
( )( ) ( )
( ) ( ) ( )
dx tAx t Bu t
dty t Cx t Du t
( ) state
, ,
( ) : inputs,
( ) : outputs
n
n n n m k n
m
k
x t
A B C
u t
y t
MIMO LTI CT dynamical system:
Here we assume a system to be stable, i.e matrix A is Hurwitz.
Model order reduction problem
G(s) (original)
Gr(s) (reduced)
+
-
Problem: find a dynamical system Gr(s) of a smaller degree q
(McMillan degree – size of a minimal realization), such that the error of approximation e
is “small” over all inputs!
u(t)
yr(t)
y(t) e(t)
Question: small in what sense??
Signals/system norms
t
u L2 – space of square-summable functions with 2- norm, or energy:
22 2|| ( ) || || ( ) || '( ) ( )x t x t dt x t x t dt
LTI system, as a linear operator on this space, has an induced 2-norm (maximum energy amplification, or L2 gain), which equals H-infinity-norm of a system’s transfer function:
2
22 max
2
|| ( ) |||| ( ) || sup sup ( ( )) || ( ) ||
|| ( ) ||inducedu L
y tG s G j G s
u t
Now we know how to state our problem!
Model order reduction problem
G(s) (original)
Gr(s) (reduced)
+
-
Problem formulation: find Gr(s) of a smaller degree that minimizes
u(t)
yr(t)
y(t) e(t)
|| ( ) ( ) ||rG s G s Unfortunately, we cannot solve this problem
Instead, we use another system norm.
Hankel operator
LTI SYSTEM
X (state)
tu
t
y
Hankel operator
Past input
(u(t>0)=0)
Future output
2 2: ( ,0) (0, )H L L Hankel operator:- maps past inputs to future system outputs- ignores any system response before time 0.- Has finite rank (connection only by the state at t=0)- As an operator on L2 it has an induced norm (energy amplification)!
Hankel optimal MOR
G(s) (original)
Gr(s) (reduced)
+
-
u(t)
yr(t)
y(t) e(t)
Problem formulation: find Gr(s) of a smaller degree that minimizes
|| ( ) ( ) ||rHG s G s
(Hankel norm of an error)
This problem has been solved and explicit algorithm is given for state-space LTI systems in Glover[84].
Controllability/observability
LTI SYSTEM
X (state)
tu
t
y
Hankel operator
Past input
Future output
P (controllability)Which states are easier to reach?
Q (observability)Which states produces more output?
Since we are interested in Hankel norm, we need to know how energy is transferred between
input, state and output
Observability
X(0)t
yFuture output
How much energy in the output we shall observe if the
system is released from some state x(0)? ( ) (0)Aty t Ce x22
0
|| ( ) || (0) (0) (0) (0)TT A t T At Ty t x e C Ce dt x x Qx
Observability Gramian
Satisfies Lyapunov equation:
ATQ +QA = -CTC
Q is SPD iff system is observable
Controllability
X(0)Past input
What is the minimal energy of input signal needed to
drive system to the state x(0)? 0
(0) ( )Ax e Bu d
1
2 12
0
|| ( ) || (0) (0) (0) (0)TT A t T At Tu t x e BB e dt x x P x
Controllability Gramian
Satisfies Lyapunov equation:
tu
State
AP + PAT = -BBT
P is SPD iff system is controllable
Side note about Lyapunov equations
( )( ) ( )
( ) ( ) ( )
dx tAx t Bu t
dty t Cx t Du t
Assume some LTI CT system:
AP + PA′ = -R, R - hermitian
This equation has a unique solution P=P′ if and only if:, ( ) ( ) 0jii j A A
Moreover, if R is SPD and A is Hurwitz, then P is SPD.
Lyapunov function:
V(x)=x’Px >0
( ( ))( ) 0T TdV x t
x A P PA xdt
(reformulation of stability criterion)
Hankel singular values
X (state)tu
t
y
Hankel operator
- This operator has finite rank (equal to degree of G).Hankel singular values are square roots of an eigenvalues of the product PQ - If we approximate this operator by different one with lower rank, we cannot do better in the Hankel norm than the first removed HSV:
0( )( ( )) ( )A t
GH u t C e Bu d
1|| ( ) ( ) || ( )rH q GG s G s H
Amazingly, this bound is tight (Adamjan et al., 71)
Truncated balanced reduction
Gramians are transformed with the change of basis as a quadratic forms:
x → Tx, P → TPTT, Q → T-TQT-1
We can find a basis, in which both gramians are equal and diagonal. Such transformation is called balancing transformation.
P = RTR UΣ2UT = RQRT T = RTU Σ-1/2
P = Q = diag(σ1, … , σn), σ1 ≥ … ≥ σn
Truncated balanced reduction-cont’d
In the balanced realization we can perform truncation of the least observable and controllable modes!
11 12 1
21 22 2
1 2
,A A B
A BA A B
C C C
1
2
0
0P Q
Truncated system (A11, B1, C1, D) will be stable (if σq ≠ σq+1 , otherwise stable for almost all T ) and have the following H-infinity error bound:|| ( ) ( ) || 2 ( )r
kk q
G s G s H
“twice sum of a tail”rule
Truncated balanced reduction vs. Hankel optimal reduction
|| ( ) ( ) || 2 ( )rk G
k q
G s G s H
For the balanced truncation procedure we have the following error bounds:
|| ( ) ( ) || 2 ( )rH k G
k q
G s G s H
TBR is not optimal in terms of the Hankel norm! For the Hankel optimal MOR the following bounds hold:
|| ( ) ( ) || ( )rk G
k q
G s G s H
1|| ( ) ( ) || ( )r
H q GG s G s H
References:
Keith Glover, “All optimal Hankel-norm approximations of linear multivariable systems and their L-infinity error bounds”