7034 CHAPTER 7. STATE-SPACE DESIGN
(b) The system is controllable because a control signal u(command) reaches all the state vari-
30. Staircase Algorithm (Van Dooren et al., 1978): Any realization (A,B,C) can be transformed
by an orthogonal similarity transformation to (
A,
B,
C), where
Ais an upper Hessenberg
matrix (having one nonzero diagonal above the main diagonal):
A=TTAT =
2
6
6
6
6
4
100
...0
...n1
3
7
7
7
7
5
;
B=TTB=
2
6
6
6
6
6
4
0
0
.
.
.
0
g1
3
7
7
7
7
7
5
;
where g16= 0, and,
C=CT = [c1c2 cn];T1=TT:
Orthogonal transformations correspond to a rotation of the vectors (represented by the matrix
columns) being transformed with no change in length.
a) Prove that if i= 0 and i+1; : : : ; n16= 0 for some i, then the controllable and uncontrol-
lable modes of the system can be identified after this transformation has been done.
b) How would you use this technique to identify the observable and unobservable modes of (A,
B,C)?
c) What advantage does this approach for determining the controllable and uncontrollable modes
have over transforming the system to any other form?
d) How can we use this approach to determine a basis for the controllable and uncontrollable
subspaces, as in Problem 7.44?
This algorithm can be used to design a numerically stable algorithm for pole placement [see
Minimis and Paige (1982)]. The name of the algorithm comes from the multi-input version in
which the iare the blocks that make
Aresemble a staircase.
Solution: