ROBUST AND OPTIMAL CONTROL
ROBUST AND OPTIMAL CONTROL
KEMIN ZHOU with JOHN C. DOYLE and KEITH GLOVER
PRENTICE HALL, ...
328 downloads
5499 Views
2MB Size
Report
This content was uploaded by our users and we assume good faith they have the permission to share this book. If you own the copyright to this book and it is wrongfully on our website, we offer a simple DMCA procedure to remove your content from our site. Start by pressing the button below!
Report copyright / DMCA form
ROBUST AND OPTIMAL CONTROL
ROBUST AND OPTIMAL CONTROL
KEMIN ZHOU with JOHN C. DOYLE and KEITH GLOVER
PRENTICE HALL, Englewood Clis, New Jersey 07632
TO OUR PARENTS
Contents Preface
xiii
Notation and Symbols
xvi
List of Acronyms
xx
1 Introduction
1
1.1 1.2 1.3
Historical Perspective : : : : : : : : : : : : : : : : : : : : : : : : : : How to Use This Book : : : : : : : : : : : : : : : : : : : : : : : : : Highlights of The Book : : : : : : : : : : : : : : : : : : : : : : : : :
2 Linear Algebra 2.1 2.2 2.3 2.4 2.5 2.6 2.7 2.8 2.9 2.10 2.11 2.12
Linear Subspaces : : : : : : : : : : : : : Eigenvalues and Eigenvectors : : : : : : Matrix Inversion Formulas : : : : : : : : Matrix Calculus : : : : : : : : : : : : : : Kronecker Product and Kronecker Sum : Invariant Subspaces : : : : : : : : : : : : Vector Norms and Matrix Norms : : : : Singular Value Decomposition : : : : : : Generalized Inverses : : : : : : : : : : : Semide nite Matrices : : : : : : : : : : : Matrix Dilation Problems* : : : : : : : : Notes and References : : : : : : : : : : :
3 Linear Dynamical Systems 3.1
: : : : : : : : : : : :
: : : : : : : : : : : :
: : : : : : : : : : : :
: : : : : : : : : : : :
: : : : : : : : : : : :
: : : : : : : : : : : :
: : : : : : : : : : : :
: : : : : : : : : : : :
: : : : : : : : : : : :
: : : : : : : : : : : :
: : : : : : : : : : : :
: : : : : : : : : : : :
: : : : : : : : : : : :
: : : : : : : : : : : :
: : : : : : : : : : : :
Descriptions of Linear Dynamical Systems : : : : : : : : : : : : : : vii
1 4 6
17
17 20 22 24 25 26 28 32 36 36 38 44
45
45
CONTENTS
viii 3.2 3.3 3.4 3.5 3.6 3.7 3.8 3.9 3.10 3.11 3.12
Controllability and Observability : : : : : : : : Kalman Canonical Decomposition : : : : : : : : Pole Placement and Canonical Forms : : : : : : Observers and Observer-Based Controllers : : : Operations on Systems : : : : : : : : : : : : : : State Space Realizations for Transfer Matrices : Lyapunov Equations : : : : : : : : : : : : : : : Balanced Realizations : : : : : : : : : : : : : : Hidden Modes and Pole-Zero Cancelation : : : Multivariable System Poles and Zeros : : : : : : Notes and References : : : : : : : : : : : : : : :
4 Performance Speci cations 4.1 4.2 4.3 4.4 4.5 4.6 4.7 4.8
Normed Spaces : : : : : : : : : Hilbert Spaces : : : : : : : : : : Hardy Spaces H2 and H1 : : : Power and Spectral Signals : : Induced System Gains : : : : : Computing L2 and H2 Norms : Computing L1 and H1 Norms Notes and References : : : : : :
: : : : : : : :
: : : : : : : :
: : : : : : : :
: : : : : : : :
: : : : : : : :
: : : : : : : :
: : : : : : : :
: : : : : : : :
: : : : : : : :
: : : : : : : : : : : : : : : : : : :
: : : : : : : : : : : : : : : : : : :
: : : : : : : : : : : : : : : : : : :
: : : : : : : : : : : : : : : : : : :
: : : : : : : : : : : : : : : : : : :
5 Stability and Performance of Feedback Systems 5.1 5.2 5.3 5.4 5.5 5.6 5.7 5.8
Feedback Structure : : : : : : : : : Well-Posedness of Feedback Loop : Internal Stability : : : : : : : : : : Coprime Factorization over RH1 : Feedback Properties : : : : : : : : The Concept of Loop Shaping : : : Weighted H2 and H1 Performance Notes and References : : : : : : : :
6 Performance Limitations 6.1 6.2 6.3 6.4 6.5
: : : : : : : :
: : : : : : : :
: : : : : : : :
: : : : : : : :
: : : : : : : :
Introduction : : : : : : : : : : : : : : : : : : Integral Relations : : : : : : : : : : : : : : : Design Limitations and Sensitivity Bounds : Bode's Gain and Phase Relation : : : : : : Notes and References : : : : : : : : : : : : :
: : : : : : : :
: : : : :
: : : : : : : :
: : : : :
: : : : : : : :
: : : : :
: : : : : : : :
: : : : :
: : : : : : : :
: : : : :
: : : : : : : :
: : : : :
: : : : : : : : : : : : :
: : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : :
: : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : :
: : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : :
: : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : :
: : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : :
: : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : :
47 53 58 63 65 68 71 72 78 80 89
91 91 93 97 102 104 112 114 116
117 117 119 121 126 130 134 137 141
143 143 145 149 151 152
CONTENTS
ix
7 Model Reduction by Balanced Truncation 7.1 7.2 7.3 7.4
Model Reduction by Balanced Truncation : : : Frequency-Weighted Balanced Model Reduction Relative and Multiplicative Model Reductions : Notes and References : : : : : : : : : : : : : : :
8 Hankel Norm Approximation 8.1 8.2 8.3 8.4 8.5 8.6 8.7 8.8 8.9
Hankel Operator : : : : : : : : : : : : : : : : All-pass Dilations : : : : : : : : : : : : : : : : Optimal Hankel Norm Approximation : : : : L1 Bounds for Hankel Norm Approximation Bounds for Balanced Truncation : : : : : : : Toeplitz Operators : : : : : : : : : : : : : : : Hankel and Toeplitz Operators on the Disk* : Nehari's Theorem* : : : : : : : : : : : : : : : Notes and References : : : : : : : : : : : : : :
: : : : : : : : :
: : : : : : : : : : : : :
: : : : : : : : : : : : :
9 Model Uncertainty and Robustness 9.1 9.2 9.3 9.4 9.5 9.6 9.7
Model Uncertainty : : : : : : : : : : : : : : : : : : Small Gain Theorem : : : : : : : : : : : : : : : : : Stability under Stable Unstructured Uncertainties : Unstructured Robust Performance : : : : : : : : : Gain Margin and Phase Margin : : : : : : : : : : : De ciency of Classical Control for MIMO Systems Notes and References : : : : : : : : : : : : : : : : :
10 Linear Fractional Transformation 10.1 10.2 10.3 10.4 10.5
Linear Fractional Transformations : Examples of LFTs : : : : : : : : : Basic Principle : : : : : : : : : : : Redheer Star-Products : : : : : : Notes and References : : : : : : : :
11 Structured Singular Value 11.1 11.2 11.3 11.4 11.5
: : : : :
: : : : :
: : : : :
: : : : :
: : : : :
: : : : :
General Framework for System Robustness : : Structured Singular Value : : : : : : : : : : : Structured Robust Stability and Performance Overview on Synthesis : : : : : : : : : : : : Notes and References : : : : : : : : : : : : : :
: : : : : : : : : :
: : : : : : : : : :
: : : : : : : : : :
: : : : : : : : : : : : : : : : : : : : : : : : : : : : : :
: : : : : : : : : : : : : : : : : : : : : : : : : : : : : :
: : : : : : : : : : : : : : : : : : : : : : : : : : : : : :
: : : : : : : : : : : : : : : : : : : : : : : : : : : : : :
: : : : : : : : : : : : : : : : : : : : : : : : : : : : : :
: : : : : : : : : : : : : : : : : : : : : : : : : : : : : :
: : : : : : : : : : : : : : : : : : : : : : : : : : : : : :
: : : : : : : : : : : : : : : : : : : : : : : : : : : : : :
: : : : : : : : : : : : : : : : : : : : : : : : : : : : : :
153
154 160 161 167
169
170 175 184 188 192 194 195 200 206
207
207 211 214 222 229 232 237
239
239 246 256 257 260
261
262 266 276 287 290
CONTENTS
x
12 Parameterization of Stabilizing Controllers 12.1 12.2 12.3 12.4 12.5 12.6 12.7
Existence of Stabilizing Controllers : : : : : : : : : : Duality and Special Problems : : : : : : : : : : : : : Parameterization of All Stabilizing Controllers : : : : Structure of Controller Parameterization : : : : : : : Closed-Loop Transfer Matrix : : : : : : : : : : : : : Youla Parameterization via Coprime Factorization* : Notes and References : : : : : : : : : : : : : : : : : :
13 Algebraic Riccati Equations 13.1 13.2 13.3 13.4 13.5 13.6 13.7 13.8 13.9
All Solutions of A Riccati Equation : : : : Stabilizing Solution and Riccati Operator Extreme Solutions and Matrix Inequalities Spectral Factorizations : : : : : : : : : : : Positive Real Functions : : : : : : : : : : : Inner Functions : : : : : : : : : : : : : : : Inner-Outer Factorizations : : : : : : : : : Normalized Coprime Factorizations : : : : Notes and References : : : : : : : : : : : :
14 H2 Optimal Control 14.1 14.2 14.3 14.4 14.5 14.6 14.7 14.8 14.9 14.10 14.11
: : : : : : : : :
: : : : : : : : :
: : : : : : : : :
: : : : : : : : :
Introduction to Regulator Problem : : : : : : : : : Standard LQR Problem : : : : : : : : : : : : : : : Extended LQR Problem : : : : : : : : : : : : : : : Guaranteed Stability Margins of LQR : : : : : : : Standard H2 Problem : : : : : : : : : : : : : : : : Optimal Controlled System : : : : : : : : : : : : : H2 Control with Direct Disturbance Feedforward* Special Problems : : : : : : : : : : : : : : : : : : : Separation Theory : : : : : : : : : : : : : : : : : : Stability Margins of H2 Controllers : : : : : : : : : Notes and References : : : : : : : : : : : : : : : : :
15 Linear Quadratic Optimization 15.1 15.2 15.3 15.4 15.5 15.6
: : : : : : : : :
: : : : : : : : : : : : : : : : : : : :
: : : : : : : : : : : : : : : : : : : : : : : : : : :
Hankel Operators : : : : : : : : : : : : : : : : : : : : : Toeplitz Operators : : : : : : : : : : : : : : : : : : : : Mixed Hankel-Toeplitz Operators : : : : : : : : : : : : Mixed Hankel-Toeplitz Operators: The General Case* Linear Quadratic Max-Min Problem : : : : : : : : : : Notes and References : : : : : : : : : : : : : : : : : : :
: : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : :
: : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : :
: : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : :
: : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : :
: : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : :
: : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : :
: : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : :
291
292 295 301 312 314 315 318
319
320 325 333 342 353 357 358 362 364
365
365 367 372 373 375 378 379 381 388 390 392
393
393 395 397 399 401 404
CONTENTS
16 H1 Control: Simple Case 16.1 16.2 16.3 16.4 16.5 16.6 16.7 16.8 16.9 16.10 16.11 16.12
Problem Formulation : : : : : : : : Output Feedback H1 Control : : : Motivation for Special Problems : : Full Information Control : : : : : : Full Control : : : : : : : : : : : : : Disturbance Feedforward : : : : : Output Estimation : : : : : : : : : Separation Theory : : : : : : : : : Optimality and Limiting Behavior Controller Interpretations : : : : : An Optimal Controller : : : : : : : Notes and References : : : : : : : :
xi
: : : : : : : : : : : :
: : : : : : : : : : : :
: : : : : : : : : : : :
: : : : : : : : : : : :
: : : : : : : : : : : :
: : : : : : : : : : : :
: : : : : : : : : : : :
: : : : : : : : : : : :
: : : : : : : : : : : :
: : : : : : : : : : : :
17 H1 Control: General Case 17.1 17.2 17.3 17.4 17.5 17.6 17.7 17.8 17.9 17.10
General H1 Solutions : : : : : : : : : : : : : : : : : Loop Shifting : : : : : : : : : : : : : : : : : : : : : : Relaxing Assumptions : : : : : : : : : : : : : : : : : H2 and H1 Integral Control : : : : : : : : : : : : : : H1 Filtering : : : : : : : : : : : : : : : : : : : : : : Youla Parameterization Approach* : : : : : : : : : : Connections : : : : : : : : : : : : : : : : : : : : : : : State Feedback and Dierential Game : : : : : : : : Parameterization of State Feedback H1 Controllers : Notes and References : : : : : : : : : : : : : : : : : :
: : : : : : : : : : : : : : : : : : : : : :
18 H1 Loop Shaping 18.1 18.2 18.3 18.4
Robust Stabilization of Coprime Factors : : : : : : : : Loop Shaping Using Normalized Coprime Stabilization Theoretical Justi cation for H1 Loop Shaping : : : : Notes and References : : : : : : : : : : : : : : : : : : :
19 Controller Order Reduction 19.1 19.2 19.3 19.4 19.5
Controller Reduction with Stability Criteria : : H1 Controller Reductions : : : : : : : : : : : : Frequency-Weighted L1 Norm Approximations An Example : : : : : : : : : : : : : : : : : : : : Notes and References : : : : : : : : : : : : : : :
: : : : :
: : : : :
: : : : :
: : : : :
: : : : : : : : : : : : : : : : : : : : : : : : : : : : : : :
: : : : : : : : : : : : : : : : : : : : : : : : : : : : : : :
: : : : : : : : : : : : : : : : : : : : : : : : : : : : : : :
: : : : : : : : : : : : : : : : : : : : : : : : : : : : : : :
: : : : : : : : : : : : : : : : : : : : : : : : : : : : : : :
: : : : : : : : : : : : : : : : : : : : : : : : : : : : : : :
: : : : : : : : : : : : : : : : : : : : : : : : : : : : : : :
405 405 406 412 416 423 423 425 426 431 436 438 439
441 442 445 449 450 454 456 460 462 465 468
469 469 478 481 487
489 490 497 504 509 513
CONTENTS
xii
20 Structure Fixed Controllers
515
21 Discrete Time Control
527
20.1 20.2 20.3
21.1 21.2 21.3 21.4 21.5 21.6 21.7 21.8
Lagrange Multiplier Method : : : : : : : : : : : : : : : : : : : : : : 515 Fixed Order Controllers : : : : : : : : : : : : : : : : : : : : : : : : 520 Notes and References : : : : : : : : : : : : : : : : : : : : : : : : : : 525 Discrete Lyapunov Equations : : : : : : Discrete Riccati Equations : : : : : : : : Bounded Real Functions : : : : : : : : : Matrix Factorizations : : : : : : : : : : : Discrete Time H2 Control : : : : : : : : Discrete Balanced Model Reduction : : : Model Reduction Using Coprime Factors Notes and References : : : : : : : : : : :
: : : : : : : :
: : : : : : : :
: : : : : : : :
: : : : : : : :
: : : : : : : :
: : : : : : : :
: : : : : : : :
: : : : : : : :
: : : : : : : :
: : : : : : : :
: : : : : : : :
: : : : : : : :
: : : : : : : :
: : : : : : : :
: : : : : : : :
527 528 537 542 548 553 558 561
Bibliography
563
Index
581
Preface This book is inspired by the recent development in the robust and H1 control theory, particularly the state-space H1 control theory developed in the paper by Doyle, Glover, Khargonekar, and Francis [1989] (known as DGKF paper). We give a fairly comprehensive and step-by-step treatment of the state-space H1 control theory in the style of DGKF. We also treat the robust control problems with unstructured and structured uncertainties. The linear fractional transformation (LFT) and the structured singular value (known as ) are introduced as the uni ed tools for robust stability and performance analysis and synthesis. Chapter 1 contains a more detailed chapter-by-chapter review of the topics and results presented in this book. We would like to thank Professor Bruce A. Francis at University of Toronto for his helpful comments and suggestions on early versions of the manuscript. As a matter of fact, this manuscript was inspired by his lectures given at Caltech in 1987 and his masterpiece { A Course in H1 Control Theory. We are grateful to Professor Andre Tits at University of Maryland who has made numerous helpful comments and suggestions that have greatly improved the quality of the manuscript. Professor Jakob Stoustrup, Professor Hans Henrik Niemann, and their students at The Technical University of Denmark have read various versions of this manuscript and have made many helpful comments and suggestions. We are grateful to their help. Special thanks go to Professor Andrew Packard at University of California-Berkeley for his help during the preparation of the early versions of this manuscript. We are also grateful to Professor Jie Chen at University of California-Riverside for providing material used in Chapter 6. We would also like to thank Professor Kang-Zhi Liu at Chiba University (Japan) and Professor Tongwen Chen at University of Calgary for their valuable comments and suggestions. In addition, we would like to thank G. Balas, C. Beck, D. S. Bernstein, G. Gu, W. Lu, J. Morris, M. Newlin, L. Qiu, H. P. Rotstein and many other people for their comments and suggestions. The rst author is especially grateful to Professor Pramod P. Khargonekar at The University of Michigan for introducing him to robust and H1 control and to Professor Tryphon Georgiou at University of Minnesota for encouraging him to complete this work. Kemin Zhou xiii
xiv
PREFACE John C. Doyle Keith Glover
xv
NOTATION AND SYMBOLS
xvi
Notation and Symbols R C F R+ C ; and C ; C + and C + C 0 , jR D D @D
eld of real numbers eld of complex numbers eld, either R or C nonnegative real numbers open and closed left-half plane open and closed right-half plane imaginary axis unit disk closed unit disk unit circle
2 [ \
belong to subset union intersection
2 3 ~
end of proof end of example end of remark
:=
' /
de ned as asymptotically greater than asymptotically less than much greater than much less than
jj
Re ()
complex conjugate of 2 C absolute value of 2 C real part of 2 C
(t) ij 1+(t)
unit impulse Kronecker delta function, ii = 1 and ij = 0 if i 6= j unit step function
NOTATION AND SYMBOLS
xvii
n n identity matrix a matrix with aij as its i-th row and j -th column element diag(a1 ; : : : ; an ) an n n diagonal matrix with ai as its i-th diagonal element AT transpose A adjoint operator of A or complex conjugate transpose of A A;1 inverse of A A+ pseudo inverse of A A; shorthand for (A;1 ) det(A) determinant of A Trace(A) trace of A (A) eigenvalue of A (A) spectral radius of A (A) the set of spectrum of A (A) largest singular value of A (A) smallest singular value of A i (A) i-th singular value of A (A) condition number of A kAk spectral norm of A: kAk = (A) Im(A), R(A) image (or range) space of A Ker(A), N(A) kernel (or null) space of A X; (A) stable invariant subspace of A X+ (A) antistable invariant subspace of A In [aij ]
Ric(H ) gf
\ h; i x?y D? S?
L2 (;1; 1) L2 [0; 1) L2 (;1; 0] L2+ L2; l2+ l2;
L2 (j R) L2 (@ D ) H2 (j R)
the stabilizing solution of an ARE convolution of g and f Kronecker product direct sum or Kronecker sum angle inner product orthogonal, hx; yi = 0 orthogonal complement of D, i.e., D D? or DD is unitary ? orthogonal complement of subspace S , e.g., H2? time domain Lebesgue space subspace of L2 (;1; 1) subspace of L2 (;1; 1) shorthand for L2 [0; 1) shorthand for L2 (;1; 0] shorthand for l2 [0; 1) shorthand for l2 (;1; 0) square integrable functions on C 0 including at 1 square integrable functions on @ D subspace of L2 (j R) with analytic extension to the rhp
NOTATION AND SYMBOLS
xviii
H2 (@ D ) H2? (j R) H2? (@ D ) L 1 ( j R) L1 (@ D ) H1 (j R) H1 (@ D ) H1; (j R) H1; (@ D )
subspace of L2 (@ D ) with analytic extension to the inside of @ D subspace of L2 (j R) with analytic extension to the lhp subspace of L2 (@ D ) with analytic extension to the outside of @ D functions bounded on Re(s) = 0 including at 1 functions bounded on @ D the set of L1 (j R) functions analytic in Re(s) > 0 the set of L1 (@ D ) functions analytic in jz j < 1 the set of L1 (j R) functions analytic in Re(s) < 0 the set of L1 (@ D ) functions analytic in jz j > 1
pre x B or B closed unit ball, e.g. BH1 and B pre x Bo open unit ball pre x R real rational, e.g., RH1 and RH2 , etc R[s]
Rp (s)
polynomial ring rational proper transfer matrices
G (s) (z ) G A B C D
shorthand for GT (;s) (continuous time) shorthand for GT (z ;1 ) (discrete time) shorthand for state space realization C (sI ; A);1 B + D or C (zI ; A);1 B + D
F` (M; Q) Fu (M; Q) S (M; N )
lower LFT upper LFT star product
xix
LIST OF ACRONYMS
xx
List of Acronyms ARE BR CIF DF FC FDLTI FI HF i lcf LF LFT lhp or LHP LQG LQR LTI LTR MIMO nlcf NP nrcf NS OE OF OI rcf rhp or RHP RP RS SF SISO SSV SVD
algebraic Riccati equation bounded real complementary inner factor disturbance feedforward full control nite dimensional linear time invariant full information high frequency if and only if left coprime factorization low frequency linear fractional transformation left-half plane Re(s) < 0 linear quadratic Gaussian linear quadratic regulator linear time invariant loop transfer recovery multi-input multi-output normalized left coprime factorization nominal performance normalized right coprime factorization nominal stability output estimation output feedback output injection right coprime factorization right-half plane Re(s) > 0 robust performance robust stability state feedback single-input single-output structured singular value () singular value decomposition
1
Introduction 1.1 Historical Perspective This book gives a comprehensive treatment of optimal H2 and H1 control theory and an introduction to the more general subject of robust control. Since the central subject of this book is state-space H1 optimal control, in contrast to the approach adopted in the famous book by Francis [1987]: A Course in H1 Control Theory, it may be helpful to provide some historical perspective of the state-space H1 control theory to be presented in this book. This section is not intended as a review of the literature in H1 theory or robust control, but rather only an attempt to outline some of the work that most closely touches on our approach to state-space H1 . Hopefully our lack of written historical material will be somewhat made up for by the pictorial history of control shown in Figure 1.1. Here we see how the practical but classical methods yielded to the more sophisticated modern theory. Robust control sought to blend the best of both worlds. The strange creature that resulted is the main topic of this book. The H1 optimal control theory was originally formulated by Zames [1981] in an input-output setting. Most solution techniques available at that time involved analytic functions (Nevanlinna-Pick interpolation) or operator-theoretic methods [Sarason, 1967; Adamjan et al., 1978; Ball and Helton, 1983]. Indeed, H1 theory seemed to many to signal the beginning of the end for the state-space methods which had dominated control for the previous 20 years. Unfortunately, the standard frequency-domain approaches to H1 started running into signi cant obstacles in dealing with multi-input multi-output (MIMO) systems, both mathematically and computationally, much as the H2 (or LQG) theory of the 1950's had. 1
INTRODUCTION
2
Figure 1.1: A picture history of control Not surprisingly, the rst solution to a general rational MIMO H1 optimal control problem, presented in Doyle [1984], relied heavily on state-space methods, although more as a computational tool than in any essential way. The steps in this solution were as follows: parameterize all internally-stabilizing controllers via [Youla et al., 1976]; obtain realizations of the closed-loop transfer matrix; convert the resulting model-matching problem into the equivalent 2 2-block general distance or best approximation problem involving mixed Hankel-Toeplitz operators; reduce to the Nehari problem (Hankel only); solve the Nehari problem by the procedure of Glover [1984]. Both [Francis, 1987] and [Francis and Doyle, 1987] give expositions of this approach, which will be referred to as the \1984" approach. In a mathematical sense, the 1984 procedure \solved" the general rational H1 optimal control problem and much of the subsequent work in H1 control theory focused on the 2 2-block problems, either in the model-matching or general distance forms. Unfortunately, the associated complexity of computation was substantial, involving several Riccati equations of increasing dimension, and formulae for the resulting controllers tended to be very complicated and have high state dimension. Encouragement came
1.1. Historical Perspective
3
from Limebeer and Hung [1987] and Limebeer and Halikias [1988] who showed, for problems transformable to 2 1-block problems, that a subsequent minimal realization of the controller has state dimension no greater than that of the generalized plant G. This suggested the likely existence of similarly low dimension optimal controllers in the general 2 2 case. Additional progress on the 2 2-block problems came from Ball and Cohen [1987], who gave a state-space solution involving 3 Riccati equations. Jonckheere and Juang [1987] showed a connection between the 2 1-block problem and previous work by Jonckheere and Silverman [1978] on linear-quadratic control. Foias and Tannenbaum [1988] developed an interesting class of operators called skew Toeplitz to study the 2 2-block problem. Other approaches have been derived by Hung [1989] using an interpolation theory approach, Kwakernaak [1986] using a polynomial approach, and Kimura [1988] using a method based on conjugation. The simple state space H1 controller formulae to be presented in this book were rst derived in Glover and Doyle [1988] with the 1984 approach, but using a new 2 2-block solution, together with a cumbersome back substitution. The very simplicity of the new formulae and their similarity with the H2 ones suggested a more direct approach. Independent encouragement for a simpler approach to the H1 problem came from papers by Petersen [1987], Khargonekar, Petersen, and Zhou [1990], Zhou and Khargonekar [1988], and Khargonekar, Petersen, and Rotea [1988]. They showed that for the state-feedback H1 problem one can choose a constant gain as a (sub)optimal controller. In addition, a formula for the state-feedback gain matrix was given in terms of an algebraic Riccati equation. Also, these papers established connections between H1 -optimal control, quadratic stabilization, and linear-quadratic dierential games. The landmark breakthrough came in the DGKF paper (Doyle, Glover, Khargonekar, and Francis [1989]). In addition to providing controller formulae that are simple and expressed in terms of plant data as in Glover and Doyle [1988], the methods in that paper are a fundamental departure from the 1984 approach. In particular, the Youla parameterization and the resulting 2 2-block model-matching problem of the 1984 solution are avoided entirely; replaced by a more purely state-space approach involving observer-based compensators, a pair of 2 1 block problems, and a separation argument. The operator theory still plays a central role (as does Redheer's work [Redheer, 1960] on linear fractional transformations), but its use is more straightforward. The key to this was a return to simple and familiar state-space tools, in the style of Willems [1971], such as completing the square, and the connection between frequency domain inequalities (e.g kGk1 < 1), Riccati equations, and spectral factorizations. This book in some sense can be regarded as an expansion of the DGKF paper. The state-space theory of H1 can be carried much further, by generalizing timeinvariant to time-varying, in nite horizon to nite horizon, and nite dimensional to in nite dimensional. A ourish of activity has begun on these problems since the publication of the DGKF paper and numerous results have been published in the literature, not surprising, many results in DGKF paper generalize mutatis mutandis, to these cases, which are beyond the scope of this book.
4
INTRODUCTION
1.2 How to Use This Book This book is intended to be used either as a graduate textbook or as a reference for control engineers. With the second objective in mind, we have tried to balance the broadness and the depth of the material covered in the book. In particular, some chapters have been written suciently self-contained so that one may jump to those special topics without going through all the preceding chapters, for example, Chapter 13 on algebraic Riccati equations. Some other topics may only require some basic linear system theory, for instance, many readers may nd that it is not dicult to go directly to Chapters 9 11. In some cases, we have tried to collect some most frequently used formulas and results in one place for the convenience of reference although they may not have any direct connection with the main results presented in the book. For example, readers may nd that those matrix formulas collected in Chapter 2 on linear algebra convenient in their research. On the other hand, if the book is used as a textbook, it may be advisable to skip those topics like Chapter 2 on the regular lectures and leave them for students to read. It is obvious that only some selected topics in this book can be covered in an one or two semester course. The speci c choice of the topics depends on the time allotted for the course and the preference of the instructor. The diagram in Figure 1.2 shows roughly the relations among the chapters and should give the users some idea for the selection of the topics. For example, the diagram shows that the only prerequisite for Chapters 7 and 8 is Section 3.9 of Chapter 3 and, therefore, these two chapters alone may be used as a short course on model reductions. Similarly, one only needs the knowledge of Sections 13.2 and 13.6 of Chapter 13 to understand Chapter 14. Hence one may only cover those related sections of Chapter 13 if time is the factor. The book is separated roughly into the following subgroups: Basic Linear System Theory: Chapters 2 3. Stability and Performance: Chapters 4 6. Model Reduction: Chapters 7 8. Robustness: Chapters 9 11. H2 and H1 Control: Chapters 12 19. Lagrange Method: Chapter 20. Discrete Time Systems: Chapter 21. In view of the above classi cation, one possible choice for an one-semester course on robust control would cover Chapters 4 5; 9 11 or 4 11 and an one-semester advanced course on H2 and H1 control would cover (parts of) Chapters 12 19. Another possible choice for an one-semester course on H1 control may include Chapter 4, parts of Chapter 5 (5:1 5:3; 5:5; 5:7), Chapter 10, Chapter 12 (except Section 12.6), parts of Chapter 13 (13:2; 13:4; 13:6), Chapter 15 and Chapter 16. Although Chapters 7 8 are very much independent of other topics and can, in principle, be studied at any
1.2. How to Use This Book
2
3
4
?
3:9
?
5
-
6
-
11
7
A U A
-
8
?
9
?
10
?
12
13
@ @ R @ 15
?
?
16
@ I @ @
?
17
-
; ?; ;
19
14
?
13:2 13:6
?
13:4
18
20
21
Figure 1.2: Relations among the chapters
5
INTRODUCTION
6
stage with the background of Section 3.9, they may serve as an introduction to sources of model uncertainties and hence to robustness problems. Robust Control 4 5 6* 7* 8* 9 10 11
H1 Control
Advanced
Model & Controller Reductions 4 12 3.9 5.15.3,5.5,5.7 13.2,13.4,13.6 7 10 14 8 12 15 5.4,5.7 13.2,13.4,13.6 16 10.1 15 17* 16.1,16.2 16 18* 17.1 19* 19
H1 Control
Table 1.1: Possible choices for an one-semester course (* chapters may be omitted) Table 1.1 lists several possible choices of topics for an one-semester course. A course on model and controller reductions may only include the concept of H1 control and the H1 controller formulas with the detailed proofs omitted as suggested in the above table.
1.3 Highlights of The Book The key results in each chapter are highlighted below. Note that some of the statements in this section are not precise, they are true under certain assumptions that are not explicitly stated. Readers should consult the corresponding chapters for the exact statements and conditions. Chapter 2 reviews some basic linear algebra facts and treats a special class of matrix dilation problems. In particular, we show
X B
min X C A
= max
C A
;
B A
and characterize all optimal (suboptimal) X . Chapter 3 reviews some system theoretical concepts: controllability, observability, stabilizability, detectability, pole placement, observer theory, system poles and zeros, and state space realizations. Particularly, the balanced state space realizations are studied in some detail. We show that for agiven stable transfer function G(s) there B such that the controllability Gramian P A is a state space realization G(s) = C D and the observability Gramian Q de ned below are equal and diagonal: P = Q = = diag(1 ; 2 ; : : : ; n ) where AP + PA + BB = 0
1.3. Highlights of The Book
7
A Q + QA + C C = 0: Chapter 4 de nes several norms for signals and introduces the H2 spaces and the H1 spaces. The input/output gains of a stable linear system under various input signals are characterized. We show that H2 and H1 norms come out naturally as measures of the worst possible performance for many classes of input signals. For example, let
G(s) = CA B0 2 RH1 ; g(t) = CeAt B
kg uk
Z
1
n X
kg(t)k dt 2 i . Some state Then kGk1 = sup kuk 2 and 1 kGk1 0 2 i=1 space methods of computing real rational H2 and H1 transfer matrix norms are also presented: kGk22 = trace(B QB ) = trace(CPC ) and kGk1 = maxf : H has an eigenvalue on the imaginary axisg where = 2 A BB H = ;C C ;A : Chapter 5 introduces the feedback structure and discusses its stability and performance properties.
w1
+
e
e1
+6
-
P K^
++ w2 e2 ? e
We show that the above closed-loop system is internally stable if and only if I ;K^ ;1 = I + K^ (I ; P K^ );1 P K^ (I ; P K^ );1 2 RH1 : ;P I (I ; P K^ );1 P (I ; P K^ );1 Alternative characterizations of internal stability using coprime factorizations are also presented. Chapter 6 introduces some multivariable versions of the Bode's sensitivity integral relations and Poisson integral formula. The sensitivity integral relations are used to study the design limitations imposed by bandwidth constraint and the open-loop unstable poles, while the Poisson integral formula is used to study the design constraints
INTRODUCTION
8
imposed by the non-minimum phase zeros. For example, let S (s) be a sensitivity function, and let pi be the right half plane poles of the open-loop system and i be the corresponding pole directions. Then we show that 1
Z
0
X
ln (S (j!))d! = max
i
!
(Repi )i i + H1 ; H1 0:
This equality shows that the design limitations in multivariable systems are dependent on the directionality properties of the sensitivity function as well as those of the poles (and zeros), in addition to the dependence upon pole (and zero) locations which is known in single-input single-output systems. Chapter 7 considers the problem of reducing the order of a linear multivariable dynamical system using the balanced truncation method. Suppose 2
A11 A12 A21 A22 C1 C2
G(s) = 4
3
B1 B2 D
5
2 RH1
is a balanced realization with controllability and observability Gramians P = Q = = diag(1 ; 2 ) 1 = diag(1 Is1 ; 2 Is2 ; : : : ; r Isr ) 2 = diag(r+1 Isr+1 ; r+2 Isr+2 ; : : : ; N IsN ):
Then the truncated system Gr (s) = AC11 BD1 is stable and satis es an additive 1 error bound: N X kG(s) ; Gr (s)k1 2 i : i=r+1
On the other hand, if G;1 2 RH1 , and P and Q satisfy PA + AP + BB = 0 Q(A ; BD;1 C ) + (A ; BD;1 C ) Q + C (D;1 ) D;1 C = 0 such that P = Q = diag(1 ; 2 ) with G partitioned compatibly as before, then
Gr (s) = AC11 BD1 1
is stable and minimum phase, and satis es respectively the following relative and multiplicative error bounds:
G;1 (G ; Gr )
G;1 (G ; Gr )
r
1
1
N Y
1 + 2i (
i=r+1 N Y i=r+1
q
1 + 2i (
q
1 + 2 + i )
i
1 + 2 + i ) i
;1
; 1:
1.3. Highlights of The Book
9
Chapter 8 deals with the optimal Hankel norm approximation and its applications in L1 norm model reduction. We show that for a given G(s) of McMillan degree n there is a G^ (s) of McMillan degree r < n such that
G(s) ; G^ (s)
H = inf
G(s) ; G^ (s)
H = r+1 :
Moreover, there is a constant matrix D0 such that
N X
G(s) ; G^ (s) ; D0
1
i=r+1
i :
The well-known Nehari's theorem is also shown: inf kG ; Qk1 = kGkH = 1 :
Q2RH;1
Chapter 9 derives robust stability tests for systems under various modeling assumptions through the use of a small gain theorem. In particular, we show that an uncertain system described below with an unstructured uncertainty 2 RH1 with kk1 < 1 is robustly stable if and only if the transfer function from w to z has H1 norm no greater than 1. ∆
z
w
nominal system
Chapter 10 introduces the linear fractional transformation (LFT). We show that many control problems can be formulated and treated in the LFT framework. In particular, we show that every analysis problem can be put in an LFT form with some structured (s) and some interconnection matrix M (s) and every synthesis problem can be put in an LFT form with a generalized plant G(s) and a controller K (s) to be designed.
- z
M
z w
y
G
-K
w u
INTRODUCTION
10
Chapter 11 considers robust stability and performance for systems with multiple sources of uncertainties. We show that an uncertain system is robustly stable for all i 2 RH1 with ki k1 < 1 if and only if the structured singular value () of the corresponding interconnection model is no greater than 1. ∆1
∆4
∆2
nominal system
∆3
Chapter 12 characterizes all controllers that stabilize a given dynamical system G(s) using the state space approach. The construction of the controller parameterization is done via separation theory and a sequence of special problems, which are so-called full information (FI) problems, disturbance feedforward (DF) problems, full control (FC) problems and output estimation (OE). The relations among these special problems are established. FI
6
-
dual
equivalent
FC
6 equivalent
?
DF
-
dual
?
OE
For a given generalized plant 2
A B1 B2 11 (s) G12 (s) = 4 C D G(s) = G 1 11 D12 G21 (s) G22 (s) C2 D21 D22
3 5
we show that all stabilizing controllers can be parameterized as the transfer matrix from y to u below where F and L are such that A + LC2 and A + B2 F are stable.
1.3. Highlights of The Book
11
z y
? ? ;
c
G
c
C2
u
D22 R
-A
66 c
-
c
B2
6 c
-F
- ;L u1
w
y1
Q
Chapter 13 studies the Algebraic Riccati Equation and the related problems: the properties of its solutions, the methods to obtain the solutions, and some applications. In particular, we study in detail the so-called stabilizing solution and its applications in matrix factorizations. A solution to the following ARE
A X + XA + XRX + Q = 0 is said to be a stabilizing solution if A + RX is stable. Now let H := ;AQ ;RA and let X; (H ) be the stable H invariant subspace and X 1 X; (H ) = Im X2 where X1 ; X2 2 C nn . If X1 is nonsingular, then X := X2 X1;1 is uniquely determined by H , denoted by X = Ric(H ). A key result of this chapter is the relationship between the spectral factorization of a transfer function and the solution of a corresponding ARE. Suppose (A; B ) is stabilizable and suppose either A has no eigenvalues on j!-axis or P is sign de nite (i.e., P 0 or P 0) and (P; A) has no unobservable modes on the j!-axis. De ne
(s) = B (;sI ; A );1 I
P S S R
(sI ; A);1 B : I
INTRODUCTION
12 Then
(j!) > 0 for all 0 ! 1 () 9 a stabilizing solution X to (A ; BR;1 S ) X + X (A ; BR;1 S ) ; XBR;1B X + P ; SR;1S = 0
() the Hamiltonian matrix
;1 S ;BR;1B H = ;A(P;;BR ; 1 SR S ) ;(A ; BR;1 S )
has no j!-axis eigenvalues. Similarly,
() 9 a solution X to
(j!) 0 for all 0 ! 1
(A ; BR;1 S ) X + X (A ; BR;1 S ) ; XBR;1B X + P ; SR;1S = 0 such that (A ; BR;1 S ; BR;1 B X ) C ; . Furthermore, there exists a M 2 Rp such that = M RM: with
M = ;AF BI ; F = ;R;1(S + B X ):
Chapter 14 treats the optimal control of linear time-invariant systems with quadratic performance criteria, i.e., LQR and H2 problems. We consider a dynamical system described by an LFT with 3
2
A B1 B2 G(s) = 4 C1 0 D12 5 : C2 D21 0
z y
G
-
K
w
u
1.3. Highlights of The Book De ne
13
H2 := ;CA C ;0A ; ;CB2D 1 1 1 12
C1 B2 D12
D21 B1 C2 J2 := ;BA B ;0A ; ;BC2D 1 1 1 21 X2 := Ric(H2) 0; Y2 := Ric(J2 ) 0 C1 ); L2 := ;(Y2 C + B1 D ): F2 := ;(B2 X2 + D12 2 21 Then the H2 optimal controller, i.e. the controller that minimizes kTzw k2 , is given by
Kopt (s) := A + B2 FF2 + L2C2 ;0L2 : 2
Chapter 15 solves a max-min problem, i.e., a full information (or state feedback)
H1 control problem, which is the key to the H1 theory considered in the next chapter. Consider a dynamical system
x_ = Ax + B1 w + B2 u C1 D12 = 0 I : z = C1 x + D12 u; D12 Then we show that sup umin kz k2 < if and only if H1 2 dom(Ric) and X1 = w2BL2+ 2L2+ Ric(H1 ) 0 where
;2 H1 := ;CA C B1 B;1A; B2 B2 1 1
Furthermore, u = F1 x with F1 := ;B2 X1 is an optimal control. Chapter 16 considers a simpli ed H1 control problem with the generalized plant
G(s) as given in Chapter 14. We show that there exists an admissible controller such that kTzw k1 < i the following three conditions hold: (i) H1 2 dom(Ric) and X1 := Ric(H1 ) 0; (ii) J1 2 dom(Ric) and Y1 := Ric(J1 ) 0 where
;2 J1 := ;BA B C1 C;1A; C2 C2 : 1 1
(iii) (X1 Y1 ) < 2 .
INTRODUCTION
14
Moreover, the set of all admissible controllers such that kTzw k1 < equals the set of all transfer matrices from y to u in
u
y M1
-
2
A^1 ;Z1 L1 Z1 B2 4 M1 (s) = F1 0 I I 0 ;C2
Q
3 5
where Q 2 RH1 , kQk1 < and A^1 := A + ;2B1 B1 X1 + B2 F1 + Z1 L1 C2
F1 := ;B2 X1 ;
L1 := ;Y1 C2 ;
Z1 := (I ; ;2Y1 X1 );1 :
Chapter 17 considers again the standard H1 control problem but with some assumptions in the last chapter relaxed. We indicate how the assumptions can be relaxed to accommodate other more complicated problems such as singular control problems. We also consider the integral control in the H2 and H1 theory and show how the general H1 solution can be used to solve the H1 ltering problem. The conventional Youla parameterization approach to the H2 and H1 problems is also outlined. Finally, the general state feedback H1 control problem and its relations with full information control and dierential game problems are discussed. Chapter 18 rst solves a gap metric minimization problem. Let P = M~ ;1 N~ be a normalized left coprime factorization. Then we show that K
stabilizing
= K inf
stabilizing
inf
K (I + PK );1 I P I
K (I + PK );1M~ I
;1
1
=
q
1;
1
N~ M~
2
H
;1
:
This implies that there is a robustly stabilizing controller for P = (M~ + ~ M );1 (N~ + ~ N ) with if and only if
~ N ~ M
q
1<
1 ; N~ M~
2
H:
Using this stabilization result, a loop shaping design technique is proposed. The proposed technique uses only the basic concept of loop shaping methods and then a robust
1.3. Highlights of The Book
15
stabilization controller for the normalized coprime factor perturbed system is used to construct the nal controller. Chapter 19 considers the design of reduced order controllers by means of controller reduction. Special attention is paid to the controller reduction methods that preserve the closed-loop stability and performance. In particular, two H1 performance preserving reduction methods are proposed: ^ a) Let K0 be a stabilizing controller
such that
kF` (G; K0 )k1 < . Then K is also a
stabilizing controller such that F`(G; K^ ) < if 1
W2;1 (K^ ; K0)W1;1
1 < 1
where W1 and W2 are some stable, minimum phase and invertible transfer matrices. b) Let K0 = 12 ;221 be a central H1 controller such that kF`(G; K0 )k1 < and ^ V^ 2 RH1 be such that let U;
p ^
;1 I 0 U 12 ; 1
2: ; < 1 =
0 I 22 V^ 1 Then K^ = U^ V^ ;1 is also a stabilizing controller such that kF`(G; K^ )k1 < . Thus the controller reduction problem is converted to weighted model reduction problems for which some numerical methods are suggested. Chapter 20 brie y introduces the Lagrange multiplier method for the design of xed order controllers. Chapter 21 discusses discrete time Riccati equations and some of their applications in discrete time control. Finally, the discrete time balanced model reduction is considered.
16
INTRODUCTION
2
Linear Algebra Some basic linear algebra facts will be reviewed in this chapter. The detailed treatment of this topic can be found in the references listed at the end of the chapter. Hence we shall omit most proofs and provide proofs only for those results that either cannot be easily found in the standard linear algebra textbooks or are insightful to the understanding of some related problems. We then treat a special class of matrix dilation problems which will be used in Chapters 8 and 17; however, most of the results presented in this book can be understood without the knowledge of the matrix dilation theory.
2.1 Linear Subspaces Let R denote the real scalar eld and C the complex scalar eld. For the interest of this chapter, let F be either R or C and let Fn be the vector space over F, i.e., Fn is either Rn or C n . Now let x1 ; x2 ; : : : ; xk 2 Fn . Then an element of the form 1 x1 + : : : + k xk with i 2 F is a linear combination over F of x1 ; : : : ; xk . The set of all linear combinations of x1 ; x2 ; : : : ; xk 2 Fn is a subspace called the span of x1 ; x2 ; : : : ; xk , denoted by spanfx1 ; x2 ; : : : ; xk g := fx = 1 x1 + : : : + k xk : i 2 Fg: A set of vectors x1 ; x2 ; : : : ; xk 2 Fn are said to be linearly dependent over F if there exists 1 ; : : : ; k 2 F not all zero such that 1 x2 + : : : + k xk = 0; otherwise they are said to be linearly independent. Let S be a subspace of Fn , then a set of vectors fx1 ; x2 ; : : : ; xk g 2 S is called a basis for S if x1 ; x2 ; : : : ; xk are linearly independent and S = spanfx1; x2 ; : : : ; xk g. However, 17
LINEAR ALGEBRA
18
such a basis for a subspace S is not unique but all bases for S have the same number of elements. This number is called the dimension of S , denoted by dim(S ). A set of vectors fx1 ; x2 ; : : : ; xk g in Fn are mutually orthogonal if xi xj = 0 for all i 6= j and orthonormal if xi xj = ij , where the superscript denotes complex conjugate transpose and ij is the Kronecker delta function with ij = 1 for i = j and ij = 0 for i 6= j . More generally, a collection of subspaces S1 ; S2 ; : : : ; Sk of Fn are mutually orthogonal if x y = 0 whenever x 2 Si and y 2 Sj for i 6= j . The orthogonal complement of a subspace S Fn is de ned by
S ? := fy 2 Fn : y x = 0 for all x 2 S g: We call a set of vectors fu1; u2 ; : : : ; uk g an orthonormal basis for a subspace S 2 Fn if they form a basis of S and are orthonormal. It is always possible to extend such a basis to a full orthonormal basis fu1 ; u2; : : : ; un g for Fn . Note that in this case S ? = spanfuk+1 ; : : : ; un g; and fuk+1 ; : : : ; un g is called an orthonormal completion of fu1; u2; : : : ; uk g. Let A 2 Fmn be a linear transformation from Fn to Fm , i.e., A : Fn 7;! Fm : (Note that a vector x 2 Fm can also be viewed as a linear transformation from F to Fm , hence anything said for the general matrix case is also true for the vector case.) Then the kernel or null space of the linear transformation A is de ned by KerA = N (A) := fx 2 Fn : Ax = 0g; and the image or range of A is ImA = R(A) := fy 2 Fm : y = Ax; x 2 Fn g: It is clear that KerA is a subspace of Fn and ImA is a subspace of Fm . Moreover, it can be easily seen that dim(KerA) + dim(ImA) = n and dim(ImA) = dim(KerA)? . Note that (KerA)? is a subspace of Fn . Let ai ; i = 1; 2; : : :; n denote the columns of a matrix A 2 Fmn , then ImA = spanfa1 ; a2 ; : : : ; an g: The rank of a matrix A is de ned by rank(A) = dim(ImA): It is a fact that rank(A) = rank(A ), and thus the rank of a matrix equals the maximal number of independent rows or columns. A matrix A 2 Fmn is said to have full row rank if m n and rank(A) = m. Dually, it is said to have full column rank if n m and rank(A) = n. A full rank square matrix is called a nonsingular matrix. It is easy
2.1. Linear Subspaces
19
to see that rank(A) = rank(AT ) = rank(PA) if T and P are nonsingular matrices with appropriate dimensions. A square matrix U 2 F nn whose columns form an orthonormal basis for Fn is called an unitary matrix (or orthogonal matrix if F = R), and it satis es U U = I = UU . The following lemma is useful. Lemma 2.1 Let D = d1 : : : dk 2 Fnk (n > k) be such that DD = I , so d i ; i = 1; 2; : : : ; k are orthonormal. Then there exists a matrix D? 2 Fn(n;k) such that D D? is a unitary matrix. Furthermore, the columns of D?, di ; i = k + 1; : : : ; n, form an orthonormal completion of fd1 ; d2 ; : : : ; dk g. The following results are standard: Lemma 2.2 Consider the linear equation where A 2 Fnl and
B
AX = B
2 Fnm are given matrices. Then the following statements are
equivalent: (i) there exists a solution X 2 Flm . (ii) the columns of B 2 ImA. (iii) rank A B =rank(A). (iv) Ker(A ) Ker(B ). Furthermore, the solution, if it exists, is unique if and only if A has full column rank. The following lemma concerns the rank of the product of two matrices. Lemma 2.3 (Sylvester's inequality) Let A 2 Fmn and B 2 Fnk . Then rank (A) + rank(B ) ; n rank(AB ) minfrank (A); rank(B )g: For simplicity, a matrix M with mij as its i-th row and j -th column's element will sometimes be denoted as M = [mij ] in this book. We will mostly use I as above to denote an identity matrix with compatible dimensions, but from time to time, we will use In to emphasis that it is an n n identity matrix. Now let A = [aij ] 2 C nn , then the trace of A is de ned as
Trace(A) :=
n X i=1
aii :
Trace has the following properties: Trace(A) = Trace(A); 8 2 C ; A 2 C nn Trace(A + B ) = Trace(A) + Trace(B ); 8A; B 2 C nn Trace(AB ) = Trace(BA); 8A 2 C nm ; B 2 C mn :
LINEAR ALGEBRA
20
2.2 Eigenvalues and Eigenvectors
Let A 2 C nn ; then the eigenvalues of A are the n roots of its characteristic polynomial p() = det(I ; A). This set of roots is called the spectrum of A and is denoted by (A) (not to be confused with singular values de ned later). That is, (A) := f1 ; 2 ; : : : ; n g if i is a root of p(). The maximal modulus of the eigenvalues is called the spectral radius, denoted by (A) := 1max j j in i where, as usual, j j denotes the magnitude. If 2 (A) then any nonzero vector x 2 C n that satis es
Ax = x is referred to as a right eigenvector of A. Dually, a nonzero vector y is called a left eigenvector of A if y A = y : It is a well known (but nontrivial) fact in linear algebra that any complex matrix admits a Jordan Canonical representation:
Theorem 2.4 For any square complex matrix A 2 C nn , there exists a nonsingular matrix T such that where
A = TJT ;1 J = diagfJ1 ; J2 ; : : : ; Jl g Ji = diagfJi1 ; Ji2 ; : : : ; Jimi g 2 3 i 1 6 7 i 1 6 7
Jij = 666
... ...
7 7 7 5
2 C nij nij
i 1 i Pl Pmi with i=1 j=1 nij = n, and with fi : i = 1; : : : ; lg as the distinct eigenvalues of A. The transformation T has the following form: T = T1 T2 : : : Tl Ti = Ti1 Ti2 : : : Timi Tij = tij1 tij2 : : : tijnij where tij1 are the eigenvectors of A, Atij1 = i tij1 ; 4
2.2. Eigenvalues and Eigenvectors
21
and tijk 6= 0 de ned by the following linear equations for k 2 (A ; i I )tijk = tij(k;1) are called the generalized eigenvectors of A. For a given integer q nij , the generalized eigenvectors tijl ; 8l < q, are called the lower rank generalized eigenvectors of tijq . De nition 2.1 A square matrix A 2 Rnn is called cyclic if the Jordan canonical form of A has one and only one Jordan block associated with each distinct eigenvalue. More speci cally, a matrix A is cyclic if its Jordan form has mi = 1; i = 1; : : : ; l. Clearly, a square matrix A with all distinct eigenvalues is cyclic and can be diagonalized: 2
A x1 x2 xn = x1 x2 xn
6 6 6 4
1
3
2
...
n
7 7 7 5
:
In this case, A has the following spectral decomposition:
A= where yi 2 C n is given by
2 6 6 6 4
y1 y2 .. .
yn
n X i=1
i xi yi
3 7 7 7 5
= x1 x2 xn ;1 :
In general, eigenvalues need not be real, and neither do their corresponding eigenvectors. However, if A is real and is a real eigenvalue of A, then there is a real eigenvector corresponding to . In the case that all eigenvalues of a matrix A are real1 , we will denote max (A) for the largest eigenvalue of A and min (A) for the smallest eigenvalue. In particular, if A is a Hermitian matrix, then there exist a unitary matrix U and a real diagonal matrix such that A = U U , where the diagonal elements of are the eigenvalues of A and the columns of U are the eigenvectors of A. The following theorem is useful in linear system theory. Theorem 2.5 (Cayley-Hamilton) Let A 2 C nn and denote det(I ; A) = n + a1 n;1 + + an : Then An + a1 An;1 + + an I = 0: 1
For example, this is the case if A is Hermitian, i.e., A = A .
LINEAR ALGEBRA
22 This is obvious if A has distinct eigenvalues. Since
An + a1 An;1 + + an I = T ;1 diag f: : : ; ni + a1 in;1 + + an ; : : :g T = 0; and i is an eigenvalue of A. The proof for the general case follows from the following lemma.
Lemma 2.6 Let A 2 C nn . Then (I ; A);1 = det(I1 ; A) (R1 n;1 + R2 n;2 + + Rn ) and
det(I ; A) = n + a1 n;1 + + an where ai and Ri can be computed from the following recursive formulas:
a1 a2
= = .. . = =
; Trace A ; 21 Trace(R2 A)
R1 = I R2 = R1 A + a1 I
.. . an;1 ; n;1 1 Trace(Rn;1 A) Rn = Rn;1 A + an;1 I 0 = Rn A + an I: an ; n1 Trace(Rn A) The proof is left to the reader as an exercise. Note that the Cayley-Hamilton Theorem follows from the fact that
0 = Rn A + an I = An + a1 An;1 + + an I:
2.3 Matrix Inversion Formulas Let A be a square matrix partitioned as follows
11 A12 A := A A21 A22
where A11 and A22 are also square matrices. Now suppose A11 is nonsingular, then A has the following decomposition:
I 0 A11 A12 = A21 A22 A21 A;111 I
A11 0 0
I A;111 A12 0 I
with := A22 ; A21 A;111 A12 , and A is nonsingular i is nonsingular. Dually, if A22 is nonsingular, then
A11 A12 = I A12 A;221 A21 A22 0 I
0 0 A22
I 0 A;221 A21 I
2.3. Matrix Inversion Formulas
23
with := A11 ; A12 A;221 A21 , and A is nonsingular i is nonsingular. The matrix () is called the Schur complement of A11 (A22 ) in A. Moreover, if A is nonsingular, then
and
A11 A12 ;1 = A;111 + A;111 A12 ;1 A21 A;111 ;A;111 A12 ;1 A21 A22 ;;1 A21 A;111 ;1
# " ;1 ;;1 A12 A;221 A11 A12 ;1 = : A21 A22 ;A;221 A21 ;1 A;221 + A;221 A21 ;1 A12 A;221
The above matrix inversion formulas are particularly simple if A is block triangular:
A11 0 ;1 = A;111 0 ; 1 ; 1 A21 A22 ;A22 A21 A11 A;221
A11 A12 ;1 = A;111 ;A;111 A12 A;221 : 0 A22 0 A;221
The following identity is also very useful. Suppose A11 and A22 are both nonsingular matrices, then (A11 ; A12 A;221 A21 );1 = A;111 + A;111 A12 (A22 ; A21 A;111 A12 );1 A21 A;111 : As a consequence of the matrix decomposition formulas mentioned above, we can calculate the determinant of a matrix by using its sub-matrices. Suppose A11 is nonsingular, then det A = det A11 det(A22 ; A21 A;111 A12 ): On the other hand, if A22 is nonsingular, then det A = det A22 det(A11 ; A12 A;221 A21 ): In particular, for any B 2 C mn and C 2 C nm , we have
det ;ImC IB = det(In + CB ) = det(Im + BC ) n and for x; y 2 C n
det(In + xy ) = 1 + y x:
LINEAR ALGEBRA
24
2.4 Matrix Calculus
Let X = [xij ] 2 C mn be a real or complex matrix and F (X ) 2 C be a scalar real or complex function of X ; then the derivative of F (X ) with respect to X is de ned as
@ @ @X F (X ) := @xij F (X ) : Let A and B be constant complex matrices with compatible dimensions. Then the following is a list of formulas for the derivatives2: @ @X TracefAXB g @ T @X TracefAX B g @ @X TracefAXBX g @ T @X TracefAXBX g @ k @X TracefX g
= AT B T
@ k @X TracefAX g
=
@ ;1 @X TracefAX B g @ @X log det X @ T @X det X @ k @X detfX g
= ;(X ;1 BAX ;1)T
= BA = AT X T B T + B T X T AT = AT XB T + AXB = k(X k;1 )T k;1 X i AX k;i;1 T i=0
P
= (X T );1 @ det X = (detX )(X T );1 = @X
= k(detX k )(X T );1 :
And nally, the derivative of a matrix A() 2 C mn with respect to a scalar 2 C is de ned as dA := daij d d
so that all the rules applicable to a scalar function also apply here. In particular, we have d(AB ) = dA B + A dB
d d d dA;1 = ;A;1 dA A;1 : d d
2 Note that transpose rather than complex conjugate transpose should be used in the list even if the involved matrices are complex matrices.
2.5. Kronecker Product and Kronecker Sum
25
2.5 Kronecker Product and Kronecker Sum
Let A 2 C mn and B 2 C pq , then the Kronecker product of A and B is de ned as 2 6
A B := 664
a11 B a12 B a1n B a21 B a22 B a2n B .. .
.. .
.. .
am1 B am2 B amn B
3 7 7 7 5
2 C mpnq :
Furthermore, if the matrices A and B are square and A 2 C nn and B 2 C mm then the Kronecker sum of A and B is de ned as
A B := (A Im ) + (In B ) 2 C nmnm : Let X 2 C mn and let vec(X ) denote the vector formed by stacking the columns of X into one long vector: 2 3
vec(X ) :=
6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 4
x11 x21 .. .
7 7 7 7 7 7 7 7 7 7 7 7 7 7 7 7 7 7 7 5
xm1 x12 x22 : . ..
x1n x2n .. .
xmn Then for any matrices A 2 C km , B 2 C nl , and X 2 C mn , we have vec(AXB ) = (B T A)vec(X ): Consequently, if k = m and l = n, then vec(AX + XB ) = (B T A)vec(X ): Let A 2 C nn and B 2 C mm , and let fi ; i = 1; : : : ; ng be the eigenvalues of A and fj ; j = 1; : : : ; mg be the eigenvalues of B . Then we have the following properties:
The eigenvalues of A B are the mn numbers i j , i = 1; 2; : : :; n, j = 1; 2; : : :; m. The eigenvalues of A B = (A Im ) + (In B ) are the mn numbers i + j , i = 1; 2; : : :; n, j = 1; 2; : : : ; m.
LINEAR ALGEBRA
26
Let fxi ; i = 1; : : : ; ng be the eigenvectors of A and let fyj ; j = 1; : : : ; mg be the eigenvectors of B . Then the eigenvectors of A B and A B correspond to the eigenvalues i j and i + j are xi yj . Using these properties, we can show the following Lemma.
Lemma 2.7 Consider the Sylvester equation AX + XB = C
(2:1)
where A 2 Fnn , B 2 Fmm , and C 2 Fnm are given matrices. There exists a unique solution X 2 Fnm if and only if i (A)+j (B ) 6= 0; 8i = 1; 2; : : : ; n and j = 1; 2; : : : ; m. In particular, if B = A , (2.1) is called the \Lyapunov Equation"; and the necessary and sucient condition for the existence of a unique solution is that i (A) + j (A) 6= 0; 8i; j = 1; 2; : : : ; n
Proof. Equation (2.1) can be written as a linear matrix equation by using the Kronecker product:
(B T A)vec(X ) = vec(C ):
Now this equation has a unique solution i B T A is nonsingular. Since the eigenvalues of B T A have the form of i (A) + j (B T ) = i (A) + j (B ), the conclusion follows. 2 The properties of the Lyapunov equations will be studied in more detail in the next chapter.
2.6 Invariant Subspaces Let A : C n 7;! C n be a linear transformation, be an eigenvalue of A, and x be a corresponding eigenvector, respectively. Then Ax = x and A(x) = (x) for any 2 C . Clearly, the eigenvector x de nes an one-dimensional subspace that is invariant with respect to pre-multiplication by A since Ak x = k x; 8k. In general, a subspace S C n is called invariant for the transformation A, or A-invariant, if Ax 2 S for every x 2 S . In other words, that S is invariant for A means that the image of S under A is contained in S : AS S . For example, f0g, C n , KerA, and ImA are all A-invariant subspaces. As a generalization of the one dimensional invariant subspace induced by an eigenvector, let 1 ; : : : ; k be eigenvalues of A (not necessarily distinct), and let xi be the corresponding eigenvectors and the generalized eigenvectors. Then S = spanfx1 ; : : : ; xk g is an A-invariant subspace provided that all the lower rank generalized eigenvectors are included. More speci cally, let 1 = 2 = = l be eigenvalues of A, and
2.6. Invariant Subspaces
27
let x1 ; x2 ; : : : ; xl be the corresponding eigenvector and the generalized eigenvectors obtained through the following equations: (A ; 1 I )x1 = 0 (A ; 1 I )x2 = x1 .. . (A ; 1 I )xl = xl;1 : Then a subspace S with xt 2 S for some t l is an A-invariant subspace only if all lower rank eigenvectors and generalized eigenvectors of xt are in S , i.e., xi 2 S; 81 i t. This will be further illustrated in Example 2.1. On the other hand, if S is a nontrivial subspace3 and is A-invariant, then there is x 2 S and such that Ax = x. An A-invariant subspace S C n is called a stable invariant subspace if all the eigenvalues of A constrained to S have negative real parts. Stable invariant subspaces will play an important role in computing the stabilizing solutions to the algebraic Riccati equations in Chapter 13.
Example 2.1 Suppose a matrix A has the following Jordan canonical form 2
A x1 x2 x3 x4 = x1 x2 x3 x4
6 6 4
1 1 1
3
3
4
7 7 5
with Re1 < 0, 3 < 0, and 4 > 0. Then it is easy to verify that
S1 = spanfx1 g S3 = spanfx3 g S4 = spanfx4 g
S12 = spanfx1 ; x2 g S13 = spanfx1 ; x3 g S14 = spanfx1 ; x4 g
S123 = spanfx1 ; x2 ; x3 g S124 = spanfx1 ; x2 ; x4 g S34 = spanfx3 ; x4 g
are all A-invariant subspaces. Moreover, S1 ; S3 ; S12 ; S13 , and S123 are stable A-invariant subspaces. However, the subspaces S2 = spanfx2 g, S23 = spanfx2 ; x3 g, S24 = spanfx2 ; x4 g, and S234 = spanfx2 ; x3 ; x4 g are not A-invariant subspaces since the lower rank generalized eigenvector x1 of x2 is not in these subspaces. To illustrate, consider the subspace S23 . Then by de nition, Ax2 2 S23 if it is an A-invariant subspace. Since
Ax2 = x2 + x1 ; Ax2 2 S23 would require that x1 be a linear combination of x2 and x3 , but this is impossible since x1 is independent of x2 and x3 . 3 3
We will say subspace S is trivial if S = f0g.
LINEAR ALGEBRA
28
2.7 Vector Norms and Matrix Norms In this section, we will de ne vector and matrix norms. Let X be a vector space, a realvalued function kk de ned on X is said to be a norm on X if it satis es the following properties: (i) kxk 0 (positivity); (ii) kxk = 0 if and only if x = 0 (positive de niteness); (iii) kxk = jj kxk, for any scalar (homogeneity); (iv) kx + yk kxk + kyk (triangle inequality) for any x 2 X and y 2 X . A function is said to be a semi-norm if it satis es (i), (iii), and (iv) but not necessarily (ii). Let x 2 C n . Then we de ne the vector p-norm of x as
kxkp :=
n X i=1
jxi jp
!1=p
; for 1 p 1:
In particular, when p = 1; 2; 1 we have
kxk1 := kxk2 :=
n X i=1
jxi j;
v u n uX t
i=1
jxi j2 ;
kxk1 := 1max jx j: in i
Clearly, norm is an abstraction and extension of our usual concept of length in 3dimensional Euclidean space. So a norm of a vector is a measure of the vector \length", for example kxk2 is the Euclidean distance of the vector x from the origin. Similarly, we can introduce some kind of measure for a matrix. Let A = [aij ] 2 C mn , then the matrix norm induced by a vector p-norm is de ned as kAxk kAkp := sup kxk p : x6=0
p
In particular, for p = 1; 2; 1, the corresponding induced matrix norm can be computed as m X kAk1 = 1max jaij j (column sum) ; jn i=1
2.7. Vector Norms and Matrix Norms
29
p
kAk2 = max (A A) ; kAk1 = 1max im
n X j =1
jaij j (row sum) :
The matrix norms induced by vector p-norms are sometimes called induced p-norms. This is because kAkp is de ned by or induced from a vector p-norm. In fact, A can be viewed as a mapping from a vector space C n equipped with a vector norm kkp to another vector space C m equipped with a vector norm kkp . So from a system theoretical point of view, the induced norms have the interpretation of input/output ampli cation gains. We shall adopt the following convention throughout the book for the vector and matrix norms unless speci ed otherwise: let x 2 C n and A 2 C mn , then we shall denote the Euclidean 2-norm of x simply by kxk := kxk2 and the induced 2-norm of A by
kAk := kAk2 : The Euclidean 2-norm has some very nice properties:
Lemma 2.8 Let x 2 Fn and y 2 Fm . 1. Suppose n m. Then kxk = kyk i there is a matrix U 2 Fnm such that x = Uy and U U = I . 2. Suppose n = m. Then jx yj kxk kyk. Moreover, the equality holds i x = y for some 2 F or y = 0.
3. kxk kyk i there is a matrix 2 Fnm with kk 1 such that x = y. Furthermore, kxk < kyk i kk < 1. 4. kUxk = kxk for any appropriately dimensioned unitary matrices U .
Another often used matrix norm is the so called Frobenius norm. It is de ned as p
kAkF := Trace(A A) =
v u m n uX X t
i=1 j =1
jaij j2 :
However, the Frobenius norm is not an induced norm. The following properties of matrix norms are easy to show: Lemma 2.9 Let A and B be any matrices with appropriate dimensions. Then
LINEAR ALGEBRA
30
1. (A) kAk (This is also true for F norm and any induced matrix norm).
2. kAB k kAk kB k. In particular, this gives A;1 kAk;1 if A is invertible. (This is also true for any induced matrix norm.) 3. kUAV k = kAk, and kUAV kF = kAkF , for any appropriately dimensioned unitary matrices U and V . 4. kAB kF kAk kB kF and kAB kF kB k kAkF .
Note that although pre-multiplication or post-multiplication of a unitary matrix on a matrix does not change its induced 2-norm and F -norm, it does change its eigenvalues. For example, let 1 0 A= 1 0 : Then 1 (A) = 1; 2 (A) = 0. Now let
U=
"
p12 ; p12
then U is a unitary matrix and
UA =
p
p2 0
p12 p12
0 0
#
;
with 1 (UA) = 2, 2 (UA) = 0. This property is useful in some matrix perturbation problems, particularly, in the computation of bounds for structured singular values which will be studied in Chapter 10.
Lemma 2.10 Let A be a block partitioned matrix with 2 A A A 3 66 A1121 A1222 A12qq 77 A = 64 .. .. .. . . . Am1 Am2 Amq
75 =: [Aij ];
and let each Aij be an appropriately dimensioned matrix. Then for any induced matrix p-norm
2 3
kA11 kp kA12 kp kA1q kp
6 kA21 k kA22 kp kA2q kp 77
kAkp
664 .. p .. .. 75
: . . .
kAm1 kp kAm2 kp kAmq kp p
Further, the inequality becomes an equality if the F -norm is used.
(2:2)
2.7. Vector Norms and Matrix Norms
31
Proof. It is obvious that if the F -norm is used, then the right hand side of inequality (2.2) equals the left hand side. Hence only the induced p-norm cases, 1 p 1, will be shown. Let a vector x be partitioned consistently with A as
2x 66 x12 x = 64 .. . xq
and note that
3 77 75 ;
2 kx1k
6 kx kp 2 kxkp =
664 .. p
. kxq kp
3
77
75
:
p
Then
2 Pq A1j xj 3
6 Pjq=1 A x 7
2j j 7 k[Aij ]kp := sup k[Aij ] xkp = sup
664 j=1.. 75
kxkp =1 kxkp=1 P .
qj=1 Amj xj
p
3
2
Pq
6
j=1 A1j xj
p 7
2 Pq kA1j k kxj k P
66
q A2j xj
77
6 Pjq=1 kA kp kx kp j =1
sup
66 j=1 2.j p j p p 7 = sup
666 7 . .. 77
kxkp=1
4 P kxkp =1 6 ..
q
4 Pq
j=1 kAmj kp kxj kp 5
j=1 Amj xj
p
p
2 kA11 k kA12k kA1q k 3 2 kx1k 3
6 kA kp kA kp kA kp 7 6 kx kp 7
21 p 22 p 2q p 7 6 2 p 7 = sup
664 .. .. .. 75 64 .. 75
kxkp =1 . . .
kAm1 kp kAm2kp kA1.q kp kxq kp
p
h i sup
kAij kp
p kxkp kxkp =1
h i =
kAij k
:
3
77
75
p
p p
2
LINEAR ALGEBRA
32
2.8 Singular Value Decomposition A very useful tool in matrix analysis is Singular Value Decomposition (SVD). It will be seen that singular values of a matrix are good measures of the \size" of the matrix and that the corresponding singular vectors are good indications of strong/weak input or output directions. Theorem 2.11 Let A 2 Fmn . There exist unitary matrices U = [u1 ; u2; : : : ; um] 2 Fmm V = [v1 ; v2 ; : : : ; vn ] 2 Fnn such that 0 A = U V ; = 01 0 where
and
2 0 66 01 2 1 = 64 .. .. . . . . . 0
0 0 .. .
0 p
3 77 75
1 2 p 0; p = minfm; ng:
Proof. Let = kAk and without loss of generality assume m n. Then from the de nition of kAk, there exists a z 2 Fn such that kAz k = kz k : By Lemma 2.8, there is a matrix U~ 2 F mn such that U~ U~ = I and ~ Az = Uz:
Now let We have Ax = y. Let and
~ x = kzz k 2 Fn ; y =
Uz
2 Fm : ~
Uz
V = x V1 2 Fnn
U = y U1 2 Fmm be unitary.4 Consequently, U AV has the following structure: w A1 := U AV = 0 B 4 Recall that it is always possible to extend an orthonormal set of vectors to an orthonormal basis for the whole space.
2.8. Singular Value Decomposition
33
where w 2 Fn;1 and B 2 F(m;1)(n;1) . Since
2 1 3
2
6 0 7
A1 66 . 77
= (2 + w w);
4 .. 5
0 2 it follows that kA1 k2 2 + w w. But since = kAk = kA1 k, we must have w = 0. An obvious induction argument gives
U AV = :
2
This completes the proof.
The i is the i-th singular value of A, and the vectors ui and vj are, respectively, the i-th left singular vector and the j -th right singular vector. It is easy to verify that
Avi = i ui A ui = i vi : The above equations can also be written as
A Avi = i2 vi AA ui = i2 ui : Hence i2 is an eigenvalue of AA or A A, ui is an eigenvector of AA , and vi is an eigenvector of A A. The following notations for singular values are often adopted:
(A) = max (A) = 1 = the largest singular value of A; and
(A) = min (A) = p = the smallest singular value of A : Geometrically, the singular values of a matrix A are precisely the lengths of the semiaxes of the hyperellipsoid E de ned by E = fy : y = Ax; x 2 C n ; kxk = 1g: Thus v1 is the direction in which kyk is largest for all kxk = 1; while vn is the direction in which kyk is smallest for all kxk = 1. From the input/output point of view, v1 (vn ) is the highest (lowest) gain input direction, while u1 (um ) is the highest (lowest) gain observing direction. This can be illustrated by the following 2 2 matrix: cos ; sin cos ; sin 1 1 1 2 2 A = sin cos 2 sin 2 cos 2 : 1 1
LINEAR ALGEBRA
34
It is easy to see that A maps a unit disk to an ellipsoid with semi-axes of 1 and 2 . Hence it is often convenient to introduce the following alternative de nitions for the largest singular value : (A) := kmax kAxk xk=1 and for the smallest singular value of a tall matrix:
(A) := kmin kAxk : xk=1
Lemma 2.12 Suppose A and are square matrices. Then (i) j(A + ) ; (A)j (); (ii) (A) (A) (); (iii) (A;1 ) = 1 if A is invertible. (A)
Proof. (i) By de nition
(A + ) := kmin k(A + )xk xk=1 kmin fkAxk ; kxkg xk=1 kmin kAxk ; kmax kxk xk=1 xk=1 = (A) ; (): Hence ;() (A + ) ; (A). The other inequality (A + ) ; (A) () follows by replacing A by A + and by ; in the above proof. (ii) This follows by noting that
(A) := kmin kAxk rxk=1 min x A Ax = kxk=1
(A) kmin kxk xk=1
= (A) ():
(iii) Let the singular value decomposition of A be A = U V , then A;1 = V ;1 U . Hence (A;1 ) = (;1 ) = 1=() = 1=(A).
2.8. Singular Value Decomposition
35
2 Some useful properties of SVD are collected in the following lemma. Lemma 2.13 Let A 2 Fmn and 1 2 r > r+1 = = 0; r minfm; ng: Then 1. rank(A) = r; 2. KerA = spanfvr+1; : : : ; vn g and (KerA)? = spanfv1 ; : : : ; vr g; 3. ImA = spanfu1; : : : ; ur g and (ImA)? = spanfur+1; : : : ; um g; 4. A 2 Fmn has a dyadic expansion:
A= 5. 6. 7. 8.
r X i=1
i ui vi = Ur r Vr
where Ur = [u1 ; : : : ; ur ], Vr = [v1 ; : : : ; vr ], and r = diag (1 ; : : : ; r ); kAk2F = 12 + 22 + + r2 ; kAk = 1 ; i (U0 AV0 ) = i (A); i = 1; : : : ; p for any appropriately dimensioned unitary matrices U0 and V0 ; P Let k < r = rank(A) and Ak := ki=1 i ui vi , then min kA ; B k = kA ; Ak k = k+1 : rank(B)k
Proof. We shall only give a proof for part 8. It is easy to see that rank(Ak ) k and kA ; Ak k = k+1 . Hence, we only need to show that min kA ; B k k+1 . Let rank(B)k B be any matrix such that rank(B ) k. Then kA ; B k = k U V ; B k = k ; U BV k
Ik+1 0 ( ; U BV ) Ik0+1
=
k+1 ; B^
where B^ = Ik+1 0 U BV Ik0+1 2 F(k+1)(k+1) and rank(B^ ) k. Let x 2 Fk+1 ^ = 0 and kxk = 1. Then be such that Bx
kA ; B k
k+1 ; B^
(k+1 ; B^ )x
= kk+1 xk k+1 : Since B is arbitrary, the conclusion follows.
2
LINEAR ALGEBRA
36
2.9 Generalized Inverses
Let A 2 C mn . A matrix X 2 C nm is said to be a right inverse of A if AX = I . Obviously, A has a right inverse i A has full row rank, and, in that case, one of the right inverses is given by X = A (AA );1 . Similarly, if Y A = I then Y is called a left inverse of A. By duality, A has a left inverse i A has full column rank, and, furthermore, one of the left inverses is Y = (A A);1 A . Note thatright (or left) inverses are not necessarily unique. For example, any matrix in the form I? is a right inverse of I 0 . More generally, if a matrix A has neither full row rank nor full column rank, then all the ordinary matrix inverses do not exist; however, the so called pseudo-inverse, known also as the Moore-Penrose inverse, is useful. This pseudo-inverse is denoted by A+ , which satis es the following conditions: (i) AA+ A = A; (ii) A+ AA+ = A+ ; (iii) (AA+ ) = AA+ ; (iv) (A+ A) = A+ A. It can be shown that pseudo-inverse is unique. One way of computing A+ is by writing A = BC so that B has full column rank and C has full row rank. Then A+ = C (CC );1 (B B );1 B : Another way to compute A+ is by using SVD. Suppose A has a singular value decomposition A = U V with 0 = 0r 0 ; r > 0: Then A+ = V + U with
;1 + = 0r 00 :
2.10 Semide nite Matrices
A square hermitian matrix A = A is said to be positive de nite (semi-de nite) , denoted by A > 0 ( 0), if x Ax > 0 ( 0) for all x 6= 0. Suppose A 2 Fnn and A = A 0, then there exists a B 2 Fnr with r rank(A) such that A = BB . Lemma 2.14 Let B 2 Fmn and C 2 Fkn . Suppose m k and BB = C C . Then there exists a matrix U 2 Fmk such that U U = I and B = UC .
2.10. Semide nite Matrices
37
Proof. Let V1 and V2 be unitary matrices such that B1 = V1
B
C
1
1
0 ; C1 = V2 0 where B1 and C1 are full row rank. Then B1 and C1 have the same number of rows and V3 := B1 C1 (C1 C1 );1 satis es V3 V3 = I since B B = C C . Hence V3 is a unitary matrix and V3 B1 = C1 . Finally let U = V1 V03 V0 V2 4 for any suitably dimensioned V4 such that V4 V4 = I . 2 by
We can de ne square root for a positive semi-de nite matrix A, A1=2 = (A1=2 ) 0,
A = A1=2 A1=2 :
Clearly, A1=2 can be computed by using spectral decomposition or SVD: let A = U U , then A1=2 = U 1=2 U where p p = diagf1 ; : : : ; n g; 1=2 = diagf 1 ; : : : ; n g: Lemma 2.15 Suppose A = A > 0 and B = B 0. Then A > B i (BA;1 ) < 1.
Proof. Since A > 0, we have A > B i 0 < I ; A;1=2 BA;1=2 = I ; A;1=2 (BA;1 )A1=2 :
However, A;1=2 BA;1=2 and BA;1 are similar, and hence i (BA;1 ) = i (A;1=2 BA;1=2 ). Therefore, the conclusion follows by the fact that 0 < I ; A;1=2 BA;1=2 i (A;1=2 BA;1=2 ) < 1 i (BA;1 ) < 1. 2
Lemma 2.16 Let X = X 0 be partitioned as X=
X
11 X12
X12 : X22
+ is the pseudo-inverse of X , then Y = Then KerX22 KerX12 . Consequently, if X22 22 + X12 X22 solves Y X22 = X12 and X X I X X + X ; X X + X 0 I 0 11 12 12 22 11 12 22 12 X12 X22 = 0 I 0 X22 X22+ X12 I :
LINEAR ALGEBRA
38
Proof. Without loss of generality, assume
X22 = U1 U2
1
0 0 0
U 1
U2
with 1 = 1 > 0 and U = U1 U2 unitary. Then Ker X22 = spanfcolumns of U2 g and ;1 U1 : X22+ = U1 U2 01 00 U Moreover
I
X
2
I X12
0 0 11 0 U X12 X22 0 U 0 gives X12 U2 = 0. Hence, Ker X22 Ker X12 and now X12 X22+ X22 = X12 U1 U1 = X12 U1 U1 + X12 U2 U2 = X12 : The factorization follows easily.
2
2.11 Matrix Dilation Problems* In this section, we consider the following induced 2-norm optimization problem:
X B
min X C A
(2:3)
where X , B , C , and A are constant matrices of compatible dimensions.
X B The matrix is a dilation of its sub-matrices as indicated in the following
diagram:
C A
X B d C A
d
6
c
-
c
?
C A
d c
B A
d
-
6
c
?
A
2.11. Matrix Dilation Problems*
39
In this diagram, \c" stands for the operation of compression and \d" stands for dilation. Compression is always norm non-increasing and dilation is always norm non-decreasing. Sometimes dilation can be made to be norm preserving. Norm preserving dilations are the focus of this section. The simplest matrix dilation problem occurs when solving
X
min X A
:
(2:4)
Although (2.4) is a much simpli ed version of (2.3), we will see that it contains all the essential features of the general problem. Letting 0 denote the minimum norm in (2.4), it is immediate that
0 = kAk : The following theorem characterizes all solutions to (2.4).
Theorem 2.17 8 0,
X
A
i there is a Y with kY k 1 such that
X = Y ( 2 I ; A A)1=2 :
Proof. i i
X
A
X X + A A 2 I
X X ( 2 I ; A A): Now suppose X X ( 2 I ; A A) and let
h
Y := X ( 2 I ; A A)1=2
i+
then X = Y ( 2 I ; A A)1=2 and Y Y I . Similarly if X = Y ( 2 I ; A A)1=2 and Y Y I then X X ( 2 I ; A A): 2 This theorem implies that, in general, (2.4) has more than one solution, which is in contrast to the minimization in the Frobenius norm in which X = 0 is the unique solution. The solution X = 0 is the central solution but others are possible unless A A = 02 I .
LINEAR ALGEBRA
40
Remark 2.1 The theorem still holds if ( 2I ; A A)1=2 is replaced by any matrix R such that 2 I ; A A = R R. ~ A more restricted version of the above theorem is shown in the following corollary.
Corollary 2.18 8 > 0 , i
X
A
(< )
2 ;1=2
X ( I ; A A) 1(< 1):
The corresponding dual results are
Theorem 2.19 8 0
X A
i there is a Y , kY k 1, such that
X = ( 2 I ; AA )1=2 Y:
Corollary 2.20 8 > 0 i
X A
(< )
2
( I ; AA );1=2X
1 (< 1):
Now, returning to the problem in (2.3), let
X B
0 := min X C A
:
(2:5)
The following so called Parrott's theorem will play an important role in many control related optimization problems. The proof is the straightforward application of Theorem 2.17 and its dual, Theorem 2.19.
Theorem 2.21 (Parrott's Theorem) The minimum in (2.5) is given by
0 = max C A ;
B
A
:
(2:6)
2.11. Matrix Dilation Problems*
41
Proof. Denote by ^ the right hand side of the equation (2.6). Clearly, 0 ^ since compressions are norm non-increasing, and that 0 ^ will be shown by using Theorem 2.17 and Theorem 2.19. Suppose A 2 C nm and n m (the case for m > n can be shown in the same fashion). Then A has the following singular value decomposition:
m
A=U 0 V ; U 2 C nn ; V 2 C mm : n;m;m Hence
^2 I ; A A = V (^ 2 I ; 2m )V
and
^2 I ; AA
Now let
=U
^2I ; 2 0
0
^2 In;m U :
m
(^ 2 I ; A A)1=2 := V (^ 2 I ; 2m )1=2 V
and
2 2 1=2 0 (^ 2 I ; AA )1=2 := U (^ I ;0m )
^In;m U : Then it is easy to verify that
(^ 2 I ; A A)1=2 A = A (^ 2 I ; AA )1=2 : Using this equality, we can show that
;A (^ 2 I ; A A)1=2 2 1 = 2 (^ I ; AA ) A =
^2I 0
;A (^ 2 I ; A A)1=2 2 1 = 2 (^ I ; AA ) A
0
^2 I :
Now we are ready to show that 0 ^. From Theorem 2.17 we have that B = Y (^ 2 I ; A A)1=2 for some Y such that kY k 1. Similarly, Theorem 2.19 yields C = (^ 2 I ; AA )1=2 Z for some Z with kZ k 1. Now let X^ = ;Y A Z . Then
^
X B
=
2 ;Y AZ1=2 Y (^ 2I ; AA)1=2
C A
I ; AA ) Z A
(^
2 I ; A A)1=2 Z Y ; A (^
= I I (^ 2 I ; AA )1=2 A
2 I ; A A)1=2
; A (^
(^ 2 I ; AA )1=2
A = ^:
LINEAR ALGEBRA
42 Thus ^ 0 , so ^ = 0 .
2
This theorem gives one solution to (2.3) and an expression for 0 . As in (2.4), there may be more than one solution to (2.3), although the proof of theorem 2.21 exhibits only one. Theorem 2.22 considers the problem of parameterizing all solutions. The solution X^ = ;Y A Z is the \central" solution analogous to X = 0 in (2.4). Theorem 2.22 Suppose 0. The solutions X such that
X B
C A
(2:7)
are exactly those of the form X = ;Y A Z + (I ; Y Y )1=2 W (I ; Z Z )1=2 (2:8) where W is an arbitrary contraction (kW k 1), and Y with kY k 1 and Z with kZ k 1 solve the linear equations B = Y ( 2 I ; A A)1=2 ; (2.9) 2 1 = 2 C = ( I ; AA ) Z: (2.10)
Proof. Since 0, again from Theorem 2.19 there exists a Z with kZ k 1 such that C = ( 2 I ; AA )1=2 Z: Note that using the above expression for C we have
2I ; C A C A (I ; Z Z )1=2 Z Z )1=2 0 0 = (I ; ;A Z ( 2 I ; A A)1=2 ;A Z ( 2 I ; A A)1=2 :
Now apply 2.17 (Remark 2.1) to inequality (2.7) with respect to the partitioned XTheorem B matrix C A to get
X B = W^ (I ; Z Z )1=2 0 ;A Z ( 2 I ; A A)1=2
for some contraction W^ , W^ 1. Partition W^ as W^ = W1 Y to obtain the expression for X and B :
X = ;Y A Z + W1 (I ; Z Z )1=2 ; B = Y ( 2 I ; A A)1=2 :
Then kY k 1 and the theorem follows by noting that W1 Y W , kW k 1, such that W1 = (I ; Y Y )1=2 W .
1 i there is a
2
The following corollary gives an alternative version of Theorem 2.22 when > 0 .
2.11. Matrix Dilation Problems* Corollary 2.23 For > 0. i
43
X B
C A
(< )
(2:11)
(I ; Y Y );1=2 (X + Y A Z )(I ; Z Z );1=2
(< )
(2:12)
where
Y = B ( 2 I ; A A);1=2 ; (2.13) 2 ; 1 = 2 Z = ( I ; AA ) C: (2.14) Note that in the case of > 0 , I ; Y Y and I ; Z Z are invertible since Corollary 2.18 and 2.20 clearly show that kY k < 1 and kZ k < 1. There are many alternative characterizations of solutions to (2.11), although the formulas given above seem to be the simplest. As a straightforward application of the dilation results obtained above, consider the following matrix approximation problem:
0 = min kR + UQV k Q
(2:15)
where R, U , and V are constant matrices such that U U = I and V V = I .
Corollary 2.24 The minimum achievable norm is given by
0 = max fkU? Rk ; kRV? kg ; and the parameterization for all optimal solutions Q can be obtained from Theorem 2.22 with X = Q + U RV , A = U? RV? , B = U RV? , and C = U? RV .
V Proof. Let U? and V? be such that U U? and V? are unitary matrices. Then
0 = min kR + UQV k Q
U U? (R + UQV ) VV
= min Q
U RV + Q U RV
? ? : = min Q
U? RV
U? RV?
The result follows after applying Theorem 2.21 and 2.22. A similar problem arises in H1 control theory.
2
44
LINEAR ALGEBRA
2.12 Notes and References A very extensive treatment of most topics in this chapter can be found in Brogan [1991], Horn and Johnson [1990,1991] and Lancaster and Tismenetsky [1985]. Golub and Van Loan's book [1983] contains many numerical algorithms for solving most of the problems in this chapter. The matrix dilation theory can be found in Davis, Kahan, and Weinberger [1982].
3
Linear Dynamical Systems This chapter reviews some basic system theoretical concepts. The notions of controllability, observability, stabilizability, and detectability are de ned and various algebraic and geometric characterizations of these notions are summarized. Kalman canonical decomposition, pole placement, and observer theory are then introduced. The solutions of Lyapunov equations and their connections with system stability, controllability, and so on, are discussed. System interconnections and realizations, in particular the balanced realization, are studied in some detail. Finally, the concepts of system poles and zeros are introduced.
3.1 Descriptions of Linear Dynamical Systems Let a nite dimensional linear time invariant (FDLTI) dynamical system be described by the following linear constant coecient dierential equations:
x_ = Ax + Bu; x(t0 ) = x0 y = Cx + Du
(3.1) (3.2)
where x(t) 2 Rn is called the system state, x(t0 ) is called the initial condition of the system, u(t) 2 Rm is called the system input, and y(t) 2 Rp is the system output. The A; B; C; and D are appropriately dimensioned real constant matrices. A dynamical system with single input (m = 1) and single output (p = 1) is called a SISO (single input and single output) system, otherwise it is called MIMO (multiple input and multiple 45
46
LINEAR DYNAMICAL SYSTEMS
output) system. The corresponding transfer matrix from u to y is de ned as Y (s) = G(s)U (s) where U (s) and Y (s) are the Laplace transform of u(t) and y(t) with zero initial condition (x(0) = 0). Hence, we have G(s) = C (sI ; A);1 B + D: Note that the system equations (3.1) and (3.2) can be written in a more compact matrix form: x_ A B x y = C D u : To expedite calculations involving transfer matrices, the notation
A B ;1 C D := C (sI ; A) B + D
will be used. Other reasons for using this notation will be discussed in Chapter 10. Note that
A B C D
is a real block matrix, not a transfer function. Now given the initial condition x(t0 ) and the input u(t), the dynamical system response x(t) and y(t) for t t0 can be determined from the following formulas:
Zt
x(t) = eA(t;t0 ) x(t0 ) + eA(t; )Bu( )d (3.3) t0 y(t) = Cx(t) + Du(t): (3.4) In the case of u(t) = 0; 8t t0 , it is easy to see from the solution that for any t1 t0 and t t0 , we have x(t) = eA(t;t1 ) x(t1 ): Therefore, the matrix function (t; t1 ) = eA(t;t1 ) acts as a transformation from one state to another, and thus (t; t1 ) is usually called the state transition matrix. Since
the state of a linear system at one time can be obtained from the state at another through the transition matrix, we can assume without loss of generality that t0 = 0. This will be assumed in the sequel. The impulse matrix of the dynamical system is de ned as g(t) = L;1 fG(s)g = CeAt B 1+ (t) + D(t) where (t) is the unit impulse and 1+ (t) is the unit step de ned as 1; t 0; 1+ (t) := 0; t < 0:
3.2. Controllability and Observability
47
The input/output relationship (i.e., with zero initial state: x0 = 0) can be described by the convolution equation
y(t) = (g u)(t) :=
Z1
;1
g(t ; )u( )d =
Zt
;1
g(t ; )u( )d:
3.2 Controllability and Observability We now turn to some very important concepts in linear system theory.
De nition 3.1 The dynamical system described by the equation (3.1) or the pair (A; B ) is said to be controllable if, for any initial state x(0) = x0 , t1 > 0 and nal state x1 , there exists a (piecewise continuous) input u() such that the solution of (3.1) satis es x(t1 ) = x1 . Otherwise, the system or the pair (A; B ) is said to be uncontrollable.
The controllability (or observability introduced next) of a system can be veri ed through some algebraic or geometric criteria.
Theorem 3.1 The following are equivalent: (i) (A; B ) is controllable. (ii) The matrix
Wc (t) :=
Zt 0
eA BB eA d
is positive de nite for any t > 0. (iii) The controllability matrix
C = B AB A2 B : : : An;1 B
P has full row rank or, in other words, hA jImB i := ni=1 Im(Ai;1 B ) = Rn . (iv) The matrix [A ; I; B ] has full row rank for all in C . (v) Let and x be any eigenvalue and any corresponding left eigenvector of A, i.e., x A = x , then x B 6= 0. (vi) The eigenvalues of A + BF can be freely assigned (with the restriction that complex eigenvalues are in conjugate pairs) by a suitable choice of F .
LINEAR DYNAMICAL SYSTEMS
48
Proof. (i) , (ii): Suppose Wc (t1 ) > 0 for some t1 > 0, and let the input be de ned as u( ) = ;B eA(t1 ; )Wc (t1 );1 (eAt1 x0 ; x1 ):
Then it is easy to verify using the formula in (3.3) that x(t1 ) = x1 . Since x1 is arbitrary, the pair (A; B ) is controllable. To show that the controllability of (A; B ) implies that Wc (t) > 0 for any t > 0, assume that (A; B ) is controllable but Wc (t1 ) is singular for some t1 > 0. Since eAtBB eAt 0 for all t, there exists a real vector 0 6= v 2 Rn such that v eAtB = 0; t 2 [0; t1 ]: Now let x(t1 ) = x1 = 0, and then from the solution (3.3), we have 0 = eAt1 x(0) +
Zt
1
0
eA(t1 ; )Bu( )d:
Pre-multiply the above equation by v to get 0 = v eAt1 x(0): If we chose the initial state x(0) = e;At1 v, then v = 0, and this is a contradiction. Hence, Wc (t) can not be singular for any t > 0. (ii) , (iii): Suppose Wc (t) > 0 for all t > 0 (in fact, it can be shown that Wc (t) > 0 for all t > 0 i, for some t1 , Wc (t1 ) > 0) but the controllability matrix C does not have full row rank. Then there exists a v 2 Rn such that v Ai B = 0 for all 0 i n ; 1. In fact, this equality holds for all i 0 by the CayleyHamilton Theorem. Hence, v eAt B = 0 for all t or, equivalently, v Wc (t) = 0 for all t; this is a contradiction, and hence, the controllability matrix C must be full row rank. Conversely, suppose C has full row rank but Wc (t) is singular for some t1 . Then there exists a 0 6= v 2 Rn such that v eAt B = 0 for all t 2 [0; t1 ]. Therefore, set t = 0, and we have v B = 0: Next, evaluate the i-th derivative of v eAt B = 0 at t = 0 to get v Ai B = 0; i > 0: Hence, we have v B AB A2 B : : : An;1 B = 0 or, in other words, the controllability matrix C does not have full row rank. This is again a contradiction.
3.2. Controllability and Observability
49
(iii) ) (iv): Suppose, on the contrary, that the matrix
A ; I B
does not have full row rank for some 2 C . Then there exists a vector x 2 C n such that x A ; I B = 0 i.e., x A = x and x B = 0. However, this will result in
x B AB : : : An;1 B = x B x B : : : n;1 x B = 0 i.e., the controllability matrix C does not have full row rank, and this is a contradiction. (iv) ) (v): This is obvious from the proof of (iii) ) (iv). (v) ) (iii): We will again prove this by contradiction. Assume that (v) holds but rank C = k < n. Then in section 3.3, we will show that there is a transformation T such that A A B c 12 ; 1 TAT = 0 Ac TB = 0c with Ac 2 R(n;k)(n;k) . Let 1 and xc be any eigenvalue and any corresponding left eigenvector of Ac, i.e., xcAc = 1 xc. Then x (TB ) = 0 and
x = x0 c
is an eigenvector of TAT ;1 corresponding to the eigenvalue 1 , which implies that (TAT ;1; TB ) is not controllable. This is a contradiction since similarity transformation does not change controllability. Hence, the proof is completed. (vi) ) (i): This follows the same arguments as in the proof of (v) ) (iii): assume that (vi) holds but (A; B ) is uncontrollable. Then, there is a decomposition so that some subsystems are not aected by the control, but this contradicts the condition (vi). (i) ) (vi): This will be clear in section 3.4. In that section, we will explicitly construct a matrix F so that the eigenvalues of A + BF are in the desired locations.
2
De nition 3.2 An unforced dynamical system x_ = Ax is said to be stable if all the eigenvalues of A are in the open left half plane, i.e., Re(A) < 0. A matrix A with such a property is said to be stable or Hurwitz.
LINEAR DYNAMICAL SYSTEMS
50
De nition 3.3 The dynamical system (3.1), or the pair (A; B), is said to be stabilizable
if there exists a state feedback u = Fx such that the system is stable, i.e., A + BF is stable. Therefore, it is more appropriate to call this stabilizability the state feedback stabilizability to dierentiate it from the output feedback stabilizability de ned later. The following theorem is a consequence of Theorem 3.1.
Theorem 3.2 The following are equivalent: (i) (A; B ) is stabilizable. (ii) The matrix [A ; I; B ] has full row rank for all Re 0.
(iii) For all and x such that x A = x and Re 0, x B 6= 0. (iv) There exists a matrix F such that A + BF is Hurwitz.
We now consider the dual notions of observability and detectability of the system described by equations (3.1) and (3.2).
De nition 3.4 The dynamical system described by the equations (3.1) and (3.2) or by the pair (C; A) is said to be observable if, for any t1 > 0, the initial state x(0) = x0 can be determined from the time history of the input u(t) and the output y(t) in the interval of [0; t1]. Otherwise, the system, or (C; A), is said to be unobservable.
Theorem 3.3 The following are equivalent: (i) (C; A) is observable. (ii) The matrix
Wo (t) := is positive de nite for any t > 0. (iii) The observability matrix
Zt 0
eA C CeA d
2 C 3 66 CA 77 O = 666 CA. 2 777 4 .. 5 CAn;1
T has full column rank or ni=1 Ker(CAi;1 ) = 0. (iv) The matrix
A ; I C
has full column rank for all in C .
3.2. Controllability and Observability
51
(v) Let and y be any eigenvalue and any corresponding right eigenvector of A, i.e., Ay = y, then Cy 6= 0. (vi) The eigenvalues of A + LC can be freely assigned (with the restriction that complex eigenvalues are in conjugate pairs) by a suitable choice of L. (vii) (A ; C ) is controllable.
Proof. First, we will show the equivalence between conditions (i) and (iii). Once this is done, the rest will follow by the duality or condition (vii).
(i) ( (iii): Note that given the input u(t) and the initial condition x0 , the output in the time interval [0; t1] is given by
y(t) = CeAt x(0) +
Zt 0
CeA(t; ) Bu( )d + Du(t):
Since y(t) and u(t) are known, there is no loss of generality in assuming u(t) = 0; 8t. Hence, y(t) = CeAt x(0); t 2 [0; t1 ]: From this equation, we have
3 2 C 3 CA 77 77 666 CA 75 = 66 . 2 777 x(0) 4 .. 5 y(n;1) (0)
2 y(0) 66 y_ (0) 64 ...
CAn;1
where y(i) stands for the i-th derivative of y. Since the observability matrix O has full column rank, there is a unique solution x(0) in the above equation. This completes the proof. (i) ) (iii): This will be proven by contradiction. Assume that (C; A) is observable but that the observability matrix does not have full column rank, i.e., there is a vector x0 such that Ox0 = 0 or equivalently CAi x0 = 0; 8i 0 by the Cayley-Hamilton Theorem. Now suppose the initial state x(0) = x0 , then y(t) = CeAt x(0) = 0. This implies that the system is not observable since x(0) cannot be determined from y(t) 0.
2
De nition 3.5 The system, or the pair (C; A), is detectable if A + LC is stable for some L.
LINEAR DYNAMICAL SYSTEMS
52
Theorem 3.4 The following are equivalent: (i) (C; A) is detectable. (ii) The matrix
A ; I C
has full column rank for all Re 0.
(iii) For all and x such that Ax = x and Re 0, Cx 6= 0. (iv) There exists a matrix L such that A + LC is Hurwitz. (v) (A ; C ) is stabilizable.
The conditions (iv) and (v) of Theorem 3.1 and Theorem 3.3 and the conditions (ii) and (iii) of Theorem 3.2 and Theorem 3.4 are often called Popov-Belevitch-Hautus (PBH) tests. In particular, the following de nitions of modal controllability and observability are often useful. De nition 3.6 Let be an eigenvalue of A or, equivalently, a mode of the system. Then the mode is said to be controllable (observable) if x B 6= 0 (Cx 6= 0) for all left (right) eigenvectors of A associated with , i.e., x A = x (Ax = x) and 0 6= x 2 C n . Otherwise, the mode is said to be uncontrollable (unobservable). It follows that a system is controllable (observable) if and only if every mode is controllable (observable). Similarly, a system is stabilizable (detectable) if and only if every unstable mode is controllable (observable). For example, consider the following 4th order system:
2 1 0 0 03 A B 66 01 1 1 0 1 77 6 7 C D = 64 00 00 01 02 1 75
0 with 1 6= 2 . Then, the mode 1 is not controllable if = 0, and 2 is not observable if = 0. Note that if 1 = 2 , the system is uncontrollable and unobservable for any and since in that case, both 1
203 6 7 x1 = 64 01 75 0
and
0
0
203 6 7 x2 = 64 00 75 1
are the left eigenvectors of A corresponding to 1 . Hence any linear combination of x1 and x2 is still an eigenvector of A corresponding to 1 . In particular, let x = x1 ; x2 , then x B = 0, and as a result, the system is not controllable. Similar arguments can be applied to check observability. However, if the B matrix is changed into a 4 2 matrix
3.3. Kalman Canonical Decomposition
53
with the last two rows independent of each other, then the system is controllable even if 1 = 2 . For example, the reader may easily verify that the system with 20 03 6 7 B = 64 1 01 75 1 0 is controllable for any . In general, for a system given in the Jordan canonical form, the controllability and observability can be concluded by inspection. The interested reader may easily derive some explicit conditions for the controllability and observability by using Jordan canonical form and the tests (iv) and (v) of Theorem 3.1 and Theorem 3.3.
3.3 Kalman Canonical Decomposition There are usually many dierent coordinate systems to describe a dynamical system. For example, consider a simple pendulum, the motion of the pendulum can be uniquely determined either in terms of the angle of the string attached to the pendulum or in terms of the vertical displacement of the pendulum. However, in most cases, the angular displacement is a more natural description than the vertical displacement in spite of the fact that they both describe the same dynamical system. This is true for most physical dynamical systems. On the other hand, although some coordinates may not be natural descriptions of a physical dynamical system, they may make the system analysis and synthesis much easier. In general, let T 2 Rnn be a nonsingular matrix and de ne x = Tx: Then the original dynamical system equations (3.1) and (3.2) become x_ = TAT ;1x + TBu y = CT ;1 x + Du: These equations represent the same dynamical system for any nonsingular matrix T , and hence, we can regard these representations as equivalent. It is easy to see that the input/output transfer matrix is not changed under the coordinate transformation, i.e., G(s) = C (sI ; A);1 B + D = CT ;1 (sI ; TAT ;1);1 TB + D: In this section, we will consider the system structure decomposition using coordinate transformation if the system is not completely controllable and/or is not completely observable. To begin with, let us consider further the dynamical systems related by a similarity transformation: A B " A B # TAT ;1 TB C D 7;! C D = CT ;1 D :
LINEAR DYNAMICAL SYSTEMS
54
The controllability and observability matrices are related by C = T C O = OT ;1: Moreover, the following theorem follows easily from the PBH tests or from the above relations. Theorem 3.5 The controllability (or stabilizability) and observability (or detectability) are invariant under similarity transformations. Using this fact, we can now show the following theorem. Theorem 3.6 If the controllability matrix C has rank k1 < n, then there exists a similarity transformation x = xxc = Tx such that
c
x_ c x_ c
=
y =
A A x B c 12 c c 0 Ac xc + 0 u C C xc + Du c
c
xc
with Ac 2 C k1 k1 and (Ac ; Bc) controllable. Moreover, G(s) = C (sI ; A);1 B + D = Cc (sI ; Ac );1 Bc + D:
Proof. Since rank C = k1 < n, the pair (A; B) is not controllable. Now let q1; q2; : : : ; qk1 be any linearly independent columns of C . Let qi ; i = k1 +1; : : : ; n be any n ; k1 linearly independent vectors such that the matrix
Q := q1 qk1 qk1 +1 qn is nonsingular. De ne
T := Q;1 :
Then the transformation x = Tx will give the desired decomposition. To see that, note that for each i = 1; 2; : : : ; k1 , Aqi can be written as a linear combination of qi ; i = 1; 2; : : : ; k1 since Aqi is a linear combination of the columns of C by the Cayley-Hamilton Theorem. Therefore, we have
AT ;1 = =
Aq Aq Aq 1 k k +1 Aqn A A q q q c 12 1 k k +1 qn 0 Ac A A
= T ;1
1
1
c
0
12
Ac
1
1
3.3. Kalman Canonical Decomposition
55
for some k1 k1 matrix Ac . Similarly, each column of the matrix B is a linear combination of qi ; i = 1; 2; : : :; k1 , hence B = Q B0c = T ;1 B0c for some Bc 2 C k1 m . To show that (Ac ; Bc) is controllable, note that rank C = k1 and B A B Ak1 ;1 B An;1 B c c c c c : ; 1 c c C=T 0 0 0 0 Since, for each j k1 , Ajc is a linear combination of Aic ; i = 0; 1; : : : ; (k1 ; 1) by CayleyHamilton theorem, we have rank Bc Ac Bc Akc 1 ;1 Bc = k1 ; i.e., (Ac ; Bc ) is controllable. 2 A numerically reliable way to nd a such transformation T is to use QR factorization. For example, if the controllability matrix C has the QR factorization QR = C , then T = Q;1 . Corollary 3.7 If the system is stabilizable and the controllability matrix C has rank k1 < n, then there exists a similarity transformation T such that 3 2 TAT ;1 TB 6 Ac A12 Bc 7 0 A 0 5 CT ;1 D = 4 c Cc Cc D
with Ac 2 C k1 k1 , (Ac ; Bc ) controllable and with Ac stable. Hence, the state space x is partitioned into two orthogonal subspaces x 0 c and 0 xc with the rst subspace controllable from the input and second completely uncontrollable from the input (i.e., the state xc are not aected by the control u). Write these subspaces in terms of the original coordinates x, we have x ; 1 x = T x = q1 qk1 qk1 +1 qn xc : c So the controllable subspace is the span of qi ; i = 1; : : : ; k1 or, equivalently, Im C . On the other hand, the uncontrollable subspace is given by the complement of the controllable subspace. By duality, we have the following decomposition if the system is not completely observable.
LINEAR DYNAMICAL SYSTEMS
56
Theorem 3.8 If the observability matrix O has rank k2 < n, then there exists a similarity transformation T such that
3 2 TAT ;1 TB 6 Ao 0 Bo 7 A A B CT ;1 D = 4 21 o o 5 Co
0
D
with Ao 2 C k2 k2 and (Co ; Ao ) observable.
Corollary 3.9 If the system is detectable and the observability matrix C has rank k2 < n, then there exists a similarity transformation T such that
2 3 TAT ;1 TB 6 Ao 0 Bo 7 A A B CT ;1 D = 4 21 o o 5 Co
0
D
with Ao 2 C k2 k2 , (Co ; Ao ) observable and with Ao stable.
Similarly, we have
G(s) = C (sI ; A);1 B + D = Co (sI ; Ao );1 Bo + D: Carefully combining the above two theorems, we get the following Kalman Canonical Decomposition. The proof is left to the reader as an exercise.
Theorem 3.10 Let an LTI dynamical system be described by the equations (3.1) and (3.2). Then there exists a nonsingular coordinate transformation x = Tx such that 2 x_ 3 2 A 0 A 0 3 2 x 3 2 B 3 co 66 x_ co 77 = 66 A21co Aco A1323 A24 77 66 xcoco 77 + 66 Bcoco 77 u 4 x_ co 5 4 0 0 Aco 0 5 4 xco 5 4 0 5 _xco 0 0 A43 Aco 0 2 x 3 xco co 6 7 x 6 y = Cco 0 Cco 0 4 xco 75 + Du co xco or equivalently
TAT ;1 CT ;1
2 Aco 0 6 A A TB = 66 021 0co 64 0 0 D Cco
0
A13 0 Bco A23 A24 Bco Aco 0 0 A43 Aco 0 Cco 0 D
3 77 77 5
3.3. Kalman Canonical Decomposition
57
where the vector xco is controllable and observable, xco is controllable but unobservable, xco is observable but uncontrollable, and xco is uncontrollable and unobservable. Moreover, the transfer matrix from u to y is given by G(s) = Cco (sI ; Aco );1 Bco + D:
One important issue is that although the transfer matrix of a dynamical system
A B C D
is equal to its controllable and observable part " Aco Bco Cco D
#
their internal behaviors are very dierent. In other words, while their input/output behaviors are the same, their state space response with nonzero initial conditions are very dierent. This can be illustrated by the state space response for the simple system 2 x_ 3 2 A 0 0 0 3 2 x 3 2 B 3 co 66 x_ co 77 = 66 0co Aco 0 0 77 66 xcoco 77 + 66 Bcoco 77 u 4 x_ co 5 4 0 0 Aco 0 5 4 xco 5 4 0 5 _xco 0 0 0 Aco 0 2 x 3 xco co 6 7 x 6 y = Cco 0 Cco 0 4 xco 75 co xco with xco controllable and observable, xco controllable but unobservable, xco observable but uncontrollable, and xco uncontrollable and unobservable. The solution to this system is given by
2 x (t) 3 66 xcoco(t) 77 4 x (t) 5 co
=
2 Acot R e xco (0) + R0t eAco (t; )Bco u( )d 66 eAcotxco(0) + t eAco(t; )Bcou( )d 0 64 eAco t xco (0)
xco(t) eAcot xco(0) y(t) = Cco xco (t) + Cco xco ;
3 77 75
note that xco (t) and xco(t) are not aected by the input u, while xco(t) and xco(t) do not show up in the output y. Moreover, if the initial condition is zero, i.e., x(0) = 0, then the output Zt y(t) = Cco eAco(t; ) Bcou( )d: 0
LINEAR DYNAMICAL SYSTEMS
58
However, if the initial state is not zero, then the response xco (t) will show up in the output. In particular, if Aco is not stable, then the output y(t) will grow without bound. The problems with uncontrollable and/or unobservable unstable modes are even more profound than what we have mentioned. Since the states are the internal signals of the dynamical system, any unbounded internal signal will eventually destroy the system. On the other hand, since it is impossible to make the initial states exactly zero, any uncontrollable and/or unobservable unstable mode will result in unacceptable system behavior. This issue will be exploited further in section 3.7. In the next section, we will consider how to place the system poles to achieve desired closed-loop behavior if the system is controllable.
3.4 Pole Placement and Canonical Forms Consider a MIMO dynamical system described by x_ = Ax + Bu y = Cx + Du; and let u be a state feedback control law given by u = Fx + v: This closed-loop system is as shown in Figure 3.1, and the closed-loop system equations are given by x_ = (A + BF )x + Bv y = (C + DF )x + Dv:
D
y ?e
C
R
x
-
A
-
F
6 e
B
u e v
6
Figure 3.1: State Feedback Then we have the following lemma in which the proof is simple and is left as an exercise to the reader.
3.4. Pole Placement and Canonical Forms
59
Lemma 3.11 Let F be a constant matrix with appropriate dimension; then (A; B) is
controllable (stabilizable) if and only if (A + BF; B ) is controllable (stabilizable). However, the observability of the system may change under state feedback. For example, the following system A B 21 1 13 4 5 C D = 11 00 00 is controllable and observable. But with the state feedback
u = Fx = ;1 ;1 x; the system becomes
A + BF B 2 0 4 C + DF D = 1
0 1 0 0 1 0 0
3 5
and is not completely observable. The dual operation of the dynamical system by
x_ = Ax + Bu 7;! x_ = Ax + Bu + Ly is called output injection which can be written as A B A + LC B + LD : C D 7;! C D By duality, the output injection does not change the system observability (detectability) but may change the system controllability (stabilizability).
Remark 3.1 We would like to call attention to the diagram and the signals ow con-
vention used in this book. It may not be conventional to let signals ow from the right to the left, however, the reader will nd that this representation is much more visually appealing than the traditional representation, and is consistent with the matrix manipulations. For example, the following diagram represents the multiplication of three matrices and will be very helpful in dealing with complicated systems:
z = M1 M2 M3 w:
z
M1
M2
M3
w
The conventional signal block diagrams, i.e., signals owing from left to right, will also be used in this book. ~
LINEAR DYNAMICAL SYSTEMS
60
We now consider some special state space representations of the dynamical system described by equations (3.1) and (3.2). First, we will consider the systems with single inputs. Assume that a single input and multiple output dynamical system is given by
A b G(s) = C d ; b 2 Rn ; C 2 Rpn ; d 2 Rp
and assume that (A; b) is controllable. Let det(I ; A) = n + a1 n;1 + + an ; and de ne
2 ;a ;a ;a ;a 3 213 1 2 n;1 n 66 1 0 0 66 0 77 0 77 6 7 1 0 0 7 b1 := 66 0 77 A1 := 66 0. 64 ... 75 . . .. 75 .. 4 .. .. . 0
0
and
1
0
0
C = b Ab An;1 b C1 = b1 A1 b1 An1 ;1 b1 : Then it is easy to verify that both C and C1 are nonsingular. Moreover, the transformation
Tc = C1 C ;1
will give the equivalent system representation
T AT ;1 T b A b 1 c c c = 1 ;1 ;1 CTc
where
d
CTc
d
CTc;1 = 1 2 n;1 n
for some i 2 Rp . This state space representation is usually called controllable canonical form or controller canonical form. It is also easy to show that the transfer matrix is given by n;1 2 sn;2 + + n;1 s + n G(s) = C (sI ; A);1 b + d = 1 ssn + + a1 sn;1 + + an;1 s + an + d; which also shows that, given a column vector of transfer matrix G(s), a state space representation of the transfer matrix can be obtained as above. The quadruple (A; b; C; d) is called a state space realization of the transfer matrix G(s).
3.4. Pole Placement and Canonical Forms
61
Now consider a dynamical system equation given by
x_ = A1 x + b1 u and a state feedback control law
u = Fx = f1 f2 : : : fn;1 fn x: Then the closed-loop system is given by
x_ = (A1 + b1 F )x and det(I ; (A1 + b1 F )) = n +(a1 ; f1)n;1 + +(an ; fn ). It is clear that the zeros of det(I ; (A1 + b1 F ) can be made arbitrary for an appropriate choice of F provided that the complex zeros appear in conjugate pairs, thus showing that the eigenvalues of A + bF can be freely assigned if (A; b) is controllable. Dually, consider a multiple input and single output system
G(s) = Ac Bd ; B 2 Rnm ; c 2 Rn ; d 2 Rm ; and assume that (c; A) is observable; then there is a transformation To such that
T AT ;1 o
o
cTo;1
2 ;a1 66 ;a2 ToB = 666 ... d 66 ;an;1 4 ;an 1
and
1 0 .. . 0 0 0
0 1 .. . 0 0 0
n;1
0 1 3 0 2 77 . . 7
.. .. 1 n;1 0 n 0 d
77 ; i 2 Rm 77 5
n;2
n G(s) = c(sI ; A);1 B + d = 1 ssn + a+ sn2;s 1 + + + a+ n;s 1+s + a + d: 1
n;1
n
This representation is called observable canonical form or observer canonical form. Similarly, we can show that the eigenvalues of A + Lc can be freely assigned if (c; A) is observable. The pole placement problem for a multiple input system (A; B ) can be converted into a simple single input pole placement problem. To describe the procedure, we need some preliminary results.
Lemma 3.12 If an m input system pair (A; B) is controllable and if A is cyclic, then for almost all v 2 Rm , the single input pair (A; Bv) is controllable.
LINEAR DYNAMICAL SYSTEMS
62
Proof. Without loss of generality, assume that A is in the Jordan canonical form and that the matrix B is partitioned accordingly:
2J 66 1 J2 A = 64
where Ji is in the form of
...
2 i 1 66 i 6 Ji = 66 64
Jk
3 2B 77 66 B12 75 B = 64 ... Bk
... ... ...
i 1 i
3 77 75
3 77 77 77 5
and i 6= j if i 6= j . By PBH test, the pair (A; B ) is controllable if and only if, for each i = 1; : : : ; k, the last row of Bi is not zero. Let bi 2 Rm be the last row of Bi , and then we only need to show that, for almost all v 2 Rm , bi v 6= 0 for each i = 1; : : : ; k which is clear since for each i, the set v 2 Rm such that bi v = 0 has measure zero in Rm since bi 6= 0. 2 The cyclicity assumption in this theorem is essential. Without this assumption, the theorem does not hold. For example, the pair 1 0 1 0 A= 0 1 ; B= 0 1 is controllable but there is no v 2 R2 such that (A; Bv) is controllable since A is not cyclic. Since a matrix A with distinct eigenvalues is cyclic, by de nition we have the following lemma. Lemma 3.13 If (A; B) is controllable, then for almost any K 2 Rmn , all the eigenvalues of A + BK are distinct and, consequently, A + BK is cyclic. A proof can be found in Brasch and Pearson [1970], Davison [1968], and Heymann [1968]. Now it is evident that given a multiple input controllable pair (A; B ), there is a matrix K 2 Rmn and a vector v 2 Rm such that A + BK is cyclic and (A + BK; Bv) is controllable. Moreover, from the pole placement results for the single input system, there is a matrix f 2 Rn so that the eigenvalues of (A + BK )+(Bv)f can be arbitrarily assigned. Hence, the eigenvalues of A + BF can be arbitrarily assigned by choosing a state feedback in the form of u = Fx = (K + vf )x:
3.5. Observers and Observer-Based Controllers
63
A dual procedure can be applied for the output injection A + LC . The canonical form for single input or single output system can also be generalized to multiple input and multiple output systems at the expense of notation. The interested reader may consult Kailath [1980] or Chen [1984]. If a system is not completely controllable, then the Kalman controllable decomposition can be applied rst and the above procedure can be used to assign the system poles corresponding to the controllable subspace.
3.5 Observers and Observer-Based Controllers We have shown in the last section that if a system is controllable and, furthermore, if the system states are available for feedback, then the system closed loop poles can be assigned arbitrarily through a constant feedback. However, in most practical applications, the system states are not completely accessible and all the designer knows are the output y and input u. Hence, the estimation of the system states from the given output information y and input u is often necessary to realize some speci c design objectives. In this section, we consider such an estimation problem and the application of this state estimation in feedback control. Consider a plant modeled by equations (3.1) and (3.2). An observer is a dynamical system with input of (u; y) and output of, say x^, which asymptotically estimates the state x. More precisely, a (linear) observer is a system such as
q_ = Mq + Nu + Hy x^ = Qq + Ru + Sy so that x^(t) ; x(t) ! 0 as t ! 1 for all initial states x(0), q(0) and for every input u(). Theorem 3.14 An observer exists i (C; A) is detectable. Further, if (C; A) is detectable, then a full order Luenberger observer is given by
q_ = Aq + Bu + L(Cq + Du ; y) x^ = q where L is any matrix such that A + LC is stable.
(3.5) (3.6)
Proof. We rst show that the detectability of (C; A) is sucient for the existence
of an observer. To that end, we only need to show that the so-called Luenberger observer de ned in the theorem is indeed an observer. Note that equation (3.5) for q is a simulation of the equation for x, with an additional forcing term L(Cq + Du ; y), which is a gain times the output error. Equivalent equations are
q_ = (A + LC )q + Bu + LDu ; Ly x^ = q:
64
LINEAR DYNAMICAL SYSTEMS
These equations have the form allowed in the de nition of an observer. De ne the error, e := x^ ; x, and then simple algebra gives
e_ = (A + LC )e; therefore e(t) ! 0 as t ! 1 for every x(0), q(0), and u(:). To show the converse, assume that (C; A) is not detectable. Take the initial state x(0) in the undetectable subspace and consider a candidate observer:
q_ = Mq + Nu + Hy x^ = Qq + Ru + Sy: Take q(0) = 0 and u(t) 0. Then the equations for x and the candidate observer are
x_ = Ax q_ = Mq + HCx x^ = Qq + SCx: Since an unobservable subspace is an A-invariant subspace containing x(0), it follows that x(t) is in the unobservable subspace for all t 0. Hence, Cx(t) = 0 for all t 0, and, consequently, q(t) 0 and x^(t) 0. However, for some x(0) in the undetectable subspace, x(t) does not converge to zero. Thus the candidate observer does not have the required property, and therefore, no observer exists. 2 The above Luenberger observer has dimension n, which is the dimension of the state x. It's possible to get an observer of lower dimension. The idea is this: since we can measure y ; Du = Cx, we already know x modulo Ker C , so we only need to generate the part of x in Ker C . If C has full row rank and p := dim y, then the dimension of Ker C equals n ; p, so we might suspect that we can get an observer of order n ; p.
This is true. Such an observer is called a \minimal order observer". We will not pursue this issue further here. The interested reader may consult Chen [1984]. Recall that, for a dynamical system described by the equations (3.1) and (3.2), if (A; B ) is controllable and state x is available for feedback, then there is a state feedback u = Fx such that the closed-loop poles of the system can be arbitrarily assigned. Similarly, if (C; A) is observable, then the system observer poles can be arbitrarily placed so that the state estimator x^ can be made to approach x arbitrarily fast. Now let us consider what will happen if the system states are not available for feedback so that the estimated state has to be used. Hence, the controller has the following dynamics: x^_ = (A + LC )^x + Bu + LDu ; Ly u = F x^:
3.6. Operations on Systems
65
Then the total system state equations are given by
x_ A =
BF ;LC A + BF + LC
x^_
Let e := x ; x^, then the system equation becomes
e_ A + LC = x^_
0 A + BF
;LC
x
x^ :
e
x^ ;
and the closed-loop poles consist of two parts: the poles resulting from state feedback (A + BF ) and the poles resulting from the state estimation (A + LC ). Now if (A; B ) is controllable and (C; A) is observable, then there exist F and L such that the eigenvalues of A + BF and A + LC can be arbitrarily assigned. In particular, they can be made to be stable. Note that a slightly weaker result can also result even if (A; B ) and (C; A) are only stabilizable and detectable. The controller given above is called an observer-based controller and is denoted as
u = K (s)y and
A + BF + LC + LDF ;L K (s) = : F
Now denote the open loop plant by
0
A B ; G= C D
then the closed-loop feedback system is as shown below:
y
G
u
K
In general, if a system is stabilizable through feeding back the output y, then it is said to be output feedback stabilizable. It is clear from the above construction that a system is output feedback stabilizable if (A; B ) is stabilizable and (C; A) is detectable. The converse is also true and will be shown in Chapter 12.
3.6 Operations on Systems In this section, we present some facts about system interconnection. Since these proofs are straightforward, we will leave the details to the reader.
LINEAR DYNAMICAL SYSTEMS
66
Suppose that G1 and G2 are two subsystems with state space representations:
B1 G1 = AC1 D 1 1
B2 : G2 = AC2 D 2 2
Then the series or cascade connection of these two subsystems is a system with the output of the second subsystem as the input of the rst subsystem as shown in the following diagram:
G1
G2
This operation in terms of the transfer matrices of the two subsystems is essentially the product of two transfer matrices. Hence, a representation for the cascaded system can be obtained as
G1 G2 = =
A B A B 2 1 2 1 C1 D1 C2 D2 2 A BC BD 3 2 A 0 1 1 2 2 1 2 4 0 A2 B2 5 = 4 B1 C2 A1 C1 D1 C2
B2 B1 D2 D1 D2
3 5:
D1 C2 C1 Similarly, the parallel connection or the addition of G1 and G2 can be obtained as 3 A B A B 2 A1 0 B1 B2 5 : G1 + G2 = C1 D1 + C2 D2 = 4 0 A2 1 1 2 2 C1 C2 D1 + D2 Next we consider a feedback connection of G1 and G2 as shown below: y r f G1 D1 D2
6;
- G2 Then the closed-loop transfer matrix from r to y is given by
2 A ; B D R;1C ;1 3 ;B1 R21;1 C2 B1 R21 1 1 2 12 1 ;1 C1 ;1 C2 B2 D1 R;1 5 B2 R12 A2 ; B2 D1 R21 T =4 ;1 ;1 ;21 1
R12 C1 ;R12 D1 C2 D1 R21 where R12 = I + D1 D2 and R21 = I + D2 D1 . Note that these state space representations may not be necessarily controllable and/or observable even if the original subsystems G1 and G2 are. For future reference, we shall also introduce the following de nitions.
3.6. Operations on Systems
67
De nition 3.7 The transpose of a transfer matrix G(s) or the dual system is de ned as G 7;! GT (s) = B (sI ; A );1 C + D
A B A C 7 ! B D : C D ;
or equivalently
De nition 3.8 The conjugate system of G(s) is de ned as G 7;! G (s) := GT (;s) = B (;sI ; A );1 C + D
A B ;A ;C 7 ! B D : C D ;
or equivalently
In particular, we have G (j!) := [G(j!)] = G (j!). De nition 3.9 A real rational matrix G^(s) is called a right (left) inverse of a transfer matrix G(s) if G(s)G^ (s) = I ( G^ (s)G(s) = I ). Moreover, if G^ (s) is both a right inverse and a left inverse of G(s), then it is simply called the inverse of G(s). Lemma 3.15 Let Dy denote a right (left) inverse of D if D has full row (column) rank. Then y C ;BDy Gy = A ;DBD yC Dy
is a right (left) inverse of G.
Proof. The right inverse case will be proven and the left inverse case follows by duality. Suppose DDy = I . Then
GGy = =
2 A BDy C 4 0 A ; BDy C yC 2 CA DD BDy C 4 0 A ; BDy C C C I I
3
BDy ;BDy 5 DDy 3 BDy ;BDy 5 : I
Performing similarity transformation T = 0 I on the above system yields 3 2A 0 0 GGy = 4 0 A ; BDy C ;BDy 5 C 0 I = I:
2
LINEAR DYNAMICAL SYSTEMS
68
3.7 State Space Realizations for Transfer Matrices In some cases, the natural or convenient description for a dynamical system is in terms of transfer matrices. This occurs, for example, in some highly complex systems for which the analytic dierential equations are too hard or too complex to write down. Hence, certain engineering approximation or identi cation has to be carried out; for example, input and output frequency responses are obtained from experiments so that some transfer matrix approximating the system dynamics is available. Since the state space computation is most convenient to implement on the computer, some appropriate state space representation for the resulting transfer matrix is necessary. In general, assume that G(s) is a real-rational transfer matrix which is proper. Then we call a state-space model (A; B; C; D) such that
B ; G(s) = CA D a realization of G(s). We note that if the transfer matrix is either single input or single output, then the formulas in Section 3.4 can be used to obtain a controllable or observable realization. The realization for a general MIMO transfer matrix is more complicated and is the focus of this section.
De nition 3.10 A state space realization (A; B; C; D) of G(s) is said to be a minimal realization of G(s) if A has the smallest possible dimension.
Theorem 3.16 A state space realization (A; B; C; D) of G(s) is minimal if and only if (A; B ) is controllable and (C; A) is observable.
Proof. We shall rst show that if (A; B; C; D) is a minimal realization of G(s), then
(A; B ) must be controllable and (C; A) must be observable. Suppose, on the contrary, that (A; B ) is not controllable and/or (C; A) is not observable. Then from Kalman decomposition, there is a smaller dimensioned controllable and observable state space realization that has the same transfer matrix; this contradicts the minimality assumption. Hence (A; B ) must be controllable and (C; A) must be observable. Next we show that if an n-th order realization (A; B; C; D) is controllable and observable, then it is minimal. But supposing it is not minimal, let (Am ; Bm ; Cm ; D) be a minimal realization of G(s) with order k < n. Since
G(s) = C (sI ; A);1 B + D = Cm (sI ; Am );1 Bm + D;
we have This implies that
CAi B = Cm Aim Bm ; 8i 0:
OC = Om Cm
(3:7)
3.7. State Space Realizations for Transfer Matrices
69
where C and O are the controllability and observability matrices of (A; B ) and (C; A), respectively, and
Cm := Om :=
B A B An;1B m m 2 mC m 3m 66 CmmAm 77 64 ... 75 : Cm Anm;1
By Sylvester's inequality, rank C + rank O ; n rank (OC ) minfrank C ; rank Og; and, therefore, we have rank (OC ) = n since rank C = rank O = n by the controllability and observability assumptions. Similarly, since (Am ; Bm ; Cm ; D) is minimal, (Am ; Bm ) is controllable and (Cm ; Am ) is observable. Moreover, rank Om Cm = k < n; which is a contradiction since rank OC = rank Om Cm by equality (3.7).
2
The following property of minimal realizations can also be veri ed, and this is left to the reader. Theorem 3.17 Let (A1; B1; C1 ; D) and (A2 ; B2; C2 ; D) be two minimal realizations of a real rational transfer matrix G(s), and let C1 , C2 , O1 , and O2 be the corresponding controllability and observability matrices, respectively. Then there exists a unique nonsingular T such that
A2 = TA1T ;1 ; B2 = TB1; C2 = C1 T ;1: Furthermore, T can be speci ed as T = (O2 O2 );1 O2 O1 or T ;1 = C1 C2 (C2 C2 );1 . We now describe several ways to obtain a state space realization for a given multiple input and multiple output transfer matrix G(s). The simplest and most straightforward way to obtain a realization is by realizing each element of the matrix G(s) and then combining all these individual realizations to form a realization for G(s). To illustrate, let us consider a 2 2 (block) transfer matrix such as
G (s) G (s) 2 G(s) = 1 G3 (s) G4 (s)
and assume that Gi (s) has a state space realization of
A B Gi (s) = Ci Di ; i = 1; : : : ; 4: i i
LINEAR DYNAMICAL SYSTEMS
70
Note that Gi (s) may itself be a multiple input and multiple output transfer matrix. In particular, if Gi (s) is a column or row vector of transfer functions, then the formulas in Section 3.4 can be used to obtain a controllable or observable realization for Gi (s). Then a realization for G(s) can be given by
2A 0 0 0 B 0 3 66 01 A2 0 0 01 B2 77 6 7 G(s) = 66 00 00 A03 A04 B03 B04 77 : 64 C C 0 0 D D 75 1 2 1 2 0
0 C3 C4 D3 D4
Alternatively, if the transfer matrix G(s) can be factored into the product and/or the sum of several simply realized transfer matrices, then a realization for G can be obtained by using the cascade or addition formulas in the last section. A problem inherited with these kinds of realization procedures is that a realization thus obtained will generally not be minimal. To obtain a minimal realization, a Kalman controllability and observability decomposition has to be performed to eliminate the uncontrollable and/or unobservable states. (An alternative numerically reliable method to eliminate uncontrollable and/or unobservable states is the balanced realization method which will be discussed later.) We will now describe one factorization procedure that does result in a minimal realization by using partial fractional expansion (The resulting realization is sometimes called Gilbert's realization due to Gilbert). Let G(s) be a p m transfer matrix and write it in the following form: G(s) = Nd((ss)) with d(s) a scalar polynomial. For simplicity, we shall assume that d(s) has only real and distinct roots i 6= j if i 6= j and
d(s) = (s ; 1 )(s ; 2 ) (s ; r ): Then G(s) has the following partial fractional expansion:
G(s) = D +
r W X i s ; i : i=1
Suppose
rank Wi = ki and let Bi 2 Rki m and Ci 2 Rpki be two constant matrices such that
Wi = Ci Bi :
3.8. Lyapunov Equations
71
Then a realization for G(s) is given by
2I 66 1 k G(s) = 64
1
C1
...
3 .. 77 . 7: Br 5
B1 r Ikr Cr D
It follows immediately from PBH tests that this realization is controllable and observable. Hence, it is minimal. An immediate consequence of this minimal realization is that a transfer matrix with an r-th order polynomial denominator does not necessarily have an r-th order state space realization unless Wi for each i is a rank one matrix. This approach can, in fact, be generalized to more complicated cases where d(s) may have complex and/or repeated roots. Readers may convince themselves by trying some simple examples.
3.8 Lyapunov Equations Testing stability, controllability, and observability of a system is very important in linear system analysis and synthesis. However, these tests often have to be done indirectly. In that respect, the Lyapunov theory is sometimes useful. Consider the following Lyapunov equation A X + XA + Q = 0 (3:8) with given real matrices A and Q. It has been shown in Chapter 2 that this equation has a unique solution i i (A) + j (A) 6= 0; 8i; j . In this section, we will study the relationships between the stability of A and the solution of X . The following results are standard. Lemma 3.18 Assume that A is stable, then the following statements hold: R (i) X = 01 eAt QeAtdt. (ii) X > 0 if Q > 0 and X 0 if Q 0. (iii) if Q 0, then (Q; A) is observable i X > 0. An immediate consequence of part (iii) is that, given a stable matrix A, a pair (C; A) is observable if and only if the solution to the following Lyapunov equation is positive de nite: A Lo + Lo A + C C = 0: The solution Lo is called the observability Gramian. Similarly, a pair (A; B ) is controllable if and only if the solution to ALc + LcA + BB = 0
LINEAR DYNAMICAL SYSTEMS
72
is positive de nite and Lc is called the controllability Gramian. In many applications, we are given the solution of the Lyapunov equation and need to conclude the stability of the matrix A. Lemma 3.19 Suppose X is the solution of the Lyapunov equation (3.8), then (i) Rei (A) 0 if X > 0 and Q 0. (ii) A is stable if X > 0 and Q > 0. (iii) A is stable if X 0, Q 0 and (Q; A) is detectable.
Proof. Let be an eigenvalue of A and v 6= 0 be a corresponding eigenvector, then Av = v. Pre-multiply equation (3.8) by v and postmultiply (3.8) by v to get 2Re (v Xv) + v Qv = 0: Now if X > 0 then v Xv > 0, and it is clear that Re 0 if Q 0 and Re < 0 if Q > 0. Hence (i) and (ii) hold. To see (iii), we assume Re 0. Then we must have v Qv = 0, i.e., Qv = 0. This implies that is an unstable and unobservable mode, which contradicts the assumption that (Q; A) is detectable. 2
3.9 Balanced Realizations Although there are in nitely many dierent state space realizations for a given transfer matrix, some particular realizations have proven to be very useful in control engineering and signal processing. Here we will only introduce one class of realizations for stable transfer matrices that are most useful in control applications. To motivate the class of realizations, we rst consider some simple facts.
A B be a state space realization of a (not necessarily stable) Lemma 3.20 Let C D
transfer matrix G(s). Suppose that there exists a symmetric matrix
P = P = with P1 nonsingular such that
P
0 0 0 1
AP + PA + BB = 0: Now partition the realization (A; B; C; D) compatibly with P as 2A A B 3 4 A1121 A2212 B12 5 : C1 C2 D
3.9. Balanced Realizations
73
A
Then
11 C1
B1 D
is also a realization of G. Moreover, (A11 ; B1 ) is controllable if A11 is stable.
Proof. Use the partitioned P and (A; B; C ) to get
1 B1 P1 A21 + B1 B2 ; 0 = AP + PA + BB = A11 PA1 +PP1+A11B +BB B2 B2 21 1 2 1 which gives B2 = 0 and A21 = 0 since P1 is nonsingular. Hence, part of the realization is not controllable:
2A A B 3 2A A B 3 4 A2111 A2212 B12 5 = 4 011 A1222 01 5 = AC11 BD1 : 1 C1
C2 D
C1
C2 D Finally, it follows from Lemma 3.18 that (A11 ; B1 ) is controllable if A11 is stable.
2
We also have
Lemma 3.21 Let CA DB be a state space realization of a (not necessarily stable) transfer matrix G(s). Suppose that there exists a symmetric matrix Q = Q = Q01 00 with Q1 nonsingular such that QA + A Q + C C = 0: Now partition the realization (A; B; C; D) compatibly with Q as
2A A B 3 4 A1121 A2212 B12 5 : C1
Then
A
C2 D
11 C1
B1 D
is also a realization of G. Moreover, (C1 ; A11 ) is observable if A11 is stable. The above two lemmas suggest that to obtain a minimal realization from a stable non-minimal realization, one only needs to eliminate all states corresponding to the zero block diagonal term of the controllability Gramian P and the observability Gramian Q. In the case where P is not block diagonal, the following procedure can be used to eliminate non-controllable subsystems:
LINEAR DYNAMICAL SYSTEMS
74
B be a stable realization. 1. Let G(s) = CA D 2. Compute the controllability Gramian P 0 from AP + PA + BB = 0:
1 3. Diagonalize P to get P = U1 U2 0 U U unitary. 1 2 U AU U B
4. Then G(s) =
1
CU1
1
1
0 0
U1 U2 with 1 > 0 and
is a controllable realization.
D
A dual procedure can also be applied to eliminate non-observable subsystems. Now assume that 1 > 0 is diagonal and 1 = diag(11 ; 12 ) such that max (12 ) min (11 ), then it is tempting to conclude that one can also discard those states corresponding to 12 without causing much error. However, this is not necessarily true as shown in the following example. Consider a stable transfer function G(s) = s2 3+s 3+s 18 + 18 : Then G(s) has a state space realization given by
2 ;1 ;4= 1 3 G(s) = 4 4 ;2 2 5 ;1 2=
0
where is any nonzero number. It is easy to check that the controllability Gramian of the realization is given by 0:5 P= 2 :
Since the last diagonal term of P can be made arbitrarily small by making small, the controllability of the corresponding state can be made arbitrarily weak. If the state corresponding to the last diagonal term of P is removed, we get a transfer function
;1 1 = ;1 G^ = ; 1 0 s+1 which is not close to the original transfer function in any sense. The problem may be easily detected if one checks the observability Gramian Q, which is
Q=
0:5
1=2 :
3.9. Balanced Realizations
75
Since 1=2 is very large if is small, this shows that the state corresponding to the last diagonal term is strongly observable. This example shows that controllability (or observability) Gramian alone can not give an accurate indication of the dominance of the system states in the input/output behavior. This motivates the introduction of a balanced realization which gives balanced Gramians for controllability A B and observability. Suppose G = C D is stable, i.e., A is stable. Let P and Q denote the controllability Gramian and observability Gramian, respectively. Then by Lemma 3.18, P and Q satisfy the following Lyapunov equations AP + PA + BB = 0 (3:9) A Q + QA + C C = 0; (3:10) and P 0, Q 0. Furthermore, the pair (A; B ) is controllable i P > 0, and (C; A) is observable i Q > 0. Suppose the state is transformed by a nonsingular T to x^ = Tx to yield the realization " ^ ^# ;1 TB A B TAT G = ^ ^ = CT ;1 D : C D Then the Gramians are transformed to P^ = TPT and Q^ = (T ;1 ) QT ;1. Note that P^ Q^ = TPQT ;1, and therefore the eigenvalues of the product of the Gramians are invariant under state transformation. Consider the similarity transformation T which gives the eigenvector decomposition PQ = T ;1 T; = diag(1 ; : : : ; n ): Then the columns of T ;1 are eigenvectors of PQ corresponding to the eigenvalues fi g. Later, it will be shown that PQ has a real diagonal Jordan form and that 0, which are consequences of P 0 and Q 0. Although the eigenvectors are not unique, in the case of a minimal realization they can always be chosen such that P^ = TPT = ; Q^ = (T ;1) QT ;1 = ; where = diag(1 ; 2 ; : : : ; n ) and 2 = . This new realization with controllability and observability Gramians P^ = Q^ = will be referred to as a balanced realization (also called internally balanced realization). The decreasingly order numbers, 1 2 : : : n 0, are called the Hankel singular values of the system. More generally, if a realization of a stable system is not minimal, then there is a transformation such that the controllability and observability Gramians for the transformed realization are diagonal and the controllable and observable subsystem is balanced. This is a consequence of the following matrix fact.
LINEAR DYNAMICAL SYSTEMS
76
Theorem 3.22 Let P and Q be two positive semide nite matrices. Then there exists a nonsingular matrix T such that 2 1 6 2 TPT = 64 0
3 2 77 ; (T ;1) QT ;1 = 66 1 5 4
0 respectively, with 1 ; 2 ; 3 diagonal and positive de nite.
0
3
0
3 77 ; 5
Proof. Since P is a positive semide nite matrix, there exists a transformation T1 such
that
Now let
T1PT1 = I0 00 : (T );1 QT ;1 = 1
1
Q
11 Q12
Q12 ; Q22
and there exists a unitary matrix U1 such that 2 U1 Q11 U1 = 01 00 ; 1 > 0: Let U 0 ; 1 (T2 ) = 01 I ; and then
2 (T2);1 (T1);1 QT1;1(T2 );1 = 4
But Q 0 implies Q^ 122 = 0. So now let
2 (T3);1 = 4
21 0 0 0 Q^ 121 Q^ 122
3
Q^ 121 Q^ 122 5 : Q22
3
I
0 ^ ;Q121 ;1 2
0 0 I 0 5; 0 I
giving
2 2 1 (T3);1 (T2);1 (T1);1 QT1;1(T2 );1 (T3 );1 = 4 0
0 0 0 0 0 0 Q22 ; Q^ 121 ;1 2 Q^ 121
Next nd a unitary matrix U2 such that
U2 (Q22 ; Q^ 121 ;1 2 Q^ 121 )U2 = 03 00 ; 3 > 0:
3 5:
3.9. Balanced Realizations
77
2 ;1=2 1 0 (T4 );1 = 4 0 I
De ne
Then
0 U2
0
and let
0 0
3 5
T = T4 T3 T2 T1:
2 1 6 TPT = 64
2
0
0
3 2 77 ; (T );1QT ;1 = 66 1 5 4
0
3
0
3 77 5 2
with 2 = I .
Corollary 3.23 The product of two positive semi-de nite matrices is similar to a positive semi-de nite matrix.
Proof. Let P and Q be any positive semi-de nite matrices. Then it is easy to see that with the transformation given above
TPQT ;1 =
2
0 0 0 : 1
2
A B ,
Corollary 3.24 For any stable system G = C D
T such that G = Gramian Q given by
TAT ;1 TB CT ;1 D
2 1 6 P = 64
2
0
there exists a nonsingular
has controllability Gramian P and observability
0
3 2 77 ; Q = 66 1 5 4
0
respectively, with 1 ; 2 ; 3 diagonal and positive de nite.
3
0
3 77 ; 5
A B is a minimal realization, a balanced realization In the special case where C D
can be obtained through the following simpli ed procedure:
LINEAR DYNAMICAL SYSTEMS
78
1. Compute the controllability and observability Gramians P > 0; Q > 0. 2. Find a matrix R such that P = R R. 3. Diagonalize RQR to get RQR = U 2 U .
;1
TB 4. Let T ;1 = RU ;1=2 . Then TPT = (T );1 QT ;1 = and TAT CT ;1 D is balanced. Assume that the Hankel singular values of the system is decreasingly ordered so that = diag(1 ; 2 ; : : : ; n ) and 1 2 : : : n and suppose r r+1 for some r then the balanced realization implies that those states corresponding to the singular values of r+1 ; : : : ; n are less controllable and observable than those states corresponding to 1 ; : : : ; r . Therefore, truncating those less controllable and observable states will not lose much information about the system. These statements will be made more concrete in Chapter 7 where error bounds will be derived for the truncation error. Two other closely related realizations are called input normal realization with P = I and Q = 2 , and output normal realization with P = 2 and Q = I . Both realizations can be obtained easily from the balanced realization by a suitable scaling on the states.
3.10 Hidden Modes and Pole-Zero Cancelation Another important issue associated with the realization theory is the problem of uncontrollable and/or unobservable unstable modes in the dynamical system. This problem is illustrated in the following example: Consider a series connection of two subsystems as shown in the following diagram
y
s;1 1
s;1 u s+1
The transfer function for this system,
1 1 1 g(s) = ss ; + 1 s ; 1 = s + 1;
is stable and has a rst order minimal realization. On the other hand, let x1 = y x2 = u ; : Then a state space description for this dynamical system is given by x_ 1 ;1 x 1 1 1 x_ 2 = 0 ;1 x2 + 2 u
y =
1
x 1 0 x2
3.10. Hidden Modes and Pole-Zero Cancelation
79
and is a second order system. Moreover, it is easy to show that the unstable mode 1 is uncontrollable but observable. Hence, the output can be unbounded if the initial state x1 (0) is not zero. We should also note that the above problem does not go away by changing the interconnection order:
y
s;1 s+1
s;1 1
u
In the later case, the unstable mode 1 becomes controllable but unobservable. The unstable mode can still result in the internal signal unbounded if the initial state (0) is not zero. Of course, there are fundamental dierences between these two types of interconnections as far as control design is concerned. For instance, if the state is available for feedback control, then the latter interconnection can be stabilized while the former cannot be. This example shows that we must be very careful in canceling unstable modes in the procedure of forming a transfer function in control designs; otherwise the results obtained may be misleading and those unstable modes become hidden modes waiting to blow. One observation from this example is that the problem is really caused by the unstable zero of the subsystem ss;+11 . Although the zeros of an SISO transfer function are easy to see, it is not quite so for an MIMO transfer matrix. In fact, the notion of \system zero" cannot be generalized naturally from the scalar transfer function zeros. For example, consider the following transfer matrix 2 1 1 3 6 s + 1 s + 2 77 G(s) = 64 1 5 2 s+2 s+1 which is stable and each element of G(s) has no nite zeros. Let 2 s+2 s +p1 3 p ; K =4 s; 2 s; 2 5 0 1 which is unstable. However, 3 2 p s + 2 6 ; (s + 1)(s + 2) 0 77 KG = 664 7 2 1 5 s+2 s+1 p is stable. This implies that G(s) must have an unstable zero at 2 that cancels the unstable pole of K . This leads us to the next topic: multivariable system poles and zeros.
80
LINEAR DYNAMICAL SYSTEMS
3.11 Multivariable System Poles and Zeros
Let R[s] denote the polynomial ring with real coecients. A matrix is called a polynomial matrix if every element of the matrix is in R[s]. A square polynomial matrix is called a unimodular matrix if its determinant is a nonzero constant (not a polynomial of s). It is a fact that a square polynomial matrix is unimodular if and only if it is invertible in R[s], i.e., its inverse is also a polynomial matrix. De nition 3.11 Let Q(s) 2 R[s] be a (p m) polynomial matrix. Then the normal rank of Q(s), denoted normalrank (Q(s)), is the rank in R[s] or, equivalently, is the maximum dimension of a square submatrix of Q(s) with nonzero determinant in R[s]. In short, sometimes we say that a polynomial matrix Q(s) has rank(Q(s)) in R[s] when we refer to the normal rank of Q(s). To show the dierence between the normal rank of a polynomial matrix and the rank of the polynomial matrix evaluated at certain point, consider Q(s) = ss2 11 : Then Q(s) has normal rank 2 since det Q(s) = s ; s2 6 0. However, Q(0) has rank 1. It is a fact in linear algebra that any polynomial matrix can be reduced to a socalled Smith form through some pre- and post- unimodular operations. [cf. Kailath, 1984, pp.391]. Lemma 3.25 (Smith form) Let P (s) 2 R[s] be any polynomial matrix, then there exist unimodular matrices U (s); V (s) 2 R[s] such that 2 (s) 0 0 0 3 66 10 2 (s) 0 0 77 .. . . . .. 77 U (s)P (s)V (s) = S (s) := 666 ... . .. . . 7 4 0 0 r (s) 0 5 0 0 0 0 and i (s) divides i+1 (s). S (s) is called the Smith form of P (s). It is also clear that r is the normal rank of P (s). We shall illustrate the procedure of obtaining a Smith form by an example. Let 2 s + 1 (s + 1)(2s + 1) s(s + 1) 3 P (s) = 4 s + 2 (s + 2)(s2 + 5s + 3) s(s + 2) 5 : 1 2s + 1 s The polynomial matrix P (s) has normal rank 2 since s + 1 (s + 1)(2s + 1) det(P (s)) 0; det s + 2 (s + 2)(s2 + 5s + 3) = (s + 1)2 (s + 2)2 6 0:
3.11. Multivariable System Poles and Zeros
81
First interchange the rst row and the third row and use row elementary operation to zero out the s+1 and s+2 elements of P (s). This process can be done by pre-multiplying a unimodular matrix U to P (s): 20 0 1 3 U = 4 0 1 ;(s + 2) 5 : 1 0 ;(s + 1) Then 21 3 2s + 1 s P1 (s) := U (s)P (s) = 4 0 (s + 1)(s + 2)2 0 5 : 0 0 0 Next use column operation to zero out the 2s + 1 and s terms in P1 . This process can be done by post-multiplying a unimodular matrix V to P1 (s): 2 1 ;(2s + 1) ;s 3 1 0 5 V (s) = 4 0 0 0 1 and 21 3 0 0 P1 (s)V (s) = 4 0 (s + 1)(s + 2)2 0 5 : 0 0 0 Then we have 21 3 0 0 S (s) = U (s)P (s)V (s) = 4 0 (s + 1)(s + 2)2 0 5 : 0 0 0 Similarly, let Rp (s) denote the set of rational proper transfer matrices.1 Then any real rational transfer matrix can be reduced to a so-called McMillan form through some pre- and post- unimodular operations. Lemma 3.26 (McMillan form) Let G(s) 2 Rp(s) be any proper real rational transfer matrix, then there exist unimodular matrices U (s); V (s) 2 R[s] such that 2 1 (s) 0 0 0 3 66 10(s) 2((ss)) 0 0 77 2 6 .. . . .. .. 777 U (s)G(s)V (s) = M (s) := 66 ... . . . . 7 64 r 0 0 r ((ss)) 0 5 0 0 0 0 and i (s) divides i+1 (s) and i+1 (s) divides i (s). 1 It is obvious that a similar notion of normal rank can be extended to a matrix in R ( ). In particular, let ( ) 2 R ( ) be a rational matrix and write ( ) = ( ) ( ) such that ( ) is a p s
G s
p s
G s
N s =d s
d s
polynomial and ( ) is a polynomial matrix, then ( ) is said to have normal rank if ( ) has normal rank . N s
r
G s
r
N s
LINEAR DYNAMICAL SYSTEMS
82
Proof. If we write the transfer matrix G(s) as G(s) = N (s)=d(s) such that d(s) is a scalar polynomial and N (s) is a p m polynomial matrix and if let the Smith form of N (s) be S (s) = U (s)N (s)V (s), the conclusion follows by letting M (s) = S (s)=d(s). 2
De nition 3.12 The number Pi deg( i (s)) is called the McMillan degree of G(s)
where deg( i (s)) denotes the degree of the polynomial i (s), i.e., the highest power of s in i (s). The McMillan degree of a transfer matrix is closely related to the dimension of a minimal realization of G(s). In fact, it can be shown that the dimension of a minimal realization of G(s) is exactly the McMillan degree of G(s).
De nition 3.13 The roots of all the polynomials i(s) in the McMillan form for G(s) are called the poles of G.
Let (A; B; C; D) be a minimal realization of G(s). Then it is fairly easy to show that a complex number is a pole of G(s) if and only if it is an eigenvalue of A.
De nition 3.14 The roots of all the polynomials i(s) in the McMillan form for G(s) are called the transmission zeros of G(s). A complex number z0 2 C is called a blocking zero of G(s) if G(z0 ) = 0.
It is clear that a blocking zero is a transmission zero. Moreover, for a scalar transfer function, the blocking zeros and the transmission zeros are the same. We now illustrate the above concepts through an example. Consider a 3 3 transfer matrix: 3 2 2s + 1 s 1 66 (s + 1)(s + 2) (s + 1)(s + 2) (s + 1)(s + 2) 77 77 66 1 s2 + 5s + 3 s 77 : 6 G(s) = 6 (s + 1)2 (s + 1)2 (s + 1)2 77 66 5 4 1 2s + 1 s (s + 1)2 (s + 2) (s + 1)2 (s + 2) (s + 1)2 (s + 2) Then G(s) can be written as
2
s + 1 (s + 1)(2s + 1) s(s + 1) G(s) = (s + 1)12 (s + 2) 4 s + 2 (s + 2)(s2 + 5s + 3) s(s + 2) 1 2s + 1 s
3 5 := N (s) : d(s)
3.11. Multivariable System Poles and Zeros
83
Since N (s) is exactly the same as the P (s) in the previous example, it is clear that the G(s) has the McMillan form 3 2 1 0 0 77 66 (s + 1)2(s + 2) 7 66 s + 2 0 77 M (s) = U (s)G(s)V (s) = 66 0 s + 1 77 6
4
0
0
0
5
and G(s) has McMillan degree of 4. The poles of the transfer matrix are f;1; ;1; ;1; ;2g and the transmission zero is f;2g. Note that the transfer matrix has pole and zero at the same location f;2g; this is the unique feature of multivariable systems. To get a minimal state space realization for G(s), note that G(s) has the following partial fractional expansion: 213 203 20 0 03 1 1 G(s) = 4 0 1 0 5 + s + 1 4 0 5 1 ;1 ;1 + s + 1 4 1 5 0 3 1 0 0 0 0 0
2 3 203 1 5 ;1 3 2 + 4 5 1 ;1 ;1 (s + 1)2 11 2 ;1 3 1 + s + 2 4 0 5 1 ;3 ;2 0 + s +1 1 4 0 1
1 Since there are repeated poles at ;1, the Gilbert's realization procedure described in the last section cannot be used directly. Nevertheless, a careful inspection of the fractional expansion results in a 4-th order minimal state space realization: 2 ;1 0 1 0 0 3 1 3 66 0 ;1 1 0 ;1 3 2 77 66 0 0 ;1 0 1 ;1 ;1 77 G(s) = 66 0 0 0 ;2 1 ;3 ;2 77 : 66 0 0 1 ;1 0 0 0 77 4 1 0 0 0 0 1 0 5 0 1 0 1 0 0 0 We remind readers that there are many dierent de nitions of system zeros. The de nitions introduced here are the most common ones and are useful in this book.
Lemma 3.27 Let G(s) be a p m proper transfer matrix with full column normal rank. Then z0 2 C is a transmission zero of G(s) if and only if there exists a 0 = 6 u0 2 C m such that G(z0 )u0 = 0.
LINEAR DYNAMICAL SYSTEMS
84
Proof. We shall outline a proof of this lemma. We shall rst show that there is a vector u0 2 C m such that G(z0 )u0 = 0 if z0 2 C is a transmission zero. Without loss of generality, assume
2 66 6 G(s) = U1 (s) 66 64
1 (s) 1 (s)
0 .. . 0 0
0
2 (s) 2 (s)
.. . 0 0
...
0 0 .. .
m (s) m (s)
0
3 77 77 V (s) 77 1 5
for some unimodular matrices U1 (s) and V1 (s) and suppose z0 is a zero of 1 (s), i.e.,
1 (z0 ) = 0. Let
u0 = V1;1 (z0 )e1 6= 0
where e1 = [1; 0; 0; : : :] 2 Rm . Then it is easy to verify that G(z0 )u0 = 0. On the other hand, suppose there is a u0 2 C m such that G(z0 )u0 = 0. Then
2 66 6 U1 (z0 ) 66 64
De ne
Then
1 (z0 ) 1 (z0 )
0 .. . 0 0
0
2 (z0 ) 2 (z0 )
.. . 0 0
0 0 .. .
...
m (z0 ) m (z0 )
0
3 77 77 V (z )u = 0: 77 1 0 0 5
2u 3 66 u12 77 64 ... 75 = V1 (z0)u0 6= 0: um
2 (z )u 66 12(z00)u12 64 ...
m (z0 )um
3 77 75 = 0:
This implies that z0 must be a root of one of polynomials i (s); i = 1; : : : ; m.
2
Note that the lemma may not be true if G(s) does not have full column normal rank. This can be seen from the following example. Consider
G(s) = s +1 1 11 11 ; u0 = ;11 :
3.11. Multivariable System Poles and Zeros
85
It is easy to see that G has no transmission zero but G(s)u0 = 0 for all s. It should also be noted that the above lemma applies even if z0 is a pole of G(s) although G(z0 ) is not de ned. The reason is that G(z0 )u0 may be well de ned. For example,
s;1 0 1 G(s) = s+1 0 ss;+21 ; u0 = 0 :
Then G(1)u0 = 0. Therefore, 1 is a transmission zero. Similarly we have the following lemma: Lemma 3.28 Let G(s) be a p m proper transfer matrix with full row normal rank. Then z0 2 C is a transmission zero of G(s) if and only if there exists a 0 6= 0 2 C p such that 0 G(z0 ) = 0. In the case where the transmission zero is not a pole of G(s), we can give a useful alternative characterization of the transfer matrix transmission zeros. Furthermore, G(s) is not required to be full column (or row) rank in this case. The following lemma is easy to show from the de nition of zeros.
Lemma 3.29 Suppose z0 2 C is not a pole of G(s). Then z0 is a transmission zero if and only if rank(G(z0 )) < normalrank(G(s)).
Corollary 3.30 Let G(s) be a square m m proper transfer matrix and det G(s) 6 0. Suppose zo 2 C is not a pole of G(s). Then z0 2 C is a transmission zero of G(s) if and only if det G(z0 ) = 0.
Using thepabove corollary, we can con rm that the example in the last section does have a zero at 2 since 2 1 1 3 6 s + 1 s + 2 77 = 2 ; s2 : det 64 2 1 5 (s + 1)2 (s + 2)2 s+2 s+1 Note that the above corollary may not be true if z0 is a pole of G. For example,
s;1
0 G(s) = s+1 s +2 0 s;1
has a zero at 1 which is not a zero of det G(s). The poles and zeros of a transfer matrix can also be characterized in terms of its state space realizations. Let be a state space realization of G(s).
A B C D
LINEAR DYNAMICAL SYSTEMS
86
De nition 3.15 The eigenvalues of A are called the poles of the realization of G(s). To de ne zeros, let us consider the following system matrix
B : Q(s) = A ;C sI D De nition 3.16 A complex number z0 2 C is called an invariant zero of the system
realization if it satis es
A;z I B A ; sI B 0 rank C D < normalrank C D :
The invariant zeros are not changed by constant state feedback since A + BF ; z I B A ; z I B I 0 A;z I B 0 0 0 rank C + DF D = rank C D F I = rank C D : It is also clear that invariant zeros are not changed under similarity transformation. The following lemma is obvious.
A ; sI B Lemma 3.31 Suppose has full column normal rank.
Then z0 2 C is D an invariant zero of a realization (A; B; C; D) if and only if there exist 0 6= x 2 C n and u 2 C m such that A ; z I B x 0 C D u = 0: Moreover, if u = 0, then z0 is also a non-observable mode.
C
x
Proof. By de nition, z0 is an invariant zero if there is a vector u 6= 0 such that A ; z I B x 0 =0 C
D
u
since A ; sI B has full column normal rank. C
D
x
On the other hand, suppose z0 is an invariant zero, then there is a vector u 6= 0 such that A ; z I B x 0 C D u = 0: We claim that x 6= 0. Otherwise,
x
B
A ; sI B has full D u = 0 or u = 0 since C D
column normal rank, i.e., u = 0 which is a contradiction.
3.11. Multivariable System Poles and Zeros
87
Finally, note that if u = 0, then
A;z I C
0
x=0
2
and z0 is a non-observable mode by PBH test.
A ; sI B Lemma 3.32 Suppose has full row normal rank.
Then z0 2 C is an D invariant zero of a realization (A; B; C; D) if and only if there exist 0 6= y 2 C n and v 2 C p such that y v A ; z0I B = 0: C D Moreover, if v = 0, then z0 is also a non-controllable mode. A ; sI B Lemma 3.33 G(s) has full column (row) normal rank if and only if C D
C
has full column (row) normal rank.
Proof. This follows by noting that A ; sI B = C
and
D
I
0
C (A ; sI );1 I
A ; sI B 0
G(s)
A ; sI B normalrank C D = n + normalrank(G(s)):
2
Theorem 3.34 Let G(s) be a real rational proper transfer matrix and let (A; B; C; D)
be a corresponding minimal realization. Then a complex number z0 is a transmission zero of G(s) if and only if it is an invariant zero of the minimal realization.
Proof. We will give a proof only for the case that the transmission zero is not a pole of G(s). Then, of course, z0 is not an eigenvalue of A since the realization is minimal. Note that A ; sI B A ; sI B I 0 C D = C (A ; sI );1 I 0 G(s) : Since we have assumed that z0 is not a pole of G(s), we have
A;z I B 0 rank C D = n + rank G(z0 ):
LINEAR DYNAMICAL SYSTEMS
88 Hence
A;z I B A ; sI B 0 rank C D < normalrank C D
if and only if rank G(z0 ) < normalrank G(s). Then the conclusion follows from Lemma 3.29. 2 Note that the minimality assumption is essential for the converse statement. For example, A 0 consider a transfer matrix G(s) = D (constant) and a realization of G(s) = where A is any square matrix with any dimension and C is any matrix with
C D
compatible dimension. Then G(s) has no poles or zeros but every eigenvalue of A is an A 0 . invariant zero of the realization C D
Nevertheless, we have the following corollary if a realization of the transfer matrix is not minimal. Corollary 3.35 Every transmission zero of a transfer matrix G(s) is an invariant zero of all its realizations, and every pole of a transfer matrix G(s) is a pole of all its realizations.
Lemma 3.36 Let G(s) 2 Rp(s) be a p m transfer matrix and let (A; B; C; D) be a minimal realization. If the system input is of the form u(t) = u0 et , where 2 C is not a pole of G(s) and u0 2 C m is an arbitrary constant vector, then the output due to the input u(t) and the initial state x(0) = (I ; A);1 Bu0 is y(t) = G()u0 et ; 8t 0. Proof. The system response with respect to the input u(t) = u0et and the initial condition x(0) = (I ; A);1 Bu0 is (in terms of Laplace transform): Y (s) = C (sI ; A);1 x(0) + C (sI ; A);1 BU (s) + DU (s) = C (sI ; A);1 x(0) + C (sI ; A);1 Bu0 (s ; );1 + Du0 (s ; );1 = C (sI ; A);1 (x(0) ; (I ; A);1 Bu0 ) + G()u0 (s ; );1 = G()u0 (s ; );1 : Hence y(t) = G()u0 et .
2
Combining the above two lemmas, we have the following results that give a dynamical interpretation of a system's transmission zero.
Corollary 3.37 Let G(s) 2 Rp(s) be a p m transfer matrix and let (A; B; C; D) be a minimal realization. Suppose that z0 2 C is a transmission zero of G(s) and is not a pole of G(s). Then for any nonzero vector u0 2 C m the output of the system due to the initial state x(0) = (z0 I ; A);1 Bu0 and the input u = u0 ez0 t is identically zero: y(t) = G(z0 )u0 ez0 t = 0.
3.12. Notes and References
89
The following lemma characterizes the relationship between zeros of a transfer function and poles of its inverse.
Lemma 3.38 Suppose that G = CA DB is a square transfer matrix with D nonsingular, and suppose z0 is not an eigenvalue of A (note that the realization is not necessarily minimal). Then there exists x0 such that
(A ; BD;1 C )x0 = z0 x0 ; Cx0 6= 0 i there exists u0 6= 0 such that
G(z0 )u0 = 0:
Proof. (() G(z0)u0 = 0 implies that ;1 ;1 G;1 (s) = A ; BD C ;BD D;1 C
D;1
has a pole at z0 which is observable. Then, by de nition, there exists x0 such that (A ; BD;1 C )x0 = z0 x0 and
Cx0 6= 0:
()) Set u0 = ;D;1 Cx0 6= 0. Then
(z0 I ; A)x0 = ;BD;1Cx0 = Bu0 : Using this equality, one gets
G(z0 )u0 = C (z0 I ; A);1 Bu0 + Du0 = Cx0 ; Cx0 = 0:
2 The above lemma implies that z0 is a zero of an invertible G(s) if and only if it is a pole of G;1 (s).
3.12 Notes and References Readers are referred to Brogan [1991], Chen [1984], Kailath [1980], and Wonham [1985] for the extensive treatment of the standard linear system theory. The balanced realization was rst introduced by Mullis and Roberts [1976] to study the roundo noise in digital lters. Moore [1981] proposed the balanced truncation method for model reduction which will be considered in Chapter 7.
90
LINEAR DYNAMICAL SYSTEMS
4
Performance Speci cations The most important objective of a control system is to achieve certain performance speci cations in addition to providing the internal stability. One way to describe the performance speci cations of a control system is in terms of the size of certain signals of interest. For example, the performance of a tracking system could be measured by the size of the tracking error signal. In this chapter, we look at several ways of de ning a signal's size, i.e., at several norms for signals. Of course, which norm is most appropriate depends on the situation at hand. For that purpose, we shall rst introduce some normed spaces and some basic notions of linear operator theory, in particular, the Hardy spaces H2 and H1 are introduced. We then consider the performance of a system under various input signals and derive the worst possible outputs with the class of input signals under consideration. We show that H2 and H1 norms come out naturally as measures of the worst possible performance for many classes of input signals. Some state space methods of computing real rational H2 and H1 transfer matrix norms are also presented.
4.1 Normed Spaces Let V be a vector space over C (or R) and let kk be a norm de ned on V . Then V is a normed space. For example, the vector space C n with any vector p-norm, kkp , for 1 p 1, is a normed space. As another example, consider the linear vector space C [a; b] of all bounded continuous functions on the real interval [a; b]. Then C [a; b] 91
PERFORMANCE SPECIFICATIONS
92
becomes a normed space if a supremum norm is de ned on the space: kf k1 := sup jf (t)j: t2[a;b]
A sequence fxn g in a normed space V is called a Cauchy sequence if kxn ; xm k ! 0 as n; m ! 1. A sequence fxn g is said to converge to x 2 V , written xn ! x, if kxn ; xk ! 0. A normed space V is said to be complete if every Cauchy sequence in V converges in V . A complete normed space is called a Banach space. For example, Rn and C n with the usual spatial p-norm, kkp for 1 p 1, are Banach spaces. (One should not be confused with the notation kkp used here and the same notation used below for function spaces because usually the context will make the meaning clear.) The following are some more examples of Banach spaces: lp [0; 1) spaces for 1 p < 1: For each 1 p < 1, lp [0; 1) consists of all sequences x = (x0 ; x1 ; : : :) such that 1 X jxi jp < 1. The associated norm is de ned as i=0
1 X
kxkp :=
i=0
jxi jp
!1=p
:
l1 [0; 1) space: l1 [0; 1) consists of all bounded sequences x = (x0 ; x1 ; : : :), and the l1 norm is de ned as
kxk1 := sup jxi j: i
Lp (I ) spaces for 1 p 1: For each 1 p < 1, Lp (I ) consists of all Lebesgue measurable functions x(t) de ned on an interval I R such that kxkp := and
Z
I
1=p
jx(t)jp dt
< 1; for 1 p < 1
kx(t)k1 := ess sup jx(t)j: t2I Some of these spaces, for example, L2 (;1; 0], L2 [0; 1) and L2 (;1; 1), will be
discussed in more detail later on. C [a; b] space: C [a; b] consists of all continuous functions on the real interval [a; b] with the norm de ned as kxk1 := sup jx(t)j: t2[a;b]
4.2. Hilbert Spaces
93
Note that if each component or function is itself a vector or matrix, then the corresponding Banach space can also be formed by replacing the absolute value j j of each component or function with its spatially normed component or function. For example, consider a vector space with all sequences in the form of
x = (x0 ; x1 ; : : :) where each component xi is a k m matrix and each element of xi is bounded. Then xi is bounded in any matrix norm, and the vector space becomes a Banach space if the following norm is de ned kxk1 := sup i (xi ) i
where i (xi ) := kxi k is any matrix norm. This space will also be denoted by l1 . Let V1 and V2 be two vector spaces and let T be an operator from S V1 into V2 . An operator T is said to be linear if for any x1 ; x2 2 S and scalars ; 2 C , the following holds: T (x1 + x2 ) = (Tx1 ) + (Tx2 ): Moreover, let V0 be a linear subspace in V1 . Then the operator T0 : V0 7;! V2 de ned by T0 x = Tx for every x 2 V0 is called the restriction of T to V0 and is denoted as T jV0 = T0 . On the other hand, a linear operator T : V1 7;! V 2 coinciding with T0 on V0 V1 is x 1 n n+m , called an extension of T0. For example, let V0 := 0 : x1 2 C V1 = C and let 2 2 C (n+m)(n+m) ; T = A1 0 2 C (n+m)(n+m) : T = A01 A 0 A3 0 0 Then T jV0 = T0 .
De nition 4.1 Two normed spaces V1 and V2 are said to be linearly isometric, denoted by V1 = V2 , if there exists a linear operator T of V1 onto V2 such that kTxk = kxk for all x in V1 . In this case, the mapping T is said to be an isometric isomorphism.
4.2 Hilbert Spaces
Recall the inner product of vectors de ned on a Euclidean space C n :
hx; yi := x y =
n X i=1
2x 3 2y 3 1 1 xi yi 8x = 64 ... 75 ; y = 64 ... 75 2 C n : xn
yn
PERFORMANCE SPECIFICATIONS
94
Note that many important metric notions and geometrical properties such as length, distance, angle, and the energy of physical systems can be deduced from this inner product. For instance, the length of a vector x 2 C n is de ned as
p
kxk := hx; xi; and the angle between two vectors x; y 2 C n can be computed from cos \(x; y) = khxx;k kyyik ; \(x; y) 2 [0; ]: The two vectors are said to be orthogonal if \(x; y) = 2 . We now consider a natural generalization of the inner product on C n to more general (possibly in nite dimensional) vector spaces. De nition 4.2 Let V be a vector space over C . An inner product on V is a complex valued function, h; i : V V 7;! C such that for any x; y; z 2 V and ; 2 C (i) 1 hx; y + z i = hx; yi + hx; z i (ii) hx; yi = hy; xi (iii) hx; xi > 0 if x 6= 0. A vector space V with an inner product is called an inner product space. p It is clear that the inner product de ned above induces a norm kxk := hx; xi, so that the norm conditions in Chapter 2 are satis ed. In particular, the distance between vectors x and y is d(x; y) = kx ; yk. Two vectors x and y in an inner product space V are said to be orthogonal if hx; yi = 0, denoted x ? y. More generally, a vector x is said to be orthogonal to a set S V , denoted by x ? S , if x ? y for all y 2 S . The inner product and the inner-product induced norm have the following familiar properties. Theorem 4.1 Let V be an inner product space and let x; y 2 V . Then (i) jhx; yij kxk kyk (Cauchy-Schwarz inequality). Moreover, the equality holds if and only if x = y for some constant or y = 0. (ii) kx + yk2 + kx ; yk2 = 2 kxk2 + 2 kyk2 (Parallelogram law) . (iii) kx + yk2 = kxk2 + kyk2 if x ? y. 1 This is the other way round to the usual mathematical convention since we want to have h rather than for 2 C n. y x
x; y
x; y
i=
x y
4.2. Hilbert Spaces
95
A Hilbert space is a complete inner product space with the norm induced by its inner product. Obviously, a Hilbert space is also a Banach space. For example, C n with the usual inner product is a ( nite dimensional) Hilbert space. More generally, it is straightforward to verify that C nm with the inner product de ned as
hA; B i := Trace A B =
n X m X i=1 j =1
aij bij 8A; B 2 C nm
is also a ( nite dimensional) Hilbert space. Here are some examples of in nite dimensional Hilbert spaces: l2 (;1; 1): l2 (;1; 1) consists of the set of all real or complex square summable sequences x = (: : : ; x;2 ; x;1 ; x0 ; x1 ; x2 ; : : :) i.e, 1 X
i=;1
jxi j2 < 1
with the inner product de ned as
hx; yi :=
1 X i=;1
xi yi
for x; y 2 l2 (;1; 1). The subspaces l2 (;1; 0) and l2 [0; 1) of l2 (;1; 1) are de ned similarly and consist of sequences of the form x = (: : : ; x;2 ; x;1 ) and x = (x0 ; x1 ; x2 ; : : :), respectively. Note that we can also de ne a corresponding Hilbert space even if each component xi is a vector or a matrix; in fact, the following inner product will suce:
hx; yi :=
1 X
i=;1
Trace(xi yi ):
L2 (I ) for I R: L2 (I ) consists of all square integrable and Lebesgue measurable functions de ned on an interval I R with the inner product de ned as
Z
hf; gi := f (t) g(t)dt I
for f; g 2 L2 (I ). Similarly, if the function is vector or matrix valued, the inner product is de ned correspondingly as
Z
hf; gi := Trace [f (t) g(t)] dt: I
PERFORMANCE SPECIFICATIONS
96
Some very often used spaces in this book are L2 [0; 1); L2 (;1; 0]; L2 (;1; 1). More precisely, they are de ned as L2 = L2 (;1; 1): Hilbert space of matrix-valued functions on R, with inner product
hf; gi :=
Z1
;1
Trace [f (t) g(t)] dt:
L2+ = L2 [0; 1): subspace of L2 (;1; 1) with functions zero for t < 0. L2; = L2 (;1; 0]: subspace of L2 (;1; 1) with functions zero for t > 0. Let H be a Hilbert space and M H a subset. Then the orthogonal complement of M , denoted by H M or M ?, is de ned as
M ? = fx : hx; yi = 0; 8y 2 M; x 2 Hg : It can be shown that M ? is closed (hence M ? is also a Hilbert space). For example, let M = L2+ L2 , then M ? = L2; is a Hilbert space. Let M and N be subspaces of a vector space V . V is said to be the direct sum of M and N , written V = M N , if M \ N = f0g, and every element v 2 V can be expressed as v = x + y with x 2 M and y 2 N . If V is an inner product space and M and N are orthogonal, then V is said to be the orthogonal direct sum of M and N . As an example, it is easy to see that L2 is the orthogonal direct sum of L2; and L2+ . Similarly, l2 (;1; 1) is the orthogonal direct sum of l2 (;1; 0) and l2 [0; 1). The following is a version of the so-called orthogonal projection theorem:
Theorem 4.2 Let H be a Hilbert space, and let M be a closed subspace of H. Then for each vector v 2 H, there exist unique vectors x 2 M and y 2 M ? such that v = x + y, i.e., H = M M ?. Moreover, x 2 M is the unique vector such that d(v; M ) = kv ; xk. Let H1 and H2 be two Hilbert spaces, and let A be a bounded linear operator from H1 into H2 . Then there exists a unique linear operator A : H2 7;! H1 such that for all x 2 H1 and y 2 H2 hAx; yi = hx; A yi: A is called the adjoint of A. Furthermore, A is called self-adjoint if A = A . Let H be a Hilbert space and M H be a closed subspace. A bounded operator P mapping from H into itself is called the orthogonal projection onto M if P (x + y) = x; 8 x 2 M and y 2 M ? :
4.3. Hardy Spaces H2 and H1
97
4.3 Hardy Spaces H2 and H1
Let S C be an open set, and let f (s) be a complex valued function de ned on S :
f (s) : S 7;! C : Then f (s) is said to be analytic at a point z0 in S if it is dierentiable at z0 and also at each point in some neighborhood of z0 . It is a fact that if f (s) is analytic at z0 then f has continuous derivatives of all orders at z0 . Hence, a function analytic at z0 has a power series representation at z0 . The converse is also true, i.e., if a function has a power series at z0 , then it is analytic at z0 . A function f (s) is said to be analytic in S if it has a derivative or is analytic at each point of S . A matrix valued function is analytic in S if every element of the matrix is analytic in S . For example, all real rational stable transfer matrices are analytic in the right-half plane and e;s is analytic everywhere.
A well known property of the analytic functions is the so-called Maximum Modulus Theorem. Theorem 4.3 If f (s) is de ned and continuous on a closed-bounded set S and analytic on the interior of S , then the maximum of jf (s)j on S is attained on the boundary of S , i.e., max jf (s)j = smax jf (s)j s2S 2@S where @S denotes the boundary of S . Next we consider some frequently used complex (matrix) function spaces.
L2 (j R) Space L2 (j R) or simply L2 is a Hilbert space of matrix-valued (or scalar-valued) func-
tions on j R and consists of all complex matrix functions F such that the integral below is bounded, i.e.,
Z1
;1
Trace [F (j!)F (j!)] d! < 1:
The inner product for this Hilbert space is de ned as Z1 1 Trace [F (j!)G(j!)] d! hF; Gi := 2 ;1 for F; G 2 L2 , and the inner product induced norm is given by
p
kF k2 := hF; F i: For example, all real rational strictly proper transfer matrices with no poles on the imaginary axis form a subspace (not closed) of L2 (j R) which is denoted by RL2 (j R) or simply RL2 .
PERFORMANCE SPECIFICATIONS
98
H2 Space2 H2 is a (closed) subspace of L2 (j R) with matrix functions F (s) analytic in Re(s) > 0 (open right-half plane). The corresponding norm is de ned as
Z1 kF k22 := sup 21 Trace [F ( + j!)F ( + j!)] d! : >0
;1
It can be shown3 that
kF k22 = 21
Z1 ;1
Trace [F (j!)F (j!)] d!:
Hence, we can compute the norm for H2 just as we do for L2 . The real rational subspace of H2 , which consists of all strictly proper and real rational stable transfer matrices, is denoted by RH2 .
H2? Space H2? is the orthogonal complement of H2 in L2 , i.e., the (closed) subspace of functions in L2 that are analytic in the open left-half plane. The real rational subspace of H2? , which consists of all strictly proper rational transfer matrices with all poles in the open right half plane, will be denoted by RH?2 . It is easy to see that if G is a strictly proper, stable, and real rational transfer matrix, then G 2 H2 and G 2 H2? . Most of our study in this book will be focused on the real rational case.
The L2 spaces de ned above in the frequency domain can be related to the L2 spaces de ned in the time domain. Recall the fact that a function in L2 space in the time domain admits a bilateral Laplace (or Fourier) transform. In fact, it can be shown that this bilateral Laplace (or Fourier) transform yields an isometric isomorphism between the L2 spaces in the time domain and the L2 spaces in the frequency domain (this is what is called Parseval's relations or Plancherel Theorem in complex analysis):
L2 (;1; 1) = L2 (j R) H2 L2 [0; 1) = L2 (;1; 0] = H2? : As a result, if g(t) 2 L2 (;1; 1) and if its Fourier (or bilateral Laplace) transform is G(j!) 2 L2 (j R), then kGk2 = kgk2 : 2 The H space and H space de ned below together with the H spaces, 1, which will not be 1 p 2 introduced in this book, are usually called Hardy spaces named after the mathematician G. H. Hardy (hence the notation of H). 3 See Francis [1987]. p
4.3. Hardy Spaces H2 and H1
99
Hence, whenever there is no confusion, the notation of functions in the time domain and in the frequency domain will be used interchangeably. De ne an orthogonal projection P+ : L2 (;1; 1) 7;! L2 [0; 1) such that, for any function f (t) 2 L2 (;1; 1), we have g(t) = P+ f (t) with t 0; g(t) := f (0t;); for for t < 0: In this book, P+ will also be used to denote the projection from L2 (j R) onto H2 . Similarly, de ne P; as another orthogonal projection from L2 (;1; 1) onto L2 (;1; 0] (or L2 (j R) onto H2? ). Then the relationships between L2 spaces and H2 spaces can be shown as in Figure 4.1. Laplace Transform L2 [0; 1) H2 Inverse Transform
P+
6
L2 (;1; 1) P;
?
L2 (;1; 0]
6
P+
Laplace Transform Inverse Transform
L2 (j R) P;
Laplace Transform Inverse Transform
-
? H2?
Figure 4.1: Relationships among function spaces Other classes of important complex matrix functions used in this book are those bounded on the imaginary axis. L1 (j R) Space L1 (j R) or simply L1 is a Banach space of matrix-valued (or scalar-valued) functions that are (essentially) bounded on j R, with norm kF k1 := ess sup [F (j!)] : ! 2R
PERFORMANCE SPECIFICATIONS
100
The rational subspace of L1 , denoted by RL1 (j R) or simply RL1 , consists of all rational proper transfer matrices with no poles on the imaginary axis.
H1 Space H1 is a (closed) subspace in L1 with functions that are analytic in the open right-half plane and bounded on the imaginary axis. The H1 norm is de ned as kF k1 := sup [F (s)] = ess sup [F (j!)] : Re(s)>0
! 2R
The second equality can be regarded as a generalization of the maximum modulus theorem for matrix functions. The real rational subspace of H1 is denoted by RH1 which consists of all proper and real rational stable transfer matrices.
; Space H1 H1; is a (closed) subspace in L1 with functions that are analytic in the open ; norm is de ned as left-half plane and bounded on the imaginary axis. The H1 kF k1 := sup [F (s)] = ess sup [F (j!)] : Re(s)<0
! 2R
; is denoted by RH; The real rational subspace of H1 1 which consists of all proper rational transfer matrices with all poles in the open right half plane.
De nition 4.3 A transfer matrix G(s) 2 H1; is usually said to be antistable or anticausal.
Some facts about L1 and H1 functions are worth mentioning: (i) if G(s) 2 L1 , then G(s)L2 := fG(s)f (s) : f (s) 2 L2 g L2 . (ii) if G(s) 2 H1 , then G(s)H2 := fG(s)f (s) : f (s) 2 H2 g H2 .
; , then G(s)H2? := fG(s)f (s) : f (s) 2 H2? g H2? . (ii) if G(s) 2 H1
Remark 4.1 The notation for L1 is somewhat unfortunate; it should be clear to the reader that the L1 space in the time domain and in the frequency domain denote completely dierent spaces. The L1 space in the time domain is usually used to denote signals, while the L1 space in the frequency domain is usually used to denote transfer functions and operators. ~ Let G(s) 2 L1 be a p q transfer matrix. Then a multiplication operator is de ned as
MG : L2 7;! L2 MG f := Gf:
4.3. Hardy Spaces H2 and H1
101
In writing the above mapping, we have assumed that f has a compatible dimension. A more accurate description of the above operator should be MG : Lq2 7;! Lp2 i.e., f is a q-dimensional vector function with each component in L2 . However, we shall suppress all dimensions in this book and assume all objects have compatible dimensions. It is easy to verify that the adjoint operator MG = MG . A useful fact about the multiplication operator is that the norm of a matrix G in L1 equals the norm of the corresponding multiplication operator. Theorem 4.4 Let G 2 L1 be a p q transfer matrix. Then kMGk = kGk1 . Remark 4.2 It is also true that this operator norm equals the norm of the operator restricted to H2 (or H2? ), i.e., kMGk = kMGjH2 k := sup fkGf k2 : f 2 H2 ; kf k2 1g : This will be clear in the proof where an f 2 H2 is constructed. ~
Proof. By de nition, we have kMGk = sup fkGf k2 : f 2 L2 ; kf k2 1g : First we see that kGk1 is an upper bound for the operator norm: Z1 f (j!)G (j!)G(j!)f (j!) d! kGf k22 = 21 ;1
Z1
kGk21 21 kf (j!)k2 d! ;1 = kGk21kf k22:
To show that kGk1 is the least upper bound, rst choose a frequency !o where [G(j!)] is maximum, i.e., [G(j!0 )] = kGk1 and denote the singular value decomposition of G(j!0 ) by
G(j!0 ) = u1 (j!0 )v1 (j!0 ) +
r X i=2
i ui (j!0 )vi (j!0 )
where r is the rank of G(j!0 ) and ui ; vi have unit length. If !0 < 1, write v1 (j!0 ) as
2 ej 66 12 ej v1 (j!0 ) = 64 .. .
1 2
q ejq
3 77 75
PERFORMANCE SPECIFICATIONS
102
where i 2 R is such that i 2 [;; 0) and q is the column dimension of G. Now let i 0 be such that i ; j!0 i = \ + j! ; and let f be given by
i
0
2 ;s 66 12 +;+sss f (s) = 66 .. 4 . ;s 1 1 2 2
q qq +s
3 77 77 f^(s) 5
where a scalar function f^ is chosen so that
j! ; !o j < or j! + !oj < jf^(j!)j = c0 ifotherwise where is a small positive number and c is chosen so that f^ has unit 2-norm, i.e., p c = =2. This in turn implies that f has unit 2-norm. Then
h
kGf k22 21 [G(;j!o )]2 + [G(j!o )]2 = [G(j!o )]2 = kGk21 :
i
If !0 = 1, then G(j!0 ) is real and v1 is real. In this case, the conclusion follows by letting f (s) = v1 f^(s). 2
4.4 Power and Spectral Signals In this section, we introduce two additional classes of signals that have been widely used in engineering. These classes of signals have some nice statistical and frequency domain representations. Let u(t) be a function of time. De ne its autocorrelation matrix as 1 Ruu ( ) := Tlim !1 2T
ZT
;T
u(t + )u (t)dt;
if the limit exists and is nite for all . It is easy to see from the de nition that Ruu ( ) = (; ). Assume further that the Fourier transform of the signal's autocorrelation Ruu matrix function exists (and may contain impulses). This Fourier transform is called the spectral density of u, denoted Suu (j!):
Suu (j!) :=
Z1
;1
Ruu ( )e;j! d:
4.4. Power and Spectral Signals
103
Thus Ruu ( ) can be obtained from Suu (j!) by performing an inverse Fourier transform: Z1 Ruu ( ) := 21 Suu (j!)ej! d!: ;1 We will call signal u(t) a power signal if the autocorrelation matrix Ruu ( ) exists and is nite for all , and moreover, if the power spectral density function Suu (j!) exists (note that Suu (j!) need not be bounded and may include impulses). The power of the signal is de ned as
s
ZT p 1 kukP = Tlim ku(t)k2 dt = Trace [Ruu (0)] !1 2T ;T
where kk is the usual Euclidean norm and the capital script P is used to dierentiate this power semi-norm from the usual Lebesgue Lp norm. The set of all signals having nite power will be denoted by P . The power semi-norm of a signal can also be computed from its spectral density function Z1 1 2 Trace[Suu (j!)]d!: kukP = 2 ;1 This expression implies that, if u 2 P , Suu is strictly proper in the sense that Suu (1) = 0. We note that if u 2 P and ku(t)k1 := supt ku(t)k < 1, then kukP kuk1. However, not every signal having nite 1-norm is a power signal since the limit in the de nition may not exist. For example, let 2k < t < 22k+1 ; for k = 0; 1; 2; : : : u(t) = 10 2otherwise :
R
Then limT !1 21T ;TT u2 dt does not exist. Note also that power signals are persistent signals in time such as sines or cosines; clearly, a time-limited signal has zero power, as does an L2 signal. Thus k kP is only a semi-norm, not a norm. Now let G be a linear system transfer matrix with convolution kernel g(t), input u(t), and output z (t). Then Rzz ( ) = g( ) Ruu ( ) g (; ) and Szz (j!) = G(j!)Suu (j!)G (j!). These properties are useful in establishing some input and output relationships in the next section. A signal u(t) is said to have bounded power spectral density if kSuu (j!)k1 < 1. The set of signals having bounded spectral density is denoted as S := fu(t) 2 Rm : kSuu (j!)k1 < 1g: p The quantity kuks := kSuu (j!)k is called the spectral density norm of u(t). The set S can be used to model signals with xed spectral characteristics by passing white noise signals through a weighting lter. Similarly, P could be used to model signals whose spectrum is not known but which are nite in power.
PERFORMANCE SPECIFICATIONS
104
4.5 Induced System Gains Many control engineering problems involve keeping some system signals \small" under various conditions, for example, under a set of possible disturbances and system parameter variations. In this section we are interested in answering the following question: if we know how \big" the input (disturbance) is, how \big" is the output going to be for a given stable dynamical system? Consider a q-input and p-output linear nite dimensional system as shown in the following diagram with input u, output z , and transfer matrix G 2 RH1 :
z
G
u
We will further assume that G(s) is strictly proper, i.e, G(1) = 0 although most of the results derived here hold for the non-strictly proper case. In the time-domain an input-output model for such a system has the form of a convolution equation, z =gu i.e., Zt z (t) = g(t ; )u( ) d 0
where the p q real matrix g(t) is the convolution kernel. Let the convolution kernel and the corresponding transfer matrix be partitioned as 2 g (t) g (t) 3 2 g (t) 3 11 1q 1 6 7 6 . . . 7 . . g(t) = 4 . . 5 = 4 .. 5 ; gp1 (t) gpq (t) gp (t)
2 G (s) G (s) 3 2 G (s) 3 11 1q 1 6 7 6 . . . 7 . . G(s) = 4 . . 5 = 4 .. 5 Gp1 (s) Gpq (s)
Gp (s)
where gi (t) is a q-dimensional row vector of the convolution kernel and Gi (s) is a row vector of the transfer matrix. Now if G is considered as an operator from the input space to the output space, then a norm is induced on G, which, loosely speaking, measures the size of the output for a given input u. These norms can determine the achievable performance of the system for dierent classes of input signals The various input/output relationships, given dierent classes of input signals, are summarized in two tables below. Table 4.1 summarizes the results for xed input signals. Note that the (t) in this table denotes the unit impulse and u0 2 Rq is a constant vector indicating the direction of the input signal. We now prove Table 4.1.
4.5. Induced System Gains
105
Input u(t)
Output z (t)
kz k2 = kGu0 k2 = kgu0k2 u(t) = u0 (t); u0 2 Rq
kz k1 = kgu0k1 kz kP = 0 kz k2 = 1
u(t) = u0 sin !0 t; u0 2 Rq
lim sup max jz (t)j = kG(j!0 )u0 k1 = max jGi (j!0 )u0 j i i i t!1
lim sup kz (t)k = kG(j!0 )u0 k t!1
kz kP = p1 kG(j!0 )u0 k 2
Table 4.1: Output norms with xed inputs
Proof. u = u0(t): If u(t) = u0(t), then z (t) = g(t)u0, so kz k2 = kgu0k2 and kz k1 = kgu0k1 . But by Parseval's relation, kgu0k2 = kGu0k2 . On the other hand,
ZT 1 ug (t)g(t)u0 dt P = Tlim !1 2T ;T 0 Z1 1 Tracefg(t)g(t)g dt ku0 k2 Tlim !1 2T ;1 1 kGk2 ku k2 = 0: = Tlim 2 0 !1 2T
kz k2
u = u0 sin !0 t: With the input u(t) = u0 sin(!0 t), the i-th output as t ! 1 is zi (t) = jGi (j!0 )u0 j sin[!0 t + argfGi (j!0 )u0 g]:
(4:1)
PERFORMANCE SPECIFICATIONS
106
The 2-norm of this signal is in nite as long as Gi (j!0 )u0 6= 0, i.e., the system's transfer function does not have a zero in every channel in the input direction at the frequency of excitation. The amplitude of the sinusoid (4.1) equals jGi (j!0 )u0 j. Hence lim sup max jz (t)j = max jGi (j!0 )u0 j = kG(j!0 )u0 k1 i i i and
t!1
v u p uX lim sup kz (t)k = t jGi (j!0 )u0 j2 = kG(j!0 )u0 k : t!1
i=1
Finally, let i := arg Gi (j!)u0 . Then p 1 ZTX kz k2P = Tlim jG (j! )u j2 sin2 (!0 t + i ) dt !1 2T ;T i=1 i 0 0 ZT p X 1 2 = jGi (j!0 )u0 j Tlim sin2 (!0 t + i ) dt !1 2 T ;T i=1 Z p X 1 T 1 ; cos 2(!0 t + i ) dt = jGi (j!0 )u0 j2 Tlim !1 2T ;T 2 i=1 p X = 21 jGi (j!0 )u0 j2 = 12 kG(j!0 )u0 k2 : i=1
2
It is interesting to see what this table signi es from the control point of view. To focus our discussion, let us assume that u(t) = u0 sin !0 t is a disturbance or a command signal on a feedback system, and z (t) is the tracking error. Then we say that the system has good tracking behavior if z (t) is small in some sense, for instance, lim supt!1 kz (t)k is small. Note that lim sup kz (t)k = kG(j!0 )u0 k t!1 for any given !0 and u0 2 Rq . Now if we want to track signals from various channels, that is if u0 can be chosen to be any direction, then we would require that (G(j!0 )) be small. Furthermore, if, in addition, we want to track signals of many dierent frequencies, we then would require that (G(j!0 )) be small at all those frequencies. This interpretation enables us to consider the control system in the frequency domain even though the speci cations are given in the time domain. Table 4.2 lists the maximum possible system gains when the input signal u is not required to be a xed signal; instead it can be any signal in a unit ball in some function space. Now we give a proof for Table 4.2. Note that the rst row (L2 7;! L2 ) has been shown in Section 4.3.
4.5. Induced System Gains Input u(t) Output z (t)
107 Signal Norms
kuk22 =
L2
L2
S
S
S
P
kuk2P = 21
P
P
kuk2P = 21
L1
Z1 0
Induced Norms
kuk2 dt
kGk1
kuk2S = kSuu k1
Z1 ;1
Z1 ;1
kGk1
TracefSuu (j!)gd!
kGk2
TracefSuu (j!)gd!
kGk1
kuk1 = sup max jui (t)j i
max kgi k1 i
t
L1
kuk1 = sup ku(t)k t
Z1
Table 4.2: Induced System Gains
Proof. S 7;! S : If u 2 S , then
Szz (j!) = G(j!)Suu (j!)G (j!):
Now suppose
[G(j!0 )] = kGk1 and take a signal u such that Suu (j!0 ) = I . Then kSzz (j!)k1 = kGk21 :
S 7;! P : By de nition, we have
Z1 1 P = 2 ;1 TracefG(j!)Suu (j!)G (j!)g d!:
kz k2
0
kg(t)k dt
PERFORMANCE SPECIFICATIONS
108
Now let u be white with unit spectral density, i.e., Suu = I . Then Z1 1 2 kz kP = 2 TracefG(j!)G (j!)g d! = kGk22 : ;1
P 7;! P :
If u is a power signal, then Z1 1 2 kz kP = 2 TracefG(j!)Suu (j!)G (j!)g d!; ;1 and immediately, we get that
kz kP kGk1 kukP : To achieve the equality, assume that !0 is such that
[G(j!0 )] = kGk1 and denote the singular value decomposition of G(j!0 ) by
G(j!0 ) = u1 (j!0 )v1 (j!0 ) +
r X i=2
i ui (j!0 )vi (j!0 )
where r is the rank of G(j!0 ) and ui ; vi have unit length. If !0 < 1, write v1 (j!0 ) as
2 ej 66 12ej v1 (j!) = 64 .. .
1 2
q ejq
3 77 75
where i 2 R is such that i 2 [;; 0) and q is the column dimension of G. Now let i 0 be such that j!0 i = \ i ; + j! i
0
and let the input u be generated from passing u^ through a lter:
2 ;s 66 21 +;+sss u(t) = 66 .. 4 . ;s 1 1 2 2
q qq +s
3 77 77 u^(t) 5
4.5. Induced System Gains where
109
p
Then Ru^u^ ( ) = cos(!o ), so
u^(t) = 2 sin(!o t):
ku^kP = Ru^u^ (0) = 1: Also, Then
Su^u^ (j!) = [(! ; !o ) + (! + !o)] :
2 ;j! 66 21 +;+j!j!j! Suu (j!) = 66 4 ... ;j! 1 1 2 2
and it is easy to show
q qq +j!
3 2 ;j! 77 66 12 +;+j!j!j! 77 Su^u^ (j!) 66 .. 5 4 . ;j! 1 1 2 2
q qq +j!
3 77 77 5
kukP = 1:
Finally,
kz k2P = 21 [G(j!o )]2 + 12 [G(;j!o )]2 = [G(;j!o)]2 = kGk21 : Similarly, if !0 = 1, then G(j!) is real. The conclusion follows by letting u = v1 u^(t) and !o ! 1. L1 7;! L1 : 1. First of all, maxi kgik1 is an upper bound on the 1-norm/1-norm system gain:
jzi (t)j = =
Z t Z gi( )u(t ; ) d t jgi( )u(t ; )j d 0 Z 0t X Z 1X q q jgij ( )j d kuk1
0 j =1 kgi k1 kuk1
0 j =1
and
kz k1 := max sup jz (t)j i t i max kgi k1 kuk1 : i
jgij ( )j d kuk1
PERFORMANCE SPECIFICATIONS
110
That maxi kgi k1 is the least upper bound can be seen as follows: Assume that the maximum maxi kgi k1 is achieved for i = 1. Let t0 be given and set
u(t0 ; ) := sign(g1 ( )); 8:
Note that since g1( ) is a vector function, the sign function sign(g1 ( )) is a component-wise operation. Then kuk1 = 1 and
Zt
0
z1 (t0 ) =
0
g1 ( )u(t0 ; ) d
Zt X q 0
=
0 j =1
= kg1 k1 ;
jg1j ( )j d
Z 1X q t0 j =1
jg1j ( )j d:
Hence, let t0 ! 1, and we have kz k1 = kg1 k1 . 2. If ku(t)k1 := supt ku(t)k, then
kz (t)k =
Z t
g( )u(t ; )d
Z t0 Zt 0 0
kg( )k ku(t ; )k d kg( )k d kuk1 :
R And, therefore, kz k1 01 kg( )k d kuk1 .
2
Next we shall derive some simple and useful bounds for the H1 norm and the L1 norm of a stable system. Suppose
G(s) = CA B0 2 RH1 is a balanced realization, i.e., there exists = diag(1 ; 2 ; : : : ; n ) 0 with 1 2 : : : n 0, such that
A + A + BB = 0
Then we have the following theorem.
A + A + C C = 0:
4.5. Induced System Gains
111
Theorem 4.5 1 kGk1
Z1 0
kg(t)k dt 2
where g(t) = CeAt B .
n X i=1
i
Remark 4.3 It should be clear that the inequalities stated in the theorem do not depend on a particular state space realization of G(s). However, use of the balanced realization does make the proof simple. ~ Proof. The inequality 1 kGk1 follows from the Nehari Theorem of Chapter 8. We will now show the other inequalities. Since
G(s) :=
Z1 0
g(t)e;st dt; Re(s) > 0;
by the de nition of H1 norm, we have
kGk1
Z 1
; st
= sup g(t)e dt
Re(s)>0 0 Z 1
g(t)e;st
dt sup Re(s)>0 0 Z1
0
kg(t)k dt:
To prove the last inequality, let ui be the ith unit vector. Then
1
n if i = j and X ui ui = I: 0 if i = 6 j i=1 De ne i (t) = ui eAt=2 B and i (t) = CeAt=2 ui . It is easy to verify that
ui uj = ij =
k i k22 = k i k22 =
Z1 0
Z1 0
ui eAt=2 BB eAt=2 ui dt = 2ui ui = 2i ui eA t=2 C CeAt=2 ui dt = 2ui ui = 2i :
Using these two equalities, we have
Z1 0
kg(t)k dt =
X Z 1
X n n Z1
i i
dt 0 k i ik dt 0 i=1 i=1 n n X X i=1
k i k2 k i k2 2
i=1
i :
PERFORMANCE SPECIFICATIONS
112
2 It should be clear from the above two tables that many system performance criteria can be stipulated as requiring a certain closed loop transfer matrix have small H2 norm or H1 norm or L1 norm. Moreover, if L1 performance is satis ed, then the H1 norm performance is also satis ed. We will be most interested in H2 and H1 performance in this book.
4.6 Computing L2 and H2 Norms
Let G(s) 2 L2 and recall that the L2 norm of G is de ned as
kGk2 :=
s Z1 1
2 ;1 TracefG (j!)G(j!)g d!
= kgk2 =
sZ 1 ;1
Tracefg(t)g(t)g dt
where g(t) denotes the convolution kernel of G. It is easy to see that the L2 norm de ned above is nite i the transfer matrix G is strictly proper, i.e., G(1) = 0. Hence, we will generally assume that the transfer matrix is strictly proper whenever we refer to the L2 norm of G (of course, this also applies to H2 functions). One straightforward way of computing the L2 norm is to use contour integral. Suppose G is strictly proper, and then we have Z1 TracefG (j!)G(j!)g d! kGk22 = 21 I;1 1 = 2j TracefG (s)G(s)g ds: The last integral is a contour integral along the imaginary axis, and around an in nite semi-circle in the left half-plane; the contribution to the integral from this semi-circle equals zero because G is strictly proper. By the residue theorem, kGk22 equals the sum of the residues of TracefG (s)G(s)g at its poles in the left half-plane. Although kGk2 can, in principle, be computed from its de nition or from the method suggested above, it is useful in many applications to have alternative characterizations and to take advantage of the state space representations of G. The computation of a RH2 transfer matrix norm is particularly simple.
Lemma 4.6 Consider a transfer matrix
A B G(s) = C 0
4.6. Computing L2 and H2 Norms
113
with A stable. Then we have
kGk22 = trace(B Lo B ) = trace(CLc C )
(4:2) where Lo and Lc are observability and controllability Gramians which can be obtained from the following Lyapunov equations ALc + LcA + BB = 0 A Lo + LoA + C C = 0:
Proof. Since G is stable, we have CeAtB; t 0 ; 1 g(t) = L (G) = 0; t<0 and
kGk22
= =
Z1 Z0 0
1
Tracefg(t)g(t)g dt =
Z1 0
Tracefg(t)g(t) g dt
TracefB eA t C CeAt B g dt =
Z1 0
TracefCeAt BB eA t C g dt:
The lemma follows from the fact that the controllability Gramian of (A; B ) and the observability Gramian of (C; A) can be represented as
Lo =
Z1 0
eAt C CeAt dt; Lc =
which can also be obtained from ALc + LcA + BB = 0
Z1 0
eAt BB eAt dt;
A Lo + LoA + C C = 0:
2
To compute the L2 norm of a rational transfer function, G(s) 2 L2 , using state space approach. Let G(s) = [G(s)]+ + [G(s)]; with G+ 2 RH2 and G; 2 RH?2 . Then kGk22 = k[G(s)]+ k22 + k[G(s)]; k22 where k[G(s)]+ k2 and k[G(s)]; k2 = k[G(;s)]+ k2 can be computed using the above lemma. Still another useful characterization of the H2 norm of G is in terms of hypothetical input-output experiments. Let ei denote the ith standard basis vector of Rm where m is the input dimension of the system. Apply the impulsive input (t)ei ((t) is the unit impulse) and denote the output by zi (t)(= g(t)ei ). Assume D = 0, and then zi 2 L2+ and m X kGk22 = kzi k22 : i=1
Note that this characterization of the H2 norm can be appropriately generalized for nonlinear time varying systems, see Chen and Francis [1992] for an application of this norm in sampled-data control.
PERFORMANCE SPECIFICATIONS
114
4.7 Computing L1 and H1 Norms
We shall rst consider, as in the L2 case, how to compute the 1 norm of an L1 transfer matrix. Let G(s) 2 L1 and recall that the L1 norm of a transfer function G is de ned as kGk1 := ess sup fG(j!)g: !
The computation of the L1 norm of G is complicated and requires a search. A control engineering interpretation of the in nity norm of a scalar transfer function G is the distance in the complex plane from the origin to the farthest point on the Nyquist plot of G, and it also appears as the peak value on the Bode magnitude plot of jG(j!)j. Hence the 1 of a transfer function can in principle be obtained graphically. To get an estimate, set up a ne grid of frequency points,
f!1; ; !N g: Then an estimate for kGk1 is max fG(j!k )g:
1kN
This value is usually read directly from a Bode singular value plot. The L1 norm can also be computed in state space if G is rational.
Lemma 4.7 Let > 0 and
B 2 RL : G(s) = CA D 1
(4:3)
Then kGk1 < if and only if (D) < and H has no eigenvalues on the imaginary axis where A + BR;1DC ;1 B BR H := ;C (I + DR;1D )C ;(A + BR;1 D C ) (4.4) and R = 2I ; D D.
Proof. Let (s) = 2I ; G(s)G(s). Then it is clear that kGk1 < if and only if (j!) > 0 for all ! 2 R. Since (1) = R > 0 and since (j!) is a continuous function of !, (j!) > 0 for all ! 2 R if and only if (j!) is nonsingular for all ! 2 R [ f1g,
i.e., (s) has no imaginary axis zero. Equivalently, ;1 (s) has no imaginary axis pole. It is easy to compute by some simple algebra that
2 ;1 (s) = 4
BR;1 3 H ;C DR;1 5 : ; 1 ; 1 R DC R B R ;1
4.7. Computing L1 and H1 Norms
115
Thus the conclusion follows if the above realization has neither uncontrollable modes nor unobservable modes on the imaginary axis. Assume that j!0 is an eigenvalue of H but not a pole of ;1 (s). Then j!0 must be either anunobservable mode of ;1 ( R;1 D C R;1 B ; H ) or an uncontrollable mode of (H; ;CBR DR;1 ). Now suppose j! x0 is an unobservable mode of ( R;1DC R;1B ; H ). Then there exists an x0 = x1 6= 0 such that 2
Hx0 = j!0 x0 ; R;1 D C R;1 B x0 = 0: These equations can be simpli ed to (j!0 I ; A)x1 = 0 (j!0 I + A )x2 = ;C Cx1 D Cx1 + B x2 = 0: Since A has no imaginary axis eigenvalues, we have x1 = 0 and x2 = 0. This contradicts our assumption, and hence the realization has no unobservable modes on the imaginary axis. Similarly, a contradiction BR;1 will also be arrived if j!0 is assumed to be an uncontrollable mode of (H; ;C DR;1 ). 2
Bisection Algorithm
Lemma 4.7 suggests the following bisection algorithm to compute RL1 norm: (a) select an upper bound u and a lower bound l such that l kGk1 u ; (b) if ( u ; l )= l speci ed level, stop; kGk ( u + l )=2. Otherwise go to next step; (c) set = ( l + u )=2; (d) test if kGk1 < by calculating the eigenvalues of H for the given ; (e) if H has an eigenvalue on j R set l = ; otherwise set u = ; go back to step (b). Of course, the above algorithm applies to H1 norm computation as well. Thus L1 norm computation requires a search, over either or !, in contrast to L2 (H2 ) norm computation, which does not. A somewhat analogous situation occurs for constant matrices with the norms kM k22 = trace(M M ) and kM k1 = [M ]. In principle, kM k22 can be computed exactly with a nite number of operations, as can the test for whether (M ) < (e.g. 2 I ; M M > 0), but the value of (M ) cannot. To compute (M ), we must use some type of iterative algorithm.
116
PERFORMANCE SPECIFICATIONS
Remark 4.4 It is clear that kGk1 < i
;1G 1 < 1. Hence, there is no loss of
generality to assume = 1. This assumption will often be made in the remainder of this book. It is also noted that there are other fast algorithms to carry out the above norm computation; nevertheless, this bisection algorithm is the simplest. ~ The H1 norm of a stable transfer function can also be estimated experimentally using the fact that the H1 norm of a stable transfer function is the maximum magnitude of the steady-state response to all possible unit amplitude sinusoidal input signals.
4.8 Notes and References The basic concept of function spaces presented in this chapter can be found in any standard functional analysis textbook, for instance, Naylor and Sell [1982] and Gohberg and Goldberg [1981]. The system theoretical interpretations of the norms and function spaces can be found in Desoer and Vidyasagar [1975]. The bisection H1 norm computational algorithm is rst developed in Boyd, Balakrishnan, and Kabamba [1989]. A more ecient L1 norm computational algorithm is presented in Bruinsma and Steinbuch [1990].
5
Stability and Performance of Feedback Systems This chapter introduces the feedback structure and discusses its stability and performance properties. The arrangement of this chapter is as follows: Section 5.1 discusses the necessity for introducing feedback structure and describes the general feedback con guration. In section 5.2, the well-posedness of the feedback loop is de ned. Next, the notion of internal stability is introduced and the relationship is established between the state space characterization of internal stability and the transfer matrix characterization of internal stability in section 5.3. The stable coprime factorizations of rational matrices are also introduced in section 5.4. Section 5.5 considers feedback properties and discusses how to achieve desired performance using feedback control. These discussions lead to a loop shaping control design technique which is introduced in section 5.6. Finally, we consider the mathematical formulations of optimal H2 and H1 control problems in section 5.7.
5.1 Feedback Structure In designing control systems, there are several fundamental issues that transcend the boundaries of speci c applications. Although they may dier for each application and may have dierent levels of importance, these issues are generic in their relationship to control design objectives and procedures. Central to these issues is the requirement to provide satisfactory performance in the face of modeling errors, system variations, and 117
118
STABILITY AND PERFORMANCE OF FEEDBACK SYSTEMS
uncertainty. Indeed, this requirement was the original motivation for the development of feedback systems. Feedback is only required when system performance cannot be achieved because of uncertainty in system characteristics. The more detailed treatment of model uncertainties and their representations will be discussed in Chapter 9. For the moment, assuming we are given a model including a representation of uncertainty which we believe adequately captures the essential features of the plant, the next step in the controller design process is to determine what structure is necessary to achieve the desired performance. Pre ltering input signals (or open loop control) can change the dynamic response of the model set but cannot reduce the eect of uncertainty. If the uncertainty is too great to achieve the desired accuracy of response, then a feedback structure is required. The mere assumption of a feedback structure, however, does not guarantee a reduction of uncertainty, and there are many obstacles to achieving the uncertainty-reducing bene ts of feedback. In particular, since for any reasonable model set representing a physical system uncertainty becomes large and the phase is completely unknown at suciently high frequencies, the loop gain must be small at those frequencies to avoid destabilizing the high frequency system dynamics. Even worse is that the feedback system actually increases uncertainty and sensitivity in the frequency ranges where uncertainty is signi cantly large. In other words, because of the type of sets required to reasonably model physical systems and because of the restriction that our controllers be causal, we cannot use feedback (or any other control structure) to cause our closed-loop model set to be a proper subset of the open-loop model set. Often, what can be achieved with intelligent use of feedback is a signi cant reduction of uncertainty for certain signals of importance with a small increase spread over other signals. Thus, the feedback design problem centers around the tradeo involved in reducing the overall impact of uncertainty. This tradeo also occurs, for example, when using feedback to reduce command/disturbance error while minimizing response degradation due to measurement noise. To be of practical value, a design technique must provide means for performing these tradeos. We will discuss these tradeos in more detail later in section 5.5 and in Chapter 6. To focus our discussion, we will consider the standard feedback con guration shown in Figure 5.1. It consists of the interconnected plant P and controller K forced by
r-e
;6
-
K
u
di
- ?e up-
d
P
- ?e y?en
Figure 5.1: Standard Feedback Con guration
5.2. Well-Posedness of Feedback Loop
119
command r, sensor noise n, plant input disturbance di , and plant output disturbance d. In general, all signals are assumed to be multivariable, and all transfer matrices are assumed to have appropriate dimensions.
5.2 Well-Posedness of Feedback Loop
Assume that the plant P and the controller K in Figure 5.1 are xed real rational proper transfer matrices. Then the rst question one would ask is whether the feedback interconnection makes sense or is physically realizable. To be more speci c, consider a simple example where ; 1; K = 1 P = ; ss + 2
are both proper transfer functions. However, u = (s +3 2) (r ; n ; d) ; s ;3 1 di i.e., the transfer functions from the external signals r ; n ; d and di to u are not proper. Hence, the feedback system is not physically realizable! De nition 5.1 A feedback system is said to be well-posed if all closed-loop transfer matrices are well-de ned and proper. Now suppose that all the external signals r; n; d, and di are speci ed and that the closed-loop transfer matrices from them to u are respectively well-de ned and proper. Then, y and all other signals are also well-de ned and the related transfer matrices are proper. Furthermore, since the transfer matrices from d and n to u are the same and dier from the transfer matrix from r to u by only a sign, the system is well-posed if and only if the transfer matrix from ddi to u exists and is proper.
In order to be consistent with the notation used in the rest of the book, we shall denote K^ := ;K and regroup the external input signals into the feedback loop as w1 and w2 and regroup the input signals of the plant and the controller as e1 and e2 . Then the feedback loop with the plant and the controller can be simply represented as inFigure 5.2 and the 1 system is well-posed if and only if the transfer matrix from w w2 to e1 exists and is proper. Lemma 5.1 The feedback system in Figure 5.2 is well-posed if and only if I ; K^ (1)P (1) (5:1) is invertible.
120
STABILITY AND PERFORMANCE OF FEEDBACK SYSTEMS w1
- e e1 +6
+
-
P K^
+ w e2 ? e+ 2
Figure 5.2: Internal Stability Analysis Diagram
Proof. The system in the above diagram can be represented in equation form as ^ 2 e1 = w1 + Ke e2 = w2 + Pe1 : Then an expression for e1 can be obtained as ^ )e1 = w1 + Kw ^ 2: (I ; KP ^ );1 exists and is proper. Thus well-posedness is equivalent to the condition that (I ; KP But this is equivalent to the condition that the constant term of the transfer function ^ is invertible. I ; KP 2 It is straightforward to show that (5.1) is equivalent to either one of the following two conditions: I ;K^ (1) is invertible; (5:2) ;P (1) I
I ; P (1)K^ (1) is invertible:
The well-posedness condition is simple to state in terms of state-space realizations. Introduce realizations of P and K^ :
A B P= "
C D
A^ K^ = ^ C
#
B^ : D^
(5:3) (5:4)
Then P (1) = D and K^ (1) = D^ . For example, well-posedness in (5.2) is equivalent to the condition that I ;D^ is invertible: (5:5) ;D I
Fortunately, in most practical cases we will have D = 0, and hence well-posedness for most practical control systems is guaranteed.
5.3. Internal Stability
121
5.3 Internal Stability Consider a system described by the standard block diagram in Figure 5.2 and assume the system is well-posed. Furthermore, assume that the realizations for P (s) and K^ (s) given in equations (5.3) and (5.4) are stabilizable and detectable. Let x and x^ denote the state vectors for P and K^ , respectively, and write the state equations in Figure 5.2 with w1 and w2 set to zero:
x_ e2 x^_ e1
= = = =
Ax + Be1 Cx + De1 ^2 A^x^ + Be ^ 2: C^ x^ + De
(5.6) (5.7) (5.8) (5.9)
De nition 5.2 The system of Figure 5.2 is said to be internally stable if the origin (x; x^) = (0; 0) is asymptotically stable, i.e., the states (x; x^) go to zero from all initial states when w1 = 0 and w2 = 0.
Note that internal stability is a state space notion. To get a concrete characterization of internal stability, solve equations (5.7) and (5.9) for e1 and e2 :
e I ;D^ ;1 1 =
x 0 C^ e2 x^ : ;D I C 0 Note that the existence of the inverse is guaranteed by the well-posedness condition. Now substitute this into (5.6) and (5.8) to get x_
~ x x^_ = A x^
where
0 C^ : ;D I C 0 Thus internal stability is equivalent to the condition that A~ has all its eigenvalues in the open left-half plane. In fact, this can be taken as a de nition of internal stability. A~ = A0 A0^ + B0 B0^
I ;D^ ;1
Lemma 5.2 The system of Figure 5.2 with given stabilizable and detectable realizations for P and K^ is internally stable if and only if A~ is a Hurwitz matrix.
It is routine to verify that the above de nition of internal stability depends only on
P and K^ , not on speci c realizations of them as long as the realizations of P and K^ are
both stabilizable and detectable, i.e., no extra unstable modes are introduced by the realizations. The above notion of internal stability is de ned in terms of state-space realizations of P and K^ . It is also important and useful to characterize internal stability from the
122
STABILITY AND PERFORMANCE OF FEEDBACK SYSTEMS
transfer matrix point of view. Note that the feedback system in Figure 5.2 is described, in term of transfer matrices, by I ;K^ e w 1 1 (5:10) e = w : ;P I 2
2
Now it is intuitively clear that if the system in Figure 5.2 is internally stable, then for all bounded inputs (w1 ; w2 ), the outputs (e1 ; e2) are also bounded. The following lemma shows that this idea leads to a transfer matrix characterization of internal stability.
Lemma 5.3 The system in Figure 5.2 is internally stable if and only if the transfer matrix
I ;K^ ;1 I + K^ (I ; P K^ );1P K^ (I ; P K^ );1 =
(I ; P K^ );1 P from (w1 ; w2 ) to (e1 ; e2 ) belongs to RH1 .
;P
(I ; P K^ );1
I
(5:11)
A B " A^ B^ # Proof. As above let C D and ^ ^ be stabilizable and detectable realizaC D tions of P and K^ , respectively. Let y1 denote the output of P and y2 the output of K^ . Then the state-space equations for the system in Figure 5.2 are
x_ _
yx^
1
y2 e1 e2
= = =
A
x B 0 e 1 x^ + 0 B^ e2 x D 0 e 1 x^ + 0 D^ e2 w 0 I y 1 + 1 : 0 0 A^ C 0 0 C^
w2
I 0
The last two equations can be rewritten as I ;D^ e 0 C^ 1 e2 = C 0 ;D I
y2
x w 1 x^ + w2 :
Now suppose that this system is internally stable. Then the well-posedness condition implies that (I ; DD^ ) = (I ; P K^ )(1) is invertible. Hence, (I ; P K^ ) is invertible. Furthermore, since the eigenvalues of
A~ = A0 A0^ + B0 B0^
I ;D^ ;1 ;D
I
0 C^ C 0
are in the open left-half plane, it follows that the transfer matrix from (w1 ; w2 ) to (e1 ; e2 ) given in (5.11) is in RH1 .
5.3. Internal Stability
123
Conversely, suppose that (I ; P K^ ) is invertible and the transfer matrix in (5.11) is in RH1 . Then, in particular, (I ; P K^ );1 is proper which implies that (I ; P K^ )(1) = (I ; DD^ ) is invertible. Therefore, I ;D^
;D
I
e1 1 is nonsingular. Now routine calculations give the transfer matrix from w w2 to e2 in terms of the state space realizations:
I ;D^ ;1 I ;D^ + ;D
I
;D
I
0 C^ (sI ; A~);1 B 0 C 0 0 B^
I ;D^ ;1 : ;D
I
Since the above transfer matrix belongs to RH1 , it follows that 0 C^ ~);1 B 0^ ( sI ; A C 0 0 B ^ B; ^ C^ ) are stabias a transfer matrix belongs to RH1 . Finally, since (A; B; C ) and (A; lizable and detectable, B 0 0 C^ ~ A; 0 B^ ; C 0 is stabilizable and detectable. It then follows that the eigenvalues of A~ are in the open left-half plane. 2 Note that to check internal stability, it is necessary (and sucient) to test whether each of the four transfer matrices in (5.11) is in RH1 . Stability cannot be concluded even if three of the four transfer matrices in (5.11) are in RH1 . For example, let an interconnected system transfer function be given by 1 K^ = ; s ;1 1 : P = ss ; + 1; Then it is easy to compute 3 2 e 6 ss ++ 12 ; (s ;s1)(+s1+ 2) 7 w 1 75 w1 ; 6 e2 = 4 s ; 1 2 s+1 s+2 s+2 which shows that the system is not internally stable although three of the four transfer functions are stable. This can also be seen by calculating the closed-loop A-matrix with any stabilizable and detectable realizations of P and K^ .
124
STABILITY AND PERFORMANCE OF FEEDBACK SYSTEMS
Remark 5.1 It should be noted that internal stability is a basic requirement for a
practical feedback system. This is because all interconnected systems may be unavoidably subject to some nonzero initial conditions and some (possibly small) errors, and it cannot be tolerated in practice that such errors at some locations will lead to unbounded signals at some other locations in the closed-loop system. Internal stability guarantees that all signals in a system are bounded provided that the injected signals (at any locations) are bounded. ~ However, there are some special cases under which determining system stability is simple.
Corollary 5.4 Suppose K^ 2 RH1. Then the system in Figure 5.2 is internally stable i (I ; P K^ );1 P 2 RH1 . Proof. The necessity is obvious. To prove the suciency, it is sucient to show that (I ; P K^ );1 2 RH1 . But this follows from (I ; P K^ );1 = I + (I ; P K^ );1 P K^ and (I ; P K^ );1 P; K^ 2 RH1 . 2 This corollary is in fact the basis for the classical control theory where the stability is checked only for one closed-loop transfer function with the implicit assumption that the controller itself is stable. Also, we have
Corollary 5.5 Suppose P 2 RH1. Then the system in Figure 5.2 is internally stable i K^ (I ; P K^ );1 2 RH1 . Corollary 5.6 Suppose P 2 RH1 and K^ 2 RH1 . Then the system in Figure 5.2 is internally stable i (I ; P K^ );1 2 RH1 . To study the more general case, de ne
nc := number of open rhp poles of K^ (s) np := number of open rhp poles of P (s):
Theorem 5.7 The system is internally stable if and only if (i) the number of open rhp poles of P (s)K^ (s) = nc + np ; (ii) (s) := det(I ; P (s)K^ (s)) has all its zeros in the open left-half plane (i.e., (I ; P (s)K^ (s));1 is stable).
5.3. Internal Stability
125
Proof. It is easy to show that P K^ and (I ; P K^ );1 have the following realizations:
3 2 A B C^ B D^ P K^ = 64 0 A^ B^ 75 C DC^ DD^ " A B (I ; P K^ );1 = C D
where
A = B =
#
A BC^ BD^ ^ );1 C DC^ + ( I ; D D ^ ^ 0 A B BD^ ^ ;1
B^ (I ; DD) C = (I ; DD^ );1 C DC^ D = (I ; DD^ );1 : It is also easy to see that A = A~. Hence, the system is internally stable i A is stable. Now suppose that the system is internally stable, then (I ; P K^ );1 2 RH1 . This implies that all zeros of det(I ; P (s)K^ (s)) must be in the left-half plane. So we only
need to show that given condition (ii), condition (i) is necessary and sucient for the B ) is stabilizable i internal stability. This follows by noting that (A; A BC^ BD^ ; B^ (5:12) 0 A^ A) is detectable i is stabilizable; and (C; A BC^ ^ ; (5:13) C DC 0 A^ is detectable. But conditions (5.12) and (5.13) are equivalent to condition (i), i.e., P K^ has no unstable pole/zero cancelations. 2 With this observation, the MIMO version of the Nyquist stability theorem is obvious. Theorem 5.8 (Nyquist Stability Theorem) The system is internally stable if and only if condition (i) in Theorem 5.7 is satis ed and the Nyquist plot of (j!) for ;1 ! 1 encircles the origin, (0; 0), nk + np times in the counter-clockwise direction.
Proof. Note that by SISO Nyquist stability theorem, (s) has all zeros in the open left-half plane if and only if the Nyquist plot of (j!) for ;1 ! 1 encircles the origin, (0; 0), nk + np times in the counter-clockwise direction.
2
126
STABILITY AND PERFORMANCE OF FEEDBACK SYSTEMS
5.4 Coprime Factorization over RH1
Recall that two polynomials m(s) and n(s), with, for example, real coecients, are said to be coprime if their greatest common divisor is 1 (equivalent, they have no common zeros). It follows from Euclid's algorithm1 that two polynomials m and n are coprime i there exist polynomials x(s) and y(s) such that xm + yn = 1; such an equation is called a Bezout identity. Similarly, two transfer functions m(s) and n(s) in RH1 are said to be coprime over RH1 if there exists x; y 2 RH1 such that xm + yn = 1: The more primitive, but equivalent, de nition is that m and n are coprime if every common divisor of m and n is invertible in RH1 , i.e., h; mh;1; nh;1 2 RH1 =) h;1 2 RH1 : More generally, we have De nition 5.3 Two matrices M and N in RH1 are right coprime over RH1 if they have the same number of columns and if there exist matrices Xr and Yr in RH1 such that X Y M = X M + Y N = I: r r r r N Similarly, two matrices M~ and N~ in RH1 are left coprime over RH1 if they have the same number of rows and if there exist matrices Xl and Yl in RH1 such that
M~ N~ Xl = MX ~ l + NY ~ l = I: Yl
M
Note that these de nitions are equivalent to saying that the matrix N is left invertible in RH1 and the matrix M~ N~ is right-invertible in RH1 . These two equations are often called Bezout identities. Now let P be a proper real-rational matrix. A right-coprime factorization (rcf) of P is a factorization P = NM ;1 where N and M are right-coprime over RH1 . Similarly, a left-coprime factorization (lcf) has the form P = M~ ;1N~ where N~ and M~ are left-coprime over RH1 . A matrix P (s) 2 Rp (s) is said to have double coprime factorization if there exist a right coprime factorization P = NM ;1 , a left coprime factorization P = M~ ;1N~ , and Xr ; Yr ; Xl ; Yl 2 RH1 such that
X Y M ;Y r r l N Xl = I: ;N~ M~
(5:14)
Of course implicit in these de nitions is the requirement that both M and M~ be square and nonsingular. 1
See, e.g., [Kailath, 1980, pp. 140-141].
5.4. Coprime Factorization over RH1
127
Theorem 5.9 Suppose P (s) is a proper real-rational matrix and
A B P=
C D is a stabilizable and detectable realization. Let F and L be such that A + BF and A + LC are both stable, and de ne
M ;Y 2 A + BF B ;L 3 l 5 4 N Xl = C +FDF DI 0I X Y 2 A + LC ;(B + LD) L 3 r r 4 F I 0 5: ;N~ M~ = ;D
C
I
(5:15) (5:16)
Then P = NM ;1 = M~ ;1N~ are rcf and lcf, respectively, and, furthermore, (5.14) is satis ed.
Proof. The theorem follows by verifying the equation (5.14).
2
Remark 5.2 Note that if P is stable, then we can take Xr = Xl = I , Yr = Yl = 0, N = N~ = P , M = M~ = I . ~ Remark 5.3 The coprime factorization of a transfer matrix can be given a feedback control interpretation. For example, right coprime factorization comes out naturally from changing the control variable by a state feedback. Consider the state space equations for a plant P : x_ = Ax + Bu y = Cx + Du: Next, introduce a state feedback and change the variable v := u ; Fx where F is such that A + BF is stable. Then we get x_ = (A + BF )x + Bv u = Fx + v y = (C + DF )x + Dv: Evidently from these equations, the transfer matrix from v to u is A + BF B ; M (s) =
F
I
128
STABILITY AND PERFORMANCE OF FEEDBACK SYSTEMS
and that from v to y is
BF B N (s) = CA + + DF D :
Therefore
u = Mv; y = Nv so that y = NM ;1 u, i.e., P = NM ;1 .
~
We shall now see how coprime factorizations can be used to obtain alternative characterizations of internal stability conditions. Consider again the standard stability analysis diagram in Figure 5.2. We begin with any rcf's and lcf's of P and K^ : P = NM ;1 = M~ ;1 N~ (5:17) ~ K^ = UV ;1 = V~ ;1 U:
(5:18)
Lemma 5.10 Consider the system in Figure 5.2. The following conditions are equivalent: 1. The feedback system is internally stable.
M U 2. N V is invertible in RH1 . V~ ;U~
;N~ M~ is invertible in RH1 . ~ ; NU ~ is invertible in RH1 . 4. MV ~ is invertible in RH1 . 5. V~ M ; UN 3.
Proof. As we saw in Lemma 5.3, internal stability is equivalent to I ;K^ ;1 2 RH1 ;P I or, equivalently, Now so that
I K^ = P I
I K^ ;1 2 RH1 : P I M ;1 I UV ;1 = M U ;1
NM
I
N V
I K^ ;1 M = P I
0
0
M U ;1 : V N V 0
(5:19) 0
V ;1
5.4. Coprime Factorization over RH1
M
Since the matrices
129
0 M U 0 V ; N V are right-coprime (this fact is left as an exercise for the reader), (5.19) holds i
M U ;1 2 RH1 : N V
This proves the equivalence of conditions 1 and 2. The equivalence of 1 and 3 is proved similarly. The conditions 4 and 5 are implied by 2 and 3 from the following equation: V~ ;U~ M U V~ M ; UN ~ 0 : ~ ; NU ~ N V = ;N~ M~ 0 MV Since the left hand side of the above equation is invertible in RH1 , so is the right hand side. Hence, conditions 4 and 5 are satis ed. We only need to show that either condition 4 or condition 5 implies condition 1. Let us show condition 5 ! 1; this is obvious since I K^ ;1 I V~ ;1U~ ;1 = NM ;1 I P I =
M
0
0 I
V~ M U~ ;1 V~ N
I
~ ~ ;1 if VNM UI 2 RH1 or if condition 5 is satis ed.
0 0 I 2 RH1
2
Combining Lemma 5.10 and Theorem 5.9, we have the following corollary. Corollary 5.11 Let P be a proper real-rational matrix and P = NM ;1 = M~ ;1N~ be corresponding rcf and lcf over RH1 . Then there exists a controller K^ 0 = U0 V0;1 = V~0;1 U~0 with U0 ; V0 ; U~0 , and V~0 in RH1 such that V~ ;U~ M U I 0 0 0 0 (5:20) N V0 = 0 I : ;N~ M~ Furthermore, let F and L be such that A + BF and A + LC are stable. Then a particular set of state space realizations for these matrices can be given by M U 2 A + BF B ;L 3 0 5 4 (5:21) N V0 = C +FDF DI I0 V~ ;U~ 2 A + LC ;(B + LD) L 3 0 0 4 F (5:22) I 0 5: ;N~ M~ =
C
;D
I
130
STABILITY AND PERFORMANCE OF FEEDBACK SYSTEMS
Proof. The idea behind the choice of these matrices is as follows. Using the observer theory, nd a controller K^ 0 achieving internal stability; for example K^ 0 := A + BF +FLC + LDF ;0L : (5:23) Perform factorizations K^ 0 = U0 V0;1 = V~0;1 U~0 which are analogous to the ones performed on P . Then Lemma 5.10 implies that each of the two left-hand side block matrices of (5.20) must be invertible in RH1 . In fact, (5.20) is satis ed by comparing it with the equation (5.14). 2
5.5 Feedback Properties In this section, we discuss the properties of a feedback system. In particular, we consider the bene t of the feedback structure and the concept of design tradeos for con icting objectives { namely, how to achieve the bene ts of feedback in the face of uncertainties.
r-e
;6
-
K
u
di - ?e up-
d
P
- ?e y?en
Figure 5.3: Standard Feedback Con guration Consider again the feedback system shown in Figure 5.1. For convenience, the system diagram is shown again in Figure 5.3. For further discussion, it is convenient to de ne the input loop transfer matrix, Li , and output loop transfer matrix, Lo , as Li = KP; Lo = PK; respectively, where Li is obtained from breaking the loop at the input (u) of the plant while Lo is obtained from breaking the loop at the output (y) of the plant. The input sensitivity matrix is de ned as the transfer matrix from di to up : Si = (I + Li );1 ; up = Si di : And the output sensitivity matrix is de ned as the transfer matrix from d to y: So = (I + Lo );1 ; y = So d:
5.5. Feedback Properties
131
The input and output complementary sensitivity matrices are de ned as
Ti = I ; Si = Li (I + Li );1 To = I ; So = Lo(I + Lo);1 ;
respectively. (The word complementary is used to signify the fact that T is the complement of S , T = I ; S .) The matrix I + Li is called input return dierence matrix and I + Lo is called output return dierence matrix. It is easy to see that the closed-loop system, if it is internally stable, satis es the following equations:
y r;y u up
= = = =
To (r ; n) + So Pdi + So d So (r ; d) + Ton ; So Pdi KSo (r ; n) ; KSod ; Ti di KSo (r ; n) ; KSod + Si di :
(5.24) (5.25) (5.26) (5.27)
These four equations show the fundamental bene ts and design objectives inherent in feedback loops. For example, equation (5.24) shows that the eects of disturbance d on the plant output can be made \small" by making the output sensitivity function So small. Similarly, equation (5.27) shows that the eects of disturbance di on the plant input can be made small by making the input sensitivity function Si small. The notion of smallness for a transfer matrix in a certain range of frequencies can be made explicit using frequency dependent singular values, for example, (So ) < 1 over a frequency range would mean that the eects of disturbance d at the plant output are eectively desensitized over that frequency range. Hence, good disturbance rejection at the plant output (y) would require that ; (So ) = (I + PK );1 = (I +1 PK ) ; (for disturbance at plant output, d) ; (So P ) = (I + PK );1P = (PSi ); (for disturbance at plant input, di ) be made small and good disturbance rejection at the plant input (up ) would require that ; (Si ) = (I + KP );1 = (I +1 KP ) ; (for disturbance at plant input, di ) ; (Si K ) = K (I + PK );1 = (KSo); (for disturbance at plant output, d) be made small, particularly in the low frequency range where d and di are usually signi cant. Note that
(PK ) ; 1 (I + PK ) (PK ) + 1 (KP ) ; 1 (I + KP ) (KP ) + 1
132 then
STABILITY AND PERFORMANCE OF FEEDBACK SYSTEMS 1
1 ( S ) o (PK ) + 1 (PK ) ; 1 ; if (PK ) > 1
1 1 (KP ) + 1 (Si ) (KP ) ; 1 ; if (KP ) > 1: These equations imply that
(So ) 1 () (PK ) 1 (Si ) 1 () (KP ) 1: Now suppose P and K are invertible, then
;
;
(PK ) 1 or (KP ) 1 () (So P ) = (I + PK );1 P (K ;1 ) = (1K )
(PK ) 1 or (KP ) 1 () (KSo ) = K (I + PK );1 (P ;1 ) = (1P ) : Hence good performance at plant output (y) requires in general large output loop gain (Lo ) = (PK ) 1 in the frequency range where d is signi cant for desensitizing d and large enough controller gain (K ) 1 in the frequency range where di is signi cant for desensitizing di . Similarly, good performance at plant input (up ) requires in general large input loop gain (Li ) = (KP ) 1 in the frequency range where di is signi cant for desensitizing di and large enough plant gain (P ) 1 in the frequency range where d is signi cant, which can not changed by controller design, for desensitizing d. (It should be noted that in general So 6= Si unless K and P are square and diagonal which is true if P is a scalar system. Hence, small (So ) does not necessarily imply small (Si ); in other words, good disturbance rejection at the output does not necessarily mean good disturbance rejection at the plant input.) Hence, good multivariable feedback loop design boils down to achieving high loop (and possibly controller) gains in the necessary frequency range. Despite the simplicity of this statement, feedback design is by no means trivial. This is true because loop gains cannot be made arbitrarily high over arbitrarily large frequency ranges. Rather, they must satisfy certain performance tradeo and design limitations. A major performance tradeo, for example, concerns commands and disturbance error reduction versus stability under the model uncertainty. Assume that the plant model is perturbed to (I + )P with stable, and assume that the system is nominally stable, i.e., the closed-loop system with = 0 is stable. Now the perturbed closed-loop system is stable if det (I + (I + )PK ) = det(I + PK ) det(I + To) has no right-half plane zero. This would in general amount to requiring that kTok be small or that (To ) be small at those frequencies where is signi cant, typically at
5.5. Feedback Properties
133
high frequency range, which in turn implies that the loop gain, (Lo ), should be small at those frequencies. Still another tradeo is with the sensor noise error reduction. The con ict between the disturbance rejection and the sensor noise reduction is evident in equation (5.24). Large (Lo(j!)) values over a large frequency range make errors due to d small. However, they also make errors due to n large because this noise is \passed through" over the same frequency range, i.e.,
y = To (r ; n) + So Pdi + So d (r ; n): Note that n is typically signi cant in the high frequency range. Worst still, large loop gains outside of the bandwidth of P , i.e., (Lo (j!)) 1 or (Li (j!)) 1 while (P (j!)) 1, can make the control activity (u) quite unacceptable, which may cause the saturation of actuators. This follows from
u = KSo(r ; n ; d) ; Ti di = Si K (r ; n ; d) ; Ti di P ;1 (r ; n ; d) ; di : Here, we have assumed P to be square and invertible for convenience. The resulting equation shows that disturbances and sensor noise are actually ampli ed at u whenever the frequency range signi cantly exceeds the bandwidth of P , since for ! such that (P (j!)) 1, we have [P ;1 (j!)] = [P (1j!)] 1:
Similarly, the controller gain, (K ), should also be kept not too large in the frequency range where the loop gain is small in order to not saturate the actuators. This is because for small loop gain (Lo (j!)) 1 or (Li (j!)) 1
u = KSo (r ; n ; d) ; Ti di K (r ; n ; d): Therefore, it is desirable to keep (K ) not too large when the loop gain is small. To summarize the above discussion, we note that good performance requires in some frequency range, typically some low frequency range (0; !l ):
(PK ) 1; (KP ) 1; (K ) 1 and good robustness and good sensor noise rejection require in some frequency range, typically some high frequency range (!h ; 1)
(PK ) 1; (KP ) 1; (K ) M where M is not too large. These design requirements are shown graphically in Figure 5.4. The speci c frequencies !l and !h depend on the speci c applications and the knowledge one has on the disturbance characteristics, the modeling uncertainties, and the sensor noise levels.
134
STABILITY AND PERFORMANCE OF FEEDBACK SYSTEMS
HHH @ H6H @ H XXXX @@ @@@(L) ;;;;;;;ZZ @@ @ ;;;;;;;;ZZ @ @ ;;; ;;;;;Z S @ ;; ;;;;; ; ZS @Z ;;;;; ;;; SH Z !h ;;;; ;;;;; Z H ;; ;;; ; !l HHH ZZ ;;;;;;;; log ! ;;;;; H;;;;;;;;;; (L)SS @@HH ; SS @@HH;;H;;H;; S @@ H S Figure 5.4: Desired Loop Gain
5.6 The Concept of Loop Shaping The analysis in the last section motivates a conceptually simple controller design technique: loop shaping. Loop shaping controller design involves essentially nding a controller K that shapes the loop transfer function L so that the loop gains, (L) and (L), clear the boundaries speci ed by the performance requirements at low frequencies and by the robustness requirements at high frequencies as shown in Figure 5.4. In the SISO case, the loop shaping design technique is particularly eective and simple since (L) = (L) = jLj. The design procedure can be completed in two steps:
SISO Loop Shaping (1) Find a rational strictly proper transfer function L which contains all the right half plane poles and zeros of P such that jLj clears the boundaries speci ed by the performance requirements at low frequencies and by the robustness requirements at high frequencies as shown in Figure 5.4. L must also be chosen so that 1+ L has all zeros in the open left half plane, which can usually be guaranteed by making L well-behaved in the crossover region, i.e., L should not be decreasing too fast in the frequency range of jL(j!)j 1. (2) The controller is given by K = L=P . The loop shaping for MIMO system can be done similarly if the singular values of the loop transfer functions are used for the loop gains.
5.6. The Concept of Loop Shaping
135
MIMO Loop Shaping (1) Find a rational strictly proper transfer function L which contains all the right half plane poles and zeros of P so that the product of P and P ;1 L (or LP ;1 ) has no unstable poles and/or zeros cancelations, and (L) clears the boundary speci ed by the performance requirements at low frequencies and (L) clears the boundary speci ed by the robustness requirements at high frequencies as shown in Figure 5.4. L must also be chosen so that det(I + L) has all zeros in the open left half plane. (This is not easy for MIMO systems.) (2) The controller is given by K = P ;1 L if L is the output loop transfer function (or K = LP ;1 if L is the input loop transfer function). The loop shaping design technique can be quite useful especially for SISO control system design. However, there are severe limitations when it is used for MIMO system design.
Limitations of MIMO Loop Shaping
Although the above loop shaping design can be eective in some of applications, there are severe intrinsic limitations. Some of these limitations are listed below: The loop shaping technique described above can only eectively deal with problems with uniformly speci ed performance and robustness speci cations. More speci cally, the method can not eectively deal with problems with dierent speci cations in dierent channels and/or problems with dierent uncertainty characteristics in dierent channels without introducing signi cant conservatism. To illustrate this diculty, consider an uncertain dynamical system P = (I + )P where P is the nominal plant and is the multiplicative modeling error. Assume that can be written in the following form ~ < 1: = ~ Wt ; () Then, for robust stability, we would require (To ) = (~ Wt To) < 1 or (Wt To) 1. If a uniform bound is required on the loop gain to apply the loop shaping technique, we would need to overbound (Wt To ): (Wt To ) (Wt ) (To ) (Wt ) 1 ;(L(oL) ) ; if (Lo ) < 1 o and the robust stability requirement is implied by 1 ; if (L ) < 1: (Lo ) (W1) + 1 (W o t t)
136
STABILITY AND PERFORMANCE OF FEEDBACK SYSTEMS Similarly, if the performance requirements, say output disturbance rejection, are not uniformly speci ed in all channels but by a weighting matrix Ws such that (Ws So ) 1, then it is also necessary to overbound (Ws So ) in order to apply the loop shaping techniques: (Ws So ) (Ws )(So ) (L(W) s;) 1 ; if (Lo) > 1 o and the performance requirement is implied by (Lo ) (Ws ) + 1 (Ws ); if (Lo) > 1: It is possible that the bounds for the loop shape may contradict each other at some frequency range, as shown in the gure 5.5. However, this does not imply that there is no controller that will satisfy both nominal performance and robust stability except for SISO systems. This contradiction happens because the bounds
6 (Ws ) ; ;;;;;;;;;Z;ZZ ; ; ; ; ; ; ;ZZ ;;;;;;;;;;; ;;; ZZ ;; ; ;;;;;;;;;;;Z ;;;;;; ; ;@ ;@ ;@ ;@;;@ @ @ @ @ ;;;;;;;;;P;;@P;P;@;;@ @ @ @ @ @@ log ! ;; ; ; ; ; ; ;@PP@P@P@ @ @ @ @ P@P @@ @@ @ ; ; ; ; ; ; ;;7 1 (Wt )
Figure 5.5: Con ict Requirements do not utilize the structure of weights, Ws and Wt ; and the bounds are only sucient conditions for robust stability and nominal performance. This possibility can be further illustrated by the following example: Assume that a two-input and two-output system transfer matrix is given by 1 1 P (s) = s + 1 0 1 ; and suppose the weighting matrices are given by
2 Ws = 4
1
s+1
(s+1)(s+2)
0
s+1
1
3 2 5 ; Wt = 4
s+2 s+10
0
(s+1) s+10 s+2 s+10
3 5:
5.7. Weighted H2 and H1 Performance
137
It is easy to show that for large , the weighting functions are as shown in Figure 5.5, and thus the above loop shaping technique cannot be applied. However, it is also easy to show that the system with controller
K = I2 gives
1
1
0 ; W T = s+10 0 Ws S = s+2 t 1 1 0 s+2 0 s+10
and, therefore, the robust performance criterion is satis ed. Even if all of the above problems can be avoided, it may still be dicult to nd a matrix function Lo so that K = P ;1 Lo is stabilizing. This becomes much harder if P is non-minimum phase and/or unstable. Hence some new methodologies have to be introduced to solve complicated problems. The so-called LQG/LTR (Linear Quadratic Gaussian/Loop Transfer Recovery) procedure developed rst by Doyle and Stein [1981] and extended later by various authors can solve some of the problems, but it is essentially limited to nominally minimum phase and output multiplicative uncertain systems. For these reasons, it will not be introduced here. This motivates us to consider the closed-loop performance directly in terms of the closed-loop transfer functions instead of open loop transfer functions. The following section considers some simple closed-loop performance problem formulations.
5.7 Weighted H2 and H1 Performance In this section, we consider how to formulate some performance objectives into mathematically tractable problems. As shown in section 5.5, the performance objectives of a feedback system can usually be speci ed in terms of requirements on the sensitivity functions and/or complementary sensitivity functions or in terms of some other closedloop transfer functions. For instance, the performance criteria for a scalar system may be speci ed as requiring js(j!)j < 1 8! ! ; 0 js(j!)j > 1 8! > !0 where s(j!) = 1+p(j!1)k(j!) . However, it is much more convenient to re ect the system performance objectives by choosing appropriate weighting functions. For example, the above performance objective can be written as
jws (j!)s(j!)j 1; 8! with
;1 8! ! ; 0 jws (j!)j = ;1
8! > !0 :
138
STABILITY AND PERFORMANCE OF FEEDBACK SYSTEMS
6u~
d~i
?
Wu
- Wr
r-e
;6
-
6
K
d~
u
?
Wi di
- ?e -
Wd d
P
- ?e y- We ee? n
Wn
n~
Figure 5.6: Standard Feedback Con guration with Weights In order to use ws in control design, a rational transfer function ws is usually used to approximate the above frequency response. The advantage of using weighted performance speci cations is obvious in multivariable system design. First of all, some components of a vector signal are usually more important than others. Secondly, each component of the signal may not be measured in the same metric; for example, some components of the output error signal may be measured in terms of length, and the others may be measured in terms of voltage. Therefore, weighting functions are essential to make these components comparable. Also, we might be primarily interested in rejecting errors in a certain frequency range (for example low frequencies), hence some frequency dependent weights must be chosen. In general, we shall modify the standard feedback diagram in Figure 5.3 into Figure 5.6. The weighting functions in Figure 5.6 are chosen to re ect the design objectives and knowledge on the disturbances and sensor noise. For example, Wd and Wi may be chosen to re ect the frequency contents of the disturbances d and di or they may be used to model the disturbance power spectrum depending on the nature of signals involved in the practical systems. The weighting matrix Wn is used to model the frequency contents of the sensor noise while We may be used to re ect the requirements on the shape of certain closed-loop transfer functions, for example, the shape of the output sensitivity function. Similarly, Wu may be used to re ect some restrictions on the control or actuator signals, and the dashed precompensator Wr is an optional element used to achieve deliberate command shaping or to represent a non-unity feedback system in equivalent unity feedback form. It is, in fact, essential that some appropriate weighting matrices be used in order to utilize the optimal control theory discussed in this book, i.e., H2 and H1 theory. So a very important step in controller design process is to choose the appropriate weights, We ; Wd ; Wu , and possibly Wn ; Wi , and Wr . The appropriate choice of weights for a particular practical problem is not trivial. In many occasions, as in the scalar case, the weights are chosen purely as a design parameter without any physical bases, so
5.7. Weighted H2 and H1 Performance
139
these weights may be treated as tuning parameters which are chosen by the designer to achieve the best compromise between the con icting objectives. The selection of the weighting matrices should be guided by the expected system inputs and the relative importance of the outputs. Hence, control design may be regarded as a process of choosing a controller K such that certain weighted signals are made small in some sense. There are many dierent ways to de ne the smallness of a signal or transfer matrix, as we have discussed in the last chapter. Dierent de nitions lead to dierent control synthesis methods, and some are much harder than others. A control engineer should make a judgment of the mathematical complexity versus engineering requirements. Below, we introduce two classes of performance formulations: H2 and H1 criteria. For the simplicity of presentation, we shall assume di = 0 and n = 0.
H2 Performance
Assume, for example, that the disturbance d~ can be approximately modeled as an impulse with random input direction, i.e., d~(t) = (t) and E ( ) = I where E denotes the expectation. We may choose to minimize the expected energy of the error e due to the disturbance d~:
n
o
E kek22 = E
Z 1 0
kek2 dt = kWe So Wd k22 :
Alternatively, if we suppose that the disturbance d~ can be approximately modeled as white noise with Sd~d~ = I , then See = (We So Wd )Sd~d~(We So Wd ) ; and we may chose to minimize the power of e: Z1 kek2P = 21 Trace See (j!) d! = kWe So Wd k22 : ;1 In general, a controller minimizing only the above criterion can lead to a very large control signal u that could cause saturation of the actuators as well as many other undesirable problems. Hence, for a realistic controller design, it is necessary to include the control signal u in the penalty function. Thus, our design criterion would usually be something like this
E
n
kek22 + 2 ku~k22
o
We SoWd = W KS W u o d
2
2
140
STABILITY AND PERFORMANCE OF FEEDBACK SYSTEMS
with some appropriate choice of weighting matrix Wu and scalar . The parameter clearly de nes the tradeo we discussed earlier between good disturbance rejection at the output and control eort (or disturbance and sensor noise rejection at the actuators). Note that can be set to = 1 by an appropriate choice of Wu . This problem can be viewed as minimizing the energy consumed by the system in order to reject the disturbance d. This type of problem was the dominant paradigm in the 1960's and 1970's and is usually referred to as Linear Quadratic Gaussian Control or simply as LQG. (They will also be referred to as H2 mixed sensitivity problems for the consistency with the H1 problems discussed next.) The development of this paradigm stimulated extensive research eorts and is responsible for important technological innovation, particularly in the area of estimation. The theoretical contributions include a deeper understanding of linear systems and improved computational methods for complex systems through state-space techniques. The major limitation of this theory is the lack of formal treatment of uncertainty in the plant itself. By allowing only additive noise for uncertainty, the stochastic theory ignored this important practical issue. Plant uncertainty is particularly critical in feedback systems.
H1 Performance
Although the H2 norm (or L2 norm) may be a meaningful performance measure and although LQG theory can give ecient design compromises under certain disturbance and plant assumptions, the H2 norm suers a major de ciency. This de ciency is due to the fact that the tradeo between disturbance error reduction and sensor noise error reduction is not the only constraint on feedback design. The problem is that these performance tradeos are often overshadowed by a second limitation on high loop gains { namely, the requirement for tolerance to uncertainties. Though a controller may be designed using FDLTI models, the design must be implemented and operated with a real physical plant. The properties of physical systems, in particular the ways in which they deviate from nite-dimensional linear models, put strict limitations on the frequency range over which the loop gains may be large. A solution to this problem would be to put explicit constraints on the loop gain in the penalty function. For instance, one may chose to minimize sup kek2 = kWe So Wd k1 ;
kd~k2 1
subject to some restrictions on the control energy or control bandwidth: sup ku~k2 = kWu KSo Wd k1 :
kd~k2 1
Or more frequently, one may introduce a parameter and a mixed criterion sup
kd~k2 1
n
o
2
So Wd
: kek22 + 2 ku~k22 =
WWueKS o Wd 1
5.8. Notes and References
141
This problem can also be regarded as minimizing the maximum power of the error subject to all bounded power disturbances: let
e
e^ := u~
W S W W S W Se^e^ = W eKSo Wd Sd~d~ W eKSo Wd u o d u o d
then and
sup ke^k2P = sup ~ ~
kdkP 1
kdkP 1
1 Z1
We SoWd 2 ;1 Trace Se~e~(j!) d! = Wu KSo Wd
2
: 1
Alternatively, if the system robust stability margin is the major concern, the weighted complementary sensitivity has to be limited. Thus the whole cost function may be
W S W
We To Wd 1 o 2
1
where W1 and W2 are the frequency dependent uncertainty scaling matrices. These design problems are usually called H1 mixed sensitivity problems. For a scalar system, an H1 norm minimization problem can also be viewed as minimizing the maximum magnitude of the system's steady-state response with respect to the worst case sinusoidal inputs.
5.8 Notes and References The presentation of this chapter is based primarily on Doyle [1984]. The discussion of internal stability and coprime factorization can also be found in Francis [1987] and Vidyasagar [1985]. The loop shaping design is well known for SISO systems in the classical control theory. The idea was extended to MIMO systems by Doyle and Stein [1981] using LQG design technique. The limitations of the loop shaping design are discussed in detail in Stein and Doyle [1991]. Chapter 18 presents another loop shaping method using H1 control theory which has the potential to overcome the limitations of the LQG/LTR method.
142
STABILITY AND PERFORMANCE OF FEEDBACK SYSTEMS
6
Performance Limitations This chapter introduces some multivariable versions of the Bode's sensitivity integral relations and Poisson integral formula. The sensitivity integral relations are used to study the design limitations imposed by bandwidth constraints and the open-loop unstable poles, while the Poisson integral formula is used to study the design constraints imposed by the non-minimum phase zeros. These results display that the design limitations in multivariable systems are dependent on the directionality properties of the sensitivity function as well as those of the poles and zeros, in addition to the dependence upon pole and zero locations which is known in single-input single-output systems. These integral relations are also used to derive lower bounds on the singular values of the sensitivity function which display the design tradeos.
6.1 Introduction One important problem that arises frequently is concerned with the level of performance that can be achieved in feedback design. It has been shown in the previous chapters that the feedback design goals are inherently con icting, and a tradeo must be performed among dierent design objectives. It is also known that the fundamental requirements such as stability and robustness impose inherent limitations upon the feedback properties irrespective of design methods, and the design limitations become more severe in the presence of right-half plane zeros and poles in the open-loop transfer function. An important tool that can be used to quantify feedback design constraints is furnished by the Bode's sensitivity integral relation and the Poisson integral formula. These integral formulae express design constraints directly in terms of the system's sensitivity 143
PERFORMANCE LIMITATIONS
144
and complementary sensitivity functions. A well-known theorem due to Bode states that for single-input single-output open-loop stable systems with more than one polezero excess, the integral of the logarithmic magnitude of the sensitivity function over all frequencies must equal to zero. This integral relation therefore suggests that in the presence of bandwidth constraints, the desirable property of sensitivity reduction in one frequency range must be traded o against the undesirable property of sensitivity increase at other frequencies. A result by Freudenberg and Looze [1985] further extends Bode's theorem to open-loop unstable systems, which shows that the presence of open-loop unstable poles makes the sensitivity tradeo a more dicult task. In the same reference, the limitations imposed by the open loop non-minimum phase zeros upon the feedback properties were also quanti ed using the Poisson integral. The results presented here are some multivariable extensions of the above mentioned integral relations. We shall now consider a linear time-invariant feedback system with an n n loop transfer matrix L. Let S (s) and T (s) be the sensitivity function and the complementary sensitivity function, respectively S (s) = (I + L(s));1 ; T (s) = L(s)(I + L(s));1 : (6:1) Before presenting the multivariable integral relations, recall that a point z 2 C is a transmission zero of L(s), which has full normal rank and a minimal state space realization (A; B; C; D), if there exist vectors and such that the relation
A ; zI B =0 C
D
holds, where = 1, and is called the input zero direction associated with z . Analogously, a transmission zero z of L(s) satis es the relation
x w A ; zI B = 0; C D
where x and w are some vectors with w satisfying the condition w w = 1. The vector w is called the output zero direction associated with z . Note also that p 2 C is a pole of L(s) if and only if it is a zero of L;1(s). By a slight abuse of terminology, we shall call the input and output zero directions of L;1 (s) the input and output pole directions of L(s), respectively. In the sequel we shall preclude the possibility that z is both a zero and pole of L(s). Then, by Lemma 3.27 and 3.28, z is a zero of L(s) if and only if L(z ) = 0 for some vector , = 1, or w L(z ) = 0 for some vector w, w w = 1. Similarly, p is a pole of L(s) if and only if L;1(p) = 0 for some vector , = 1, or w L;1(p) = 0 for some vector w, w w = 1. It is well-known that a non-minimum phase transfer function admits a factorization that consists of a minimum phase part and an all-pass factor. Let zi 2 C + , i = 1; ; k, be the non-minimum phase zeros of L(s) and let i ; i i = 1; be the input directions generated from the following iterative procedure
6.2. Integral Relations
145
Let (A; B; C; D) be a minimal realization of L(s) and B (0) := B ; Repeat for i = 1 to k A ; z I B(i;1) i =0 i C
D
i
B (i) := B (i;1) ; 2(Rezi )i i : Then, the input factorization of L(s) is given by L(s) = Lm (s)Bk (s) B1 (s) where Lm (s) denotes the minimum phase factor of L(s), and Bi (s) corresponds to the all-pass factor associated with zi : zi (6:2) Bi (s) = I ; s2Re + zi i i : In fact, Lm(s) can be written as A B(k) Lm(s) := C D : For example, suppose z 2 C is a zero of L(s). Then it is easy to verify using state space calculation that L(s) can be factorized as A B ; 2(Rez) 2Rez L(s) = C I ; s + z : D Note that a non-minimum phase transfer function admits an output factorization analogous to the input factorization, and the subsequent results can be applied to both types of factorizations.
6.2 Integral Relations In this section we provide extensions of the Bode's sensitivity integral relations and Poisson integral relations to multivariable systems. Consider a unit feedback system with a loop transfer function L. The following assumptions are needed:
Assumption 6.1 The closed-loop system is stable. Assumption 6.2 lim
R!1
sup
s2C+ jsj R
R (L(s)) = 0
PERFORMANCE LIMITATIONS
146
Each of these assumptions has important implications. Assumption 6.1 implies that the sensitivity function S (s) is analytic in C + . Assumption 6.2 states that the open-loop transfer function has a rollo rate of more than one pole-zero excess. Note that most of practical systems require a rollo rate of more than one pole-zero excess in order to maintain a sucient stability margin. One instance for this assumption to hold is that each element of L has a rollo rate of more than one pole-zero excess. Suppose that the open-loop transfer function L(s) has poles pi in the open right-half plane with input pole directions i , i = 1; ; k, which are obtained through a similar iterative procedure as in the last section.
Lemma 6.1 Let L(s) and S (s) be de ned by (6.1). Then p 2 C is a zero of S (s) with zero direction if and only if it is a pole of L(s) with pole direction .
Proof. Let p be a pole of L(s). Then there exists ;a vector such that = 1 ;1
and L;1(p) = 0. However, S (s) = (I + L(s));1 = I + L;1 (s) L;1 (s). Hence, S (p) = 0. This establishes the suciency part. The proof for necessity follows by reversing the above procedure. 2 Then the sensitivity function S (s) can be factorized as
S (s) = Sm (s)B1 (s)B2 (s) Bk (s) (6:3) where Sm (s) has no zeros in C + , and Bi (s) is given by pi Bi (s) = I ; 2Re s + pi i i : Theorem 6.2 Let S (s) be factorized in (6.3) and suppose that Assumptions 6.1-6.2 hold. Then
Z1 0
0k 1 X ln (S (j!))d! max @ (Repj )j j A : j =1
(6:4)
It is also instructive to examine the following two extreme cases. (i) If i j = 0 for all i; j = 1; ; k, i 6= j , then
Z1 0
ln (S (j!))d! max Repi :
(6:5)
(ii) If i = for all i = 1; ; k, then
Z1 0
ln (S (j!))d!
k X i=1
Repi :
(6:6)
6.2. Integral Relations
147
Note also that the following equality holds
Z1 0
ln jS (j!)jd! =
k X i=1
Repi
if S (s) is a scalar function. Theorem 6.2 has an important implication toward the limitations imposed by the open-loop unstable poles on sensitivity properties. It shows that there will exist a frequency range over which the largest singular value of the sensitivity function exceeds one if it is to be kept below one at other frequencies. In the presence of bandwidth constraint, this imposes a sensitivity tradeo in dierent frequency ranges. Furthermore, this result suggests that unlike in single-input single-output systems, the limitations imposed by open-loop unstable poles in multivariable systems are related not only to the locations, but also to the directions of poles and their relative interaction. The case (i) of this result corresponds to the situation where the pole directions are mutually orthogonal, for which the integral corresponding to each singular value is related solely to one unstable pole with a corresponding distance to the imaginary axis, as if each channel of the system is decoupled from the others in eects of sensitivity properties. The case (ii) corresponds to the situation where all the pole directions are parallel, for which the unstable poles aect only the integral corresponding to the largest singular value, as if the channel corresponding to the largest singular value contains all unstable poles. Clearly, these phenomena are unique to multivariable systems. The following result further strengthens these observations and shows that the interaction between open-loop unstable poles plays an important role toward sensitivity properties. Corollary 6.3 Let k = 2 and let the Assumptions 6.1-6.2 hold. Then
Z1 0
p
ln (S (j!))d! 2 Re(p1 + p2 ) + (Re(p1 ; p2 ))2 + 4Rep1 Rep2 cos2 \(1 ; 2 ) : (6:7)
Proof. Note that
Rep 0 1 1 1 2 0 Rep2 2 Rep 0 1 1 1 2 max Re0p Re0p2 21
max ((Rep1 )1 1 + (Rep2 )2 2 ) = max =
= amx = max
1
1 2
2 1 1 Rep1 (Rep1 )1 2 : (Rep2 )2 1 Rep2 0
A straightforward calculation then gives max ((Rep1 )1 1 + (Rep2 )2 2 ) = 21 Re(p1 + p2 )
Rep2
PERFORMANCE LIMITATIONS
148
p
+ 12 (Re(p1 ; p2 ))2 + 4Rep1 Rep2 cos2 \(1 ; 2 ):
2
The proof is now completed.
The utility of this corollary is clear. This result fully characterizes the limitation imposed by a pair of open-loop unstable poles on the sensitivity reduction properties. This limitation depends not only on the relative distances of the poles to the imaginary axis, but also on the principal angle between the two pole directions. Next, we investigate the design constraints imposed by open-loop non-minimum phase zeros upon sensitivity properties. The results below may be considered to be a matrix extension of the Poisson integral relation.
Theorem 6.4 Let S (s) 2 H1 be factorized as in (6.3) and assume that lim
max
R!1 2[;=2;=2]
ln (S (Rej )) R
= 0:
(6:8)
Then, for any non-minimum phase zero z = x0 + jy0 2 C + of L(s) with output direction w, w w = 1,
Z1
Z1
ln (S (j!)) x2 + (!x0; y )2 d! ln (Sm (z )) ln (S (z )): 0 ;1 0
ln (S (j!)) x2 + (!x0; y )2 d! ln w Bk;1 (z ) B1;1 (z ) : 0 ;1 0
(6:9) (6:10)
Note that the condition (6.8) is satis ed if L(s) is a proper rational transfer matrix. Furthermore, for single-input single-output systems (n = 1),
Yk w Bi;1(z) = Yk z + pi i=1 i=1 z ; pi
and
Z1
Yk + pi ln jS (j!)j x2 + (!x0; y )2 d! = ln zz ; pi : 0 ;1 0 i=1
The more interesting result, however, is the inequality (6.10). This result again suggests that the multivariable sensitivity properties are closely related to the pole and zero directions. This result implies that the sensitivity reduction ability of the system may be severely limited by the open-loop unstable poles and non-minimum phase zeros, especially when these poles and zeros are close to each other and the angles between their directions are small.
6.3. Design Limitations and Sensitivity Bounds
149
6.3 Design Limitations and Sensitivity Bounds The integral relations derived in the preceding section are now used to analyze the design tradeos and the limitations imposed by the bandwidth constraint and right-half plane poles and zeros upon sensitivity reduction properties. Similar to their counterparts for single-input single-output systems, these integral relations show that there will necessarily exist frequencies at which the sensitivity function exceeds one if it is to be kept below one over other frequencies, hence exhibiting a tradeo between the reduction of the sensitivity over one frequency range against its increase over another frequency range. Suppose that the feedback system is designed such that the level of sensitivity reduction is given by
(S (j!)) ML < 1; 8! 2 [;!L; !L ]; (6:11) where ML > 0 is a given constant. Let z = x0 + jy0 2 C + be an open right-half plane zero of L(s) with output direction w. De ne also Z !L x0 d!: (z ) := 2 ;!L x0 + (! ; y0 )2 The following lower bound on the maximum sensitivity displays a limitation due to the open right-half plane zeros upon the sensitivity reduction properties.
Corollary 6.5 Let the assumption in Theorem 6.4 holds. In addition, suppose that the condition (6.11) is satis ed. Then, for each open right-half plane zero z 2 C + of L(s) with output direction w,
; z z w Bk;1(z) B1;1 (z) ; z ; kS (s)k1 M L
and
( ) ( )
1
1
kS (s)k1 M L
( )
; z z
( ) ( )
((S (z ))) ;(z) :
(6:12) (6:13)
Proof. Note that
Z1
ln (S (j!)) x2 + (!x0; y )2 d! ( ; (z )) ln kS (j!)k1 + (z ) ln(ML): 0 ;1 0
Then the inequality (6.12) follows by applying inequality (6.10) and inequality (6.13) follows by applying inequality (6.9) 2 The interpretation of Corollary 6.5 is similar to that in single-input single-output systems. Roughly stated, this result shows that for a non-minimum phase system, its
PERFORMANCE LIMITATIONS
150
sensitivity must increase beyond one at certain frequencies if the sensitivity reduction is to be achieved at other frequencies. Of particular importance here is that the sensitivity function will in general exhibit a larger peak in multivariable systems than in singleinput single-output systems, due to the fact that (S (z )) 1. The design tradeos and limitations on the sensitivity reduction which arise from bandwidth constraints as well as open-loop unstable poles can be studied using the extended Bode integral relations. However, these integral relations by themselves do not mandate a meaningful tradeo between the sensitivity reduction and the sensitivity increase, since the sensitivity function can be allowed to exceed one by an arbitrarily small amount over an arbitrarily large frequency range so as not to violate the Bode integral relations. However, bandwidth constraints in feedback design typically require that the open-loop transfer function be small above a speci ed frequency, and that it roll o at a rate of more than one pole-zero excess above that frequency. These constraints are commonly needed to ensure stability robustness despite the presence of modeling uncertainty in the plant model, particularly at high frequencies. One way of quantifying such bandwidth constraints is by requiring the open-loop transfer function to satisfy
(L(j!)) !M1+Hk < 1; 8! 2 [!H ; 1)
(6:14)
where !H > !L , and MH > 0, k > 0 are some given constants. With the bandwidth constraint given as such, the following result again shows that the sensitivity reduction speci ed by (6.11) can be achieved only at the expense of increasing the sensitivity at certain frequencies.
Corollary 6.6 Suppose the Assumptions 6.1-6.2 hold. In addition, suppose that the
conditions (6.11) and (6.14) are satis ed for some !H and !L such that !H > !L . Then 1 !H!;L!L !H (6:15) max (S (j!)) e (1 ; ) k(!H ;!L)
ML
!2[!L ;!H ]
where
=
max
Pk
i=1 (Repi ) i i !H ; !L
:
Proof. Note rst that for ! !H , (S (j!)) = (I + 1L(j!)) 1 ; (1L(j!)) and
Z1
1 Z 1 1 M i X M H H d! ; ln 1 ; !1+k d! = 1+ k !H i=1 !H i !
1
1 ; !M1+Hk
6.4. Bode's Gain and Phase Relation
151
!i
1 1 X
!H MH = 1+k i i (1 + k ) ; 1 ! H i=1 ! 1 1 M !i X ! ! M H H H H k 1+k = ; k ln 1 ; ! 1+k H i=1 i !H ! H ; k ln(1 ; ):
Then
Z1 0
ln (S (j!))d! =
Z !L 0
ln (S (j!))d! +
Z !H !L
ln (S (j!))d! +
Z1
Z1 !H
ln (S (j!))d!
!L ln ML + (!H ; !L ) !2max ln (S (j!)) ; ln 1 ; !M1+Hk d! [!L ;!H ] !H ! !L ln ML + (!H ; !L ) !2max ln (S (j!)) ; kH ln(1 ; ) [! ;! ] L H
and the result follows from applying (6.4).
2
The above lower bound shows that the sensitivity can be very signi cant in the transition band.
6.4 Bode's Gain and Phase Relation In the classical feedback theory, the Bode's gain-phase integral relation (see Bode [1945]) has been used as an important tool to express design constraints in scalar systems. The following is an extended version of the Bode's gain and phase relationship for an openloop stable scalar system with possible right-half plane zeros, see Freudenberg and Looze [1988] and Doyle, Francis, and Tannenbaum [1992]:
Z 1 d ln jLj Yk j!0 + zi j j 1 ln coth 2 d + \ j! ; z \L(j!0 ) = ;1 d i=1 0 i
where zi 's are assumed to be the right-half plane zeros of L(s) and := ln(!=!0 ). Note L(j!)j is the slope of the Bode plot which is almost always negative. It follows that d ln jd that \L(j!0 ) will be large if the gain L attenuates slowly and small if it attenuates rapidly. The behavior of \L(j!) is particularly important near the crossover frequency !c where jL(j!c )j = 1 since + \L(j!c) is the phase margin of the feedback system, and further the return dierence is given by + \L(j! ) c ; 1 j1 + L(j!c )j = j1 + L (j!c )j = 2 sin 2
PERFORMANCE LIMITATIONS
152
which must not be too small for good stability robustness. If + \L(j!c ) is forced to be very small by rapid gain attenuation, the feedback system will amplify disturbances 0 + z i 0 for each i, and exhibit little uncertainty tolerance at and near !c . Since \ j! j!0 ; zi a non-minimum phase zero contributes an additional phase lag and imposes limitations upon the rollo rate of the open-loop gain. The con ict between attenuation rate and loop quality near crossover is thus clearly evident. A thorough discussion of the limitations these relations impose upon feedback control design is given by Bode [1945], Horowitz [1963], and Freudenberg and Looze [1988]. See also Freudenberg and Looze [1988] for some multivariable generalizations. In the classical feedback theory, it has been common to express design goals in terms of the \shape" of the open-loop transfer function. A typical design requires that the open-loop transfer function have a high gain at low frequencies and a low gain at high frequencies while the transition should be well-behaviored. The same conclusion applies to multivariable system where the singular value plots should be well-behaviored between the transition band.
6.5 Notes and References The results presented in this chapter are based on Chen [1992a, 1992b, 1995]. Some related results can be found in Boyd and Desoer [1985] and Freudenberg and Looze [1988]. The related results for scalar systems can be found in Bode [1945], Horowitz [1963], Doyle, Francis, and Tannenbaum [1992], and Freudenberg and Looze [1988]. The study of analytic functions, harmonic functions1 , and various integral relations in the scalar case can be found in Garnett [1981] and Homan [1962].
1 A function : C 7;! R is said to be a harmonic function (subharmonic function) if 52 ( ) = 0 (52 ( ) 0) where the symbol 52 ( ) with = + denotes the Laplacian of ( ) and is de ned by 2 2 52 ( ) := (2 ) + (2 ) f
f s
f s
f s
s
f s
x
jy
f s
@ f s
@ f s
@x
@y
:
7
Model Reduction by Balanced Truncation In this chapter we consider the problem of reducing the order of a linear multivariable dynamical system. There are many ways to reduce the order of a dynamical system. However, we shall study only two of them: balanced truncation method and Hankel norm approximation method. This chapter focuses on the balanced truncation method while the next chapter studies the Hankel norm approximation method. A model order reduction problem can in general be stated as follows: Given a full order model G(s), nd a lower order model, say, an r-th order model Gr , such that G and Gr are close in some sense. Of course, there are many ways to de ne the closeness of an approximation. For example, one may desire that the reduced model be such that
G = Gr + a and a is small in some norm. This model reduction is usually called an additive model reduction problem. On the other hand, one may also desire that the approximation be in relative form Gr = G(I + rel ) so that rel is small in some norm. This is called a relative model reduction problem. We shall be only interested in L1 norm approximation in this book. Once the norm is chosen, the additive model reduction problem can be formulated as inf
deg(Gr )r
kG ; Gr k1
153
154
MODEL REDUCTION BY BALANCED TRUNCATION
and the relative model reduction problem can be formulated as
inf G;1 (G ; Gr ) 1 deg(Gr )r
if G is invertible. In general, a practical model reduction problem is inherently frequency weighted, i.e., the requirement on the approximation accuracy at one frequency range can be drastically dierent from the requirement at another frequency range. These problems can in general be formulated as frequency weighted model reduction problems inf kW (G ; Gr )Wi k1 deg(G )r o r
with appropriate choice of Wi and Wo . We shall see in this chapter how the balanced realization can give an eective approach to the above model reduction problems.
7.1 Model Reduction by Balanced Truncation
A B is a balanced realizaConsider a stable system G 2 RH1 and suppose G = C D
tion, i.e., its controllability and observability Gramians are equal and diagonal. Denote the balanced Gramians by , then A + A + BB = 0 (7:1) A + A + C C = 0: (7:2) 0 Now partition the balanced Gramian as = 01 and partition the system 2 accordingly as 2 3
A11 A12 G = 4 A21 A22 C1 C2
B1 B2 D
5:
Then (7.1) and (7.2) can be written in terms of their partitioned matrices as A11 1 + 1 A11 + B1 B1 = 0 (7.3) 1 A11 + A11 1 + C1 C1 = 0 (7.4) A21 1 + 2 A12 + B2 B1 = 0 (7.5) 2 A21 + A12 1 + C2 C1 = 0 (7.6) A22 2 + 2 A22 + B2 B2 = 0 (7.7) 2 A22 + A22 2 + C2 C2 = 0: (7.8) The following theorem characterizes the properties of these subsystems. Theorem 7.1 Assume that 1 and 2 have no diagonal entries in common. Then both subsystems (Aii ; Bi ; Ci ); i = 1; 2 are asymptotically stable.
7.1. Model Reduction by Balanced Truncation
155
Proof. It is clearly sucient to show that A11 is asymptotically stable. The proof for the stability of A22 is similar. By Lemma 3.20 or Lemma 3.21, 1 can be assumed to be positive de nite without loss of generality. Then it is obvious that i (A11 ) 0 by Lemma 3.19. Assume that A11 is not asymptotically, then there exists an eigenvalue at j! for some !. Let V be a basis matrix for Ker(A11 ; j!I ). Then we have (A11 ; j!I )V = 0 which gives
(7:9)
V (A11 + j!I ) = 0:
Equations (7.3) and (7.4) can be rewritten as
(A11 ; j!I )1 + 1 (A11 + j!I ) + B1 B1 = 0 1 (A11 ; j!I ) + (A11 + j!I )1 + C1 C1 = 0:
(7.10) (7.11)
Multiplication of (7.11) from the right by V and from the left by V gives V C1 C1 V = 0, which is equivalent to C1 V = 0: Multiplication of (7.11) from the right by V now gives (A11 + j!I )1 V = 0: Analogously, rst multiply (7.10) from the right by 1 V and from the left by V 1 to obtain B1 1 V = 0: Then multiply (7.10) from the right by 1 V to get (A11 ; j!I )21 V = 0: It follows that the columns of 21 V are in Ker(A11 ; j!I ). Therefore, there exists a matrix 1 such that 21 V = V 21 : Since 21 is the restriction of 21 to the space spanned by V , it follows that it is possible to choose V such that 21 is diagonal. It is then also possible to choose 1 diagonal and such that the diagonal entries of 1 are a subset of the diagonal entries of 1 . Multiply (7.5) from the right by 1 V and (7.6) by V to get
A21 21 V + 2 A12 1 V = 0 2 A21 V + A12 1 V = 0 which gives
(A21 V ) 21 = 22 (A21 V ):
156
MODEL REDUCTION BY BALANCED TRUNCATION
This is a Sylvester equation in (A21 V ). Because 21 and 22 have no diagonal entries in common it follows from Lemma 2.7 that
A21 V = 0
(7:12)
is the unique solution. Now (7.12) and (7.9) implies that
A
11 A21
A12 A22
V 0
V
= j! 0
which means that the A-matrix of the original system has an eigenvalue at j!. This contradicts the fact that the original system is asymptotically stable. Therefore A11 must be asymptotically stable. 2
Corollary 7.2 If has distinct singular values, then every subsystem is asymptotically
stable.
The stability condition in Theorem 7.1 is only sucient. For example,
2 ;2 ;2:8284 ;2 3 (s ; 1)(s ; 2) = 4 0 ;1 ;1:4142 5 (s + 1)(s + 2) 2
1:4142
1
is a balanced realization with = I and every subsystem of the realization is stable. On the other hand,
3
2
1 1:4142 1:4142 s2 ; s + 2 = 4 ;1;:4142 0 0 5 s2 + s + 2 ;1:4142 0 1 is also a balanced realization with = I but one of the subsystems is not stable.
Theorem 7.3 Suppose G(s) 2 RH1 and
2 A A 11 12 G(s) = 4 A21 A22 C1 C2
B1 B2 D
3 5
is a balanced realization with Gramian = diag(1 ; 2 )
1 = diag(1 Is1 ; 2 Is2 ; : : : ; r Isr ) 2 = diag(r+1 Isr+1 ; r+2 Isr+2 ; : : : ; N IsN ) and
1 > 2 > > r > r+1 > r+2 > > N
7.1. Model Reduction by Balanced Truncation
157
where i has multiplicity si ; i = 1; 2; : : :; N and s1 + s2 + + sN = n. Then the truncated system Gr (s) = AC11 BD1 1
is balanced and asymptotically stable. Furthermore kG(s) ; Gr (s)k1 2(r+1 + r+2 + + N ) and the bound is achieved if r = N ; 1, i.e., kG(s) ; GN ;1 (s)k1 = 2N :
Proof. The stability of Gr follows from Theorem 7.1. We shall now prove the error bound for the case si = 1 for all i. The case where the multiplicity of i is not equal to one is more complicated and an alternative proof is given in the next chapter. Hence, we assume si = 1 and N = n. Let (s) := (sI ; A11 );1 (s) := sI ; A22 ; A21 (s)A12 B~ (s) := A21 (s)B1 + B2 C~ (s) := C1 (s)A12 + C2 then using the partitioned matrix results of section 2.3, G(s) ; Gr (s) = C (sI ; A);1 B ; C1 (s)B1 =
C C sI ; A11 ;A12 ;1 B1 ; C (s)B 1 2 1 1 ;A21 sI ; A22 B2
= C~ (s) ;1 (s)B~ (s) computing this quantity on the imaginary axis to get =2 h ;1 (j! )B~ (j! )B~ (j! ) ; (j! )C~ (j! )C~ (j! )i : (7:13) [G(j!) ; Gr (j!)] = 1max Expressions for B~ (j!)B~ (j!) and C~ (j!)C~ (j!) are obtained by using the partitioned form of the internally balanced Gramian equations (7.3){(7.8). An expression for B~ (j!)B~ (j!) is obtained by using the de nition of B (s), substituting for B1 B1 , B1 B2 and B2 B2 from the partitioned form of the Gramian equations (7.3){(7.5), we get B~ (j!)B~ (j!) = (j!)2 + 2 (j!): The expression for C~ (j!)C~ (j!) is obtained analogously and is given by C~ (j!)C~ (j!) = 2 (j!) + (j!)2 :
158
MODEL REDUCTION BY BALANCED TRUNCATION
These expressions for B~ (j!)B~ (j!) and C~ (j!)C~ (j!) are then substituted into (7.13) to obtain =2 + ;1 (j! ) (j! ) + ; (j! ) (j! ) : [G(j!) ; Gr (j!)] = 1max 2 2 2 2
Now consider one-step order reduction, i.e., r = n ; 1, then 2 = n and
=2 [G(j!) ; Gr (j!)] = n 1max 1 + ;1(j!) [1 + (j!)]
(7:14)
where := ; (j!) (j!) = ; is an \all pass" scalar function. (This is the only place we need the assumption of si = 1) Hence j(j!)j = 1. Using triangle inequality we get
[G(j!) ; Gr (j!)] n [1 + j(j!)j] = 2n :
(7:15)
This completes the bound for r = n ; 1. The remainder of the proof is achieved the order reduction by one step A byB using results and by noting that Gk (s) = C11 D1 obtained by the \k-th" order parti1 tioning is internally balanced with balanced Gramian given by 1 = diag(1 Is1 ; 2 Is2 ; : : : ; k Isk ): Let Ek (s) = Gk+1 (s) ; Gk (s) for k = 1; 2; : : : ; N ; 1 and let GN (s) = G(s). Then
[Ek (j!)] 2k+1 since Gk (s) is a reduced order model obtained from the internally balanced realization of Gk+1 (s) and the bound for one-step order reduction, (7.15) holds. Noting that
G(s) ; Gr (s) = by the de nition of Ek (s), we have
[G(j!) ; Gr (j!)]
NX ;1 k =r
NX ;1 k=r
Ek (s)
[Ek (j!)] 2
NX ;1 k=r
k+1 :
This is the desired upper bound. To see that the bound is actually achieved when r = N ; 1, we note that (0) = I . Then the right hand side of (7.14) is 2N at ! = 0. 2 The singular values i are called the Hankel singular values. A useful consequence of the above theorem is the following corollary.
7.1. Model Reduction by Balanced Truncation
159
Corollary 7.4 Let i ; i = 1; : : : ; N be the Hankel singular values of G(s) 2 RH1 . Then kG(s) ; G(1)k1 2(1 + : : : + N ): The above bound can be tight for some systems. For example, consider an n-th order transfer function n 2j X G(s) = s + 2j ; j =1
with > 0. Then kG(s)k1 = G(0) = n and G(s) has the following state space realization 2 2 3
66 G = 666 4
;
;4
...
2
2
;2n n
77 77 7 n 5 .. .
0 and the controllability and observability Gramians of the realization are given by
i+j
P = Q = 2i+ 2j
and P = Q ! 21 In as ! 1. So the Hankel singular values j ! 12 and 2(1 + 2 + + n ) ! n = kG(s)k1 as ! 1. The model reduction bound can also be loose for systems with Hankel singular values close to each other. For example, consider the balanced realization of a fourth order system 2 ;19:9579 ;5:4682 9:6954 0:9160 ;6:3180 3 66 5:4682 0 0 0:2378 0:0020 77 6 0 0 ;4:0051 ;0:0067 7 G(s) = 6 ;9:6954 4 0:9160 ;0:2378 4:0051 ;0:0420 0:2893 75 ;6:3180 ;0:0020 0:0067 0:2893 0 with Hankel singular values given by
1 = 1; 2 = 0:9977; 3 = 0:9957; 4 = 0:9952: The approximation errors and the estimated bounds are listed in the following table. The table shows that the actual error for an r-th order approximation is almost the same as 2r+1 which would be the estimated bound if we regard r+1 = r+2 = = 4 . In general, it is not hard to construct an n-th order system so that the r-th order balanced model reduction error is approximately 2r+1 but the error bound is arbitrarily close to 2(n ; r)r+1 . One method to construct such system is as follows: Let G(s) be a stable all-pass function, i.e., G(s) G(s) = I , then there is a balanced realization for G so that the controllability and observability Gramians are P = Q = I . Next make
160
MODEL REDUCTION BY BALANCED TRUNCATION
a very small perturbation to the balanced realization then the perturbed system has a balanced realization with distinct singular values and P = Q I . This perturbed system will have the desired properties and this is exactly how the above example is constructed.
r
0 1 2 3 2 1.996 1.991 1.9904 Bounds: 2 4i=r+1 i 7.9772 5.9772 3.9818 1.9904 2r+1 2 1.9954 1.9914 1.9904
kG ; GPr k1
7.2 Frequency-Weighted Balanced Model Reduction This section considers the extension of the balanced truncation method to frequency weighted case. Given the original full order model G 2 RH1 , the input weighting matrix Wi 2 RH1 and the output weighting matrix Wo 2 RH1 , our objective is to nd a lower order model Gr such that
kWo (G ; Gr )Wi k1 is made as small as possible. Assume that G; Wi , and Wo have the following state space realizations
A B A B A B i i G = C 0 ; Wi = C D ; Wo = Co Do i i o o
with A 2 Rnn . Note that there is no loss of generality in assuming D = G(1) = 0 since otherwise it can be eliminated by replacing Gr with D + Gr . Now the state space realization for the weighted transfer matrix is given by
2 A 0 BC BD 3 " A B # i i 6 7 B C A 0 0 o o Wo GWi = 64 0 0 Ai Bi 75 =: : C 0 Do C Co
0
0
Let P and Q be the solutions to the following Lyapunov equations AP + P A + B B = 0 Q A + A Q + C C = 0:
(7.16) (7.17)
Then the input weighted Gramian P and the output weighted Gramian Q are de ned by I I n P := In 0 P 0 ; Q := In 0 Q 0n :
7.3. Relative and Multiplicative Model Reductions
161
It can be shown easily that P and Q satisfy the following lower order equations
A 0
BC A
i
i
P P12 P12 P22
+
A
P P12 P12 P22
BC A
i
0
i
BD BD i
B
+
i
B
i
i
=0
:
(7 18)
Q Q12 Q12 Q22
A 0 BC A o
o
+
A 0 BC A o
o
Q Q12 Q12 Q22
C D C D C
+
o
o
C o
o
:
=0
:
(7 19)
The computation can be further reduced if Wi = I or Wo = I . In the case of Wi = I ,
P can be obtained from
PA + AP + BB = 0
(7:20)
while in the case of Wo = I , Q can be obtained from
QA + A Q + C C = 0: Now let T be a nonsingular matrix such that
(7:21)
TPT = (T ;1 ) QT ;1 = 1 2
(i.e., balanced) with 1 = diag(1 Is1 ; : : : ; r Isr ) and 2 = diag(r+1 Isr+1 ; : : : ; n Isn ) and partition the system accordingly as
TAT ;1 TB 2 A11 A12 B1 3 4 5 CT ;1 0 = A21 A22 B2 : C1
Then a reduced order model Gr is obtained as
Gr =
A
11 C1
C2
0
B1 : 0
Unfortunately, there is generally no known a priori error bound for the approximation error and the reduced order model Gr is not guaranteed to be stable either.
7.3 Relative and Multiplicative Model Reductions A very special frequency weighted model reduction problem is the relative error model reduction problem where the objective is to nd a reduced order model Gr so that
Gr = G(I + rel )
MODEL REDUCTION BY BALANCED TRUNCATION
162
and krel k1 is made as small as possible. rel is usually called the relative error. In the case where G is square and invertible, this problem can be simply formulated as
G;1 (G ; G )
: min r 1 degG r r
Of course the dual approximation problem Gr = (I + rel )G can be obtained by taking the transpose of G. We will show below that, as a bonus, the approximation Gr obtained below also serves as a multiplicative approximation: G = Gr (I + mul ) where mul is usually called the multiplicative error. Theorem 7.5 Let G; G;1 2 RH1 be an n-th order square transfer matrix with a state space realization A B G(s) = C D :
A ; BD;1C ;BD;1 ;1 ;1 .
Let Wi = I and Wo = G;1 (s) =
D C D (a) Then the weighted Gramians P and Q for the frequency weighted balanced realization of G can be obtained as PA + AP + BB = 0 (7:22) Q(A ; BD;1 C ) + (A ; BD;1 C ) Q + C (D;1 ) D;1 C = 0: (7:23) (b) Suppose the realization for G is weighted balanced, i.e., P = Q = diag(1 Is1 ; : : : ; r Isr ; r+1 Isr+1 ; : : : ; N IsN ) = diag(1 ; 2 ) with 1 > 2 > : : : > N 0 and let the realization of G be partitioned compatibly with 1 and 2 as
2A A B 3 1 11 12 G(s) = 4 A21 A22 B2 5 : C1
Then
Gr (s) =
A
C2 D
is stable and minimum phase. Furthermore
krel k1 kmul k1
N Y
i=r+1 N Y
i=r+1
q
1 + 2i (
q
1 + 2i (
B1 D
11 C1
1 + 2 + i )
;1
1 + 2 + i )
; 1:
i
i
7.3. Relative and Multiplicative Model Reductions
163
Proof. Since the input weighting matrix Wi = I , it is obvious that the input weighted Gramian is given by P . Now the output weighted transfer matrix is given by
G;1 (G ; D) =
2 A 3 " 0 B B # A ; 1 ; 1 4 ;BD C A ; BD C 0 5 =: : C 0 ;1 ;1 D C
It is easy to verify that
D C
Q Q := Q Q Q
0
satis es the following Lyapunov equation Q A + A Q + C C = 0: Hence Q is the output weighted Gramian. The proof for part (b) is more involved and needs much more work. We refer readers to the references at the end of the chapter for details. 2 In the above theorem, we have assumed that the system is square, we shall now extend the results to include non-square case. Let G(s) be a minimum phase transfer matrix with a minimal realization
B G(s) = CA D
and assume that D has full row rank. Without loss of generality, we shall also assume that D such that DD = I . Let D? be a matrix with full row rank such isDnormalized that D is square and unitary. ?
Lemma 7.6 A complex number z 2 C is a zero of G(s) if and only if z is an uncontrollable mode of (A ; BD C; BD? ).
A B Proof. Since D has full row rank and G(s) = C D is a minimal realization, z is a transmission zero of G(s) if and only if
A ; zI B C
D
does not have full row rank. Now note that
A ; zI B I C
D
0
2 I 0 0 4 ;C I [D ; D ] ?
0
0 0
0 I
3 5
MODEL REDUCTION BY BALANCED TRUNCATION
164
Then it is clear that
BD ? : = A ; BD0 C ; zI BD I 0
A ; zI B C
does not have full row rank if and only if
D
A ; BD C ; zI BD ?
does not have full row rank. By PBH test, this implies that z is a zero of G(s) if and only if it is an uncontrollable mode of (A ; BD C; BD? ). 2
Corollary 7.7 There exists a matrix C~ such that the augmented system
A B 2 A B 3 G(s) Ga := C D = 4 C D 5 = G~ (s) a a C~ D?
is minimum phase.
Proof. Note that the zeros of Ga are given by the eigenvalues of
D ;1 C ~ A;B D C~ = A ; BD C ; BD? C: ?
Hence C~ can always be chosen so that A ; BD C ; BD? C~ is stable.
2
If the previous model reduction algorithms are applied to the augmented system Ga , the corresponding P and Q equations are given by PA + AP + BB = 0 Q(A ; BDa;1 Ca ) + (A ; BDa;1 Ca ) Q + Ca (Da;1 ) Da;1 Ca = 0: Moreover, we have " ^ # " # G(s) = G(s) (I + ); G(s) = G^ (s) (I + ) rel mul G~ (s) G~ (s) G^~ (s) G^~ (s) and G^ (s) = G(s)(I + rel ); G(s) = G^ (s)(I + mul ): However, there are in general in nitely many choices of C~ and the model reduction results will in general depend on the speci c choice. Hence an appropriate choice of C~ is important. To motivate our choice, note that the equation for Q can be rewritten as Q(A;BD C )+(A;BD C ) Q;QBD? D? B Q+C C +(C~ ;D? B Q) (C~ ;D?B Q) = 0
7.3. Relative and Multiplicative Model Reductions A natural choice might be
165
C~ = D?B Q:
The existence of a solution Q to the following so-called algebraic Riccati equation
Q(A ; BD C ) + (A ; BD C ) Q ; QBD? D? B Q + C C = 0 such that
A ; BDa;1 Ca = A ; BD C ; BD? C~ = A ; BD C ; BD? D? B Q is stable will be shown in Chapter 13. In the case where the model is not stable and /or is not minimum phase, the following procedure can be used: Let G(s) be factorized as G(s) = Gap (s)Gmp (s) such that Gap is an all-pass, i.e., Gap Gap = I , and Gmp is stable and minimum phase. Let G^ mp be a relative/multiplicative reduced model of Gmp such that
G^ mp = Gmp (I + rel ) and
Gmp = G^ mp (I + mul):
Then G^ := Gap G^ mp has exactly the same right half plane poles and zeros as that of G and G^ = G(I + rel ) G = G^ (I + mul): Unfortunately, this approach may be conservative if the transfer matrix has many nonminimum phase zeros or unstable poles. An alternative relative/multiplicative model reduction approach, which does not require that the transfer matrix be minimum phase but does require solving an algebraic Riccati equation, is the so-called Balanced Stochastic Truncation (BST) method. Let G(s) 2 RH1 be a square transfer matrix with a state space realization
B G(s) = CA D
and det(D) 6= 0. Let W (s) 2 RH1 be a minimum phase left spectral factor of G(s)G (s), i.e, W (s)W (s) = G(s)G (s): Then W (s) can be obtained as
A B W W (s) = CW D
MODEL REDUCTION BY BALANCED TRUNCATION
166 with
BW = PC + BD CW = D;1 (C ; BW X ) where P is the controllability Gramian given by
AP + PA + BB = 0
(7.24)
and X is the solution of a Riccati equation
XAW + AW X + XBW (DD );1 BW X + C (DD );1 C = 0
(7:25)
X is stable. The with AW := A ; BW (DD );1 C such that AW + BW (DD );1 BW realization G is said to be a balanced stochastic realization if
2I 66 1 s 2Is P = X = 64 1
2
...
n Isn
3 77 75
with 1 > 2 > : : : > n 0. i is in fact the i-th Hankel singular value of the so-called \phase matrix" (W (s));1 G(s).
Theorem 7.8 Let G(s) 2 RH1 have the following balanced stochastic realization
A B 2 A11 A12 B1 3 G(s) = C D = 4 A21 A22 B2 5 C1
C2 D
with det(D) 6= 0 and P = X = diag(M1 ; M2 ) where
M1 = diag(1 Is1 ; : : : ; r Isr ); M2 = diag(r+1 Isr+1 ; : : : ; n Isn ): Then
G^ = A11 B1
C1 D
is stable and
n 1+
;1
Y i ;1
G (G ; G^)
1 1 ; i i=r+1 n 1+
;1
Y i
G^ (G ; G^ )
1 1 ; i ; 1: i=r+1
7.4. Notes and References
167
It can be shown that the balanced stochastic realization p and the self-weighted balanced realization in Theorem 7.5 are the same and i = i = 1 + i2 if G(s) is minimum phase. To illustrate, consider a third order stable and minimum phase transfer function 3 + 2s2 + 3s + 4 G(s) = ss3 + 3s2 + 4s + 4 :
It is easy to show that the Hankel singular values of the phase function is given by
1 = 0:55705372196966; 2 = 0:53088390857035; 3 = 0:03715882438832; and a rst order BST approximation is given by + 0:00375717470515: G^ = ss + 0:00106883052786 The relative approximation error is 2:51522024045904 and the error bound is
Y3 1 + i
i=2 1 ; i
; 1 = 2:51522024046226:
7.4 Notes and References The balanced model reduction method was rst introduced by Moore [1981]. The stability properties of the reduced order model were shown by Pernebo and Silverman [1982]. The error bound for the balanced model reduction was shown by Enns [1984] and Glover [1984] subsequently gave an independent proof. The frequency weighted balanced model reduction method was also introduced by Enns [1984] from a somewhat dierent perspective. The error bounds for the relative and multiplicative approximations using the self-weighted balanced realization were shown by Zhou [1993]. The Balanced Stochastic Truncation (BST) method was proposed by Desai and Pal [1984] and generalized by Green [1988a,1988b] and many other people. The relative error bound for the Balanced Stochastic Truncation method was obtained by Green [1988a] and the multiplicative error bound for the BST was obtained by Wang and Safonov [1992]. It was also shown in Zhou [1993] that the frequency self-weighted method and the BST method are the same if the transfer matrix is minimum phase. Improved error bounds for the BST reduction w