Lesson 6 State Transition Matrix
Lesson 6 State Transition Matrix
1. Analysis
Lesson 6
State transition matrix
1. (0) I
1
2. (t ) (t )
3. x(0) (t ) x(t )
4. (t 2 t1 ) (t1 t0 ) (t 2 t0 )
(t ) (kt)
k
5.
sX ( s ) x(0) AX ( s ) BU ( s )
( sI A) X ( s ) x(0) BU ( s )
1 1
X ( s ) ( sI A) x(0) ( sI A) BU ( s )
x(t ) L1[( sI A) 1 ]x(0) L1[( sI A) 1 BU ( s )]
t
x(t ) (t ) x(0) (t ) Bu ( )d Convolution
0
Homogeneous
linear system by Meiling CHEN 5
t
x(t ) (t ) x(0) (t ) Bu ( )d
0
t
x(t ) (t t0 ) x(t0 ) (t ) Bu ( )d
t0
t
y (t ) C(t t0 ) x(t0 ) C(t ) Bu ( )d Du (t )
t0
2e t
e 2t
e 1 e 2t
(t ) L1[( sI A) 1 ] e At t 2t
2 e 2 e e t 2e 2t
t
x(t ) (t ) x(0) (t ) Bu ( )d
0
x1 2e t e 2t
1 3
Ans: x 2 2 L1[( sI A) 1 BU ( s)]
2 2e 2e 2t
t
x(0) 0 0
T
let
u 1 s 1 x2 s 1 x1 1 y
3
Using Maison’s gain formula 2
1 3s 1 2s 2
s 1 (1 3s 1 ) s 2 s 2
x1 ( s) x1 (0) x2 (0) U ( s)
2s 2 s 1 s 1
x2 ( s ) x1 (0) x2 (0) U ( s)
Methode 2: (t ) e At
adj ( sI A)
( sI A) 1
sI A
s 2 6s 11 s 2 3
1
3 s 2
2 3s
s ( s 4)( s 2) 3 3s
s4 s 1 s 4s
2
e t 0 0
2t
(t ) e 0
At
e 0
0 0 e 3t
0 1 1 1 3
A ( 3)( 1)
3 4 3 4 2 1
depend
3 1 v1 v1 1
(1I A)V1 0
3 3 4 v2 v2 3
1 1 v1 v1 1
(2 I A)V2 0
3 3 v2 v2 1
1 1 3 0
P V1 V2
1
P AP
3 1 0 1
1 1 1
P v1 v2 vn 1 2 n Vandermonde matrix
1
2
1
P AP
3
4
t 1
e Pe P
At
linear system by Meiling CHEN 15
Case 1: i distinct
1 0 1 1 0 1
A 0 1 0 I A 0 1 0 ( 1)( 1)( 2)
0 0 2 0 0 2
1 2 0 0 1 v1
(1I A)V1 0 0 0 v2 0 depend
0 0 1 v3
v1 1 v1 0
0v1 0v2 v3 0 v2 0 0v1 0v2 v3 0 v2 1
v3 0 v3 0
V1 V2
linear system by Meiling CHEN 16
3 2 1 0 1 v1
(3 I A)V3 0 1 0 v2 0
0 0 0 v3
v1 1
v1 0v2 v3 0 v2 0
v3 1
1 0 1 1 0 0
P V1 V2 V3 0 1 0 P 1 AP 0 1 0
0 0 1 0 0 2
P v1 v2 v3 P AP Jordan
1
form
Generalized eigenvectors
1 1 v11 v11 1
(1I A)V1 0
1 1 v12 v12 1
1 1 v21 1 v21 1
(1I A)V2
1 1 v22 1 v22 0
1 1 2 1
P V1 V2
1 ˆ
P AP A
1 0 0 2
e 2t
Aˆ t te2t Aˆ t 1
e 2t
e Pe P
At
e
linear system by Meiling CHEN 19
Method 3:
any f ( A) k0 I k1 A k 2 A k n A
2 n
f ( A) 0 I 1 A 2 A n 1 A
2 n 1
n 1
k 0
k A k
1 2
( 1)( 2) 0 , 1 1, 2 2
0 2
f (1 ) 1
100
0 11 1100 0 2 2100
f (2 ) 2
100
0 12 2 100
1 2100 1
1 0 1 2 1 2101
2
f ( A) A (2 2 )
100 100
(2 1)
100
0 1 0 1 0 1
t 1 0
2t 2t t 3 1
e 2e e
At
( e e )
0 1 2 0
2e 2t e t e 2 t e t
2t t 2t t
2e 2e e 2e