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!
R be defined by
Show that if// e [1, oo) and if/?' #/?, then/ p <£Z/, b u t / , eL p . 11
Remark In later applications, we shall consider functions from U+ into IR". In this case, all above definitions hold, except that \f(t)\ is interpreted as the chosen norm of the vector f(t) e Un; one norm in Un is chosen once and for all for the whole development. Since all norms in Un are equivalent, norms in Rn are selected for numerical convenience and for obtaining best bounds.
12
Notation Sometimes we consider functions on IR (or IR+) to IR (or Un). To keep track of these cases we use the symbol
and a similar definition for L/(U). In case n = 1, we drop the subscript n. Once it is understood that we consider IR (or IR+) exclusively, we then use the abbreviation Lnp.
4
Geometric interpretation of norms
In order to obtain a more intuitive interpretation of norms, we show below that to every norm is associated a certain type of convex set. Conversely, to any such convex set is associated a norm. We start by defining some concepts. 1 Let £ be a linear space, over IR or C. A set K in E is said to be convex iff x,y e K^> Xx + (1 - X)y e K, MXe [0, 1]. A set K in E is said to be balanced (equilibre) iff x e K=> ocx e K, V | a | < 1. A set K in E is said to be absorbing iff x e E =>3A(x) > 0 such that xeX(x)K. The set {y\y = Xx, XeU+) is called the ray Ox. 2
Theorem Let E be a linear space. (A) If N: E-> U+ is a norm on E, then the unit ball associated with N( •), namely, the set B = {xeE\N(x)<
1}
is convex, balanced, absorbing and B intersects every ray Ox on a finite interval (i.e., \fx e E, 3XN < oo such that Ox n B = {y | y = Xx, 0 < X < XN}).
4
GEOMETRIC
INTERPRETATION
OF
NORMS
19
(B) If the set K c E is convex, balanced, absorbing and if K intersects every ray Ox on a finite interval, then the function pK: E-+ U+ defined by 3
PK(X)
4 inf{A | A > 0 and x e XK}
is a norm on E. 4
Remark The ray condition is indispensable; to wit, let K c U2 and K = {(x,y)\xe R, \y\ < 1}. Clearly K is convex, balanced, and absorbing, but pK is not a norm [pK(x0) = 0 for x 0 = (1, 0)]. Proof (A) By assumption N is a norm. (i) B is convex because x, y e B imply JV(X) < 1, N(y) < 1. Now VAe[0, 1]. iV[Ax + (1 - % ] <
JV(AJC)
+ JV[(1 - X)y] = XN(x) + (1 - A)iV(>0 < 1
Hence Ax + (1 — A)y is in B, for all 2 e [0, 1]. (ii) B is balanced because x e B=>N(x) < 1. Hence V | a | < 1, N(ocx) = |a|iV(jc) < |a| < 1; i.e., axeB for all |a| < 1. (hi) B is absorbing because for any xe E, N(x) < oo and x/N(x) eB; i.e., xe N(x)B. (iv) OxnB = {Xx\X > 0 and N(Xx) < 1}. Now N(Xx) < 1 <=> \X\ < l/N(x); hence Ax e Ox n £ iff 0 < A < l/7V(x). (B) By assumption K has the four properties; we have to show that the function pK satisfies the axioms of a norm. (i) Obviously by (3), pK(0) = 0. Next we show that x ^ 0 =>pK(x) > 0 by contradiction. Suppose x0 ^ 6 and pK(x0) = 0 = inf{A | A > 0, x0 e AK}. Hence VA > 0, x 0 e AX; i.e., (1/A)x0 e K. Hence the whole ray Ox0 is contained in K. (ii) Since K is absorbing, pK(x) < oo for any XE E. (iii) pK(ocx) = \oc\pK(x) because K is balanced. Indeed, axeXK for some A implies | a | x e XK or x e (A/1 a | )X. Hence (iv) ^ ( x + y) < pK(x) + follows from the convexity of K and the definition of pK. By definition of pK, for any e > 0, —— and —— eK pK(x) + e pK(y) + 8 Since K is convex (we drop the subscript K for simplicity), I"
Pix) + 8
1
x
+
f
p(y) + e
So, Ve > 0, x + y c [/?(x) + /?O0 + 2e]K; hence /?(x + .y) < i?(x) + Xy).
II
20
5
NORMS
Induced norms of linear maps
5.1
The space of linear maps
Let E be a linear space over the field IK, which is U or C. Let &(E, E) be the class of all linear maps from E into E. 3{E, E) is a linear space if the addition of A and B is defined by 1
{A + B)x = Ax + Bx,
VJC
e E,
VA, B e S(E, E)
and the scalar product of a and A is defined by 2
(<xA)(x) = a(Ax),
VaeK,
Vxe£,
VAe&(E,E)
In addition, the product AB can be defined as the composition of the maps A and B: 3
(AB)(x) = A(Bx),
Vx e E,
VA, B e ${E, E)
Note that the product is not commutative. It is easy to check that (i) (ii) (iii) (iv)
multiplication defined by (3) is associative; addition and multiplication are distributive; multiplication and scalar multiplication commute; /, the identity map from E into E, is the unit of the multiplication.
Thus with the three operations defined by (1), (2), and (3), &(E, E) is a (noncommutative) algebra with a unit. (Refer to Appendix D for a discussion of algebras.) 4
Remark With obvious but simple modifications, the considerations of this chapter apply to linear maps from a linear space E to a linear space F. In Section 5.2, where we introduce induced norms, it becomes then crucial to distinguish between the norms on the domain and the norms on the range. To avoid cluttering the notation, we restrict ourselves to J^(£, E), i.e., to the case where the domain and the range are the same spaces.
5.2
Induced norms
Let | • | be a norm on E and A e S(E, E). Define the function || • || from a subset of ££{E, E) into U+ by 5 6 7
Fact Definition (5) is equivalent to \\A\\ = sup \Az\ |z| = l
5
8
INDUCED
NORMS
OF LINEAR
MAPS
21
\\A\\ is called the induced norm of the linear map A or the operator norm induced by the vector norm | • |. To show that (5) and (7) are equivalent, let z = x/\x\, then !!
To interpret (7) geometrically, let K be the convex, balanced, absorbing set corresponding to the vector norm | • |; i.e., the unit ball K±{xeE\\x\
< 1}
Let AK denote the image of K under the map A. Then (7) is equivalent to 9 Roughly speaking, \\A\\ is the smallest magnification factor X for which XK includes AK. 10
Theorem Let | • | be any norm on C". Let A be a nonsingular linear map from C" to Cn. Let ||-|| denote the induced norm on n x n matrices with elements in C. U.t.c. (a) There is a constant P which depends only on n and | • | such that
11 (b) If Euclidean norms are used, then ft < 1. Proof (a) From the equivalence of norms and (2.3), there are constants az and ocu such that
Then (11) follows from Cramer's formula. (b) By polar decomposition A = UH where U is unitary (i.e., UU* = I) and H is Hermitian. Note that |det >41 = |det U\ \det H\ = | d e t / / | Since A is nonsingular and H2 = A*A, H is positive definite. Call hu h2, . . . , hn its eigenvalues and order them so that 0 < ht < h2 < • • • < hn. By the properties of the (operator) norm induced by the Euclidean norm [see (1.18)],
12
22
II
NORMS
So
Note that the inequality (13) holds with equal sign if h2 = hn. In fact, the right-hand side of (13) is equal to the left-hand side times Y\k=2 (hjhk).
5.3
Continuous linear maps
Let (E, |-|) be a normed space over the field IK, and let ||-|| be the induced norm on some subspace of &{E, E). We define 14
&{E, E)^{Ae
&(E, E)\\\A\\ < oo}
Theorem U.t.c. VA, B e JS?(£, E), Va e IK, Vx e £
Proof
All these inequalities follow directly from Definition (7). For example, M2?|| = sup \ABz\ < \\A\\ sup \Bz\ = \\A\\ \\B\\ \z\ = l
ss
\z\ = l
The inequalities above show that S£{E, E) is a normed algebra. It can be shown that if (E, | • |) is complete (i.e., if E is a Banach space), then J£(E, E) is also a Banach algebra with the norm (7). It is, in fact, a noncommutative Banach algebra with a unit. Exercise 1 Let A e 3{E, E). Show that the following three statements are equivalent: (i) The linear function A is continuous at 6 e E. (ii) The linear function A is continuous on E. (iii) The induced norm of A, \\A\\, is finite. This exercise justifies our saying that ££{E, E) is the class of all continuous linear maps from the normed space E into E. Some authors call the elements of J£(E, E) " bounded " linear maps. This terminology conflicts with the general definition of a bounded map from a normed space into another normed space. What they mean is that A e J£(E, E), iff A e 2(E, E), and the restriction of A to the unit ball is a bounded map.
6
TWO EXAMPLES
23
Remark Suppose that on 3?(E, E) we define a norm N(-) which, in addition to the axioms of the norm, satisfies 19
N(AB) < N(A)N(B) and suppose that we have a vector norm | • | such that
20
\Ax\
VxeE,
VAe£(E,E)
Then we say that N(-) is an (operator) norm on S{E, E) compatible with the (vector) norm | • | on E. Exercise 2 (i) If ||-|| is the norm induced by | • | and if N(-) is any norm compatible with | • |, show that 21 \\A\\
6
Two examples
The two examples that follow are designed to illustrate the fact that the induced norm depends on the vector norm. The results of these examples will be useful later. Example 1 Let (E, \'\j = L°°([R+) = {/: U+ -> Rlll/IL < oo}. Let H be a linear map defined on E in terms of an integrable function h: U -> U; 1
H:ut-+Hu^h*u,
Vw e L00
i.e., 2
(Hu)(t) = f hit- T)W(T) dT,
Vr e U+
We assume that \\hWi = Jo \h(t)\ dt < oo. 3
Theorem (a) (b)
U.t.c.
H: L00 -> L00 \\H\\, the induced norm of the linear map / / , is given by
II
24
NORMS
and ||A*w||oo can be made arbitrarily close to ||/?Hi||w||oo by appropriate choice of u. Proof We start by calculating the induced norm of H. We drop the subscript oo throughout; e.g., \\u\\ denotes the L00 norm of u: U+ -* M. We have three norms in this proof: the absolute value of real numbers, e.g., |w(r)|; the norm on L°°, e.g., ||w||; the induced norm on ££(E, E), namely, \\H\\. 4
\\H\\ = sup \\h * u\\ = sup sup | (h * u)(i)\ ||u|| = i
||«|| = i r > 0
Since \\u\\ = 1,
Hence
This inequality shows that H is a continuous linear map from L°° into L00. Inequality (5) shows also that ||>^||± is an upper bound on the induced norm of the map H: L00 -* L00. Let us show that \\hWi is the induced norm. Consider a sequence of inputs ul9 u2, . . . , with \\ut\\ = 1, where for t = 1, 2, 3, . . . , we define ut: x\->ut(i) = sgn[h(t — T)],
T e U+ ,
t el
+
and we take /*(f) = 0 for t < 0. Consider now the value at time t of the output due to ut(')
where
denotes the norm on £. Hence for t = 1, 2, 3, . . . , we have by (5)
Letting £ -> oo, these inequalities imply that \H\ = p l ^ .
"
Example 2 Let E = L2(U) = {/: R -• R | ||/|| 2 < oo}. Let # be a linear map defined on L2 by H: u\-+Hu, where 6
6
7
TWO
EXAMPLES
25
Theorem If the linear map His defined by (6), where he I}, then (a) (b)
H:L2-+L2, || # | | 2 , the induced norm of the linear map H e J£?(L2, L2), is given by
8
|| H || 2 =max\h(jco)\ coeM
Proof Since he I}, its Fourier transform J^(/z) = h(jco) is uniformly continuous on U and -»0 as \co\ -• oo. (See Appendix B.1.1.) Now, with all integrals below being over U, we have \\Hu\\22 = |A * t/||22 = J (A * u)(t)(h * w)(0 A = — \{h * u)(jco)(h * u)(j(o)* Jco
(Parseval)
271 J
= —
I n(jco) | 2 1fl(jcu)| 2
(convolution theorem)
By Parseval,
Hence, Vw such that ||w||2 = 1,
Thus, the induced norm satisfies 9
\\H\\2 < max | h(joj) \ aeU
Note that since coh-» \h(jco)\ is continuous on R and ->0 as |co| -> oo, the maximum exists. We are going to show that \\H\\2 is actually equal to the right-hand side of (9). Observe that for X > 0, &(e-**2) = (n/X)l/2 e x p [ - co2/4A] and [exp(-Ar 2 ) cos a>0t] = K^M) 1/2 {exp[-(c» - co0)2/4A] + exp - [(co + co0)2/U]} As A->0, this expression tends to n[S(co — a>0) + 8(co + co0)], where <$(•) denotes the Dirac delta (generalized) function. Pick co0 to be the abscissa of the maximum of coi-> | ft(jco)\; for each X pick a normalization «(A) such that ux(i) = n(X)[exp( — Xt2)] cos co01
26
II
NORMS
has unit norm. Since | h(jco) | is continuous, we see that \\h * uAi ->max|/J(jco)|
as
2->0
CO
Consequently, we have shown that ||#|| 2 =max|fi(/c>)|
ss
CO
10
Remark These results can be generalized to the case where u and h * u are vector valued; i.e., map M+ into Un. We state the result as an exercise. Exercise 1 Let u: U+ ->Un and let u be locally integrable. Let H be the matrix impulse response; so H: U+ -• UnXn. Assume throughout that the elements of H, namely, the h^-ys, are in L1, for i,j=l,2,...,n. Denote by H the linear operator defined by H: M H H u = H * u
where (H * u)(t) = J
o
H(t - T)W(T) dx
Establish the following induced norms: (a) w eL„°°(IR+): \\u\\^ = max,- sup,> 0 |u t (i)|; show that the induced norm of H is
(b) weL n 2 ((R + ): ||w||22 = Jg5 £j»=1 l M *(0| 2 <&; show that the induced norm of H is ||H|| 2 = (i m a x ) 1 / 2
12 where 13
Amax = max max ^t[li(jco)*ti(j(o)] where ^(Af) denotes the (necessarily real) iih eigenvalue of the Hermitian matrix M. (c) ueLn\U+): IMU = Jo E"=i lw*(0l
14
(column sum)
7
7
NORMS
AND
SPECTRAL
RADIUS
27
Norms and spectral radius Letv4eC n X M and
where r(A) is called the spectral radius of A. 2
Exercise 1 Show that for any induced norm, r(A) < \\A\\. For the given matrix A, we may try to find a norm on Cn that gives the "minimum" induced norm for A. In fact, we shall prove the following theorem.
3
Theorem Let Jf denote the set of all norms on C"; then for any A e CnXn, inf [ s u p ( M * | / | x | ) l = r(A) J
UeC"
\-\eJT
By the definition of the infimum, (4) is equivalent to inequality (2) and the statement that for any e > 0 and any A eCnXn, there is a (vector) norm on C" such that the corresponding induced norm satisfies \\A\\
Let J be the Jordan form of A; then there is a nonsingular matrix P J =PAP~X
=A+U
where A is diagonal and all the elements of U are either 0 or 1 with all nonzero elements located on the diagonal above the main diagonal. For some small 3 > 0, define the nonsingular matrix D by
Then DJD'1
=A + 3U
Define a norm | • | on C" by xi-> \DPx\2 where | • 12 is the Euclidean norm on Cn. The corresponding induced norm is ||^41| =max|^4x| =
max
|x| = l
|DPx|2=l
\DPAx\2
II
28
With z 4 DPx, we have
Z>P^(JC
NORMS
= DPAP~xD~xz
= (A + 8U)z; consequently,
2
M|| = max <(A + SU)z\(A + SU)z} < max{|Az| 2 2 + 231
+ <S2|l/z|22}
< r(^) 2 + 2(5r(^) + (52 or \\A\\
::
The trouble with this result is that the vector norm must be specially tailored for the matrix A. It is, however, useful in applications where the problem involves only one matrix; for in that case the norm can be tailored to that matrix. Exercise 2 Let N be a norm on C". Show that xt-+N(Px) is a norm on Cn if and only if P is a nonsingular matrix eCnXn. Show that if P is singular, then p: x\-^N(Px) satisfies axioms (ii) and (iii) of the norms [see (II. 1.1)], but (i) is replaced by (i7) p ( * ) > 0 ,
VieC".
(In such a case, p is called a seminorm.) Exercise 3 (contraction mapping theorem) The following is a statement of the contraction mapping theorem in a form particularly useful for applications. The proof is essentially the same as the usual textbook case. Let (P, d) be a metric space and (^,|| • ||) be a Banach space. Let p0eP and XQ e J1. Consider the closed balls : BP =
{peP\d(p-p0)
B® = {xe &\\\x-x0\\
If (i) f: BP x B<%-> & and/is continuous in BP x BM; (ii) there is some k < 1 such that \\f(P,x)-f(p,x')\\ (iii)
\\f(p, x0) - x01| < (1 - k)rm,
VpeBP, ty?
Vx, x' e Bm
e BP
then (a) Vp G BP, the iteration scheme *n+i(p) =fU>> xn(p)]9
with x0(p) = x0
8
THE M E A S U R E
OF A
MATRIX
29
converges to a unique continuous function x: BP -> Bm such that
x(p)=flP,x(p)l
^peBP
(b) the convergence is uniform inp over BP; i.e., for the given k and the given BP, \\x(p) ~ xa(p)\\ < knrm,
VpeBP,
V/i e Z +
(Hint: Be sure to verify that xn{p) e i?^ for all n > 1, and a l l p e BP.) In general, any function such as /(/?, •)> which maps a set i?^ into a Banach space ^ and which satisfies an inequality like (ii) above, is called a contraction over Bm. Exercise 4 Let A be a continuous linear map from a Banach space E into itself. We say that X e C is a spectral value of ^ iff ^4 — XI does not have a continuous inverse on E. Call the spectrum of A, Sp(^4), the set of all spectral values of A, and the spectral radius of A, the positive number *(A) ^
sup \X\ XeSp(A)
(a)
Show that
(A-Xiy1^
00
-^X^k+l)Ak
k= 0
and that the series converges absolutely [in ££{E\ E)] for |A| > ||^4||. (b) Show that (A - Xiy1 e &(E; E)for \X\> Sp(A). Exercise 5 Let A, B e £P(E\ E), E a Banach space. Show that it is not generally true that *(AB) < \\A\\*(B)9
*(AB) < *(A)*(B)
(Hint: Consider 2 x 2 matrices, one of which is nil potent.)
8
The measure of a matrix
Let | • | be some norm on Cn. Let || • || denote the corresponding induced norm on the n x n matrices in CnX\ The function ||-||: CnXn -> U+ is a convex function; therefore, at every point I e C " x " , ||-|| has a one-sided directional derivative in any direction AeCnXn; i.e., the limit Km(\\X+OA\\e\o exists for all X and all A.
\\X\\)/6
II
30
NORMS
The one-sided directional derivative of ||-|| at / e C nX " in the direction A is called the measure of the matrix A and is denoted by fi(A). Thus, 1
ii(A) ^ l i m ( | | / + 6U|| - l ) / 0 We shall prove the existence of this limit in Lemma (4) below. The concept of the measure of a matrix appears naturally in the study of differential equations. Consider x(t) = A(i)x(i), where A(-) is continuous. Let us bound the one-sided derivative in the positive direction of t H» |>(0I> where 0(-) is a solution of the differential equation: D+\$(t)\
2
Mim[|0(* + 0)| - |0(O|]/0
= iim[|M) +0.4OMOI
-\Ht)\]/e
e\o
< lim[||/ + 6A(t)\\ \
/)+|
3
Inequality (3) is sharper than the standard one D+\$(t)\<\\A(t)\\
|0(O|
Indeed, fi(A(t)) may be negative, whereas \\A(t)\\ is always nonnegative. 4
Lemma For any A eCnXn, n{A) is well defined. Proof Call/(0) the ratio in (1); we show that f(6) decreases as 6 \ 0 and that it is bounded below. Hence as 6 decreases to O,/(0) tends to a well-defined limit. Let k e (0, 1). k0f(k6) =\\I + k6A\\ - 1 = |Jfc(J + 6A) + (1 - k)I\\ - 1 < A: ||7 + 0A\\ + l - k - l = k(\\I + 0A\\ - 1)
= W(0) So for ke(0, 1), f(kQ)
::
Properties of n For convenience, we list a number of properties of \i in the following theorem.
8
5
Theorem
6
(a)
THE MEASURE
OF A M A T R I X
31
Let A, B e C"x", and \i be given by (1). Then KI)=h
K-I)=~h
M0) = 0
(Note: fi(A) = 0 does not imply that A — 0.)
7
(b)
8
(c)
fi(cA) = cfi(A)9
9
(d)
/i(4 + d) = fi(A) + c,
10
(e) max[/jL(A) - fi(-B\ (f)
11
-fi(-A)
nXn
fi:C
-^U
+
JI(B)]
Vc e R < fi(A + B) < p{A) + fi(B)
is convex on CnXn
/*[A4 + (1 - A)5] < Xii(A) + (1 - A)/x(£), (g)
12
| ii{A) - KB) \fi(A)-KB)\
13
Mc > 0
(h)
14
\<\fi(A-B)\<\\A-B\\ < \KB-A)\
<\\A-B\\
-fi(-A)
(i) —/i( —v4)|x| < \Ax\
VA G [0, 1]
and
V/e{l, 2, . . . , n) - ^ ) | x | < |^x|, V ^ e C
(Afate: | Ax | w not bounded above by ju(^4) \x\.) (j) Let | • | be a norm on Cn and P e CnXn be nonsingular. Call fiP the measure defined in terms of the induced norm corresponding to the vector norm |-| P defined by x\-> \x\P = \Px\. Then fiP(A) = ix(PAP-1)
15 (k)
If A is nonsingular,
16 Proof
(a) Immediate from Definition (1). (b) The triangle inequality and 9 > 0 give
and
Finally, the relation between fi(A) and — fi{ — A) follows from 0 = ||/ + 6(A - A)\\ - 1 < (||/ + 28A\\ - 1 + ||/ - 26A\\ - l)/2 (c) (8) is true for c = 0 in view of (6). For c> 0, observe that (||/ + 6cA\\ - l)/0 = c(\\I + cOA\\ - l)/cd
32
II
NORMS
Since c > 0, as 0 \ O , so does cO. (d) Consider 11/ + 6(A + cl)\\ - 1 = (1 + eg) 11/ + [9/(1 + c6)]A\\ - 1
Finally, Vc e R, as 0 \ O , 0/(1 + c 0 ) \ O . (e) For the second inequality ||/ + 0(A + B)\\ - 1 = i(l|/ + 20A+I
+ 26B\\ - 2)
<>m + 20A\\ - I) + i(\\I + 20B\\ - I) With 0 \ O , we conclude \i(A + B) < fi(A) + ii(B). The other inequality in (10) follows from the one just proved: 18 19
/JL(A)
= fi(A+B-B)<
fx(-B) + \i(A + B)
fi(B) = ii(A+B-A)< fi(-A) + \i(A + B) (f) Convexity is immediate from (8) and the second inequality (10). (g) The second inequality (12) follows from (7). To obtain the first, replace B by —B in (18) and obtain fi(A) - n(B) < ii{A - B) Replacing — A by A in (19), we obtain li(B) - ii(A) < ti(B - A) and (12) follows. (h) Let e eCn be a normalized eigenvector of A associated with the eigenvalue Xt; so Ae = Xte and ||/ + 0( — A)\\ > \e — 0Xte\. Therefore,
As 0 \ O , the right-hand side tends to Re X{ and the left to —n( — A). To obtain the second inequality, consider
Again as 0 \ O , we obtain the second inequality. (i) For 0 > 0 |,4x| = \x-(x-6Ax)\/6
= \x-(I-6A)x\/9<(\x\
- ||/-0^||
|JC|)/0
8
THE M E A S U R E
OF A
33
MATRIX
where in the last step we noted that the left-hand side is independent of 6. The second inequality (i) follows from the derivation above by changing A into — A and noting that \Ax\ = \ —Ax\. (j)
| | / + 0.4||p ^ sup \x + 6Ax\P
#
|x|P=l
= sup \Px + 0PAP~1Px\ ^ \\I+ ePAP~1\\ \Px\ = l
(k) By (14) -p(-A)\x\
< \Ax\
and
inf \Ax\ =
fl^-1!!)-1
\x\ = l
the first inequality follows. For the second, take the norm of AA~ * = J. •• ••
24
Theorem Let x = (xt, x2,...,
xn) e Cn and A = {atj) e C n X " ; then
Proof The calculation of pt(A) (i = 1, 2, oo) is a simple exercise using the definition. (A* denotes, as usual, the complex conjugate of A.) s: Exercise 1 Show that if A ^ 0 and if A is skew Hermitian, or skew symmetric, then fi2(A) = 0. Exercise 2 Let AeUnXn be a singular, positive semidefinite, symmetric matrix. Show that fi2( — A) = 0. 26
Comments The formulas of Theorem (24) show that p(A) is easy to calculate forp = 1, oo or to estimate for/? = 2. Also fi(A) may actually be smaller than the corresponding ||^||. Also, fi(A) may be negative. As applications of the notion of measure we give two facts. The first one gives upper and lower bounds on solutions of linear differential equations, and the second gives a sufficient condition for the existence and uniqueness of operating points in circuit theory.
34
27
II
NORMS
Theorem Let t n-> A(t) be a regulated function from R+ to CMXn. Then the solution of
28 satisfies the inequalities 29
|x0 0 )|exp - f / i [ - y 4 ( 0 ] * ' l < 1401 ^ l*('o)l exp f /x|>4(0] dt' Proof Let x(0 denote any nonzero solution of (28), let n(i) = \x(t)\ and D+n(t) denote the right-hand derivative of /?(•) at t; then by definition, for all t$ D, where D is the at most countable set of points at which A(-) is discontinuous, D+n(t) = lim[n(t + 0) - n(t)]/0 = lim[ | x(t) + 9A(t)x(t) \ - | x(t) \ ]/0
30 But
Inserting this inequality in (30) and using the definition of /x, we obtain D+n(t) < fi[A(t)]n(t)
31
Since n(f) > 0 for all t, (31) becomes D+n(t)/n(t) < fi[A(t)] and the second inequality (29) follows by integration. The first inequality is proved in a similar manner. :: In many applications one has to find the operating point (or equilibrium point) for a system described by 32
x =f(x) + u n
where w, xeU a n d / : U" -> R . The problem is to find an x e Un such that f(x) = u. It is important to know whether this equation has solutions for any ueUn and whether such solutions are unique. The theorem below gives sufficient conditions for this to be the case. Df(x) denotes the derivative off at x (equivalently, the Jacobian matrix off at x). 33 34
n
Theorem Let/: Un -» Un be continuously differentiable. U.t.c, if there exists a function rn: U+ -> U+ such that li[Df{x)}< - m ( | x | ) < 0 , where m(a) > 0 for all a > 0 and -00
35
m(oc) dx = oo
VxeK"
NOTES A N D
REFERENCES
35
then X K / ( X ) is a C 1 diffeomorphism of Un onto itself [equivalently, / is a continuously differentiate bijection of Un onto Un with a continuously differentiable inverse]; thus, for any u e Un, (32) has a solution x which depends in a C 1 fashion on x. Proof By Palais' theorem our claim will be established if we show that dct[Df(x)] j - 0, V x e r and that | x | ->oo implies that | / ( * ) | -» oo. The first condition follows from the observation that Vy e W with y #= 0, where we used (14) and assumption (34). The second requirement holds true because by using Taylor's theorem about 0, the origin of C", we obtain
f(x)=f(0)+ \f Df(*x)dUx So
\f(x)\ >\^D/ax)d^x\
-|/(0)|
> -n^Df(Xx)
d^\x\
> - fn[Df(Xx)]
dX\x\-
> JCm(X\x\)dX\x\ o
- |/(0)|
by (14)
|/(0) |
by (11)
-|/(0)|
by (34)
= f'lm(a)da- |/(0)| and the second requirement holds as a consequence of (35). Remark The theorem still holds if (34) is replaced by fi[-Df(x)]<
-m(\x\)<0,
Notes and references The discussion of norms and equivalent norms is standard [Yos.2, Die.l, Edw.l, Hou.l]. The examples may be illuminating. The calculations of induced norms were introduced in the engineering literature by Sandberg, in his many papers starting in 1963, and by Zames at about the same time. (See reference list.) The notion of measure of a matrix is due to Dahlquist [Dah.l]. Inequality (8.29) can be found in Coppel's book [Cop.l]. For Theorem (8.32) see the paper by Desoer and Haneda [Des.ll].
III
GENERAL THEOREMS
This chapter is abstract because abstraction saves time. Indeed, suppose that we solve a dozen specific problems and that we detect a common pattern in their solution. It would obviously be useful to abstract from these solutions the essence of those characteristics that lead to the solution; then when encountering a new problem, we would know what to look for. This is, of course, very beneficial, but what is the cost ? The cost is that this process of abstraction requires care. Indeed, in a specific concrete problem, certain features of the problem are well known and well understood; so one takes advantage of them without comment. (In other words, familiarity makes you believe that it is simpler than it actually is.) In an abstract setup, all required properties must be precisely stated, and every step of the reasoning must be carefully scrutinized. On the other hand, it often happens that some extremely simple abstract reasonings lead to very general and useful theorems. A number of such theorems are collected in this chapter. In the first section, we set up the general framework which will underlie our future work. Next we state, prove, and discuss the small gain theorem in its general and in its incremental form. In Section 4, we prove another 36
1
SETTING
OF THE
PROBLEM
37
boundedness result, which has an interesting converse. In the next section, we prove a very general existence and uniqueness result with which we can prove that most of the feedback systems that we shall encounter are determinate in the sense that to a specific input they have a unique response. Section 6 is devoted to the loop transformation theorem, which can be thought of as a " stability equivalence" result. The chapter ends by the general definition of if stability and a general feedback property.
1 Setting of the problem A large number of feedback systems can be put in the form shown in Fig. III. 1. The symbols wl9 u2 , denote the inputs, yt, y2 the outputs, and e1,e2 the errors. The w/s, j/ f 's, and et9s (i = 1, 2) are functions of time; usually they
Figure III.l
are defined for t > 0 or for t e Z+; usually they take values in R, Rn (sometimes, C"), or in a normed space or a Hilbert space. The general problem under investigation is: Given some assumptions on Hl9 H2, show that if ul9 u2 belong to some class, then eu e2 and yt, y2 also belong to the same class. The equations of the feedback system are 1 2
ut = eY + H2 e2 u2=e2H1e1
H1 (H2) is an operator which acts on its input ex (e2, resp.) to produce the output yt (y2, resp.). Equations (1) and (2) have an obvious control interpretation shown in Fig. III.l. It is worthwhile to point out that they have also an w-port interpretation (Fig. III.2 shows the case of two-ports). Let the ut take values in R2 with components (ui)1, (ut)2. The operator H1 is an "impedance" type operator; it operates on currents and gives out voltages.
Figure III.2
III
38
GENERAL
THEOREMS
The operator H2 is an " admittance "-type operator; it operates on voltages and gives out currents. Equation (1) expresses the Kirchhoff current law, and Eq. (2) expresses the Kirchhoff voltage law.
General framework Since we wish to cover continuous-time and discrete-time systems and also systems in which the w(.'s, et9s, and yt's are either real valued or take values in Un or even in normed spaces (for distributed systems), we set up the following general framework. Let ZT\ subset of R+ (typically,
where Ov- is the zero vector in ir. The linearity of PT is obvious from its definition. PT is a projection on 3F since PT2 = PT. We say t h a t / r is obtained by truncating / at T. 5 Introduce a norm || • || on $F\ this defines a normed linear subspace ££ of the linear space ^ :
(Typically, ||/|| = Jg> ||/(0II A or ||/|| = £ | ||/(*)||.) Associated with the normed space «£? is the extended space ££e defined by 6 We shall impose throughout the following requirements on the norm || • || that is used to define if and if e [see (5) and (6) above]: 7 8
(i) (ii)
V/e S£e, the map T\-+ \\fT\\ is monotonically increasing; V/e if,
1
SETTING
OF THE P R O B L E M
39
The following notation will turn out to be useful:
With these two assumptions, we may reinterpret Definitions (5) and (6) of if and S£e as follows:/belongs to if iff the real-valued function T H - ||/ r || is bounded on «^~, a n d / e <£e iff T\-> \\fT\\ maps ^T into U (i.e., there are no growth constraints!). If i^ is either U or Un, and if || • || is an If norm, we denote if by If or L„p; similarly, S£e is denoted by L / or L%e. For the discrete case, we write P, / / , / / , and l*e. Exercise 1 (a) Take if to be L00. L e t / : f M>exp(f2). D o e s / e L 0 0 ? Does (b)
Give examples of sequences in IJ- but not in Z1, in /e°° but not in /°°.
Exercise 2 Consider the restriction of PT to S£ and call it still PT. Show that in terms of induced norms, ||P r || < 1. Thus, PT is a continuous linear operator on ^£, and its operator norm is at most 1. Most models used in system theory are nonanticipative; so we define nonanticipative maps. Let H: if\ -> if' e ; H is said to be causal {nonanticipative) iff 9
PTHPT = PTH,
VJe^
Exercise 3 Let Hl9 H2: i f \ - » if'e and be nonanticipative. Show that HlH2 is also nonanticipative. {Hint: Use the fact that the composition of two functions is associative.) Exercise 4 Let h e l}(U) and u e L2{U). Show that the map H: L2{U) -» L2{U) defined by i.e., (#K)(0 =
h{t-
T)W(T)
rfr,
fe U
is nonanticipative if and only if h{i) = 0 , almost everywhere on (—oo, 0). Exercise 5 Assumption (7) on the norms ||-|| in 3F is not necessarily fulfilled by any norm. Construct an example. [Hint: Consider the space of measures JJ, on M+ ; define the norm as in Appendix (C.3.3); show that for s o m e / / , \\fiT\\ > \\fi\\.]
Exercise 6 Within the general framework above, assumption (7) need not always hold. Let ^£ be the class of functions having well-defined Fourier
40
Ml
GENERAL
THEOREMS
transforms [by Appendix B, J ^ Z D L 1 , if D L 2 , and l e t / r = PTfe S£\ define the norm of/ r by
JS?9<5(0, . . . ] . Let fe
&e
where / r is the Fourier transform of fT. (a) Show that f o r / e L2(IR), the relation above defines a norm. (b) Let/(f) = e?l(-t)-0.25(t - 10~3), where 1(0 denotes the unit step. Show that ||P 0 /ll=ll/o II > 11/11 • Exercise 7 Some interconnections of nonanticipative subsystems are not nonanticipative. Give an example. [Hint: Consider a discrete system with unity feedback; uu eu yt: Z+ -> U, u2 = 0, H2 = identity map, (H^Jin) = — ex{n) + et(n — 1), for all neZ+ .] Discuss what happens if Hx is perturbed a little so that (H^Jin) = - ( 1 + &)e1(n) + ex(« - 1), with £ <^ 1. Exercise 8 Let HUH2: &e-* &e. If Hx is a linear map and if (/ + H1H2Yl and (I + H2H1)~l are well-defined maps from J2?e into J^ e , show that HX(I + # 2 HJ-1
= (J +
H.H.y'H,
Give a system theoretic interpretation in terms of block diagrams. Give an example to show that this relation is false if Hx is not a linear map. Exercise 9 In the general framework above, suppose that u2 is identically zero. Suppose that (J -f H2H1)~1 is a well-defined map from S£e into <£e, then show that, for the feedback system shown in Fig. III.l and described by (1) and (2), we have
Exercise 10 Consider an alternate definition of nonanticipative map. Again let H: !*£'e-> ££'e; then H is said to be nonanticipative iff MT e $~ and Vx, y e <£e. 10
PTx=PTy=>PTHx=PTHy Show that definitions (9) and (10) are equivalent.
2
Small gain theorem
The small gain theorem is a very general theorem, which gives sufficient conditions under which a "bounded input" produces a "bounded output." Its formulation is chosen so that the question of boundedness is completely disconnected from the questions of existence, uniqueness, etc.
2
SMALL GAIN
THEOREM
41
1
Theorem Consider the system shown in Fig. III.l. Let Hl9 H2 : J^ e -» S£e. Let ex, e2 e ^ e a n dflfe/z^eWi and i/2 by
2
ut = et + H2 e2
3
u2= e2 — H1e1 Suppose that there are constants
U.t.c, if y^2 < 1, then
(ii) if, in addition II " i l l , II " 2 II < ° ° then et, e2, yu y2 have finite norms, and the norms of the errors, namely, ||et\\ and ||e 2 ||, are bounded by the right-hand sides of (6) and (7), provided all subscripts T are dropped. 8 Given an operator Hi: S£e -* S£\, suppose that there are real numbers px and ft such that 8a Clearly ft is not uniquely defined by the above inequality. Intuitively, it is clear that we are interested in the smallest ft that "works." More precisely, we call gain of Hl the number y{H^) defined by 8b
yiHJ = inf {ft e U+ | 3j5x s.t. inequality (8a) holds} This infimum will often be denoted by y(Hx) or yv With this terminology, Theorem (1) can be interpreted to state that if y(Hx)y the gain of Hl9 andy(// 2 ), the gain of H2, have a product smaller than 1, then, provided a solution exists, any bounded input pair (wl9 u2) produces a bounded output pair, and the map (wl5 u2) -> (yl9 y2) has also finite gain. Exercise
Show that if H± is causal, then condition (8a) can be replaced by
8c Note that, in (8c), since x ranges only on ££, T drops put from the picture. 9
Comments (a) Generality Theorem (1) applies to continuous-time or discrete-time systems. The system may be single-input-single-output (i.e.,
42
III
GENERAL
THEOREMS
if = U) or multiple-input multiple-output (i.e., if = Un) or any normed space (distributed systems). (b) Statement The theorem assumes the bare minimum; it assumes ei, e2e <£\ and defines ux and u2 accordingly. In practice, ul9 u2 are given and et, e2 are calculated. Thus, the formulation above avoids the question of existence of solutions of (2) and (3). In practice, the constants pt and yt are obtained by bounding
For this purpose, inequality (II.8.29) and the Bellman-Gronwall lemma Appendix (E.l) are very useful. (c) The form of the assumptions are improved versions of results of Sandberg [San. 6, 7, 8, 9, 10, 11], Zames [Zam. 3], Lee-Desoer [Lee. 1]. The usual formulation sets /?x = 0 and therefore does not apply to the memoryless nonlinearity (f): U -> R, where
Nor does it apply to some cases of relays with hysteresis, and to saturating nonlinearities, whereas the present one does. (d) The results extend to the case where H1 and H2 are relations (i.e., "multivalued functions"). In that case, (4) and (5) must hold for all the "images" Hte t of each et e <£e (i = 1, 2). This fact is very useful in the case of feedback systems with hysteresis. (e) Theorems (II.6.3), (II.6.8), and Exercise 1 of Section II.6 give very useful evaluations of gains for convolution maps. Exercise 1 With Theorem (1) in mind, construct an example (say, of the type studied in Chapter I) for which existence and/or uniqueness and/or continuous dependence fails even though the product of the gains 7(// 1 )y(// 2 ) < 1. Proof of Theorem (7) 10
From (2), we see that VTe &~, e1T = uiT — (H2e2)T
Since all vectors e S£e, 11 We have a similar calculation from (3) 12 Hence, using the fact that y2 > 0, 13
2
SMALL GAIN
THEOREM
43
Since yly2 < 1, 14
\\e1T\\ <(\\uiT\\ + y2||w2T|| + £ 2 + y 2 &)(l -
y1y2y1
The remainder follows immediately. Exercise 2 Consider a feedback system where w1? el9 yx, e 2 , y 2 : //"i and H2 map L°°([R+) into itself; the input u2 is identically zero. More precisely, H1e1 = g * el9 where g is a given function in L*(IR+); (H2e2)(t) = (p[e2(t), t]9 where 0 : [ R x [ R + - » I R i s continuous and belongs to the sector [0, k). Assume that for all uy eL°°([R+), there is a unique solution el9 yx e L°°([R+). Obtain conditions on the constant k and the function g(-) such that u1eLx>(R+) implies j ^ e L°°(IR+). Under the conditions found, exhibit a number m such that
Exercise 3 Repeat Exercise 2 for discrete systems, i.e., uu eu yi: Z + -» [R; ^ and // 2 map /°° into itself;... Exercise 4 Consider a feedback system where u2 = 6 and // 2 = J, the identity; thus (I + H1)el = wx. Suppose that / ^ : if -• if and that ( J + / / i ) - 1 : S£-+y?. Show that under these conditions, y[(7 + / / J - 1 ] < oo if and only if 3 constants s, and /?/ with e > 0 such that If u2 = 0, there is no longer need to separate the gain of H1 and the gain of H2; one can consider the "loop gain" H2Hl. The following corollary illustrates the idea. 15
Corollary Consider the system shown in Fig. III.I, where u2 = 0. Let Hu H2 : S£e -> if e . Let ^ e if e and define wx by
16
ux = e± + H2e2
17
Suppose that there are constants y21, y1? /? 21 , and /?1? with y21>0, s.t.
U.t.c, if "y2i < 1J then
yx> 0,
44
III
GENERAL
THEOREMS
Note that Comments (9) above apply also to the corollary. What the corollary shows is that once the "loop gain" is smaller than 1, the closedloop system has finite gain. Compare the corollary with Theorem (1.2.7). Proof
3
Exercise for the reader.
n
Small gain theorem: incremental form
We now consider a theorem that guarantees existence, uniqueness, boundedness, and continuity. 1
Theorem Consider the feedback system shown in Fig. III. 1 and described by Eqs. (1.1) and (1.2). Assume that for each T, PT^e ls a complete normed linear space (i.e., a Banach space). Let Hx, H2\ $£e-+ $£e. Suppose there are constants yx and y2 such that VTe &~ and V{, £'e S£e
U.t.c, if 7i72 < 1> then (i) Vwl5 u2 e J£\ 3 a unique solution eu e2, yu y2e <£e, which can be obtained by iteration; (ii) the map (wl5 u2)\-^(el, e2) is uniformly continuous on PTJ£ex PT£>e<md on if x J^7; (iii) If, in addition, the solution corresponding to wx = u2 = 9 is in $£\ t h e n ul9 U2G ££ => ex, e2 e «£?. 4
Comments (a) If H1 is linear, assumption (2) is very closely related to assumption (2.4). More precisely, if Ht is a linear map and if for some yt
then
(b) The incremental small gain theorem answers all four questions: existence, uniqueness, boundedness, and continuous dependence. (c) It is a simple exercise to prove that (2) and (3) imply that H1 and H2 are nonanticipative. 5 Given a nonanticipative operator H1: S£e -> $£e which satisfies (2), the inflnium of all real numbers yt which satisfy (2) is called the incremental gain of Hv It is often denoted by y(#iX °r for simplicity, yt.
3
Proof
(i)
SMALL GAIN T H E O R E M : INCREMENTAL
FORM
45
From the feedback Equations (1.1) and (1.2), we obtain e2 =u2 + i/1(w1 -
H2e2)
and by truncation e2T = u2T + [H^u, - H2e2)]T, Using nonanticipativeness of Hx and H2, e2T = u2T + {i/Jt/xr This equation is of the form e2T =f(e2T). on indeed,
(H2e2T)T]}T We claim that f is a contraction
\\ where we used successively assumptions (2) and (3). By assumption y ^ < 1, consequently / is a contraction. Therefore, V T e ^ , Vul9 u2eJ£e, the resulting e2T is uniquely defined element of PT^e. The same holds for e1T since by (1.1) and nonanticipativeness of H2, we have
(ii) For any Te^~, for any (ul9 u2), {ux\ u2')eJ£e unique solution (ex, e2), (ex\ e2) e $£e x £ge. Also
e\T = w'1T -
x «Sfc, there is a
(H2e'2T)T
Subtracting, taking norms, and using the triangle inequality, we obtain \\e1T - e'lT\\ < \\u1T - u[T\\ + y2\\e2T - e2T\\ Similarly, \\e2T ~ e2T\\ < \\u2T - u2T\\ + yilki T - e'1T\\ 6
||e 1T - e'lT\\ < (\\uiT - u'lT\\ + y 2 ||w 2r - u2T\\)(l - yiy 2 ) _1 , Hence (ii) follows. (iii) follows from (6) and the corresponding inequality for e2 when w/ = u2 — 9 is inserted. » Exercise 1 Formulate and prove a corollary to Theorem (1) which is the analogue of Corollary (2.15) to Theorem (2.1). Exercise 2 Consider a system that satisfies all the conditions of Theorem (1). Suppose that ul9 uu i/ 2 , u2, e <£\ but that ux — ii1 and u2 — u2e $£'. Show that et — e2 e <£ and
III
46
4
GENERAL
THEOREMS
A boundedness result
We may think of the small gain theorem and its incremental form as two extreme forms of boundedness results. The former assumes the least— the finiteness of the gains [see (2.4) and (2.5)]; the latter assumes the most— finite incremental gains for Hx and H2 [see (3.2) and (3.3)]. We now state and prove a theorem that uses somewhat intermediate assumptions. It emphasizes assumptions on the composite function H2H1, which, in a very rough way, can be thought of as the loop gain. 1
Theorem Consider the system shown in Fig. III.l and described by (1.1) and (1.2). Assume that H1 and H2 are nonanticipative, that the gain yiH^ < oo and the incremental gain y(H2) < oo. U.t.c. (a)
if 3 8 > 0 s.t.t
2 then (wl5 u2) e if x j£? implies that any solution (el9 e2) that is in ££\ x S£e is also in S£ x 5£ and for some k < oo 3
\\et\\
i = l,2,
(b) If the relation between (uu u2) and (ex, e2) is a nonanticipative map from if x if into <£ x <£ which has finite gain, then (3) implies (2). Proof (a) Consider fixed wl9 u2 e if and a corresponding solution (eu e2) of Eqs. (1.1) and (1.2) with eu e2 e ££e. Then e1 + H2 H1e1 =ul — [H2(H1e1 + u2) - H2 HYe^\ Upon truncation, since PT is linear PT(I + H2 HJe, =PTu1-
PT[H2(Hiei
+ u2) - H2 H&]
Using the fact that the incremental gain y(H2) < oo,
Now using the assumption (2) and letting T-> oo in the right-hand side, we obtain with the help of (1.8)
Thus, 5 t To lighten the notation, we write ||«2llr instead of ||«2rll-
5
AN
EXISTENCE A N D
UNIQUENESS
THEOREM
47
i.e., e1 e ££. Now from e2 = u2 + H1el, we obtain 6 Therefore, (3) is established, and k may be taken to be
(b)
Let u2 = 0; then to wx e if, there is a unique ex e J£ such that (I + H2H1)e1
=Ul
From (3) it follows that y[(I + H2H1)~1] < oo; therefore, VTe ^
from which (2) follows.
::
Exercise 1 Consider the following special case to show that condition (2) is closely related to the Nyquist criterion. Let uu eu yt map U+ -> U; let u2 = 0 and // 2 ^ e the identity map. Let H1el = g * eiy where ^eL 1 (IR + ) and its Laplace transform g(s) is a rational function which is analytic in Re s > 0 and which tends to zero as \s\ -^ oo. Show that if the Nyquist diagram of g [i.e., the map co)-^g(jco), co e U] encircles one or more times the critical point (—1, 0), then (2) does not hold. [Hint: Use a state representation for H1\ choose appropriate initial conditions and an appropriate exponential form for et( •).]
5
An existence and uniqueness theorem
In this section, we restrict ourselves to !T = R+ . Indeed, for the discretetime case, the problem of existence and uniqueness is completely different. Instead of solving for a function from IR+ to i^, we have to solve, at each sampling time, for one point in ir. An example of result required for the discrete-time case, where x(n) =f[x(n)] + u(n) x(n), u(n) E Un,f: Un -• Un, is given by Theorem (II.8.33). We wish to show that the existence and uniqueness of the solution (ei9 e2) of Eqs. (1.1) and (1.2) in the space S£e x <£e can be guaranteed on the basis of some quite reasonable assumptions, which are usually far less restrictive than those required for guaranteeing finite gain.
48
III
GENERAL
THEOREMS
To simplify the notation, it is convenient to think of the pairs (w1? u2) and (el9 e2) as single elements of if e x if e , denoted, respectively, by u and e. Similarly, instead of the maps Ht and H2, let us think in terms of the map defined by Then Eqs. (1.1) and (1.2) become 1
u=e + He Furthermore, no confusion will arise if we abbreviate <£e x $£e by ^£ 2. The following theorem will require a Lipschitz-type condition on H and will guarantee that for any u e $£ 2, there is one and only one solution ee<£? of(l).
2
Theorem Let i/: if e2 -» if e 2 and be nonanticipative. Let 5" = IR+ . Let P r be the projection defined on if e 2 as in (1.4). Define a new projection by
3 U.t.c, if for all compact intervals I c U+9 there are numbers y(I) < 1 and A(J) > 0 such that W e I and Ve, e' e ifc2 subject to Pte = Pte\
(where for simplicity we have suppressed the dependence of A and y on J) and if W and A, Pt A ife2 is complete, then for any u e ife2, the equation u = e + He has one and only one solution. Proof Suppose we have computed a solution up to some t > 0, let us show that the solution can be extended uniquely on all M+ . Let / be a compact interval including t and such that J n (t, oo) is nonempty. Now for the A and y corresponding to the chosen /, let 5
eA^PttAe=Pt+Ae-Pte and uA be similarly defined. Now apply Pt A to u = e -f He,
6
eA = uA-Pt>AH(Pte
+ eA)
where we used the nonanticipativeness of H. Equation (6) is of the form eA =f(eA), since uA is given and Pte is known. Thus,/: Pt A ife2 -» Pt A ifc2. We claim that / is a contraction on PtiA^e2- Indeed, for all eAt eA e Pt,A^e2^ 7
\\f(eA) -f(eA')\\
= \\Pt,A[H(Pte + eA) - H(Pte + 2A')]||
5
AN EXISTENCE A N D
UNIQUENESS
THEOREM
49
where we used successively the linearity of Pt A , (5), (6), and inequality (4). From (7), we conclude t h a t / i s a contraction on the (complete) normed space PtAS£'e2 since y(I) < 1 by assumption. Therefore, the iteration scheme eAn+1)=f(eAn)),
i = 0 , 1,2, . . .
starting from any initial guess, eA°\ will converge to the unique solution on (t, t + A]. Thus, by starting at t = 0 and by repeating this process, we can construct piece by piece the unique solution of Eq. (1) on (0, oo). :s Corollary Suppose that, in addition to the assumption of the theorem, we assume that His linear; then using the notation of (5) to (7), the condition (4) becomes: For any compact interval /, there exist y(I) < 1 and A(7) > 0 such that for all t e /, and for all eA e PtA &e2. Proof
Follows directly from (7).
::
Comments (a) The most important example of an engineering system that does not fulfill such condition is the chattering phenomenon in servos [Flu. 1 ]. The simplest example is where Ht is an integrator (i.e., Hx is defined by its transfer function \/s) and H2 is a memoryless nonlinearity with characteristic (j)(e2) = 1 for e2 > 0 and <j)(e2) = — 1 for e2 < 0. (b) In the assumptions of the theorem above, the order of the quantifiers is very important. For any chosen compact interval /, the same y(I) and A(J) must " w o r k " for all t e I. The solution is constructed over successive intervals of length A(J) > 0; so, eventually, the process moves out of the compact interval /. Then a new compact interval is chosen, say, /', for which there is a A(T) and y(If).... Clearly, the process will never stop because, by assumption, for any compact interval J, there is a A(J) > 0 which " works " for all t e L (c) If H is time invariant, successive compact intervals can be chosen to be translates of the first one, and the same A and y can be used throughout. For some time-varying problems, as the solution is continued further to the right, A(7) must be chosen smaller and smaller in order to achieve y(I) < 1 in (4). Then there is no unique A that works for all t e U+. Exercise 1 Consider the special case where (a) the feedback loop is open (i.e., H2 maps everything into the zero vector); (b) wx(r) =
III
50
GENERAL
THEOREMS
( c ) Ji = Hxex is defined in terms of a differential equation yx =f(yl9 t) where / i s continuous o n R " x H " x R + .
eu
Display assumptions o n / s u c h that the input output map ul\->y1 satisfies (4). Exercise 2 Let ul9el9 e2 map IR+ into U. Take u2 = 0. Suppose that (H^^if) = 4>(ei9 t), where <£(•, •) is continuous and the conditions for some y < oo, satisfies, Suppose that (H2e2)(t) = (g * ^)(0» where # eL e 1 ([R + ). Show that for any wx eLe°°, there is one and only one solution el and e2 eL e °°. [Hint: Consider the equation ex(t) = ux(t) — (g * e2)(t), where e 2 (0 = ^[^i(0? *] • • • Note that / : /I'—> Jo \g(r)\ dx is continuous with/(0) =0.] Exercise 3
Consider the equation e(t) = u(t) + f G(t •'o
T>(T)
rft
where w: U+ -> [Rn, ueLpne, for some/? 6 [1, oo]; also G: [R+-^[RnXn and all elements of GeLj^. Show that Eq. (10) has one and only one solution e(-)eLpnefor each ueLpne. (Hint: t\-+\G(t)\ is in Lelm9 fh->J{, | G ( T ) | rfr is continuous, monotonically increasing, and equal to zero at t = 0, . . . .) Exercise 4 Consider the equation
where w: R+ -> R", ue L™; also / : IR+ x IR" x Rn is continuous and satisfies a global Lipschitz condition, namely, there is a /c e U+ such that
Show that Eq. (11) has, for each ueL™, one and only one solution e e L™ .
6
Loop transformation theorem First, let us make the following observation.
Exercise. 1 Let H1 and K be maps from S£\ into S£e. (Note that neither Ht nor # need be linear.) U.t.c, (/ + KH^1: <£e -* seeoH1(J + KH^'1: <£e-+ <£e. [=> is immediate. For <=, consider the identity
6
LOOP T R A N S F O R M A T I O N
THEOREM
51
Exercise 2 Let E, F, and G be linear spaces. Let g: G-+ E; let fx and f2 map E into F. Show that (fi + fi)09=fi
°g+f2°g
[Hint: By definition (/x + / 2 ) 0 ) = / i W + / 2 (*)-] Show that if E = F = G, in order to have 9°(fi
+fz) = 9°fi
+ 9 °fi
g must, except for trivial cases, be a linear map from E into Zs. Consider the feedback system S shown in Fig. III. 1 and described by 1
ux = e1 + H2 e2
2
u2=e2-
H1e1
We shall derive from the given feedback system S another feedback system SK such that S is " stable " if and only if SK is " stable." It will turn out that some straightforward theorems, such as (2.1) and (3.1) above, applied to SK lead to very interesting stability conditions for S. The system SK is shown in Fig. III.3 and will be derived in the proof of the theorem in the following.
Figure III.3
Theorem Let // 1? i / 2 , K, and (I + KH^'1 linear, U.t.c,
map if e into jSfc. Let ^ be
(a) if wx, w2, el9 e 2 a r e m &\ a n d a r e solutions of S [i.e., of Eqs. (1) and (2)], then uY — Ku2, w2, >7i — (/ + KH{)eu and 2 a r e m ^ e anc * a r e solutions of SK [i.e., of Eqs. (5) and (7), in the following]; (b) conversely, if ut — Ku2, u2, rjl, and e 2 a r e m &\ a n d a r e solutions of SK, then w^ u2, e1 = (I + KH^'1^^ and 2 a r e m ^ e a n d satisfy *S; (c) assertions (a) and (b) still hold if £Pe is everywhere replaced by J£?; (d) if u2 = 0, then (a), (b), and (c) still hold even when K is nonlinear. Proof
Since K is linear, we obtain from (2) Ke2 = K(u2 + Hxe^) = Ku2 + KH^e^
52
III
GENERAL
THEOREMS
Using this result in (1), we obtain successively ex = ut — (H2 — K)e2 — Ku2 — KH1el and 5
> / ! - ( / + KH^
= (ut - Ku2) - (H2 - K)e2
Writing ex in terms of rjl9 6
ex =(I +
KHlYlr\l
we obtain from (2) 7
e2=u2
+ Hl(I + KH1Yir}l
Equations (5) and (7) represent the system SK shown in Fig. III.3; indeed, by inspection, ex is related to rjx by the first equality of (5). (a) follows from the derivation of (5) and (7) from (1) and (2). (b) is obtained by tracing this derivation in the reverse direction and by invoking Exercise 1. (c) is immediate. Finally, (d) follows, once it is recognized that the linearity of K was used only once, namely, in obtaining (4). 8
Comment Strictly speaking, it is not necessary to assume that (7 + KH^'1 is defined on S£e. An examination of the proof will show that we need only that the feedback system of Fig. III.3 be such that rju e2, yxe S£\ for any input pair (wl9 u2) e =£?e2, equivalently, that the equations m = (ui ~
Ku
i) ~ (H2 - * > 2 ,
e2 = u2 + yt,
yt = Hl(rjl - Ky\)
have a unique solution (rjt, e2 , yx) e <£e x $£e x if c . Exercise 3 Give a circuit theoretic interpretation of the loop transformation shown in Fig. III.3 in terms of the «-port model of Fig. III.2.
7
Stability
Throughout the remainder of the book, we shall consider systems of the form shown in Fig. III. 1 and described by (1.1) and (1.2). Let us note that the stability theorems above such as Theorem (2.1); Theorem (3.1); Exercise 1, Section 3; and Theorem (4.1) not only guarantee that whenever wx and u2 belong to =£? then eu e2, yu y2 also belong to i>?, but more than that they guarantee that there is a constant k such that
The important point is that k is independent of ut and u
7
3
<£ S T A B I L I T Y
53
Therefore, from now on we shall say that a system described by (1.1) and (1.2) is j£? stable whenever there is a constant k < oo such that (1) and (2) hold. For example, the loop transformation theorem (6.3) essentially gives conditions under which the system S is <£ stable if and only if the system SK is S£ stable; it is an <£ stability equivalence theorem.
Relation between stability and instability Provided the term "instability" is suitably narrowly defined, the observation in the following exhibits when "instability" occurs. 4
Observation Let H be nonanticipative and map J2?e2 into 5£ 2. Let (J + H)~l be nonanticipative and map ife2 into J£?e2. U.t.c. the feedback system (J + H)e = u is "stable" in the sense that it has the properties: (a) e is given in terms of u by nonanticipative map from <£2 into 5£2; (b) 3y < oo s.t. \\e\\ < y\\u\\, for all u e if2, if and only if (/ + H) has a nonanticipative inverse which maps if 2 into J£?2, and (J + H)~l has finite gain. <= Immediate from (/ 4- H)~1u — e. => the map u\-*e is, by assumption, nonanticipative and sends u e S£2 into an e e if2. ::
Proof
The relationship between stability and instability can be clarified by the following tree of dichotomies; to emphasize these dichotomies, we label the cases by sequences of zeros and ones as in Boolean algebra. 0:
(/ + Hy1
cannot be defined on all of if2.
Then the problem is not well formulated because for some u e if2, one cannot define e, i.e., the equations have no solution for some inputs e<£2. 1: (/ + H)'1 is defined on all of i^ 2 . 1.0: (/ + i/) _ 1 [if 2 ] is a strict superset of ^2. Thus, for some 1.1: 1.1.0: y[(I + H)~1] = oo. Then there is a sequence (w,) c S£2 with the corresponding et e <£2, for all /, but . 1.1.1: 7[(/ + / / ) _ 1 ] < oo. 1.1.1.0: (/ + H) ~i is noncausal. 1.1.1.1: (I + H)-1 is causal.
54
III
GENERAL
THEOREMS
Only for the case 1.1.1.1 do we have «£? stability. In Chapter V, some classes of unstable feedback systems will be demonstrated by showing that either 1.0 is the case or that 1.1.1.0 is the case.
8
General feedback formula
If H1 is linear, there are two ways of writing the relation between wx and yt; H2, however, may be nonlinear, This flexibility is very useful in many computations. 1
Theorem Consider the system shown in Fig. III. 1. Let/f1? H2 , (/ + H1H2)~1, and (J + H2 # i ) - 1 map S£\ into $£e. U.t.c, if u2 = 0 and if Ht is linear, then
2
= (I + H1H2y1H2
yt= Ht(I + H2 H^u,
u,
Proof 3
H±+ H1H2 H1=I
H.+ (H.H^H,
= (I +
H.H^H,
where we used the fact that the composition of two functions is associative and then the definition of the sum of the two functions. Furthermore, since H1 is linear, 4
H1+HiH2H1
=Hl(I + H2H1)
Combining (3) and (4) and, composing it on the left with (7 + and on the right with (/ + H2 # i ) ~ \ we obtain (2).
H^H^'1 ::
Exercise Consider a feedback system as shown in Fig. III.l when uu ex, y1: IR+ ->1RM; u2(t) =6, Vt. Suppose that Hx consists of a given "plant" P preceded by a "compensator" G. Thus H1 — PG. We assume throughout that P and G are linear. Since 5
y1=PG[I
+ H2PG]-1u1
consider a "comparison system" consisting of the same "plant" P preceded by a compensator G0 ; call y0 the output of this open-loop system: 6
y0= PG0 u If we choose
7
G0=G(I
+
H2PnGy1
Then, when P =Pn, y0 = y1 for all u. Consider now an arbitrary change in P; more precisely, let P change from Pn to P = Pn + AP. Then, by (6), Ay0 = APG0 u
NOTES AND
(a) 8
REFERENCES
55
Show that Ay, =(I + PGH2y1
Ay0
(b) Prove (8) directly, for AP small, by taking derivatives in function spaces. [Hint: Note that PG(I + H2PG)~1 = (I + PGH2)~~lPG.] 9
Comment This formula is important because it shows that if the " loop gain" PGH2 is large, then a given change AP in the plant will cause a much smaller change in the closed-loop system (5) than in the open-loop system (6). This fact is fundamental in the engineering usefulness of feedback systems.
Notes and references The general setting of the problem is due to Sandberg [San.3, 4, 5, 6, 9] and Zames [Zam.l, 2, 3]. A detailed discussion of causality can be found in Saeks [Sae.l, 2]. The small gain theorem has been used in many ways by many people with varying degrees of generality. In its two general forms, it appears in Sandberg [San.9] and Zames [Zam.3]. The existence and uniqueness result is a formalization of the conventional argument for Volterra integral equations of the second kind (see, for example, Zames [Zam.l]). The loop shifting theorem has a long history. It was known to and used by Sandberg [San.2, 9] and Zames [Zam.3]; the fact that linearity is no longer required if u2 = 0 is due to Sandberg [San. 10]. Equation (8.8) is a wellknown result of sensitivity theory [Per.l]. The boundedness result of Section 2 is due to Willems [Wil. 5].
IV
0
LINEAR SYSTEMS
Introduction
Most of the results concerning nonlinear feedback systems are based, in some manner or other, on properties of liner feedback systems. Therefore, it is important to develop the best possible results for linear feedback systems and to have them in a form that makes them readily applicable to the nonlinear case. This is the main purpose of this chapter. In the development that follows, the input «(•) and the output y(-) of the feedback systems under consideration take values in Un.lfn = l, we refer to these systems as single-loop feedback systems or as scalar systems, or, more precisely, as single-input-single-output systems. If n > 1, we refer to them as multivariate systems or as multiple-loop feedback systems, or, more precisely, as w-input-«-output systems. Wherever possible, all results are stated for multivariable systems, and results that are specifically applicable to scalar systems are stated only to the extent that the main contrasts with the multivariable case can be exhibited. 56
1
SYSTEMS WITH
RATIONAL TRANSFER
FUNCTIONS
57
Sections 1, 2, and 3 consider exclusively time-invariantlumpedsystems, i.e., systems with rational transfer functions. The thrust of Section 1 is to contrast the properties of scalar systems versus those of multivariable systems [see Theorem (1.12)]. Section 2 develops, for the same class of systems, the factorization method for obtaining necessary and sufficient conditions for the stability of multivariable systems and provides much of the insight that is later needed to study multivariable distributed systems. Section 3 considers the case where the feedback path contains dynamics and investigates the problem of " p o l e " and " z e r o " cancellation. Section 4 turns to distributed systems and develops the basic necessary and sufficient conditions for stability that are used throughout the rest of the book. Important notions such as pseudo-right-coprime factorizations are introduced and comprehensive results are obtained for the practically significant case of a multivariable system whose transfer function has a finite number of poles in the closed right-half-plane, but is otherwise stable. The graphical test for the stability of distributed systems is given in Section 5. Three cases of increasing generality are considered in succession, and the most general results are given without proof; the proof would require too long an excursion into the theory of almost periodic functions. Section 6 develops the main results concerning discrete-time systems, and the parallels as well as the contrasts with the continuous-time case are indicated. In Section 7 we present the basic results concerning linear time-varying systems, including necessary and sufficient conditions for "open-loop" stability, and a perturbational result for both continuous-time and discrete-time systems. Section 8 uses Liapunov theory to give bounds on the rate of variation of a nonlinear differential system that insure overall exponential stability when the "frozen" system is exponentially stable. This formulation has the advantage that it reduces to well-known conditions in case the system is linear. Finally, Section 9 studies the problem of linearization: Under what conditions is it true that the linearized version of a nonlinear differential system gives good results on all of R+ ? Among other things, the results obtained justify the use of small-signal equivalent circuits in analysis and design and the use of variational equations in control and optimization problems.
1
Linear feedback systems with rational transfer functions
Notation U[s] = commutative ring of polynomials in the (complex) variable s with coefficients in U. It can be shown that U[s] is a principal ideal domain. U(s) = (commutative) field of rational functions in s with coefficients in U.
58
IV
LINEAR
SYSTEMS
R[.s]mX*, (R(^)WM) = class of allmxq matrices whose elements are in U[s] (U(s), resp.). If N then N(s) is called a polynomial matrix. C denotes the extended complex plane (i.e., the complex plane including the point at infinity.) It is understood, once and for all, that the ratios of polynomials s+l s(s + 2)
and
(s + l)(s - 1) s(s + 2)(s - 1)
represent the same rational function / and that / has, in C, — 1 and oo as zeros and 0 and —2 as poles. The two expressions above represent the same rational function precisely in the same way as the expressions 0.5 and \ represent the same real number. We consider two cases: first, the single-input-single-output, linear, timeinvariant feedback system whose feedback is / and whose open-loop transfer function is g(s)eU(s); second, the n-input-n-output, linear, timeinvariant feedback systems whose feedback is the matrix FeUnXn and whose open-loop transfer function is G(s) e UnXn(s). As shown in Fig. IV. 1, u is the input, y is the output, and e is the error; the basic equations are 1
y = G*e
2
e =u — Fy
Figure IV.l
We say that G(s)eUnXn(s) [g(s)eR(s)] is proper (strictly proper) iff all elements of G(s) [g(s) itself] are bounded at oo (tend to zero at oo, resp.). 5
A rational transfer function H(s) is said to be exponentially stable iff (i) it is proper, and (ii) all its poles have negative real parts.
6
Fact If H(s) e U(s)n x n is exponentially stable and strictly proper, then the corresponding impulse response H(t) and its derivative H(t) have the following properties:
1
SYSTEMS
WITH
RATIONAL TRANSFER
FUNCTIONS
59
(a) There are constants hm > 0 and a > 0 which depend on the H considered such that (b) There are constants hmd > 0 and a > 0 such that denotes the norm of the matrix H(t) e UnXn, this norm being induced by some chosen norm in Rn.) Proof
Immediate by partial fraction expansion.
::
To summarize the input-output properties of systems with exponentially stable transfer functions, we state the following theorem. Theorem Let the closed-loop transfer function H(s) eUnX n(s) be exponentially stable and strictly proper; then (a) for any minimal representation of H(s) (i.e., any minimal state representation of the form x = Ax + Bu, y = Cx), the equilibrium point x = 0 is globally, exponentially, uniformly (in 0 stable: (b) if u e Ln1, then y = H * ue L* r^ Ln™, y eL„, y is absolutely continuous and y(t) -• 0 as t -> oo; (c) if u e L„2, then y = H * ue Ln2 n Ln°°, y e L„2, y is continuous and y(t) -> 0 as t -> oo; (d) if u e L„°°, then y = H*ue L^, y e Lrt°°, and y is uniformly continuous; (e) if u e Ln°° and if, as t -> oo, i/(0 -> w^ , a constant vector in IR", then, in addition y(t) -> Hifyu^ as f -> oo and the convergence is exponential; (f) if w e L / and 1 < p < oo, then y = H * ue Lnp and 3) e L / . Proof Follows immediately from the results of Appendix C. The asymptotic results of (e) follow from Laplace transform. :: Exercise 1 In the case of z transforms, we say that the rational transfer function H(z) is exponentially stable iff it is proper (bounded at infinity) and has all its poles with absolute value smaller than 1 (i.e., in the open unit disk). Formulate and prove the inequality that corresponds to (7) and a theorem analogous to Theorem (9). We consider now the relation between the properties of the open-loop transfer function G(s) and the poles of the closed-loop transfer function. This subject is basic to stability questions. Fact Let H(s) and G(s) e UnXn(s) and be related by (4); then / - FH(s) = [I + FG(s)]~l
60
IV
LINEAR
SYSTEMS
If, in addition, det F =£ 0, pc e C is a pole of H(s) if and only if pc is a pole of
[I + FG(s)Y\ Proof Equation (11) is immediate by calculation from (4). The conclusion follows since det F # 0. :: 12
Theorem Let g(s) e U(s) and G(s) e U(s)n x". Let C be the extended complex plane. Define h(s) and H(s) by (4). U.t.c.: (i) pc e C is a pole of h(s) if and only if pc e C is a zero of 1 + g(s). (ii) If pc e C is a zero of det[7 + FG(s)], then pc e C is a pole of /?(V). (But the converse is not true.) (iii) If pc E C is a pole of H(s), then either /?c is a zero of det[Z + FG(s)] orpc is a pole of G(s). (iv) If G(.s') is exponentially stable, then H(s) is exponentially stable if and only if det [J + FG(s)] has no zero at oo and has all its zeros with negative real parts.
13
Remarks 1. Note that we did not assume that g{s) or G(s) were proper. 2. Here we encounter for the first time the extended complex plane C. This is crucial because when H(s) has a pole at infinity (equivalently, is not proper, or is not bounded at infinity), it takes some bounded inputs into some unbounded outputs. For example, letn = l,g(s) = —s/(s + 1), then h(s) = — s. Now h takes the bounded input t H-> sin(t2) into the output t h-• 2t cos(t2) which is unbounded. Thus, (i) and (ii) show that if 1 + g(co) = 0 (or det [J + FG(oo)] = 0), then the closed-loop system is not L00 stable. 3. It is very important to keep in mind that the set of poles of H(s) (in C) may be larger than the set of zeros of det[Z + FG(s)] (in C). For example, consider F = I and J + G(s) = diag[s, l/s, (s - 1 )/(s + 1), (s + l)/s - 1)], clearly det[/ + G(s)] = 1, V^eC, and [I + G(s)]~l = diag[l/^, s, (s + 1)/ (s - 1), (s - l)/s + 1)]. Therefore, by (10), H(s) has a pole at 0, 1, - 1 , oo even though det [J + G(s)] has no zeros whatsoever.
14 Example Consider a simple example where G(s) is proper and, in fact, tends to zero as s -• oo. Let
1
SYSTEMS
WITH
RATIONAL TRANSFER
FUNCTIONS
61
Then
and det[I +
G(s)]=(s+l)/(s-l)
Hence det[/ + G(s)] has no zeros in the closed right half-plane nor at infinity; G(s) has a double pole at s = 1; det [I + G(s)] has a simple pole at .y = 1; here H(s) has a simple pole at s = 1. So the closed-loop system is unstable even though det [J + G(s)] has no zeros in the closed right half-plane and is equal to 1 at infinity. Proof of Theorem 12 (i) Note that if p0 is a pole of g(s), so that | g(s) | -* oo as s^p0, then, by (4), h(s) -> 1 as s -+p0. Therefore, the only way for the scalar rational function /z^) to have a pole at /?c e C is that 1 + g(pc) = 0. Conversely, if 1 + g(pc) = 0, the numerator of (4), namely, $(V), tends to — 1 as s->pc; hence no cancellation can occur at pc, and pc is a pole of h(s). (ii) By assumption det[7 + FG(pc)] = 0. For a proof by contradiction, using Fact (10), assume that [J + FG(s)]
15
1
is bounded in some neighborhood of pc
Then s ^ det{[/ + FGis)]-1} = {det[/ + FGis)]}'1 is bounded in a neighborhood of pc. This contradicts the assumption det[I + FG(pc)]=0. Therefore, by (11), I - FH(s) has a pole at pc e C whenever det[7 + FG(pc)] = 0. Hence H(s) also has a pole at pc. (iii) Follows immediately from (10) and Cramer's rule. (iv) => By assumption H(s) is exponentially stable, i.e., proper, and has no poles in the closed right half-plane. Hence by (iii), det[/ + FG(s)] cannot have a zero at infinity, nor in the closed right half-plane. <= Given the assumptions on G(s) and det[7 + FG(s)], (iii) implies that all the poles of H(s) are finite and have negative real parts. :: Exercise 2 Formulate the statements analogous to those of Theorem (12) for the z-transform case. Exercise 3 Give an example where F is singular and the converse of conclusion (ii) of Theorem (12) fails (e.g., F = diag(l, 0), G(s) = diag[(s + 1) _1 ,
IV
62
2
LINEAR
SYSTEMS
Necessary and sufficient conditions: factorization method
The purpose of this section is to obtain necessary and sufficient conditions for the stability of feedback systems described byf H(s) = G(s)[I + FG(s)]-1
1
where G(s) e UnXn(s) and Fe UnX\ The system is depicted in Fig. IV. 1. The single-input-single-output case is no problem since, w h e n / V 0, 1a
h(s)=g(s)/[l+fg(s)] is exponentially stable if and only if 1 +fg(s) has no zeros in Re s > 0, including the point at infinity. In view of Example (1.14), we know that the obvious extension of this result is false for the «-input-«-output case. On the other hand, if we write the rational function g(s) as n(s)/d(s), where the polynomials n(s) and d(s) are coprime, we know that h(s) [given by (la)] is exponentially stable if and only if the polynomial d(s) + fn(s) has no zeros in the closed right half-plane. We propose to derive in this section a similar criterion for the «-input-«-output case. This will require the factorization of the rational function G{s) as a product N(s)D(s)~1, where N(s) and D(s) are polynomial matrices and N(s) and D(s) are "coprime" in a suitable sense. Then H(s) will be exponentially stable if and only if the polynomial det [D(s) + FN(s)] has no zeros in the closed right half-plane.
2.1
Factorization
Let N(s) and D(s) e UnX"[s]. The polynomial matrix A is said to be a common right divisor of TV and D iff there are polynomial matrices Nl and Z)x such that 2
N = NtA,
D = D^
Note that all matrices in (2) are in [R"Xn[s]; therefore, (2) asserts that the polynomial matrices vV and A^A are equal for all s e C; ditto for D and Z^A. If P, Q, Re UnXn[s] and if P = QR, we say that P is a left-multiple of R, and R is a right divisor of P. Given two matrices TV and DeUnXn[s], we say that AelR nX,, |>] is a greatest common right divisor (abbreviated gcrd) of TV and D iff f i n this section since we deal exclusively with transfer functions, we drop the " ~ " which we use everywhere else to denote Laplace transforms. Even the best notations have to be abused!
2
NECESSARY
AND
SUFFICIENT
CONDITIONS
63
(a) A is a common right divisor of TV and D and (b) A is a left multiple of every common right divisor of TV and D. A square matrix with elements in U[s] is said to be unimodular iff its determinant is a nonzero real number. By Cramer's rule, the inverse of a unimodular matrix is a matrix in [R"x"[s], namely, a polynomial matrix. In general, the inverse of a matrix in R" *"[.?] is not in IRnXn[s], but is in (R"x%s). When the polynomial matrix A, a greatest common right divisor of the polynomial matrices TV and D, is unimodular, we say that TV and D are right coprime. Left coprime and greatest common left divisor are defined similarly.
Factorization Theorem Let H(s) be a q x m matrix with elements in U(s). Then there exists two polynomial matrices N(s) and D(s) such that H(s) = N(s)D(s)-1 such that N(s) and D(s) are right coprime [i.e., every greatest common right divisor of N(s) and D(s) is a unimodular matrix].
Remarks (a) The analogy between (4) and the scalar case is clear. In the scalar case, the polynomials n(s) and d(s) are determined modulo a common factor, which is a nonzero number. In the present case, the polynomial matrices TV and D are determined modulo a right factor, which is a unimodular polynomial matrix. (b) If TV and D are right coprime, then it does not follow that the polynomials det N(s) and det D(s) are coprime. Consider, for example, TV = diag (s-l,s2); D(s) = diagO - 2, s - 1). (c) It is clear that we could just as well have selected a representation in the opposite order: H(s)=D(sylN(s) where N(s) and D(s) are left coprime. This representation will be useful later. (d) It can be shown that if H(s) is bounded at infinity, then det D(s) = k det(sl — A), where A is the matrix of any minimal realization [A, B, C, D] of H(s), and k a nonzero constant. (e) All the operations that follow are legitimate because R is a field. No change would be required if we used C as the field of interest. This occurs, in practice, when polynomials in U[s] are factored; the factors (s — zt) belong often to C[s].
64
IV
LINEAR
SYSTEMS
The analogy between the scalar case and (4) is immediate. We establish this canonical form by giving a procedure for calculating N and D. Procedure
Let H(s) be of the form
where the ntj{s) and dj(s) are polynomials and where dj(s), for/ = 1, 2, . . . , m, is the least common multiple of the denominators of the elements in the yth column of H(s). From (5)
Call these polynomial matrices N(s) and D(s), respectively. Note that det[D(V)] ^k 0. Extracting from N and D a greatest common right divisor R(s), we have N(s) = N(s)R(s)
D(s) = D(s)R(s),
V^GC
where all the matrices have elements in U[s]. Since det[D(s)] ^ 0, R(s) is necessarily nonsingular; hence the canonical form (4) follows. :: The extraction of a greatest common right divisor is obtained as the solution of this. 8
Problem Given two polynomial matrices N(s) and D(s), where N(s) eU[s]qXm D(s) e R[j] mXM , with det D(s) # 0. Find (a) two polynomial matrices Un(s) and Ul2(s) that satisfy (9) below; (b) a greatest common right divisor R(s) of N(s) and D(s); (c)
two polynomial matrices Vu(s) and V2i(s), which are right coprime
such that 9
Ux! (s)D(s) + Ut 2(s)N(s) = R(s), and
10
N(s)D(s)~l = V21(s)Vn(s)-\
except at poles
2
11
NECESSARY
AND
SUFFICIENT
CONDITIONS
65
Procedure We shall use elementary row operations on matrices whose elements belong to U[s]. There are three types of elementary row operations: (i) (ii) (iii) add the
Multiply any row by a nonzero constant. Interchange any two rows. For / ^ /', multiply rowy by an arbitrary polynomial p(s) e U[s] and result to row /.
The effect of any such elementary row operation on a matrix M(s) e ^r^-jmxm j s e q U i v a i e n t to a multiplication on the left by a matrix that is the m x m unit matrix upon which one has performed the desired elementary row operation. Note that any such elementary row matrix has a determinant that is a nonzero constant] hence it is a unimodular matrix, and its inverse is also a polynomial matrix.
Step 1 M(s) = F(s). Step 2 If all elements of the first column of M(s), except the (1, 1) element are zero, go to Step 6; otherwise, go to Step 3. Step 3 From the elements in the first column of M(s), pick one nonzero element with least degree. If necessary, interchange two rows to bring this element in the (1, 1) position. Let M = (mik) be the resulting matrix. Step 4 For i = 2, 3, . . . , j , where j is the number of rows of M(s), divide mn by mil; thus, 13
mn =qilmll+ril
(/ = 2, 3, ... J)
where d°(rn) < J°(w 11 ). For / = 2, 3, . . . , j \ subtract from the /th row, the first row of M(s) multiplied by qn. The result is a new matrix, M(s), whose first column is ( m n , r 21 , r 31 , . . . , r 7l ). Step 5 M(s) = M(s); go to Step 2. Step 6 If M(s) has only one row or one column, go to Step 9. Otherwise, go to Step 7. Step 7 Delete the first row and first column of M(s) eU[s]jXk, thus obtaining a new matrix M(s) e Step 8 M(s) = M(s); go to Step 2. Step 9 Stop.
IV
66
LINEAR
SYSTEMS
The result of this procedure is to transform F(s) into an upper triangular matrix e U[s](m+q)Xm. Equivalently, there exists a matrix U(s) e U[s](m+q)x (m+q) such that for all s e C,
14 Since U(s) eU[s](m+q)x(m+q) and is a product of elementary row matrices, det[U(s)]= constant ^ 0 and V(s) ± Uisy1 e U[s](m+q)x(m+q\ Note that since det D(s) =£ 0, det R(s) ^ 0. Multiplying (14) on the left by V(s) gives 15
D(s) = Vli(s)R(sl
N(s) = V21(s)R(sl
Furthermore, 16 and hence, by (15), 17 From (15), 7?(s) is a common right divisor of N(s) and D(s). From (16), (17), and lemma (20) in the following, R(s) is a greatest common right divisor of N(s) and D(s). From (15) 18 where Vll and V2l are right coprime as is shown in lemma (20) in the following. :: 19
Exercise 1 (a) Write down the form of the elementary row matrices for the three operations. (b) Write down the matrices corresponding to the inverses of these operations. (c) Show that the calculation of f/(^) -1 amounts to the product of known elementary row matrices.
20
Lemma Let N(s) e U[s]qXm, D(s)eU[s]mXm. Then there exists two polynomial matrices P(s) e R[s]mXq9 Q(s) eU[s]mXm such that
21
P(s)N(s) + Q(s)D(s) = Im x m,
V GC
if and only if N(s) and D(s) are right coprime. Proof => Suppose not; then there is a right common divisor which is not unimodular, say R(s): 22
N = NR,
D=DR
2
NECESSARY
AND
SUFFICIENT
CONDITIONS
67
where N, D are polynomial matrices and det R(s) is a polynomial of degree > 1 . Then (21) gives 23
[P(s)N(s) + Q(s)D(s)]R(s) = /,
V^eC
This is a contradiction. Indeed, the bracketed factor is a polynomial matrix; hence dGt[P(s)N(s) + Q(s)D(s)] is a polynomial, but det[7?(V)] is also a polynomial of degree > 1 , hence contradiction with (23). <= The procedure (9) applied to N(s) and D(s) gives a greatest right common divisor R(s) and two polynomial matrices P(s), Q(s) such that [see (16)] 24 P(s)N(s) + Q(s)D(s) = R(s) Since N and Z) are right coprime by assumption, R(s) is unimodular; hence Ris)'1 e M[s]mXm. So multiplying (24) on the left by R(s)~\ we obtain 25 which is of the form (21).
::
Exercise 2 Show that N(s) e U[s]qXm and D(s) e tR^] mXm are right coprime if and only if the matrix [%{SJ}] e M[s](q+m)Xm is of the full rank (in the commutative ring R[,$]); after viewing this matrix as an element of Q('?+m>Xm5 it must have rank /??, \/s e C.
2.2
Necessary and sufficient conditions
We consider again the #-input-/7-output feedback system with G(s) e M(s)nX" as forward transfer function and FeUnXn as feedback gain. (See Fig. IV. 1.) We shall require now that G(s) be proper, i.e., bounded at infinity. 30 31
Theorem
Let G(s) e U(s)n x n and be proper; let F e M"x n and det[/ + K7(oo)]^0
Let G{s) = N(s)D(s)~l, where N(s) and D(s) are polynomial matrices, which are right coprime. U.t.c, the closed-loop transfer function H(s) = G(s) [I + FG(s)]~l is exponentially stable if and only if the polynomial det[D(s) + FN(s)] has all its zeros with negative real parts. (In fact, we show that H(s) is proper and that pc is a pole of H(s) if and only if pc is a zero of the polynomial det[£>(.s) + FN(s)].) Exercise 3 case. Proof 32
State and prove the corresponding theorem for the z-transform
Let us note that H(s) is proper:
H(s) = G(s)[I + FGis)]'1 = G(s) Adj[/ + FG(s)]{det[I + FGis)]}'1
68
IV
LINEAR
SYSTEMS
Since G(s) is proper, the two matrices in the extreme right-hand side of (32) are bounded at infinity. By (31), the last factor is also bounded at infinity; hence H(s) is proper. Consequently, H(s) can only have poles in the finite plane. The theorem will be proved if we show that 33 o
pc e C is a pole of H{s) pc e C is a zero of the polynomial det[D(s) + FN(s)]
=> Let pc e C be a pole of H(s). Using the factorization of G(s), we obtain H(s) = N(s)[D(s) + FN(s)]~l = N(s) Ad)[D(s) + FN(s)] {det [£>(.*) + FN(s)]}~1
34
Now N(s) and D(s) are polynomial matrices and F is constant matrix; hence by (34), if H(s) has a pole at />c, then pc is a zero of the polynomial s — i> det[Z)(j) + /W(j)]. <= Let /7C e C be a zero of det[D(s) + FA^^)]. We have to show that pc is a pole of i/(.s). Since N(s) and £)(.?) are right coprime, by lemma (20), there are polynomial matrices P(s), Q(s) e U[s]nXn such that 35
P(s)N(s) + Q(s)D(s) = /,
V.y G C
Adding and subtracting the polynomial matrix Q(s)FN(s), we obtain 36
[P(s) - Q(s)F]N(s) + Q(s)[D(s) + fW(j)] = /,
V^ G C
So #(5) and D(s) + FA^(^) are right coprime. Using (34) in (36), we obtain 37
{[P(s) - Q(s)F]H(s) + Q(s)}[D(s) + FN(s)] = /,
V^eC
Hence 38
det{[/>(5) - Q(s)F]H(s) + 2(^)} det[Z)(5) + FN(s)] = 1,
V^eC
By assumption, /?c e C is a zero of the second factor of (38); hence for (38) to hold at pc, the first factor must have a pole at pc. Now P(s), Q(s), and F are polynomials; hence have no poles in C. Therefore, H(s) must have a pole at pc. Thus, (33) is established, and the theorem is proved. :: 40
Remark
From (35) we can write dQt[P(s)G(s) + Q(s)] det D(s) = 1,
Hence 41
p0 G C is a pole of G^) <=> /?0 is a zero of the polynomial det[D(s)]
V^GC
2
43
Corollary
44
NECESSARY
AND
SUFFICIENT
CONDITIONS
69
Under the assumptions of Theorem (30), we have
det[/
+
FG(S)] = £ § > = det[/ + FG(oo)] ^ ~ ^ det H(s) l\T=i(s-Poi)
where {p0i}im and {pci)im are the poles of G(s) and H{s) (counting multiplicities), respectively. Proof
By (32), taking determinants
The last step follows from (33), (34), and (41). k = det[/ + FG(oo)] # 0 as a consequence of (31). Furthermore, the number of poles of G(s) and of H(s) are equal; indeed, if they were not, (45) would either go to zero at infinity [contradicting (31)] or would be unbounded at infinity [contradicting the fact that G(s) is proper]. :: 46
Remark Equation (44) shows that as a result of possible cancellations, the set of zeros of det[7 + FG(s)] may be a. proper subset of the set {pci} of closedloop poles. [See Example (1.14.)] This shows that, under the assumptions of Theorem (30), if G{s) is exponentially stable, then H{s) is exponentially stable if and only if all the zeros of det[l + FG(s)] have negative real parts.
50
Alternate Derivation of Corollary (43) Suppose that the forward transfer function G(s) has R0 = [A, B, C, D] as a minimal representation. Clearly, then
51
G(s) = C(sI -A)~1B+
D
Referrring to Fig. IV. 1, note that e is the input to G(s) and e = u — Fy. A little calculation leads to the state equations of the closed-loop system: FDylFC]x
+ B(I+ FD)~1u
52
x = [A -B(I+
53
y = [C- D(I + FDy'FClx + D(I + FD)~lu = (I + DF)-xCx + (/ + DFYlDu This is a representation of the closed-loop system. It is a minimal representation because, as can easily be checked, by a reasoning based on assuming the contrary, the output feedback cannot destroy the complete controllability and the complete observability of the system in the forward loop. Therefore, the natural frequencies of the closed-loop system are precisely
70
IV
LINEAR
SYSTEMS
the eigenvalues of A - B(I + FD)~lFC. Now using det(PQ) = det P det g, det(7 + MN) = det(7 + NM), we obtain successively: 54
55
det[.sJ -A + B(I + FD)~1FC] = det(sl - A) det[/ + (si - A)~lB(I + FD)~lFC] = det(s7 - ^) det[/ + (/ + FD)~lFC(sI - A)~lB] = det<>/ - ^) det[(/ + FD)'1] det[/ + FC(.s7 - A)~lB + FT)] Now the last two determinants are, respectively, equal to det[/ + FG(co)] and det [7 + FG(s)] as can be seen from (51). Therefore, we conclude from (55)
56
det[7 + FG(s)] = det [7 + FG(oo)]
det [si -A+ B(I + FDYlFC] det(sl - A)
Equation (44) follows from (56) because the representations R0 = [A, Z?, C, D] and that of the closed-loop system in (52) and (53) are minimal. 58 59
Remark on Inverses of Matrices in U(s)n x "
Let 77(s) be factored as
H(s) = N(s)D(s)'1 where N and D are in [R[^]"x" and are right coprime. We have
60 61
p e C is a pole of H(s)op
e C is a zero of det [D(s)]
z e C is a pole of His)'1 o z e C i s a zero of det [N(s)] Note that no assertion whatsoever is made concerning poles at infinity. Furthermore, since det D(s) and det N(s) may have common zeros, it may happen that both H(s) and H(s)~l have a pole at some s e C. For example, H{s) = diag[(* + \)l(s - 1), (s - l)/(s + 1)].
62
Remark on Zeros of the 7 + FG(s) Let the assumptions of Theorem (30) hold. The matrix 7 + FG(s), by analogy with the scalar case, will be called the return difference matrix. Its factored form is (D + FN)D~l, where the two polynomial matrices are right coprime, provided det F / 0; then we know that p is a pole of the return difference if and only if det D(p) = 0. For simplicity assume that det(7) + FN) ^ 0. Then, by analogy with the scalar case, we say that z is a zero of the return difference matrix I + FG(-) ifr det[7)(z) + FN(z)] =0. Note that, as indicated above, it may happen that some p e C is at the same time a pole and a zero of 7 + FG(). Exercise 4 Suppose that the return difference is factored in two ways 7 + FG(s) = Nr(s)Dr(sy1
=
Dtisy'N^s)
2
NECESSARY
AND
SUFFICIENT
CONDITIONS
71
where Nr, Dr (Nt, Dt, resp.) are right coprime (left coprime), polynomial matrices. Show that, for z e C, det Nt(z) = 0 if and only if det Nr{z) = 0. In the scalar case, the zeros and poles of transfer functions have wellknown dynamical characterizations. Such characterizations generalize to the matrix case. For simplicity, we consider only the square matrix case. The dynamical characterization is given by the following theorem. 63
Theorem
Let the assumptions of Theorem (30) hold, then
(i) p e C is a pole of / + FG() if and only if there is an input u to the matrix transfer function / + FG( •) of the form a
with each ua e C", for which the corresponding zero-state response of I + FG() has the property that e(t) = rept
64 where (ii)
for all
t>0
0n^reCn; if z e C is a zero of / + FG( •), then
(a) there exists a nonzero vector g e C" and a polynomial £ a masa such that for the input u(t) = l(t)eztg + X ma6\t)
65
a
the corresponding zero-state reponse of / + FG{) satisfies the relation 66
e[f;O-,0n;w(-)]=0„,
for
t>0
(b) if, in addition, z is not a pole of I + FG(-), then there exists a nonzero vector y e Cn such that 67
\l/(t) ± y'y[t\ 0 - , 0n; «(•)] = 0,
for all
t>0
where w(-) is defined in (65) with g arbitrary in C" and the w a 's are appropriate vectors in C which depend on g; (iii) if r e C is neither a zero nor a pole of / + FG(), then for all nonzero vectors k e C there is a polynomial £ a masa such that the input 68
M(0
= l ( 0 ^ + X/w/(0 a
produces a zero-state response with exponential form 69
e[t;0-99tt;u(-)]
= [I+ F6(v)]kevt*0„,
for all
r>0
::
72
IV
LINEAR
SYSTEMS
Proof We shall only sketch the proof of (i) and (ii). First use Exercise 4 and write I + FG(s) = Dl(s)~lNl(s); p is a pole if and only if det Dt(p) = 0, and z is a zero if and only if det Nt(z) = 0. Since N{{-) and £>/(•) are left coprime, we have Nt(s)P(s) = I - Dt(s)Q(s), Vs e C. (i) If p is a pole, there is a vector r e C" such that Dl(p)r = 0n. Thus, DL(s)r = (s — p)k(s), where £(•) e C"[s], i.e., is a polynomial vector. Choose an input u(s) = P(s)k(s), then
= [r/(^Jp)]-G(^(*) Since the last term is a polynomial in $, (64) follows. The converse follows easily by contradiction. (ii) (a) If z is a zero, then there is a nonzero vector g such that Nt(z)g = 0n. Hence Nt(s)g/(s — z) is a polynomial vector, say, /?(s). Choose /w(s) in (65) to be -P(s)/?(s);then
Hence e(t) = Qn for all t > 0. (b) The proof follows similar lines by choosing y' = c Dt(z), where c'Nt(z) = 0n\ :: With this concept of zero and with Theorem (30) in mind, the analogy between the scalar case and the /7-input-tf-output case is complete. 70
Theorem (a) pc e C is a pole of h = g(\ + fg)~{ if and only if pc is a zero of the return difference 1 +fg, i.e., 1 +fg(pc) = 0 . (b) Suppose that det F ^ 0 , G(s)eUnXn(s) and is proper, and finally that det[/ + FG(oo)] ^ 0; then pc e C is a pole of ft = G(I + FG)~l if and only if pc is a zero of the return difference matrix / + FG. (c) If G (g, resp.) is proper, i.e., bounded at infinity, and if det[7 + FG(oo)] # 0 [1 +fg(oo) # 0], then /? (/?, resp.) is proper. Proof (a) and (c) are immediate. For variety, let us use a left-coprime decomposition of G: G = D~lN. Hence H =(/
+ < 5 F ) _ 1 G =(D
+
NF)XN
Noting that Z) + /VT and N are left coprime [indeed, NP + DQ — I if and only if N(/> - F 0 + (D + NF)£> = / ] , we conclude that /?c is a pole of // if and only if pc. is a zero of det[D + FN]. Since f is nonsingular, D + /VFand D are left coprime [indeed, NP + DQ = / if and only if (D + NF)(F~lP) +
3
LINEAR
FEEDBACK
SYSTEMS WITH
DYNAMICS
73
D(Q - F~lP) = / ] , and since I + GF = D~\B + NF), we conclude that pc is a zero of / + GF [and of / + FG = F(I + GF)F~l ], if and only if pc is zero of det[D -f NF]. Thus, /?c is a pole of H if and only if it is a zero of / -f FG.
71
Remark If F is singular, the equivalence (b) does not hold. To wit G = diag[(s — l ) " 1 , (s + l)~l], F' = diag(0, 1), H has a pole at s = 1 and 5 = —2, and J -h FG has a zero only at s = —2.
3
Linear feedback systems with dynamics in the feedback path (rational transfer functions case)
Consider a continuous-time, linear, time-invariant, fl-input-/7-output feedback system with input w, output y, and error e. Call G0 and Gf the transfer functions of the open-loop system and of the feedback system; we assume that they are rational matrix functions and are proper: 1 2
e
y = G0e;
G0eRnXn(s),
G0 proper
= u - Gf y;
Gf e Wx "(s),
Gf proper
We assume throughout that 3 As a consequence, we know that (/ + GfG0)~l is a well-defined member of Unxn(s) because det[/ + Gf(s)G0(s)] # 0. Our goal is to exhibit necessary and sufficient conditions for the closedloop transfer functions 4
He: w n e , He(s) = [I + G/^Gote)]" 1
5
//, : ut-*y, Hy(s) = (70(5)[/ + G ^ C o ^ ) ] " 1 to be exponentially stable. Exercise Given that G 0 , G r e U"x "(s) are proper (bounded at infinity), show that det[/ 4- G/(oo)G0(oo)] ^ 0 if and only if He and 7/y are proper. One approach to the problem is to pick some minimal realization for G0 and for Gf, derive from them minimal realizations of He and Hy, and require that the characteristic polynomials of the resulting A matrices, Ae and Ay, be stable. We shall use, instead, the factorization technique of Section 2.1.
74
IV
LINEAR
SYSTEMS
To start with, consider how one would approach the problem in the single-input-single-output case. First choose irreducible representations of the rational transfer functions g0 and gf : 6
go — noldo,
7
gf = rif/df,
« 0 ^ o coprime polynomials n
f?df
coprime polynomials
Then 8
he = (1 + gjgoY1 = d0df/(nfn0
9
hy =g0(l + gfQoY1 = n0df/(nfn0
+ dfd0) + dfd0)
The numerator and denominator polynomials in the right-hand sides of (8) and (9) are not necessarily coprime. Indeed, for he, common factors may cancel out between d0, nf and df, n0, respectively. For hy, cancellation can occur only between df and n0. For this reason it is false to assert that the zeros of nfn0 + dfd0 are the poles of he and hy. Intuitively, it is clear that the same type of phenomenon will occur in the «-input-«-output case; however, the noncommutativity of the product of matrices requires a bit more care. Consider the /z-input-/?-output system defined by (1) and (2). We assume that (3) holds. We seek necessary and sufficient conditions under which He and Hy, defined in (4) and (5), are exponentially stable. In fact, we shall obtain more, namely, polynomials whose roots are the poles of He and Hy, respectively. Let us factor G0 and Gf. 10 11
G0=N0D0~1; Gf = DjlNf;
N0, D0eUnXtt[s];
N0, D0 right coprime
Nf, DfeUnXn[s];
Nf, Df left coprime
We, of course, have det D0 # 0, det Df £ 0. (t) 12
Q = DfDQ + NfN0 Then by (4) and (5)
13
He = D0Q-1Df9
Hy=N0Q-1Df
f In most of the analysis of Section 3, the explicit dependence on s is not indicated because it is not necessary. For example, Eq. (12) asserts the equality of two polynomial matrices, i.e., the values taken by the left- and right-hand side, are equal for all se C; Eq. (10) asserts the equality of two matrices of rational functions, i.e., the values taken by the left- and right-hand side are equal for all s e C, except at the poles. Similarly, det D0 # 0 means that the polynomial det DQ is not the zero element of the ring U[s]; equivalently, the function s >-> det[Z)0W] is not equal to zero for all s e C.
3
LINEAR
FEEDBACK
SYSTEMS
WITH
DYNAMICS
75
Again note that det Q ^ 0, because, by (3), He tends to a nonsingular constant matrix as|s| -> oo. Let Lbe a greatest common left divisor (geld) of Q and Df; then 14
Q=LQ,
Df=LDf
x
where L. Q, 5 / e[R" "[^], and Dy and Q. are fe/jf coprime. Equivalently, there are polynomial matrices P and Q s.t. 15
DfP + QQ = I Thus, 7/c can be written // e = J D 0 Q - 1 5 /
16
Let J?e be a gcrd of D0 and Q. Then 17
Q=QeRe
18
D0=D0Re where Re, Qe, D0e MnXn[s], and Qe and D 0 are r/#/?f coprime. Equivalently, there are polynomial matrices Pe, Qe s.t.
19 Substituting (17) in (15), we obtain
DfP + neReQ = i Hence Df and Qe are left coprime. Hence 20
with
He = tiQn-elBf
l&e,Bf left coprime [D0, Qe right coprime
Operating similarly on H , we obtain 21 Let Ry be gcrd of N0 and Q, then 22
=QyRy
23
N0=N0Ry where Q y , i? y , N0 e [R"x "[>?], and Q^ and N 0 are n#/?r coprime. Hence there are polynomial matrices P y and Qy such that
24 Again Df and Qy can be shown to be left coprime. Thus, we obtain 25
Hy=N0n;lDf
where
\Qy and Df are left coprime N0 and Qy are right coprime
76
26
IV
LINEAR
SYSTEMS
Theorem For the system defined by (1), (2), with assumption (3) and the notations above, we have
27
pe e C is a pole of Heope
is a zero of det Qe
28
py e C is a pole of Hyopy
is a zero of det Qy
Theorem (26) gives immediately the necessary and sufficient conditions for He and Hy to be exponentially stable; namely, det Qe and det Qy must have all their zeros in the open left-half plane. Proof Note that (3) and the assumption that G0 and Gf are proper imply that He and Hy are proper. Hence we concern ourselves only with poles in C. We prove (27) only; the proof of (28) is similar. <= By multiplying (19) on the right, we obtain 29
Pe D0 Q; lDf +QeDf=
Pe He +QeDf=
Q; xDf
By assumption det Qe(/?e) = 0. Since Qe and Df are left coprime, the righthand side of (29) has a pole at pe [by the proof of Theorem (2.30)]. On the left-hand side, Pe, Qe, and Df e IR/,X|,[.s], hence are bounded in any neighborhood of pe; hence He has a pole at pe. => By Cramer's rule in (20) 30
He = 5 0 (Adj QJD^det Qe By assumption^ is a pole of He. But 5 0 , Adj D c , and Df e tR"x"[1s'] (hence have no finite poles); hence (30) requires that det Qe(pe) = 0. ::
31
Interpretation Let p = 1, 2, or oo. If det Qe and det Qe have all their zeros in the open left half-plane, then (a) He and Hy are exponentially stable, (b) for any u e Lnp, e and y are in L / , (c) for any ue L / , and for any minimal representation of G0 and Gf, the corresponding state trajectories x0(-) and Xy(-) (starting from the zero state) are in Lnp. Exercise Prove the above statement. [Use Theorem (1.9) and note that any minimal realization is completely observable.]
35
Remark With the notations above,
36
{zeros of det[/ + GfG0]} c {poles of He)
37
{zeros of det [I + GfG0]} c {poles of Hy} u {zeros of det Ry)
3
LINEAR
FEEDBACK
SYSTEMS WITH
DYNAMICS
77
These inclusion relations show how dangerous it would be to try to ascertain the stability of the closed-loop transfer functions He and Hy by considering only the zeros of the rational function s\~>det[/ + Gf(s)G0(s)]. Proof (36) and (37) follow directly from (27), (20), and (4) and from (28), (25), and (5). Indeed, 38 39 41
Examples The examples in the following are purposefully simple. Their purpose is to illustrate the relations between the poles of G0, Gf, Hy, Hy and the zeros of Q and det(7 + GfG0).
42
Example 1 Neither G0 nor Gf is exponentially stable; He is unstable and Hy is exponentially stable.
78
IV
LINEAR
SYSTEMS
43
Example 2 Neither G0 nor Gf is exponentially stable; He is exponentially stable and Hy is unstable.
50
Interpretation of the Zeros of det Q(s) = 0 For the system described by (1) and (2), statements (27) and (28) assert that the stability of the transfer functions He and Hy is completely characterized by the location of the zeros of det Qe(s) = 0 and det Qy(s) = 0, resp. The transfer functions He and Hy, however, characterize only the zero-state response of the feedback system. To consider responses that do not start from the zero state, we have to adopt a specific state representation. Let (At, Bt, Ct, D() = Rt where / = 0, / , be some minimal state representations of G0 and Gf, resp. Call the corresponding states x0 and xf, resp. The vector (x0\ x/)' is a suitable state vector for the feedback system. Of course, it is not necessarily of minimal dimension. Note that det Dt(s) = kt det(sl - At), for i = 0,/. We claim that
51
det Q(s) = 0 is the characteristic equation of the feedback system described by (1) and (2).
3
LINEAR
FEEDBACK
SYSTEMS
WITH
79
DYNAMICS
This means, in particular, that if, for some X9 det Q(A) = 0, then for some initial state c and for u = 0, the state trajectory is of the form ceu. To prove (51) we use the factorization (10) and (11) to rewrite the feedback equation as follows: „ (D0v=e, (w = Nfy u J y = G0e u-e = Gfy { _ ' Ar fJ \y=N0v, \DfuDfe = w where we introduced the new variables v and w. The four equations on the right are differential equations since N0, D09 Nf9 Df are polynomial matrices. Let us eliminate e, w, and y by substitution; then we obtain the following equivalent system (NfN0 + DfD0)v = Dfu9 y = N0v, e = D0v, w = Nfy =
NfN0v
So given u and the appropriate initial conditions, the solution t -> v(t)9 for t > 0, is obtained by the first equation; y, e9 and w are obtained by substitution. Since these substitutions involve only products by polynomial matrices, no new modes are introduced. Clearly then, the characteristic equation of the feedback system is det(Nf N0 + Df D0) = det Q = 0. s: 59
State-Space Representation Formulation The feedback system described by (1) and (2) consisted of subsystems prescribed by their transfer functions. This allowed us to consider only the zero-state responses of the subsystems and of the feedback configuration. In contrast, suppose now that the subsystems are prescribed by their state representations R0 and Rf9 respectively:
60
R0 = (A0,B0,C09
D0);
hence
G0(s) = C0(sl - ^ 0 ) _ 1 ^ o + A)
61
Rf=(Af9Bf,Cf9
Df);
hence
Gf(s) = Cf(sl-Af)~1Bf+
62
Df
These state representations are not assumed to be minimal. We wish to be able to study the behavior of the state trajectory of the feedback system when both the input and the initial state are arbitrarily chosen. We assume that det [J + Gy(cx))Go(oo)] = det(J + Df D0) # 0 Let x0 and xf denote the states associated with R0 and Rf9 respectively; let us choose x, defined by x = (x0\ x/)', to be the state of the representation Rc of the closed-loop system. We shall see that under assumption (62), Rc takes the standard form Rc = (A9B9C9D). Once the representation Rc is obtained, one has a complete description of the relation between input, initial state, and output. In fact, the zerostate response y of the closed-loop system is given by
64
$(s) = Hy(s)u(s) = [C(sl - AyxB
+ D]vi(s)
IV
80
LINEAR
SYSTEMS
and the state trajectory starting from x(0) at 0 is given by x(s) = (si - Aylx(0)
65
+ (si -
AylBu(s)
In order to discuss the boundedness of the state trajectory t\-+x(t), we recall the definition (1.5) of exponentially stable transfer functions and their properties [Theorem (1.9)]; thus, we see that we need to relate the closedloop eigenvalues Xcl (defined as the eigenvalues of A) to the eigenvalues of R0 and Rf (respectively defined as the eigenvalues of A0 and Af). Thus, we need to calculate A. The matrices A, B, C, D which define Rc are obtained from the equations describing the subsystems and from the equations describing their interconnections. As in (1) and (2) above, let u and y denote the input and output of the closed-loop system. Call e the error; then we have: (a)
For the subsystems x0 =A0x0 + B0e, y = C0x0 + D0e,
66
xf =Afxf + Bfy y2 = Cfxf + Dfy
(We used here the fact that the error e and the output y are, respectively, the input and output of the forward subsystem, and also that y is the input of the feedback subsystem.) (b) For the interconnection 67
e — u — y2=u—
CfXf — Dfy
We shall obtain the representation Rc by eliminating e from the first three equations of (66) and from (67). In fact, (67) and the second equation of (66) give 68
e=(I
+ DfD0)~\u-
DfC0x0-Cfxf)
Using (68) in the first three equations of (66), we obtain, after a few manipulations, RQ
A =
\A0-B0(I
L
71
C=[(I
+ DfDoy1DfC0
*f(! + A) DfV'Co
+ D0DfylC0
-(I +
-B0(I
+ DfDoy'Cf
1
Af - Bf(I + D0 Z),)"1 A A J
DoDfy'DoCf]
Equations (69)—(71) specify the representation Rc of the closed-loop system. Note the symmetry of the elements of A; by interchanging subscripts 0 and/, one obtains one row from the other. This type of symmetry is not present in
3
LINEAR
FEEDBACK
SYSTEMS WITH
DYNAMICS
81
B, C, and D because of the lack of symmetry of the point of application of u as seen from the block diagram representation of the feedback system. To obtain the desired relation between the eigenvalues of A and those of A0 and Af is conceptually very simple. The manipulations are messy; they involve elementary row and column operations performed on blocks of si - A, the observation that D0(I + DfDo)'1 = (J + D0 Df)~1D0, and if M and TV are, resp., p x q and q x p matrices, then det(/ p + MN) = det(J, + NM) For the details the reader is referred to Hsu and Chen [Hsu.l]. The result can be expressed as follows: Let lci denote the closed-loop eigenvalues (i.e., the eigenvalues of A); let koi and lfi denote those of A0 and Af, resp. Then
or equivalently
Note that (72) is a generalization of (2.56), and (73) is a generalization of (2.44). We note again that the zeros of det[J + Gf(s)G0(s)] may be a, proper subset of {kci}, the set of closed-loop eigenvalues; indeed, cancellations may occur in the right-hand side of (73). On the other hand, (73) shows that, in the case where Re X0i < 0 and Re Xfi < 0, for all /, the kci will all have negative real parts if and only if all the zeros of det[/ + Gf(s)G0(s)] have negative real parts. Concerning state trajectories, we can state the following fact. 74
Fact If all the closed-loop eigenvalues kci have negative real parts, then for all initial states x(0) = [x0(0)', x^O)']' and for all bounded inputs, i.e., u e L,,00, the state trajectory of the closed-loop system, i.e., th^x(t), is bounded; this is also true for e(-) and y(-). Exercise 5 Derive (69), (70), and (71) in the case where D0 and Df are zero. Exercise 6 Show that if R0 and Rf are minimal, it does not follow that Rc is minimal.
82
IV
LINEAR
SYSTEMS
Exercise 7 Let Hy denote, as in (5), the closed-loop transfer junction. Show that 75
[/ - Gf(s)Hy(s)][I + Gf(s)G0(s)] = J,
(a) (b)
If det(/ + Df D0) = det(J + D0 Df) = 0
then (i) as s -> oo, Hy(s) -* oo, and (ii) the closed-loop system does not have a state representation in the standard form (A, B, C, D).
4
Convolution feedback systems
4.1
General results
In the previous sections, we considered only rational transfer functions and hence were restricted to lumped models. We consider now feedback systems made of subsystems whose input-output properties are represented by convolution operators. Thus, our present study includes distributed models. We shall make use without comment of the results of Appendixes C and D. To appreciate the generality of the convolution assumption, recall that L. Schwartz has shown that any linear time-invariant operator that satisfies some slight continuity properties has a convolutional representation, more precisely, a representation of the form u\-*T * u where T is a distribution (generalized function). If the operator is, in addition, nonanticipative, then the support of T is in U + , and conversely.
Figure IV.2
The system under study is shown in Fig. IV.2. The input w, the error e, and the output y are functions from U+ into Un. We shall also allow them to be generalized functions: ^-functions will appear frequently. The linear time-invariant subsystems G and F are characterized by their impulse responses (?(•) and F(-). The equations are y = G * e, u = e + F * G * e,
1 2
equivalently,
' y = Ge u = e + FGe
Hence
3a
H(s) = G(s)[I + F(s)G(s)Y
4
CONVOLUTION
FEEDBACK
SYSTEMS
83
and / - F(s)H(s) = [I + P(s)G(s)]'1
3b
over the common half-plane, where the Laplace transforms P and G are both defined. In this section we shall require for stability that the closed-loop impulse response //(•) e s/nXn(0). When this is the case, 4
\\y\\P<\\H\L'\M\P
for
l
i.e., the closed-loop system is LP stable for allp e [1, GO]. The converse is not true, because the class of impulse responses could be enlarged by considering those with singular measure [Tho. 1]. We shall abbreviate J / ( 0 ) by $0 \ \H\tf denotes the norm of H(-)e stfnXn. We take the position that the increased technical difficulties are not worth the slight extension. Throughout this section, we assume that the feedback transfer function matrix F(s) belongs to the algebra s/n x n, for reasons that are mostly technical. This assumption unfortunately rules out all "unstable" feedbacks, including the commonly found case of rate feedback. This is evidently the price we have to pay for allowing distributed, possibly unstable elements in the forward path. The first theorem in the following shows that, under very broad conditions, if the closed-loop impulse response //(•) e s$nXn{o) for some a > 0, then G(-) must satisfy certain conditions. 5
Theorem Consider a system described by (1) and (2), where the feedback transfer matrix F( •) e stfn x". Let G( •) be a matrix of distributions with support in IR + , and suppose that in some neighborhood of the origin, G contains at most impulse functions. Assume that the closed-loop impulse response H(-) is uniquely determined by the equation
6
H+H*F*G
=G,
or
H=G-H*F*G
U.t.c, if H(-) e jtfnxn(a) for some a > 0, then (i) (/(•) is Laplace transformable; for some a > 0, G(-) is analytic in Re s > a, G(-) e <s/nXn(a) and can be continued to a meromorphic function in Re s > o. (ii) G( •) is of the form 7
G{s) =
rf(s)l@(s)Y1
where
JP(S),
(iii) 8
inf Re s>
\det[I + F(s)G(s)]\ > 0
$(s) e
JnXn(a)
84
IV
LINEAR
SYSTEMS
Remark 1. Note that we do not assume that F(-) is constant, or even if F(-) is constant, that it is nonsingular. This allows us to consider systems whose number of inputs need not necessarily equal the number of outputs. If F() is rectangular, it can be made square by adding rows or columns of zeros, as appropriate. 2. This theorem shows that under the mild assumptions on G(-), the solvability of the closed-loop system, and the assumption that H() is of exponential order, we can deduce a great deal about the form of (/(•)• Proof
(i)
Balancing impulses in (6) gives H0=G0
— H0 F0 G0,
or
H0(I + F0 G0) = G0
where F0, G0, and H0 denote, respectively, the strengths of the impulses at t =0 of F(-), G ( ) , anc * H(-). In order for H0 to be uniquely determined from (9), it is necessary for I + F0G0 to be nonsingular. Now define E(s) = [I + P(s)G(s)]'1 = I - F(s)H(s) Since E(s) = I — F(s)H(s) (see Exercise 2) and since F and H both belong to jtfnXn(a), clearly so does E. Thus, E(s) is bounded in Re s > cr, analytic in Re s > a, and tends to I + F0G0 as Re s-> ao. Hence sh-^l/det E(s) is meromorphic in Re s > a and is analytic and bounded away from zero in some half-plane Re s > a for a sufficiently large. Consequently, by Appendix D.3.3, Eis)'1 e JnXn(ot). But by (10), this means that IS(-) + F(-) * G() e ^nXn(oc). Thus, F * G is Laplace transformable, and FG is analytic for Re s > a. Furthermore, FG can be analytically continued to a meromorphic function in Re s > a, since det E(s) can have almost isolated zeros in Re s > a. Since G ( ) = H(s)[I + F(s)G(s)], the same conclusion holds for (/(•)• Finally,
G=HE-1eJnXn(a).
(ii) Since G( •) is Laplace transformable, we may write H = G(I + FG) ~ *. Routine matrix algebra can now be used to show that G(s)=H(s)[E(s)]-1 where E(s) is defined in (10). (iii) As we have seen, H{ •) e stfn x n{o) implies that E( •) e stfn x "(a), whence det E(-) e s$(o). Thus, there exists a finite constant k such that | det E(s) | < k whenever Re s > a. But this, in turn, implies that 1/|det E(s)\ = |det[/ + F(s)G(s)]\ > \\k which is enough to prove (8).
whenever
Re s > a s:
The factorization (7) is the first hint of a similarity between the theory for systems with rational transfer functions and the general case of convolution feedback systems.
4
CONVOLUTION
FEEDBACK
SYSTEMS
85
Exercise 1 Suppose that n = 1, that g(0 = g0S(t) + gfl(0> with 0 a (') e L1, and /(s) = / 0 , a nonzero constant. Show that (8) is equivalent to the statement: s H-> 1 +f0g(s) has no zeros in Re s > a. This holds if and only if the Nyquist diagram of g [i.e., the graph of co \-+§(a + jco), COGU] does not intersect or encircle the point (—1// 0 , 0) in C. For other graphical tests, see Section 5. [The significance of this exercise is as follows. There are clearly two possible ways in which the condition (8) can be violated: (i) det[J + F(s0) G(s0)] = 0 for some s0 with Re s0 > cr, or (ii) no such s0 may exist, but there may exist a sequence {st} with Re st > a such that det[7 + Fis^GiSi)] -* 0 as / -> oo. This exercise shows that under the stated conditions, the second possibility cannot occur. Furthermore, it provides a means for verifying whether or not the first possibility occurs by studying only the behavior of the function co i—• g(a +jco).] Exercise 2 Show that the following relationships hold for the system described in Theorem (5): 13a
H =G(I + FG)'1 = ( / + GF)~ 1 G
13b
G=H(I-FHY1
={I-HFY1H
13c
(/ - FH)(I + FG)=I
13d
(/ - HF)(I + GF) = I The relation between (13a) and (13b) is made clearer by the observation that H is obtained from G by putting a feedback F around G, while G is obtained from H by putting a feedback of — F around H. Exercise 3 Show that if ft e Jn x n and F e i n X " , then so does E. Show that if in addition F ~J e Jn x \ then ft e Jn x n if and only if E e Jn x \ Knowing that in order for the closed-loop impulse response to be of exponential order, G ( ) must be of the form (7), we can now formulate a very general theorem that can, in turn, be specialized to various practically significant situations.
14
Theorem Consider a feedback system described by (1) and (2). Suppose that F( •) E stfn x", that the system has a uniquely defined closed-loop impulse response H(), that G(-) is Laplace transformable, and hence that ft(s) = G(s)[I + F(s)G(s)]~1 over the common half-plane of convergence. U.t.c, # e j t f n x n i f andonlyif (i) there exist «#(•) and Qj(')'m^nXn
15
G{S) =
such that
JV°(S)QJ-1(S)
86
IV
LINEAR
SYSTEMS
Moreover, the following non-cancellation condition is satisfied: Whenever (s^ is a sequence with Re st > 0 such that lim^^ldet @>(s?)\ = 0> w e n a v e lim i n f ^ | det[$(Si) + i ^ V P f o ) ] I > 0. [This condition is hereafter referred to in abbreviated form as follows: The ordered pair of functions [det 3, det(^ 4- FJ^)] satisfy condition (N).] (ii) inf \det[I + F(s)G(s)]\ > 0 Res>0
Proof
=> Rewrite the relation between G and H as follows G=H(I
-FHy1
Hence with Jf = H, 3 = I — FH, we have (15), Furthermore, the no-cancellation condition (N) also holds since det(# + PJf) = det J - 1,
Vs in Re s > 0
Thus, statement (i) is established. Consider now (13c) and take determinant of both sides; then det [J + FG] = l/det(7 - FH) nXn
Since I — FH e ja/ , it is bounded in Re s > 0, and so is its determinant. Hence (16) follows from (17). <= We show first of all that (16) and (15) together imply that inf \det[&(s) + P(s)rf(s)]\
>0
Re s > 0
To prove (18), suppose by way of contradiction that (18) is false, and let (st)f be a sequence with Re st > 0 such that det[S(st) + Fis^Jf (jf)] -> 0. Since det(^ + FJT) = det § • det(J + FG), we see that if det(# + PJf) -> 0, then either det §) -» 0 or det(7 + FG) -• 0 [after taking subsequences of (stf\ if necessary]. The latter possibility is ruled out by (16). As to the former possibility, suppose det ^(st) -• 0. Then since the pair (det Q), det(it + PJ*)) satisfies condition (AT), it follows that lim inf |det[^(^ t ) + F(si)^(si)]\ > 0, which is a contradiction. Thus, (18) is established. Now, by matrix algebra, we have H = G(I + FG)'1 = Jf{§ + / t f ) _ 1 . In view of (18) and Appendix D.3.3, we see that (S + PJf)'1 eJnXn, whence HeJnXn. :: Exercise 4 Prove the following alternate version of Theorem (14). Let PeJnXn. Then H = G(I + FG)'1 E JnXn if and only if there exist Jf and § in JnXn such that (i) G = Jf^\ and (ii) inf \dQt[3(s) + F(s)J*(s)]\ > 0 Res>0
4
CONVOLUTION
FEEDBACK
SYSTEMS
87
Corollary Suppose F eJnXn and that G =tyV'^-\ where Jt, 3eJnXn, and the pair [det Q), det {0} + PJF)\ satisfies condition (N). Then H = G(I + FGy1eJnXn if and only if (16) is satisfied. Theorem (14), though quite easy to state and prove, has many interesting implications. Suppose we are given F e j$n Xn and G, and we wish to determine whether H = G(I + FG)'1 e JnXn or not. How would we proceed? We would first check the condition (16). If (16) fails, then definitely H <£ j
Then
and hence (16) is satisfied. However.
and clearly H $ sinXn. Thus, in order to conclude that H e stf"Xn, in addition to (16), we use the added assumption that G is of the form (15), where the appropriate condition (N) is satisfied. This brings us to the following question: Suppose we express G in the form (15), where «#, l e i " x " , but suppose the condition (N) fails to hold. What, if anything, can we conclude? The answer is, in general, nothing—one simply has to try to find a different factorization for G. On the other hand, if JV* and §) constitute a so-called pseudo-rightcoprime factorization, then definite conclusions can be drawn. We now proceed to study this last concept in detail. Definition Two elements Jf, <3) e srfnXn are said to be pseudo-right-coprime (pre) if there exist $ , -f, # e JnXn such that (i) det # ( s ) =?* 0 for all s with Re s > 0, \s\ < GO, and
88
21
IV
LINEAR
SYSTEMS
Definition Given a Laplace transform G(-), the pair (Jf, 3) is said to be a pseudo-right-coprime factorization (prcf) of G if
(i) (ii) Jf and # are pre, and (iii) whenever ( s ^ 0 0 is a sequence with Re 5*; > 0 and | ^ | -» oo, we have l i m i n f ^ J d e t ^ > ; ) | > 0. 22
Fact
Let G(s) e UnXn(s) and be proper. Then G has a prcf.
Proof If G(s) e IR"x n(s) and is proper, then there exist polynomial matrices N and D such tht iV and D are right coprime and such that ND'1 = G. Moreover, we can assume that D is column proper. Let det D(s) = I7?=iC?— /?£)m', and let <5; denote the highest power of s appearing in the /th column of D(s). Since D is column proper, we have YJ = I ^i = Z?=i m «- Let M(s) = diag[(j + l)*1, . . . , 0 + I)*5"], and define 23
/ = M "
1
,
3 = DM"1
Then <# and ^ are proper rational matrices with poles at £ = — 1, and hence Jf.Se JnXn. Moreover, G = Jf®-1. Thus, (i) of Definition (21) is satisfied. Since N and D are right coprime, there exist polynomial matrices P and Q such that 24
PN + QD= /,
for all
j
Now let a be an integer greater than or equal to the degree of any element of P and Q. Then the rational matrices 25
€ =P'(s+iy*,
-f' =
Q(s+iy*
nXn
both belong to jtf 26
. Moreover, from (24) we have
%Jf + r® = (PN + QD)M~\s
+ l)~ a = M _ 1 ( J + l ) " a = # ( * ) , say
Clearly, # ( 5 ) e i " x " . Moreover, det # ( 5 ) = (J + 1)"', where / is an integer. (In fact, / = ocn + £f = x mi.) So det #"(5) / 0 whenever Re.? > 0 and \s\ < 00. Thus, the condition (ii) of Definition (21) is satisfied. Finally, we have k
det S(s) = det D(s) • [det Mis)]-1 = ["] (s- p^
n
' Y[(s-
\ydi
So clearly det S(s) -• 1 whenever \s\ -> 00. Thus, the pair {Jf, §)) defined by (23) constitutes a prcf of G, according to Definition (21). :: Exercise 5 Show that Jf defined in (23) is proper.
4
CONVOLUTION
FEEDBACK
SYSTEMS
89
Exercise 6 Let (<#, $)) be a prcf of G. Show that G is a meromorphic in C + and that p, with Re p > 0 is a pole of G if and only if det Q)(p) = 0. Exercise 7 Let G possess a prcf (yT, # ) . Show that whenever {s^ is a sequence with Re ^ > 0 and lim i ^^ \st\ = GO, we have lim sup| G(s-)\ < oo. Loosely speaking, if G possesses a prcf, then G(s) must remain bounded as | s | -> oo with Re s > 0. The importance of pseudo-right-coprime factorizations is brought out in the following theorem. 27
Theorem Let FeJnXn, and let G = Jf$)~l, where (yf, ^ ) s a prcf of G. 1 U.t.c., H = G(7 + FG)~ e <*/"x n if and only if
28
(i)
inf | det[/ + F(s)G(s)] \ > 0 Res>0
and 29
(ii) det[^0) + F(S)J?(S)]
# 0 whenever
det &(s) = 0 and Re s > 0
nXn
Prflfl/ => Suppose fteJ . Then (28) follows, by Theorem (14). To prove (29), we show that if (29) fails, then H $JnXn. So let .y0 be such that det[@(s0) + F(s0).#(,s0)] = 0 and Re ^0 > 0. Since Jf and<3)are pre, there exist $ , -T, and # in JnXn such that
30 and det iP~(s) ^ 0 whenever Re s > 0. Now, starting from (30), we get
Now as iT-^o, the right side of (31) becomes unbounded, because det {0 + FJf) -• 0, while det it(s0) # 0. Thus, the left side of (31) must also become unbounded. But % — i^F and i^ are both bounded over the region Re s > 0. Hence H must become unbounded as s -> s0, so that H $ jtfnXn. Hence HeJnXn implies (29). <^= Suppose (28) and (29) hold. We must show that H e JnXn. We begin by showing that the pair (det 3, det(^ + FU^) satisfies condition (AT). Let (^j)!00 be a sequence with Re st > 0 such that det 3{sj) -• 0 as / -• 00. Since lim inf I det ^Csf) | > 0 as | st | -> 00, it follows that the sequence (si) is bounded. Therefore, it contains a convergent subsequence, which we renumber again as (si), and denote the limit of (s,) by s0. Then Re ,s0 > 0 and det 3(s0) = 0. But by (29), this implies that det[3(s0) + F(s0)J^(s0)] # 0. Thus, the pair (det S, det(^ + F # ) ) satisfies condition (JV). This fact, together with (28), implies by Theorem (14) that H eJnXn. ::
IV
90
LINEAR
SYSTEMS
Exercise 8 Prove the following alternate version of the Theorem (27). Given that(^,^)isprcfofGandthatFe^nX^wehavethatH=G(/+FG)_1e^n><" if and only if inf \dtt[@(s) + P(S)JP(S)]\
>0
Re s > 0
32
Remark As mentioned after Corollary (19), the condition (28) [or (16), which is the same thing] is necessary for H to belong to s/nXn, but is not sufficient. The present theorem more clearly brings out when (28) is sufficient for stability. Let (Jf, §) be a prcf of G and suppose F e s£nXn and that (28) holds. Then H e stfnXn if and only if (29) is satisfied. This condition is to be interpreted as follows. We have det {0 + tJf) = det Q) • det(7 + FG). Now suppose det @(s) = 0 with Re s > 0. If det(J 4- FG) is finite, then det(# + i v f ) = 0, and H$jrfnXn. [This is, in fact, the case in the example following Corollary (19).] On the other hand, if det(J + FG) has a pole at s, then the product det Q) • det(7 + FG) is indeterminate, and one has to evaluate det(# + FJf) directly. This theorem shows the importance of finding a prcf of a given transfer function G(-). This problem is made simpler by the following fact, which shows that it is only necessary to find a prcf of the " unstable part" of G ( ) .
33
Fact Let (Jf,®) be a prcf of G(-), and suppose G1(-)eJnXn. (Jf + Gx3, 3) is a prcf of G + Gt.
Then
Proof By hypothesis, G = Jr@-\ so clearly G + G1 = (Jf + Gx§) • S'1. Also by hypothesis, lim inf|det S>(s)\ > 0 whenever 1^1 -» oo with Re s > 0. So all that remains to be shown is that Jf + GXQJ and Q) are pre. Since Jf and Q) are pre by hypothesis, there exist %, f^, and iff in s3nXn such that det \iP"(s)\ ^ 0 whenever Re s > 0 and \s\ < oo, and such that 34
€Jf + ^
= #
So from (34) it follows that 35
$(Jf + Gx<2)) + {T - mG^Q) = # which shows that/T + GXQ) and S> are pre. As an application of Theorem (27), we derive completely explicit, necessary, and sufficient conditions for a class of multivariate feedback systems to be stable.
36
Theorem Let G(-) be of the form nti
k
37
G(s) =
n
RtJl(s -
J
Pi)
+ Gb(s) = Gu(s) + Gb(s)
::
4
CONVOLUTION
FEEDBACK
SYSTEMS
91
where Re Pi > 0 for all i, and Gb e i " x " . Let Gu(s)=N(s)D(sy1
38
where N and D are right-coprime polynomial matrices, and further D is column proper. Suppose F e JnXn. Then ft = G(I + FG)'1 eJnXn if and only if 39
(i)
inf | det[J + F(s)G(s)] | > 0 Res>0
and 40
(ii) dQt[D(Pl)+P(Pi)N(pd+
^1)6^)0^)]^
for i = l , . . . , *
Proof Given N and D, define Jf and ^ as in (23). Then (Jf, # ) is a prcf of GM, and therefore, by Fact (33), {Jf + GhQ), Q)) is a prcf of G. Hence by Theorem (27), H e ^nXn if and only if (39) holds, and in addition 41
det[#(s) + F(S)JP(S) + F(s)G 6 (s)^(s)] 7^ 0 whenever det §(s) = 0 and Re s > 0 However, it is clear from the way that Jf and Q) are constructed that det Q)(s) = 0 with Re s > 0 if and only if s = Pi, / = 1, . . . , k. Furthermore, jf(s) = N(s)M-1(sl 9(s) = D{s)M~\s\ and det M(Pi) ^ 0 for / = 1, . . . , k. Therefore, (41) simplifies to (40). ::
42
Corollary
Suppose n = 1 (scalar case), that k
43
0(s)=t.
mi
T.rijl(s-Pi)J
+db(s)=gu(s)+gb(s)
• = i j = \
and suppose/, gb e s>2. Then h = gj(\ +fg) e s£ if and only if 44
inf \l+f(s)g(s)\
>0
Res>0
45
f(Pi)*0,
i = l,...,fc
Proof Let gu(s) = n(s)jd(s), where «(£) and d{s) are polynomials with no common zeros. Then (39) reduces to (44), while (40) becomes 46
d(Pi) +f(Pi)n(Pi)
+fiPdgb(pdd(Pd
* 0,
1 = 1, . . . , k
However, since d(Pi) = 0 and n(Pi) ^ 0, (46) reduces to (45). 48
::
Remark When G has several right half-plane poles, the right-coprime factorization (38) may be quite cumbersome. Since the condition (40) is purely local, it is possible to deal with each pole successively. Call R^s) the singular part of the Laurent expansion of G about Pi, i = 1, 2, . . . , k. Call Mt the
92
IV
LINEAR
SYSTEMS
difference between G and Rt; Mt is analytic in a small disk centered a t / v We have G(s) = [Us) + Mt(Pi)] ^lMt(s)
- Miipd]
The first bracket is a proper rational matrix, hence has a right-coprime factorization, say, A^D; -1 ; the second bracket, say $ f , is locally analytic and
6,0*,) = 0. Thus, G(s)=Ni(s)Di(sy1
+ ®i(s)
We leave it as an exercise to show that (40) can be replaced by 50
detld&d+PipdfiiiPiK^O,
for
i = l,2,...,fc
Exercise 9 With the notations and assumptions of Remark (48), show that H has a pole at pt if and only if (50) fails.
5.
Graphical test
It is well known that the Nyquist graphical test is important for three reasons: (i) It is based on directly measured experimental data, which can be obtained with great accuracy. It is not like the Routh-Hurwitz test or the Lienard-Chipart test, which are applied to data derived by interpolation from the measurements. (ii) It applies to distributed systems. (iii) In case the criterion is not satisfied, the required design modifications are readily apparent. In this section we present the graphical test for the distributed «-input-«-output case and also for the scalar case. We consider a particular case of the system of Theorem (4.36) in that the feedback transfer function is a constant matrix F. As before, fc
G(*) = I
m,-
ZRijKs-Piy
+ G.is)
The graphical test is used to check the inequality (4.39). The following equation describes our notation OO
det[/ + FG(s)] 4 1 + g{s) 4
1 + ga(s) + £ $r"' i= 0
I
+ I k=l
jUfc
E rj(s a=l
- pkf
5
GRAPHICAL
TEST
93
where ga e L1, Y,o \9i\ < oo, Re /?fe > 0 for /: = 1, 2, . . . , /, and pk, the order of the pole pk of det[7 + FG(s)], need not be equal to mk. In fact, 0 < \ik < nmk. We assume 0 = t0, tt > 0 for all / > 0. In the scalar case, as in Corollary (4.42), the expression to be tested is of the same form as (2), except for the fact that we have taken / = 1, for simplicity. Roughly speaking, the graphical test is based on the image of the jco axis under the map s h-> 1 + g(s). We must first define the phase of 1 -f g(jco) for all co EU: 4
6(jco) 4 arg[l + g(jco)] = Im{log[l + g(jco)]} There are two difficulties with this expression. First, 1 + g(jco) may be zero for some co. In that case, the test (4.39) fails; i.e., the closed-loop transfer function $ <stfnXn, and no further work is required. Second, one or more of the poles pk may be on theya>axis. In that case, we " indent" the jco axis at every pole. More precisely, let Ik denote the line segment centered on the yco-axis pole pk and of length 2p, where p > 0 and sufficiently small; for all jco-axis poles we replace these line segments Ik by half-circles of radius p, centered on the pole and lying in the right half-plane. Along the indented jco axis, the function s i—• 1 + g(s) is uniformly continuous, and the phase 9 is well defined. To every point on the indented jco axis associate its ordinate co; this defines a bijection between the real line, — oo < co < oo, and the indented jco axis. For this reason, we abuse notations and denote by 6(jco) the phase of 1 + g(s) at the point s of the indented jco axis whose ordinate is co. Thus, as co increases and goes around the polepk = jcok of order mk, we have 9[j(cok + p)] — 6 [j(cok + p)] = — mkn+ O(p); i.e., 6(-) decreases by mkn. At this point, we have O(jco) well defined as a continuous function of co except that we have to specify the branch of the logarithm we use in (4). We choose it as follows: if 0 < 11 + $(/0) | < oo,
then 6(j0) is equal to zero or n
according as 1 + g(jO) is positive or negative, respectively; if
1 + g(-) has a pole at 0,
then #0*0) is equal to zero or n
according as whether 1 + g(o) is positive or negative for all <J restricted to (0, p) where p is chosen sufficiently small. Thus, we have a well-defined continuous function co H-> 6(jco), which is the phase of 1 + g(s) along the indented jco axis. Let V0 denote the jco axis duly indented in the manner described above. The graphical test is based on the image of V0 under the map 1 4- g(-). Let Jf (for Nyquist diagram) denote this image. It will help us to consider in succession three increasingly complicated cases.
94
IV
LINEAR
SYSTEMS
Case I All the g/s in (2) are zero Then 1 + g(s) is analytic for Re s > 0, except at the poles pk, and, by the Riemann-Lebesgue lemma, it tends to 1 as | s | -* oo with Re s > 0. This limit is attained uniformly in arg s for |arg s\ < njl. Therefore, for any £ > 0, there is an r > 0 sufficiently large so that (a) all poles pk are included in B(0; r) n C+ , namely, the right half of the disk centered on the origin and of radius r\ (b) for all |a| < TT/2, 11 + g(r^)\ < 1 + e. Call c€r the right half-circle, which is on the boundary of the above halfdisk. The function 1 + g(') is meromorphic in the interior of B(0; r) n C + and uniformly continuous on its boundary, namely, V0 u <€r. Therefore, the principle of the argument applies: 1 + g{ •) has no zeros in the interior of V0 u c€r if and only if the net increase in its argument 6 as we traverse V0 u <€r in the clockwise direction is A0 = £ x fc \ik. Since by statement (b) above, 1 + g is bounded away from zero outside B(0, r), we conclude with the following theorem. 5
Theorem With the notations of (1), (2), and (3), and assuming that gt = 0 for all i > 0,
6
inf \det[I + F6(s)]\ > 0 Re s>o
if and only if 7
1 + g(jco) ^ 0,
for all
OJGU
and 8
A6 = lim [00'") " 0( -JQ)] =^^k fi->oo
= np
k
where the summation is over all poles pk that lie in the open right half-plane. The interpretation of (8) is the following: As co increases from — oo to + oo, following the required indentations at the jco-axis poles of 1 + #(•), the corresponding point traverses Jf and encircles the origin Yj^k=nP times in the counterclockwise direction. Note that np denotes the number of poles in the open right half-plane, where multiple poles are counted according to their multiplicity. Note also that (7) asserts that Jf does not go through the origin. Case II The g/$ are not required to be zero, but we assume that there is a sequence of nonnegative integers O^o00 and a positive number x > 0 such that n0 = 0 and 10
tt = ntT,
V7 e Z +
5
GRAPHICAL
TEST
95
This is an important special case because it occurs (a) in circuits which include one uniform lossless transmission line or a number of such transmission lines whose lengths are rationally related; (b) in control systems and in bioengineering models where there is only one transportation lag or a number of transportation lags whose time delays are rationally related. Condition (10) has two interpretations: (a) The tt9s are rationally related: tt = tknjnk, V7, k e Z + . ex n co 1 s (b) The function cov-^Y^Qi P(~~ J i ' ) * & periodic function of period 2%\x. Let OC
00
11 By the Riemann-Lebesgue lemma, as \s\ -> oo with Re s > 0, we have 1 2a
1 + g(s) -*?(s)
uniformly in arg s on
[ — n/2, n/2]
and 1 2b
1 + g(s) -> 1 + g0
for
s -» CXD along the real axis
Let 13
0(co) * arg/t/G)) Since cDt-*f(jco) is periodic with period
14
ITZ/T,
we have
(J)((JO + 27i/i) - <j)((o) = m2n, where m is an integer. If m =0, there is no increase in 0 over one period and coi->(/)(co) is periodic. If m ^ 0, then there is a net increase in phase of m2n per period, and we have
15 where X =mx and 4>p(') is periodic. Graphically, (12a) implies that the image of V0 under the map s\-+l + g(s) approaches, as | co \ -> oo, a closed curve J ^ , which is represented by 16
^oo^{f(jco)\0
96
IV
LINEAR
SYSTEMS
The graphical test for Case II is a special instance of Case III in the following. Case II can also be established independently by conformal mapping techniques using the transformation z = e x p ( — ST) [Wil. 5]. The test can be expressed as follows. 18
Theorem With the notations (1), (2), and (3) and assuming that the tt's are rationally related [(10)], we have
19
inf \det[I + FG(s)]\ > 0 Re s > 0
if and only if 20
l+£o
21
1 + g(jco) j= 0,
^0 for all
weR
22 where the summation is taken over all open right-half-plane poles, counting their multiplicity. Condition (22) implies that X = 0, or equivalently m = 0; graphically, it means that the closed curve Jf ^ does not encircle the origin. Furthermore, (21) and (12a) require that both Jf and Jf ^ do not go through the origin. Case III General Case: No Specializing Assumptions We shall not prove this case. We shall only describe what the test involves and in what way it differs from the preceding cases. In the present case, the function/defined, as in (11), by OO
turns out to be an almost periodic function in the right half-plane. (For definition see [Cor.l].) The limiting conditions (12a) and (12b) still hold. Since co\->f(ja)) is almost periodic, given any e > 0, there are e-translation numbers T£ which satisfy the condition 26
| f(jco) - f(j(D + JT£) | < 8,
for all
coeU
Furthermore, these translation numbers are 1(E) relatively dense on R. This means that any interval of length 1(e) contains at least one e-translation number. For these facts consult [Cor.l]. These facts have a very important consequence—consider the image under f(j') of the compact interval [0, /(e)], namely, 27
Jf{ 4 {z e C | z =f(j(o), 0 < oo < /(e)}
5
G R A P H I C A L TEST
97
Let a e Z and consider 28
Jfal ^ {z e C | z = / ( » , a/(e) < co < (a + l)/(e)} By definition of /(e), we have the important fact that for all a e Z , e/Taj is within an s neighborhood of Jfx. Consequently, the image of the jco axis under / ( • ) lies within an s neighborhood of Jf{. Using the same £ as in (26) and (28) and invoking the Riemann-Lebesgue lemma, there is an Q£ > 0 such that for all | co \ > QE, the image of V0 under 1 + g( •) lies within a 2s neighborhood of Jf t. As \co\ becomes very large, Jf enters and remains within 2e neighborhood of Jfx. It can be shown that the phase <j> of the almost periodic function f(jco) is necessarily of the form
29
(j>(co) =Xco + h(co)y
co EU
where XeU and /?(•) is almost periodic, hence bounded on U. Note that k ^ 0 if and only if, for s sufficiently small, the corresponding curve Jf x encircles the origin. To state the graphical test, it is convenient to denote by N{Jf i; 2s) the 2s neighborhood of Jf u with Jf', being the curve defined by (27). Using these facts, we can state the graphical test as follows. Theorem With the notations of (1), (2), and (3), inf
\det[I + FG(s)]\ > 0
Res>0
if and only if (0 l + ^ o ^ 0 (ii) the. position of the curves {z e C | z =f(jco), co e U} and {z e C|z = 1 + g(jco), co eU} with respect to the origin O of the complex plane is such that (a) for an s > 0, sufficiently small, the point O does not belong to N{Jfx\ 2s) and to {z e C|z = 1 + g(jco), 0 < co < Q(e)}, where Q(s) is defined above; (b) for the same s, with Te denoting a corresponding translation number, it is required that |#T,)-#0)|<jt/2
(c)
lim [6(ja>) ~
where np is the number of open right-half-plane poles counting multiplicities of §, 0 is the phase of 1 + g, and
98
32
IV
LINEAR
SYSTEMS
Remarks 1. The graphical test (30) requires the knowledge of the sequences ($1)0°° a n d (^)o°° m order to plot Jf x and obtain >(•). 2. Condition (b) essentially says that Jf x does not encircle the origin. Indeed, by (13), > is the phase off; by (26), | f(jtE) — f(0) \ < s; by condition (a) I f(JTE) I and | /(0) | are both larger than 2s. So condition (b) says that as co increases from 0 to T £ , the point f(jco) does not encircle the origin. 3. In simple cases, having chosen an s > 0, it is easy to obtain an estimate for Q(e) and /(e). Then, only images of compact intervals need to be plotted. In complicated cases, it is not easy to give a lower bound on 1(e); there is the possibility that in (29) X is, say, positive and very small so that over [0, /(e)], the contribution of Xco is not apparent. Using (^i)0°° and (^)o°° and Diophantine analysis, we can obtain a lower bound on X if X were positive; hence this gives a lower bound on 1(e) so that the condition (b) will guarantee X=0. Exercise Use the graphical test to discuss the stability of the following system: uu eu yt: U+ -• U; u2 = 0; the forward gain is a real constant k; the feedback subsystem has e~s as transfer function; the constant k takes values in (0, 00). Check your answer by calculating the impulse response of the system.
6
Discrete-time systems Discrete-time systems arise
(a) from modeling systems that are inherently digital such as digital filters and computer-controlled systems where the inputs and outputs are periodically sampled; (b) from approximations of continuous-time models where the inputs and outputs are approximated as piecewise constant functions; for example, u(i) = ak, for kT < t < (k + 1)T, ak constant, and k = 0, 1, . . . ; (c) in computer algorithms for solving continuous-time problems. In all these cases, the inputs and outputs can be viewed as sequences defined on Z+ (the set of nonnegative integers) taking values in a Banach space E (i.e., complete normed space). Typically this Banach space will be R, C, Un, C", Unxn, etc., . . . .
6.1
Existence and uniqueness
We consider once again a system whose configuration is as shown in Fig. IV. 1. Since we are dealing now with the discrete-time case, w, e, and y represent sequences in W. We study the conditions under which there exists
6
DISCRETE-TIME
SYSTEMS
99
a unique sequence e corresponding to each sequence u. In what follows, we allow both F and G to be time-varying operators with memory, but we restrict them to be linear and nonanticipative. So, to establish our notation, we have Sn = the set of all maps x from Z + into Un
1 2
u, e, y e S",
or equivalently,
F: Sn -± Sn,
3
u, e, y: Z+ ->W, e.g., u = (u0, ul9 w2, ...)
and
(Fx)t = £ Fu
Xj
y=o
G: S" -• Sn,
4
and
(Gx), = £ G lJjci
Notice that there is no real restriction in assuming that the input, error, and output all have the same number of components; for if this were not the case, then one can always add rows or columns of zeros, as appropriate, to the matrices Ftj and Gtj. 5
Theorem There exists a unique e e S" satisfying the equation
6
e = u — FGe n
corresponding to each u e S , if and only if 7
det(I + i v m G m , w ) ^ 0 , Proof
VmeZ +
Since the system in Fig. IV. 1 is characterized by the equations
8a
e = u — Fy
8b
y = Ge
it is clear that there exists a unique pair (e, y) in Sn x Sn satisfying (8a) and (8b) corresponding to each u e Sn, if and only if (6) has a unique solution e e Sn corresponding to each u e Sn. Thus, we justify concentrating on the existence and uniqueness of solutions to (6). <= If we expand out the equations forming (6) and write them out as simultaneous equations in the infinite number of unknowns e0, el9 . . . , em, . . . , we see that the matrix of coefficients multiplying (e0, el9 ...) is lower triangular, and that the diagonal elements are J + F 0 0 G 0s0 , . . . , I + Fm>m G m m , . . . . Thus, if (7) holds, then for any u e Sn, we can find a unique e e S" satisfying (6). => By contradiction. Suppose (7) is false, and let k be the smallest integer m such that det(7 + Fm>mGm>m) = 0. Then, given any u e Sn, the
100
IV
LINEAR
SYSTEMS
quantities e0, eu . . . , ek_x can be uniquely determined. Now the equation for ek is k
9
k
YFkjGijej
e* = w * - E i=0j=0
or, collecting all unknown quantities on one side and all known quantities on the other, k-l
(I + J7k,kGk,k)ek = uk-YJ
10
i
k-l
!Lfk,iGijej-Y
i=0;=0
F
k,kGkjej
j=0
Depending on the particular sequence u under consideration, the right side of (10) may not be in the range of / + FkkGkk, in which case (10) has no solution; or it may be in the range of / + FkkGkk, in which case (10) has infinitely many solutions. But in either case, (10) does not have a unique solution, whence neither does (6). :: The importance of Theorem (5) lies in the fact that it provides a very simple, necessary, and sufficient condition for the closed-loop system characterized by (8a) and (8b) to be solvable, under relatively mild assumptions on F and G. The only crucial assumptions on F and G are that they are (i) linear, and (ii) nonanticipative. But other than that, F and G may be time invariant or time varying, and they may have memory or be memoryless. Exercise 1 Based on Theorem (5), one can readily derive a large number of criteria for various classes of discrete feedback systems to be solvable. We give one of the most important cases as an exercise. Let G: Sn -* Sn be time invariant, i.e., Gttj = ^(i — j) = &i-j, say (the causality assumption on G, of course, implies that (Si = 0 for / < 0), and let F: Sn -» S" be a memoryless time-varying gain, i.e., Fiti = # ' ; , Fitj = 0 for i>j. Then (6) has a unique solution e e S" corresponding to each u e Sn if and only if 11
det(J + &m &0) # 0,
6.2
Vw e Z +
Z-transforms
The main properties of z transforms are a direct consequence of properties of power series. Given a sequence a = (a0, au a2, ...) with the afs in a Banach space E, we define its z transform by OO
12
%{a) =a(z) = Yiakz~k fc = 0
6
DISCRETE-TIME
SYSTEMS
101
This is a power series in z _ 1 ; it has a radius of convergence ra and converges outside B(0; ra), the closed disk of center 0, and radius ra. It is a well-known result that ra =limsup||tfj 1 / f c k-+ oo
Furthermore, (a) the right-hand side of (12) converges absolutely for any \z\ > ra ; (b) for any S > 0, it converges uniformly in the complement of B(0; ra 4- (5), the open disk of center 0 and radius ra + S. (c) the right-hand side of (12) is an analytic function in the open set
\A >ra. In the following we shall use the superscript tilde(~) to denote z transforms; viz., a = &{a\ G = 3T(G). The connection between z transforms and the Laplace transform is the following: To the sequence a = (a0, al9 ...) associate the time "function" Y,o ak 5(t — k). Its Laplace transform is Xfc°=o ^ke~ks- By comparison with (12), we see that z corresponds to es. Thus, the open left half-plane, Re s < 0, corresponds to B(0; 1), the open unit disk \z\ < 1; the closed right halfplane C + , Re s > 0, corresponds to the complement of i?(0; 1), i.e., \z\ > 1. This observation is very useful in translating a proof of the continuoustime case into one for the discrete-time case. To recover the sequence from its z transform, we use a classical result on Laurent expansions as in the following theorem. Theorem Let a = (a0, al9 ...) be a sequence in a Banach space E. Let a be its z transform and ra its radius of convergence. Then, for any simple closed rectifiable curve y which lies in \z\ >ra and which encircles the origin once in the counter clockwise direction, ak = (1/2TT/) & a(z)zk~1 dz,
k = 0, 1, . . .
These results are to be found in Dieudonne [Die.l, Chap.9], Hille and Phillips, [Hil.l, Chap.5.4].
6.3
Stability of discrete-time feedback systems
In this subsection, we leave the proofs of the various theorems as exercises to the reader because they can be easily constructed from those of the corresponding theorems for the continuous-time case. It is a fact, however, that in many instances the theorems for the discrete case are more intuitively
102
IV
LINEAR
SYSTEMS
clear, and less cluttered, than their continuous analogues. Where this happens, it is pointed out. We consider a discrete-time linear feedback system as shown in Fig. IV.2. The subsystems G and Fare both time invariant, and as such they are characterized by their "unit pulse responses" G and F, respectively. Specifically, we have 18a 18b
SnXn = {set of all mappings from Z + into UnXn} G, FeSnXn;
e.g., G = (G 0 , G„ . . . .), G f eK n X ",
V/eZ +
The equations characterizing the feedback system are m
19a
e=u-F*y,
or em = um - £
K-iyi
i= 0 m
19b
y=G*e,
or ym =
Y,Gm.iei i= 0
If w, e, y, G, and F are all z transformable, then (19a) and (19b) can also be rewritten as 20a
e(z) = u(z) - F(z)e(z)
20b
y(z) = G(z)e(z)
Note that if both G and F are z transformable, then the closed-loop transfer function satisfies
21a 21b
R = G(I + FGy1 (/ - FH)(I + FG) = (/ + FG)(/ - FH) = I But in any case, / / satisfies the time domain equation
22
H = G-
H*F*G
If G(z) is rational and F(z) equals a constant F, we can state a theorem analogous to Theorem (2.30) and Corollary (2.43). 23 24
Theorem Let G{z) be rational and proper; let F(z) = F be a constant and suppose det[/ + FG(oo)] = det(/ + FG0) * 0 Let G(z) = N(z)D(z)~1, where the polynomial matrices N(z) and D(z) are right coprime. U.t.c,
6
DISCRETE-TIME
SYSTEMS
103
(a) the closed-loop transfer function H(z) is exponentially stable [i.e., all of its poles are in B(0; p) for some p < 1] if and only if the polynomial det[5(z) + FN(z)] has all of its zeros in B(0; 1), the open unit disk; 25
(b)
det[/ + FG(z)] =
~ = det H(z)
~ det D{z)
where (p0i)in and (/>c;)i" are the poles of G ( ) [i.e., the zeros of det D(z)] and the poles of H() (i.e., zeros of det[5(z) + FN(z)]), respectively. In both cases, multiple poles are counted according to their multiplicity. Note that the remarks (2.46), (2.58), (2.62), and Theorem (2.70) also apply in the present case. Note also that the assumption (24) is quite reasonable since, by Theorem (5), (24) is necessary and sufficient for the closed-loop system to have a unique solution. 26
Corollary
If H( •) e U(zf
xn
and if it is exponentially stable, then
(a) for any minimal representation [of the form xk + l = Axk + Buk, yk = Cxk + Duk] of H(z), the equilibrium point x = 0 is globally, exponentially, uniformly (in k) stable; (b) for any p e [1, oo], if u e / / , then y = H * uelnp, and both uk and yk -> 0 as k -> oo whenever p < oo; (c) if u e ln™ and w* -• &/<», a constant vector in Rn, then yk -> H^u^ as k -> oo, and the convergence is exponential. :: In the case where G(z) is not necessarily rational, our results are based on a straightforward extension of Wiener's theorem (Appendix D.3.6.). Let | • | denote any suitable norm on Un and also the corresponding induced norm on UnXn. A sequence (a0, ax, ...) of vectors in Un (resp. of matrices in UnXn) is said to be in lnl (resp., l*Xn) if £ f * 0 I ai I < oo, and its z transform is said to be in l„ (resp., VnXn). The following lemma is an important tool in the subsequent work. 27
Lemma Let M = (M 0 , Mu ...) be a sequence in UnXn. Assume that Me tfx^i.e., \\M\U ^ X r = o \Mk\ < o o . U.t.c, (a) its z transform zi—>Af(z) is analytic in \z\ > 1, uniformly continuous on the unit circle e[\ 0<9<2n; \M(z)\ < HA/^ for all \z\ > 1, and M(z) -> M0 as | z | -> oo;
IV
104
LINEAR
SYSTEMS
(b) M has an inverse in l*Xn [i.e., there is a P = (P 0 , Pu ...), with \\P\\X < oo, such that M * P = P * M = (I, 0, 0, ...)] if and only if 28a
inf |detM(z)| > 0 (c) for any u e / / [i.e., u = (u0, uu ...) with £ o \uk\p ± (\\u\\p)p < oo],
28b First, we state a general set of necessary conditions. 29
Theorem Consider the system characterized by (19a) and (19b). Suppose Fel„Xn, and that the closed-loop system has a unique solution (e, y) in Sn x Sn corresponding to each input u e Sn [or, equivalently, that H is uniquely determined by (22)]. U.t.c, if He l^Xn then
30 31 32 33
(i) G is z transformable; (ii) G is analytic outside some finite ball B(0; r), where r < oo; (iii) G is of the form G(z) = N(z)[D(z)]-\ where JV(-), D(')el^n\ (iv) all singularities of G in the region {z: 1 < \z\ < r} are isolated poles;
34
(v)
inf | det[/ + F(z)G(z)] | > 0.
::
\z\ = l
35
Remarks (i) Note that Theorem (29) is significantly more comprehensive than its continuous-time analogue, namely, Theorem (4.5), because there is no assumption in the present case corresponding to " G is a distribution of order at most zero in some neighborhood of the origin," as in Theorem (4.5). The only assumptions on G in the present case are linearity and time invariance, and nothing else. (ii) In Theorem (4.5), we conclude that all singularities of G must be in some half plane, while in the present case we conclude that all singularities of G must lie in some disk in C. As shown later, the fact that all singularities of G lie in a compact set has the effect of making the pseudoright-coprime factorization technique much more pertinent and valuable to the discrete-time case than the continuous-time case. We now state the discrete analogue of Theorem (4.14).
36 37
Theorem Consider the feedback system characterized by (19a) and (19b). Suppose G is z transformable, and that Fe ljlXn. Then H e l„Xn if and only if (i) There exist N, D in Vn x „ such that (a) det D0 ^ 0
6
DISCRETE-TIME
SYSTEMS
105
(b) det [D(z) + F(z)N(z)] # 0 whenever \z\ > 1 and det D(z) = 0, and (c) G(z) =N(z)[D(z)]-\ and 38
(ii)
inf | det[/ + F(z)G(z)] | > 0 ki>i
39
Remark It is easy to verify that (i) (a) and (i)(b) merely ensure that the pair (det D, det(D + FN)) satisfies the no-cancellation condition (N) in the region {z: \z\ > 1}. In the present case, we have exploited the fact that D(z), N(z), and F(z) all have definite limits as \z\ -> oo, namely, D0, N0, and F0, resp. Next we turn to pseudo-right-coprime factorizations and to stability results based on them.
40
Definition Two elements Jf, S) in 7,JX|I are said to be pseudo right coprime (pre) if there exist 4?, IT, # in Vnxn such that (i) det iT(z) ^ 0 whenever \z\ > 1, \z\ < oo, and
41 42
(ii)
for all | * | > 1 .
Definition Given a z transform G, the pair (^/T, ^ ) is said to be a pseudoright-coprime factorization (prcf) of G if (i) (ii) JV" and # are pre, and (iii) det 30 # 0.
43
Remark As is the case with Laplace transforms, in order for G to have a prcf, it is necessary that all poles of G outside the unit disk be contained in some compact set. But in contrast with the continuous-time case, this places no real restriction on G. because if G has poles of arbitrarily large magnitude, then we know by (29) that H^ /,JX „, and further analysis would be unnecessary.
44
Theorem Let FellnXn, and let G = J?9~\ Then H e l\ x „ if and only if
45
(i)
where (<#, §) is a prcf of G.
inf | det [J + F(z)G(z)] \ > 0
and 46a
(ii) det[5(z) + F(z)J?'(z)] # 0
whenever det D(z) = 0 and
\z\ > 1
106
IV
LINEAR
SYSTEMS
46b Theorem Let FellnXn, and let G = JfQ)~\ Then H e l„xn if and only if 47a
where (J*9 3) is a prcf of G.
inf | det[^(z) + F(z)Jf(z)\ \ > 0 Finally, we turn to the case where G(z) has a finite number of poles in the region { z e C : \z\ > 1}.
47b Theorem
Let Fe l*Xn, and suppose G{z) is of the form
48
G(z) = £ where
E * 0 -/(* - p,-y + C6(z) = SM(z) + 5*(z)
GbellXn, 5 I I (z)=iV(z)[5(z)]- 1
49
where iV and 5 are right-coprime-polynomial matrices, and further D is column proper. Then H e /,JX|I if and only if 50
(i)
inf | det[/ + ^(z)S(z)] | > 0
and (ii) d e t f e ) + F(pdN(Pi) + F(Pi)Gb(Pi)B(Pi)] ^ 0 51
Corollary
52
for
i = 1, . . . , &
Suppose n = 1, that g(z) = Y,
ZrijKz-pty'+faiz)
i=\
j=l
and suppose/, gbe ll. Then // e Z1 if and only if 53
(i)
inf | l + / ( z ) £ ( z ) | > 0
and 54
(ii)
/(/>,) # 0 ,
for
i = l , . . . , A:
We conclude with a note on the graphical test for discrete-time systems Let G(z) be of the form (48), and let Fe l*Xn. The objective is to derive a means of verifying the condition (50) by examining G(el9), 6 e [0, 2n]. For this purpose, define 55
1 + g(z) = det[J + F(z)G(z)] Note that g(z) is of the form (52).
6
DISCRETE-TIME
SYSTEMS
107
The graphical test is applicable to the image of the set D = {z = eie, 9e [0, 2n]} under the map ZI->1 + g(z). In case g(z) has a pole at some point eldo, we indent D by "removing" from it the set {z = eid, 9 = [90 — 3, 90 + 3]}, and "adding" the set {z = [1 + f](9 - 00)]ew, 9e[603, 90 + 3]}, where rj: U -» U is the "triangular pulse" function (0 n(x) = lx + 3 ((5 - x
56
if |JC| >3 if x e [ - < 5 , 0) if * e [0, (5]
Furthermore, we choose (5 > 0 sufficiently small so that inf 11 + g(z) | > 0 zeSo0
where Sdo is the set {z = re{\ 1 < r < 1 + rj(6 - 0o), 9 e [0O -3,60 + 3]} and such that Sdo contains no poles of g other than exp(7#0). Let us again refer to the simple closed curve that results from these indentations as D. Then with each 6 e [0, 2n] we can associate a unique element of D, which we denote by z(6). Now define 57
§i(0)=g[z(0)] It remains to define the argument of 1 + ^i(#). It is clear that as 6 varies from 0 to 27i, the function gt(9) is uniformly continuous in 9. Moreover, we can assume without loss of generality that 1 +#i(0) ^ 0 , because if 1 + ^i(0) = 0, the condition (50) is automatically violated, and further analysis is unnecessary. So we define
58
[l+g1(9)]
where the particular branch of the logarithm function is so chosen that 0(0) = 0 (resp., TT) if 1 + ^ ( 0 ) > 0 [resp, 1 + ^ ( 0 ) < 0]. With these definitions and conventions, we are ready to state the graphical test for discrete-time systems. 59 Theorem Under the above conditions, 60
inf 11 + g(z) \ > 0 if and only if
61
(i)
62
(ii)
l+<7o^0 inf
|1 +£ 1 (0)| > 0
06[O,2TT]
63
(iii)
(j)(2n) - 0(0)
=2n-mp
where mp is the number of poles of g(z) outside the closed unit disk.
108
IV
LINEAR
SYSTEMS
Exercise 2 (a) Show that (60) holds if and only if (i) 1 + g0 ^ 0, and (ii) 1 + g(z) =£ 0 whenever \z\ > 1. (b) Define £ = z _ 1 , Vze C, and define h(0 ^giC1). Show that (60) holds if and only if 1 + h(£) =£ 0 whenever | £ \ < 1. (c) Prove Theorem (59) by applying the principle of the argument to the function £ -> 1 +£(£)• Exercise 3 (a)
Let z = es. Show that (60) holds if and only if inf | 1 + g(es) \ > 0
64
Re s > 0
(b)
Let 00
§(z) = Y.9iz~l
00
so that
9(es) = X 9ie~ls
1=0
1=0
Prove Theorem (59) by applying Theorem (5.18) to the condition (64).
7
Linear time-varying systems
Linear time-varying systems have several features that distinguish them from linear time-invariant systems. To name only two: (1) A linear time-invariant system is represented by a convolution integral, while a linear time-varying system is characterized only by an integral operator. As a result, linear time-invariant systems can be conveniently studied in the Laplace domain or in the time domain, while time-varying systems can be studied only in the time domain. (2) Unlike a time-invariant system, a time-varying system can be L°° stable but not L1 stable, or vice versa. However, a linear time-invariant system is L00 stable if and only if it is L1 stable. In many of the stability studies in this section, we do not assume that the systems under study are nonanticipative, since this assumption usually does not affect the development one way or the other.
7.1
L00 Stability Consider a system whose zero-state response is given by 00
1
y(t) = I i =
«00
w,(0«(( -tt)+
— GO
where w, y: U -> U. We assume that
w(t, T)«(T) dx = {Wu)(i) ^ — CO
7
LINEAR T I M E - V A R Y I N G
SYSTEMS
109
(i) the Wj(*) and u(-, •) are all measurable [this implies, in particular, that w(t, •) is measurable for almost all t e U]; (ii) for all t e U, we have
2 -
Throughout this section || • || will denote the L00 norm, e.g., ||w||. Let ^ , the input space, be L°°(lR), and let ^ , the output space, be the set of all measurable functions from R into U. Then the conditions (2) and (3) ensure that ^ m a p s % into ^ , and clearly W is a linear map. Moreover, the domain of W is all of °ll\ given any «(•) such that ||w|| < oo, the quantity >>(0 is well defined by (1), and \y(t)\ < GO, Vf e IR. Our objective is to derive conditions under which a system whose zero-state or input-output response is characterized by (l)isL 0 0 stable. There are two possible ways of interpreting the sentence, "The system is L00 stable"; namely, (I) an input u e L00 produces an output y = Wu e L00; (II) there exists a constant c < oo such that ||^|| = || Wu\\ < c\\u\\ whenever weL 00 . The first statement simply states that a bounded input produces a bounded output. Statement (II) is more restrictive; it includes statement (I) as well as the added assertion that there is a maximum possible finite ratio between the norm of the input u and that of the output y = Wu. Now let us define the quantity 4
Coo
= sup ( £ reR
| w,(01 + f
\» = - oo
J
| w(f,
T)|
dx) /
-oo
With these definitions, we can state the following theorem. 5 6
Theorem Statements (I), (II), and (III)
c 0 0
are all equivalent. Proof We proceed in the following order: (III) (III) => (II) Given u e L00, we have
=> (II)
=> (I)
=> (III)
110
IV
LINEAR
SYSTEMS
But since the extreme right side of (7) is independent of t, it follows that y e L00, and that \\y\\ < c a Jw||. Thus, statement (II) holds with c = c^. (II) => (I) Obvious (I) => (III) The proof is based on the principle of uniform boundedness, which states: Let A be an arbitrary index set, and let (% , t e A) be a family of continuous linear functional mapping a Banach space X into a normed linear space Y. If for each xe X the set {rjt(x), t e A} is a bounded subset of Y, then {\\rjt||, t e A} is a bounded subset of U. To apply this principle for our present purposes, we let X = °U = L°°, Y = R, and define a family of linear functional (t]t, t e U), as follows. For each t e M, r\t is the map % -» U defined by o
-
8 o
Clearly ^r is linear, and it is continuous by virtue of the assumptions (2) and (3). Next, let us determine ||^f||. On the one hand, we have
so that 00
.00
We show now that the inequality in (9) is, in fact, an equality by showing that for any e > 0, we can find a function weL 00 such that \\u\\ = 1 and rjt(u) > bt — &, where bt is the right-hand side of (11). So given 8, pick an open interval 11 containing t — tt such that 10
f |vv(r, T)|
Let u be the element of L00 defined by
Then \\u\\ = l, and
Hence
rfT<(e/6)2~|f|
7
LINEAR
TIME-VARYING
SYSTEMS
111
Now suppose statement (I) holds; i.e., suppose that for all w e L00, the set {nt{u), t e U} is bounded. Then by the principle of uniform boundedness, the set {11*7,||, t e U} is bounded. But by (11), this means that QO
..GO
which is precisely statement (III). 13
ss
Remarks (a) Notice that W is not required to be nonanticipative. (b) If u: U-+W1 and y: U -> Km, then wt(-) and w(-, •) would all be m x n matrices, and (12) would stand as is, except that | • | would have to be interpreted as any norm on RmXn. (c) The number c^ is, in fact, the induced norm of the linear map W from L00 into L00. Exercise 1 Consider a feedback system where ul9 eu yx\ U+ -> U; Hu H2 map L00 into itself; and u2 is identically zero. Suppose that
where vv(-, •) satisfies (3) above; suppose also that
where (/>: U x U+ -• R is continuous and belongs to the sector [0, k). (a) Obtain conditions on the constants cM and k such that u1 e L00 implies yt e L°°. (b) Show that if w(-, •) satisfies (3) above and 0 is saturating [i.e., for each 7 > 0, 7 arbitrarily small, there exists a /? < oo such that 10(o-, t) | < y\<j\ + /?, Vcre R, Vr e R + ] , then ul e L00 implies j ^ e L00, regardless of the value of c^. In the case of discrete systems, we have a similar characterization. 14
Theorem Consider a system whose input u and output y map ^+ into R". Let 00
where w(k, i) e UnXn and satisfies
112
IV
LINEAR
SYSTEMS
U.t.c., the following three statements are equivalent:
(i)
.
17 (ii) 3c
7.2 L Stability Consider a system represented by r00 18
y(t)
=
w(t,
T)W(T) dxy
•'-oo
where Suppose w e L1 and that w(f, •) is bounded for all t e IR. Then y(t) is unambiguously defined by (18) for each t e U. We now derive conditions for the L1 stability of the system represented by (18). 19
Theorem Let y(-) and u(-) be related by (18). U.t.c, (I) ue L1 => y e L1, and moreover, there exists a constant c < oo such that || j || x < cllwlli if and only if
20
(II)
sup
| w(r, x) | dt = c^ < oo
Proof <= Suppose (20) holds, and let w(-) e L1. Then for y(-) defined by (18), we have
where we use Fubini's theorem to justify interchanging the order of integration. Thus (I) follows, with c = c1. => Let u(x) = d(x — X). Then the corresponding y(-) is given by y(t) = w{t, X)
7
LINEAR T I M E - V A R Y I N G
SYSTEMS
113
If (I) holds, then this y(-) must belong to L1. [Note that even though 3(T — X) does not belong to L1, it can be approximated arbitrarily closely in the weak * sense by an L1 function. ] In other words. r°°
| w(t, X) | dt < oo J -oo
Now let X vary over R, and let u{x) = d(x — X) as before. Then (I) implies that the corresponding functions w(t, X) must belong to L1 for each X e U, and moreover that the family of functions [w(t, X), XeU] must be uniformly bounded. Hence, we must have -00
sup A E R
| w(t, X)\ dX < oo ^ -CO
which is clearly equivalent to (20).
::
21
Remark Note that c{ is the induced norm of the operator W when viewed as a mapping from L1 into itself. To study If stability for p e (1, oo), we consider once again a system represented by (18), where w(t, •) and u(-) are locally integrable.
22
Theorem
Under these conditions, if
(a) for some constant c^ / . + CO
23
\w(t9 T)| dx Kc^ < oo,
VrelR
(b) for some constant cx 24
| w(t,
T)
Jr < d < oo,
VT G
R
•'-oo
Then, for any fixed p e [1, oo], uelf{— oo, oo) => .y elf( — oo, oo) In fact, 25 26
||j;|| p < c i ^ ^ t l ^ l l p ,
where
\\p + l/g = I
Remarks I. Assumption (23) is the necessary and sufficient condition for L00 stability, while (24) is the necessary and sufficient condition for L1 stability. II. Assumptions (23) and (24) can be rewritten as 3 constants c^ and cx s.t.
114
IV
LINEAR
SYSTEMS
For the time-invariant case, w(t, T) =f(t — T), the two conditions are equivalent and reduce t o / ( - ) e L1. III. (23) does not imply (24), or vice versa. To see this, consider w(t9T) = l(t-T)-e-x\l
+
\t\yl
Then (23) holds, but not (24). IV. The results still hold if u takes values in IR", y takes values in lRm, and w(t, T) is an m x n matrix. Then | w(t, x) | should be read as the induced norm of the matrix w(t, T). Proof In view of Theorem (19), we need only consider the case where 1
(by Holder) (by 23) dt
by (24) Hence
Exercise 3 (23).
Give an example of a function w(-, •) that satisfies (24) but not
Exercise 4 Prove the following stronger version of Theorem (22); consider a system of the form (18). U.t.c, this system is IF stable for all p e [1, oo] if and only if it is L1 stable and L°° stable.
7
27
LINEAR T I M E - V A R Y I N G
SYSTEMS
115
Application Consider the linear time-varying system where uu el9 e2, yl9 y2 U+-+U and
28
y1=g4:ei,
29
gestf
y2(t) = k(t)e2(t)9
k(-) continuous on R.
Assume u2 = 0 for simplicity. The equations for the systems can be written as 30 31
et(t) = ux(t) - k(t)(g * ex){t) e2(t) = (g* Ul)(t) - (g * ke2){t) Since (28) and (29) are linear, we may apply the incremental small gain theorem; then, in addition to bounds, we have existence, uniqueness, and continuous dependence. (a) L00 Stability
We have immediately «! e L00
=> et and e2 e L00
if either 33a
sup \k(t)\ f \g(x)d% < 1 or
33b
sup (b) L1 Stability
\g(t - x)k(z)\ dx = cj < 1
We have immediately wx eL 1
=> e1? e2 e L1
if either 34a
sup T>0
r00
\k(t)g(t - T)| dt = c / < 1
^T
or 34b
sup |/C(T)| T>0
|flf(0|
dt<\
^0
(c) I? Stability If (33a) and (34a) hold, or if (33b) and (34b) hold, then for any p e (1, GO), ut e IF => eu e2 e IF. Exercise 5 Consider a linear time-varying system described by (30) and (31). Suppose that gel} and that k(i) = k0 + 2kx cos co0t9
Vf e U+
116
IV
LINEAR
SYSTEMS
where k0, ku and co0 are real constants. Apply the loop shifting theorem (II.6.8) (with the linear map K — kQI) so that the feedback is 2k1 cos co0 t, and the forward loop is yt = gx * ex. Suppose that giijco) is of low-pass character, say, for co>coc, \gl(jw)\ < |^fO'coc)|(coc/co)2. Discuss the L2 stability of the system and show that as a>0 becomes much larger than coc, then kx can take very large values.
7.3 A perturbational result Consider the feedback system shown in Fig. IV. 1. Our ultimate objective is to show that if the time-varying feedback gain k(-) e L1 [0, oo), then the open-loop system is LP stable if and only if the closed-loop system is LP stable, under quite broad conditions. We begin with a few preliminary results. Since all of our main results are based on an integral equation relating the closed-loop and open-loop impulse responses, we first show that the closed-loop system is uniquely solvable and that its input-output relation is of the form (18). The two lemmas that follow immediately are in the nature of " dogwork," and the reader may skip to Theorem (50) without loss of continuity. 37
Lemma Consider the feedback system shown in Fig. IV. 1, and suppose u, e, y: U+ -> Un. Suppose G(t, x) is bounded over every compact subset of U2, and that K(-) e L1nxne(U+). U.t.c, for each u e Llne(U+), there exists a unique e e L|,e((R+) satisfying the equation
38
e(t) = u(t) - K{t) f G(t, T > ( T ) dx Jo
Moreover, VT< oo, 3cT < oo such that ||erlli ^ c rll w rlliRemark Lemma (37) is stated for u belonging to L / , since Lex is the largest of the extended spaces, in the sense that Lex contains L e 2 , L™, and indeed all L / f o r 1
Equation (38) is of the form
39
e(t) = u(i) - (KGe)(t) LAwe(R+)
where KG: ->Lj e (R+). Taking truncations of (38) over [0, T], we get an equation of the form 40
eT(t) = uT(t) - (FeT)(t) l
1
where F: Ln [0, T] -• L,, [0, T] is defined by 41
(Fx)(t) = f K{t)G(t, J
o
T)JC(T)
dx,
Vf e [0, T]
7
LINEAR T I M E - V A R Y I N G
SYSTEMS
117
Note that F can be interpreted as the operator PTKGPT, restricted to the space Lnx [0, T], where PT is the projection operator defined by Eqs. (III. 1.4). We know from Eq. (II.7.4) that (40) has a unique solution er e Lnl [0, T] corresponding to each uTe L„l[Q, T] if the spectral radius of the operator FT is less than 1. Now define a family of operators (RT, TeU+), with
(RTx)(t)=
(\K(t)\
gTx(x)dx
where 42
gT=
sup
\G(t,x)\
0
We show that p(RT), the spectral radius of RT when viewed as a mapping from L1 [0, T] into itself, is zero. It is left as an exercise to the reader to verify that, for meZ+ and m > 1, the operator RTm: l}[0, T] is given by (RTmx)(t) = I K(t) | J ^ I J^ | K(s) | gT ds\
43
• ^ r x(t) dr/(/w - 1)!
Now by slight modifications of Theorem (19) and Remark (21), we have \\RTm\\=
44
sup
\ \K(t)\\
< I \K(t)\dt\
\K(s)\gTds\ gTml(m - 1)! = (bTgTTI(m
gTdtl(m-\)\ - 1)!
where 45
rT bT= \ \K(t)\ dt < 00 ^0
So clearly ||i? T w || 1/m ^ 0 as m -> oo, so that p(7?r) = lim^^,, ||^ r w ll 1/m = 0. At this point, one can show by routine majorization arguments that p(FT) < p(RT) = 0. Hence (/ + Fj)'1 is a well-defined operator on L/IX), T], and IKZ + ^r)" 1 !! < E ^ o l l F r i l = ^ r , say. Thus, (38) has a unique solution (-)e.L,}e(IR+) corresponding to each w(-)eL„1e(R + ), and moreover H^Hi < !! c r ll"rlliExercise 6 Show that i? r m is given by (43). (Hint: See Vidyasagar [Vid. 3].) Exercise 7 Using methods entirely analogous to those in the proof of Lemma (37), show that if G(t, T) is bounded over every compact subset of
118
IV
LINEAR
SYSTEMS
IR2 and K(-) e Lj,e[0, oo), then for each u(-) e L^,[0, oo), there exists a unique y e L*e[0, oo) satisfying the equation 46
y(t) = f G(t, T)W(T) JT •'O
f G(f, T)K(T)J>(T) rfr •'o
Moreover, V r < oo, 3 J r < oo such that Halloo < dT ||wrlla>Exercise 8 Prove Lemma (37) and do Exercise 7 by using Corollary (III.5.8). 47
48
Lemma Let G(t, T) be bounded over every compact subset of U2, and suppose K(-) e L1nxne(R+). U.t.c, there exists a unique solution H(-, •) of the equation H(t, T) = G(t, T) - f G(r, v)K(v)H(v, r) dv,
0 < T < t < oo
Moreover, //(*, T) is bounded over every compact subset of IR2. Proof Fix T G I R + , and consider (48) to be an equation in the unknown function H( •, T). Then by Exercise 7, we see that H(,r) is uniquely determined from (48), and that for each T < oo, there exists a finite constant dT such that 49
\\H(t, T)|| < dT sup ||G(r, T)||,
Vr e [T, T]
T
It is clear from (49) that since G(t, t) is bounded over every compact subset of R2, so is H(t, T). S: We are now in a position to state our main result concerning the nature of the input-output relation of the closed-loop system in Fig. IV. 1. 50
51
Theorem Consider the system shown in Fig. IV. 1, where w, e, y: U+ -> Un. Suppose G(t, T) is bounded over every compact set in R2 and that K( •) e L\ x ne (R+). U.t.c, for each u e LFne(R+), the equations y(t) = (G(U TMT) dx, J
e(t) = u(i) - K(t)y(t)
o
have a unique solution y e LPne(R+) given by y(t) = f //(r,
T)W(T) JT
= (Hu)(t)
where H(-, •) is the unique solution of (48). /V00/ Suppose weLJ e (R + ) for some pe [1, oo]; then ue l}ne(U+). Hence the system of equations (51) has a unique solution for e (and hence y) in
7
LINEAR T I M E - V A R Y I N G
SYSTEMS
119
L*e([R+). Now consider the function z = Hu. Clearly, z e LFne(U+) and hence z e I}ne(M+), and moreover (51) is satisfied with y = z. Since (51) has a unique solution, this implies that y = Hu. :: 52
Remark The thrust of Theorem (50) is in showing that (i) the feedback system in Fig. IV. 1 is solvable; (ii) the input-output relation of the closed-loop system is of the form (18); and (iii) the open-loop impulse response and the close-loop impulse response are related by (48). The next three theorems relate some properties of the open-loop impulse response with the corresponding properties of the closed-loop impulse response.
53
Definition Let F: U+2 -»UnXn be measurable and locally integrable, and suppose further that F(t, x) = 0 whenever x > t. Define
54a
fh=\\F\\b=
sup
54b
/ i = l|F|li= sup xeU+
54c
|F(*,T)|
C\F{t,x)\dt J
x
/ „ = IIFIL = sup
f\F(t,T)\
With these definitions, let Sb be the normed linear space 55 Sh = {F: \\F\\b < ex)} The normed linear spaces Sl and S^ are defined similarly. 56
Remark Consider a system whose input-output relation is rf
r00
57
y(t) =
F(t, T)M(T) dx = Jo
F(t, x)u(x) dx J0
Then (i) Fe Sb if and only if u e l}=> y e L00, and moreover, there exists a finite constant cb such that ||y || ^ < ^^||^/|| i; (ii) FE SX if and only if the system (57) is L1 stable; (iii) Fe S^ if and only if the system (57) is L00 stable. 58
Theorem Suppose K: U+-^UnXn and that KeL\U+), and suppose G: R+2 -> Rnxn and H: U+2 -> UnXn are related by (48). U.t.c, He Sb iff G e Sb.
IV
120
LINEAR
SYSTEMS
Proof <= By hypothesis, G and H are related by (48), and G e Sb. Let 9b = \\G\\b be defined as in (54a). Then, from (48), we have 59
\H(t9x)\
\K(v)\
\H(v9x)\dv
Let i e ( R + be fixed for the moment. Applying the Bellman-Gronwal) inequality to (59), we get 60
\H(t9x)\
( \K(v)\ J
dv] < gb exp[gb • \\KJH,]
X
where 61
K
=
\K(v)\dv
Since the bound in (60) is independent of both t and T, it follows that H e Sb. => Equation (48) can be equivalently expressed as 62
G(t, x) = H(t9 T) + f H(t9 v)K(v)G(v9 T) dv ^X
The equivalence of (48) and (62) is most easily seen by observing that if H is obtained from G by applying a feedback of X, then G is obtained from H by applying a feedback of —K. Now (62) is of the same type as (48), except that the roles of G and H are interchanged and K is replaced by —K. However, if K e l}(U+), then so does —K. Thus, if HeSb, then so does G, by the same reasoning as above. » 63
Theorem Under the conditions of Theorem (58), H e Sb n S^ if and only if G e Sbn S^. Proof <= Suppose G e Sbn S^. Then by Theorem (58), HeSb, only remains to show that He S^. From (48), we have
64
and it
f \H(t9x)\ dx< ( \G(t9T)\ dx+ ( f | G ( f , v ) | |X(v)| \H(v9x)\ dv dx
(\K(v)\
J
0
= gx+gb(
J
\H{v,x)\dvdx
J
x
\K(v)\ ( 0
J
\H(v,r)dxdv
0
after changing the order of integration. Now define m(t)=
f \H(t9x)\ dx
7
LINEAR T I M E - V A R Y I N G
121
SYSTEMS
Then (64) becomes 65
m(t) < g^ + gb f | K(v) \ m(v) dv Applying the Bellman-Gronwall inequality to (65), we get
68
m(i) < do0 exp[gb f |X(v)| dv]
o
Hence ra(-) is bounded, and so He
S^.
=> This implication follows by symmetry from the proof of <=, as in Theorem (58). ss 69a Theorem Under the conditions of Theorem (58), H e Sbn S1 if and only if The proof is left as an exercise. Exercise 9 Interpret Theorems (58), (63), and (69a) in terms of the stability of the closed-loop system versus the stability of the open-loop system. Now we state the main result of this section. 69b Theorem Consider a system of the type shown in Fig. IV. 1, where u, e, y: IR+ -• W\ the forward path contains a linear time-invariant element with a transfer function k
70
»=i
71
mi
G(s) = Gb(s) + 1 1 RtjKs -
j
Pi)
= Gb(s) + Gu(s)
j=i
where Gbe L\xnn L* xn , Re^ f > 0 for / = 1, . . . , k and mt = 1 if Re pt = 0, and the feedback element is a memoryless time-varying gain multiplier with gain F(t) = F0 + Fv(t) where F0eUnXn equivalent:
and Fv (•) e L1nxn. U.t.c, the following three statements are
(I) The closed-loop system is L00 stable, and W(-, •) (the closed-loop impulse response) is bounded on U2. (II) The closed-loop system is LP stable for all/? e [1, oo], and W(-, •) is bounded on U2. 72
(III)
(i)
inf
| det[/ + F0G(s)] | > 0
Res>0
and 73
(ii)
dQt[D(pi) + FoN(Pi) + FoGb(pi)D(pi)]^0,
for
/=!,...,£
122
IV
LINEAR
SYSTEMS
where Gu(s) = N(s)D(s) \ N and D are right coprime, and f) is column proper. Proof We proceed in the following order: (II) => (I), (I) => (III), (III) => (II). (II) => (I) Obvious. (I) => (III) Suppose (I) holds. Then W(-, •)> the closed-loop impulse response, belongs to Sbn S^. So by Theorem (63), it follows that the function H1: (i, T) I—• H(t — T), where H is the inverse Laplace transform of G(I + F0Gy\ also belongs to Sb n £«,. By Remark (2611), this means that H( •) e IJ([R+). But by Theorem (4.36), this implies (III), namely, (72) and (73). (III) => (II) Let H = G(I + F0GyK By Theorem (4.36), (III) implies that He ,
Since HeL\xn and Gft eL*xn nL^° x „, the first three terms in (74) are analytic for Re s > 0 and are bounded and uniformly continuous on Re s = 0. Hence so is the last term, namely, (/ — HF0)GU. In order to show that (/ — HF0)GU has an inverse transform in L™xn, we consider an arbitrary element of (/ — HF0)GU, which is of the form r(s)(j)(s), where r is a partial fraction expansion at p{, / = 1, . . . , k, and 0 e ,Q/. Thus, we can consider one pole of r(-) at a time. Now we claim that if 0 e J / and if [m\/(s — a)m + 1](j)(s) is analytic at a, with meZ+ and Re a > 0, then and that if Re a = 0 and >(a) = 0, t h e n / e L00 provided m = 0. We note that
using the binomial expansion, we express the first integral as
7
LINEAR T I M E - V A R Y I N G
SYSTEMS
123
where the last equality is a consequence of the fact that <j)(s)/(s — a) w + 1 is analytic at a if and only if >(l)(a) = 0 for / = 0, . . . , m. Furthermore, if either Re a > 0 and m e Z + , o r R e a = 0 and m = 0, then the function T i-> (f — r) m e«(t-x) | s bounded for 0 < t < %, say, by y. Consequently, for all t > 0, we have Hence fe L°°, and so H e L™xn. 76
SB
Corollary Under the conditions of Theorem (69b), suppose (72) and (73) hold. Let rj and y be the solutions, respectively, of the equations
77a
y =
lib
Gu-GF0y-GFvy
t] — Gu — GF01] 00
Then, whenever u e L , we have r\{i) — y(i) -* 0 as t -• oo. Proof Let H = (I + GF 0 ) _ 1 G. Then HeL^xnnL^xn. Moreover, by Theorem (69b), y e L^. Now (77a) and (77b) can be rewritten as 78a
y =
H*u-H*Fvy
78b
rj = H * u Subtracting (78a) from (78b), we get t] - y =
H*Fvy
Since y e L„°° and Fv e L*xn, it follows that F y y e L„ . Since H eLlxnn we finally have that (rj — y)(t) = (// * ^ ^ ( 0 -* 0 as f -> oo.
L„x„, SS
Exercise 10 Suppose Fv( -) e L^°x „, but not necessarily L\ x „ . Using the small gain theorem, obtain a bound on ||F(-)lloo t n a t ensures closed-loop L°° stability. 79
Remarks 1. With regard to Theorem (69b), note that the conditions (72) and (73) are sufficient for the closed-loop system to be L00 stable, but are not necessary, strictly speaking. If (72) and (73) are violated, in which case H = G(I + FQG)'1 $ jtfnX", we can only conclude that either the closed-loop system is not L^ stable, or that closed-loop impulse response [equivalently H()] is unbounded. 2. Theorem (69b) and Exercise 10 show that the feedback can be perturbed by an arbitrarily large L^xn gain without affecting the stability status of the system, but that there is, in general, a limit on how large an L™xn perturbation can be made in the feedback without affecting stability. Now consider the discrete-time analogues of the preceding results. The theory in the discrete-time case is made much simpler by the fact that any
124
IV
LINEAR
SYSTEMS
sequence in /„* necessarily belongs to /n°°. We state only the theorems and leave the proofs as exercises. 80
Theorem Consider the feedback system shown in Fig. IV. 1, where u, e, y: Z + -> Un; the elements G and F are represented by the relations
81
(Ge)(k) =
^G(kJ)e(i) ;=o
82
(Fy)(k) = F(k)y{k) Then the system of equations
83a
e = u — Fy
83b
y = Ge has a unique solution of the form fc-i
85
y(k) = X H(k, i)u(i) i=0
where //(•, *) is the unique solution of the equation k-l
86
H(k, i) = G(k, i) - £ G(k, l)F(l)H& i) 1=1
87
Remarks 1. As is common practice, we take empty summations to equal zero. 2. The element G is not only nonanticipative [which is equivalent to requiring that G(k, i) — 0 for / > k], it has the additional property that G(k, k) = 0 for all k e Z + . Physically, this means that there is a delay of one sampling instant before the effect of the input is felt on the output. This is the case, for example, if the subsystem G has a state representation of the form x
k+l
=
S*kxk + "kuk->
yk ~
^kXk
where x: Z+ -• Rm, and A, B, C map Z+ into an appropriate space. In analogy with the sets Sb, StJ and S^, we define 88a
S?b = {G:Z+-+UnXn:
sup \G(i,j)\ < ao} i,jeZ
+ 00
88b
£fx ={G: Z+->UnXn:sup jeZ+
£ \G(i,j)\ < 00} i=0 00
88c
STn = {G: Z+ -> K"x": sup £ \G(i,j)\ < <»} ieZ+
j=0
8
SLOWLY V A R Y I N G
SYSTEMS
125
Exercise 11 Show that ^x and ^^ are subsets of 9"h. Give a physical interpretation for each of the sets Sfh^ Sfu ¥'(X). 89
Theorem Suppose G, H: Z + -> U"Xn, that G(k, i) = H(k, i) = 0 for k > i, and that G and / / a r e related by (86). Suppose F: Z + -> MnX" belongs to l*xn. U.t.c, / / e « ^ ( r e s p . ^ 1 ? y 0 0 ) i f and only if G e ^ ( r e s p . , ^ , ^ J .
90
Theorem Consider the system of the type shown in Fig. IV. 1, where u, e, y: Z+ -• Un; the forward element is linear and time invariant with a transfer function. k
91
G(z) = z'\Gb{z) + I
mi
X Ru/(z -
j Pi) }
= z~J Gb(z) + SB00
where Gbel*xn, \pt\ > 1 for / = 1, . . . , /:, and the feedback element is a memoryless time-varying gain multiplier with gain F: Z+ -+MnXn of the form F(k) = F0 + Fv(k) nXn
where F0eM equivalent:
and Fvel*xn.
U.t.c, the following three statements are
(I) The closed-loop system is Z00 stable. (II) The closed-loop system is lp stable for all p e [1, oo]. 92
(III) (i)
inf | det[/ + F0 G(z)] \ > 0 |z|>l
and 93
(ii) detlDfa)+
Fofit(pd + Fopr1Gb(pi)B(pi)]*0,
where Gu(z) = N(z)D(z)~\ proper. 94
for i = l,...,fc
N and D are right coprime, and D is column
Remark In contrast with the continuous-time case, (92) and (93) are necessary and sufficient for closed-loop Z00 stability.
8
Slowly varying systems
It frequently happens in engineering that some system parameters vary slowly. Then a typical question arises: Given that the system is stable (in some sense) when its parameters are constant, to what extent is it true that the system will still be stable when its parameters vary slowly ? In this section we consider differential systems; furthermore, since there is only a small increase in difficulty to consider the nonlinear case rather than only the linear case, we
126
IV
LINEAR
SYSTEMS
shall treat the nonlinear case. The approach is due to J. Barman [Bar. 1]. Suppose that the system is represented by 1
x = f(x, et) where e is a positive number. We denote by |x| the I2 norm of x e Un. We assume throughout (Al) / : W x IR+ -» Wn is in C 1 and/(0,/?) = 0, for all/? > 0; (A2) / i s globally Lipschitz—there is a constant / > 0 such that \f(x,p)-f(x',p)\
V/7>0,
V^jc'eR";
(A3) there is a positive constant rj such that |0 2 /(*,/>)l
2
x=f(x,p) where p e U+ is fixed. We think of (2) as describing the "frozen" system or, more precisely, the system frozen at t — p/e. To describe stability, we introduce two definitions.
3 4
The zero solution of (1) is said to be global uniform exponentially stable iff there are positive constants c and a such that \(j)(t; t0,x)\
for all
t > t0 > 0,
VxeK"
where cf)(t; t0, x) is the solution of (1) at time t, starting from x at t0. 5 8
The zero solution of (2) is global uniform exponentially stable uniformly in p iff there are positive constants k and o such that \4>f(t,x\p)\
Vf>0,
V(x,p) e W x U +
where (j)f (t, x; p) is the solution of the frozen system (2) at time t, starting from x at t = 0. 7
Theorem Consider the systems (1) and (2), where/(•, •) satisfies assumptions (Al) to (A3). U.t.c, if the zero solution of (2) is global uniform exponentially stable uniformly in p, then for e sufficiently small, (1) is global uniform exponentially stable. In the linear case, (1) would read x = A(t)x and (2) would read x = A(p)x. Condition (6) is equivalent to requiring that all eigenvalues of A(p) are in Re s < — a for all p > 0. (Al) is automatically satisfied provided t\-+A(t) is C 1 ; (A2) is equivalent to t\-+A(t) bounded on IR+; (A3) is equivalent to \DA(t)\
8
Proof
SLOWLY V A R Y I N G
SYSTEMS
127
The solution of the frozen system (2) satisfies the integral equation
8
<j>f(T,x;p)=x+
I
J
f[(j)f(t',x;p),p]dt'
o
Differentiating with respect to the real variable p, we have VT, peU VxelR"
+,
Using (6) and (A2) in (8), we obtain 10
<£/(T,*;/0>i|*|,
for
0 < T < l/lkl^T,
V(x,p)eUn
x U+
Using (6), (A2), (A3), into (9), and invoking Bellman's lemma, we see that for some positive constants m and m\ 11
\D34>f{x,x\p)\
<m'\x\emx
for all (T, x,p) e U+ x Un x U +
Now choose P > (m + o)\2o and choose r oo
12
V(x,p)=
\4>f(z,x;p)\2lldr
as a possible Lyapunov function for the frozen system (2). Clearly, Ve C 1 and V(0, p) = 0, Vp > 0. From (6) and (10), there are constants kl and k2 such that 13 Finally, from (12),
Thus V is a Lyapunov function for the frozen system (2). We are going to show that the Lyapunov function Kof (2) is also a Lyapunov function of (1), provided £ is small enough. Consider the time derivative of V(x, st) = Jo 10/(T> x> 8t) I 2/? di along solutions of (I):
Now -00
Hence
128
IV
LINEAR
SYSTEMS
where M is finite in view of the choice of /?. Then (16) reads sM)\x\2(i
V(l)(x, et)< - ( 1 -
If s < l/M, V(l) < 0; using (13) and estimating V{i)/V, we see that the solutions of (1) are bounded by 18 where c = (&2/£i)1/2/? and a = (1 -
£ M)/(2^ 1 ).
::
Exercise State precisely the theorem for the linear case, expressing the conditions in terms of characteristics appropriate for the linear case.
9
Linearization
One of the most important and the most frequently used method of analysis and design is that of linearization; that is, a nonlinear system is replaced by an (approximate) linear system which is tangent to the given nonlinear system. This approximation is, of course, valid only locally, in the same sense that, in U2, a tangent approximates a curve only locally.
9.1
Formulation
We restrict ourselves to differential systems; we wish to give conditions under which the linearized equations about a given trajectory will give valid results on the whole ofU + . In the language of circuit theory or control theory, we are going to develop conditions under which the small-signal equivalent circuit or the variational equations give predictions for the state-space trajectory which are valid for all t > 0. Consider the system of differential equations 1
x =f(x, u, t) n
m
n
where/: U x U x R + -> U
2
7(0,0,0 = 0,
3
x(0) = 0
W>0
Equation (1) relates the state trajectory x(-) to the input u(-). Equations (2) and (3) assume that the velocity under zero input is always zero and that the system starts from the zero state at t = 0; this is just a matter of convenience. This can always be achieved by a change of coordinates. First, we impose assumptions which guarantee the existence and uniqueness of solutions.
9
4
5
LINEARIZATION
129
Assumption For every fixed x e IRn and u e IRm, f(x,u,-): IR+->lR" is regulated; for every fixed u e (Rm, t e U + ,/(*, w, 0 is locally Lipschitz in x; for every fixed l e H " , t e M + ,f(x, •, 0 is continuous. We think of the input u as consisting of a "reference" input w0 and a small perturbation w; thus, u = u0 + u We assume throughout that u0 and w are regulated functions of t, defined on U+; as a consequence, for fixed jceIR", t\-+f[x,u(i), t] is regulated. Consequently, the state trajectory can similarly be thought of as a sum of two terms
6
x = x0 + £ where we assume that x 0 is defined for all £ > 0 by
7
x 0 =/(*(, > w o, 0,
x0(0) = 0
Note that £ is defined by (6). Consider the function t i-> [x0(i), u0(t)], and in Un x [Rm x U+ the set # defined by 8
V = {[x0(t) + £, u0(t) + u, t]\
\Z\
\u\
t>0}
where £m and um are positive numbers. We think of # as a " tube " surrounding the "reference trajectory": t i-*[x0(t), u0(t)]. In order to carry out our approximations, we require an additional assumption. 9
Assumption For some £m > 0 and um > 0,/has indwell-defined, continuous, second partial derivatives with respect to x and u ,and
are finite for all appropriate values of i, k, l,j, and h. Let us expand/about the reference trajectory:
where DJdenotes the derivative of/with respect to its /th argument. Observe that D{f[x0(t), u0(t), t] is the Jacobian matrix of/evaluated along the reference trajectory; therefore, it is a known function of time mapping U+ into
IV
130
LINEAR
SYSTEMS
UnXn. Similarly, D2f[x0(t), u0(t), t] is the n x m. matrix of partial derivatives with respect to the w/s; therefore, it is a known function of time mapping U + into R"Xm. By the standard expression for the remainder of a Taylor series [Die.l, p. 190]
assumption (9) implies that 35 < oo such that 11 In other words, g is of second order uniformly in t since S does not depend on t. Calling A(t) and B(i) the derivatives in (10), we rewrite (1) as 12
| = A(t)£ + *(*>/ + <7«, u, 0,
(0)
=0
If we drop the second-order term g(£, w, 0, we have 13
£0 = A(t)£0 + B(t)u9
£0(0) = 0
Equation (12) is an exact nonlinear equation equivalent to (1). Equation (13) is an approximate linear equation', it is the linearized equation about the reference trajectory [x0(*)> u0(-)]. Intuitively, we would expect that if the linearized equation (13) is " stable," then for " small" u, Eq. (13) will give valid results. The theorem that follows will make this basic idea precise. From (13), using standard notation, we obtain 14
where (f, 0) | < K, \f t e R + , a small u(-) does not necessarily produce a small x(-) (small, in the sense of sup norms). Exercise 2 Ditto for 10(f, T) | -> 0 as t - T -> oo (t > 0, x > 0). Exercise 3 15
Show that (9) implies that V e > 0, 35(E) s.t.
( | { | + \u\)<2S=>\g(Z9u,t)\
< e ( | { | + |i/|),
W>0
9
9.2
LINEARIZATION
131
Main result
In terms of the above formulation, we state the following theorem. 20
Theorem Consider the system (1) subject to Assumptions (4) and (9). Let u0: R + -> Um be regulated and x0(-) be defined on IR+ by (7). Let £(•) and £0(-)be defined by (12) and (13), respectively. Assume further that (Al)
3 M < oo s.t. V f > 0
21
f (A2)
|0(*,T)|
dx<M
3N< oo s.t. V f > 0
22 (A3) V a > 0 , 3 5(e) s.t. U.t.c, if, for some e e (0, 1/M) and a 5 corresponding to it according to (23),
then, using sup norms throughout, 25
28
Comment Let us discuss the meaning of Theorem (20). Assumption (21) together with (22) are the necessary and sufficient conditions for the approximate linearized equation (13) to be bounded input and bounded state stable [Des.14]. Assumption (23) requires g to be of the second order (in |£| and | u |) uniformly in t. Turning now to the conclusions: Conclusions (25) and (26) say that if the perturbational input u is bounded according to (24), then both £0 and £, the state of the approximate linearized system and the state of the exact nonlinear system, will remain within a distance 3 of the reference trajectory. Conclusion (27) says that the ratio of the " p e a k " difference between £(f) and £0(t) to the peak input \\u\\ can be made arbitrarily small; i.e., for small inputs the response t h-» £(f) of the exact nonlinear system is arbitrarily close to the response t f-» £0(i) of the approximate linearized system over the whole half-line U + . If the right-hand side of (1) depends linearly in u, then this last conclusion can be made even sharper [see (34), in the following].
IV
132
30
Corollary in u; i.e.,
LINEAR
SYSTEMS
Consider the special case where the right-hand side of (1) is linear
31
x = / ( * , 0 + B(t)u Equation (12) becomes
32
t=A{t)£
+
B(t)u+g{Z9t)
Consequently, assumption (23) can be simplified to read (A37) V e > 0, 3 S > 0 s.t. 33 U.t.c, if (24) holds, then (25) and (26) hold, and we also have 34 35
Comment In this case, the conclusion is much sharper because it says that by taking \\u\\ small, (i.e., S small), s can be taken arbitrarily small; hence by (34), ||{ — £oll/ll£oll> the ratio of the " p e a k " difference between £(f) and £ o (0 to the peak value of £o(0> can be made arbitrarily small. This truly shows that the relative error between the nonlinear and the linearized system [i.e., £(0 — £ 0 (0] c a n be made arbitrarily small. This fact has been verified computationally [Des.5]. Proof of Theorem (20) If necessary, increase TV [from (22)] so that 1 — eM < N + sM. For purposes of the proof, assume temporarily that
36 The solution of (12) is given by 37 or, by virtue of (13),
38 From (14), taking sup norms of both sides, we obtain
from which (25) follows. Using the temporary assumption (36) in (38), we get
40
9
LINEARIZATION
133
Pick a time T in (0, oo) and consider (40) for t e [0, T]. Since A(-) is regulated (hence bounded on [0, T]), (£, t') is bounded on [0, T] x [0, T]; thus, the Bellman-Gronwall lemma applied in (40) implies that for any finite T \\€T\\ < oo. Hence, for any Tin (0, oo), we obtain from (40) Thus, using sM < 1,
Since the right-hand side is independent of T, if we let T-* oo, we see that the function Ti—> ||^ r || is monotonically increasing and bounded; hence,
i.e., (26) has been established under the temporary assumption (36). Looking back over the derivation, we see that since, over [0, oo), | £(f) | < 3 and |w(OI ^ <^ w e n e e ( i on ^y require that (36) holds for all (£, w, r) in ^ = {[x0(r) + £, w0(r) + w, f] | | £| < 3,\u\ < 3 and t > 0}. Hence conclusions (25) and (26) hold under the assumptions of the theorem. From (38)
Hence (27) is established. Proof of Corollary (30) Conclusions (25) and (26) follow as before. Start with (38), where now g depends only on £ and f, so that by (33) we have successively
from which (34) follows.
9.3
::
Discrete time case
The linearization for the discrete case follows the same pattern as the continuous case. The system is specified by the difference equation
134
IV
where/: Un xUm xI+^Un. 51
LINEAR
SYSTEMS
We assume throughout that x(0) = 0
As before, we split the input u and the response x in two parts: 52
u(k) = u0(k) + u(k),
x(k) = x0(k) + £(k)
where x 0 (') is defined by 53
x0(k + 1) =f[x0(k),
u0(k), k]
x0(0) = 0
As before, let £m > 0 and um > 0 and define 54 We further assume that 55
(a) for some £m > 0, um > 0, / has continuous second partial derivatives with respect to x and w in # ; 56 (b) for all appropriate values of /, /:, /, 7, and //,
are finite. [The sups are taken over all (x, u, k) e^.] From Taylor's expansion theorem applied to (50) about [x0(k), u0(k)], we obtain the exact nonlinear difference equation 57 The approximate linearized equation is 58 Note that (55) and (56) imply that the remainder term g in (57) satisfies the following condition: 59
For any e > 0, there is a 5(e) > 0 (independent of k) s.t.
60 whenever \£\ + \u\ <25. 61
62
Theorem Consider the system (50) and (51). Suppose that (55) and (56) hold. Suppose also that (AI) there is an M < 00 such that
NOTES A N D
(A2)
REFERENCES
135
there is a K < oo such that
and let e e (0, 1/M) and 3(e) be picked according to (59), U.t.c, if 64 then, using || • || to denote /°° norms, 66
67 Corollary 68
Iff in (50) is linear in u, i.e., x(k + 1) =f[x(k), k] + B(k)u(k)
then (67) can be sharpened to
Notes and references The difficulties associated with " pole-zero " cancellations in the multivariate case can be treated by state-variable techniques using the concepts of controllability and observability. The purely algebraic approach developed in Sections 1 to 3 is due to several researchers [Pop. 1, Ros. 1, Wan. 1, Wol. 1, Des. 12]. The material in section 4 has been developed in stages by several researchers. Desoer [Des. 2] gave a general formulation of the Nyquist criterion, and this was extended by Desoer and Wu [Des. 6] and Desoer and Callier [Des. 12, Cal. 2]. The method of pseudoright-coprime factorizations is due to Vidyasagar. The graphical test of Section 5 was developed for the case of periodically spaced impulses by Willems [Wil. 1, 5], and for the general case by Callier and Desoer [Cal. 1]. Davis [Dav. 1, 2] has obtained related results. A thorough treatment of the discrete-time case, which contains the elements of the discussion of Section 6, can be found in [Des. 9] and [Wu 2]. The calculations of norms in Section 7 appear to have a long history in the mathematical literature [Edw. 1]; for the engineering literature see for example [San. 12, Wil. 2, Wu. 1]. The idea of using the principle of uniform boundedness to prove the equivalence of the two types of L00 stability is found in Desoer and Thomasian [Des. 1]. The spectral radius calculations in Section 7 are taken from [Vid. 3], and earlier versions of the perturbational results can be found in [Che. 1] and [Vid. 2]. The method employed in Section 8 is due to Barman [Bar. 1]. Finally, the results of Section 9 are updated versions of those found in [Des. 4].
V
APPLICATIONS OF THE SMALL GAIN THEOREM
The purpose of this chapter is to illustrate the concept that once the small gain theorem [(III.2.1) and (III.3.1)] is understood and the techniques of Chapter II, Chapter IV, and the Appendices are available, it is easy to establish a large number of input-output stability results. Our emphasis is more on displaying the flexibility of the method rather than giving an exhaustive account of known results. In Section 1, we obtain an LP stability result based on the results of Chapter IV and the small gain theorem. Section 2 contains a sufficient condition for L2 stability that differs in two important respects from that of Section 1: (i) The condition of Section 2 can be verified in the frequency domain, in contrast with that of Section 1. (ii) The condition of Section 2 is less conservative than that of Section 1. In Section 3, the important concept of exponential weighting is discussed, and a criterion for L00 stability, which can be verified directly in the frequency domain, is derived. Discrete-time analogues of some of theresuits of the first two sections are given in Section 4. In Section 5, we study 136
1
CONTINUOUS-TIME
SYSTEMS-!"
STABILITY
137
slowly varying linear systems and obtain a condition that ensure LP stability when each " frozen " system is stable. Section 6 presents a nonlinear circuit example that illustrates the application of the small gain theorem. In Section 7, we show how small gain techniques can be used to prove the existence of periodic solutions to a nonautonomous nonlinear differential equation. Section 8 contains a proof of the well-known Popov criterion using the small gain approach. Finally, in Section 9 we study two approaches for obtaining conditions that ensure the instability of a nonlinear feedback system.
1
Continuous-time systems—Lp stability
We consider feedback systems of the form shown in Fig. III.l, where H1 is a linear convolution operator and H2 is a memoryless time-varying nonlinearity. The general idea is to assume that H2 can be approximated by a time-invariant linear map y2(t) = Ke2(t) and to use the small gain theorem to show that if the linear time-invariant system with Hx in the forward path and K in the feedback path is stable, then so is the original nonlinear system, provided H2 does not deviate too much from K. We consider first an LP stability result where p e [1, oo]. 1
Theorem Consider a multivariable feedback system of the form shown in Fig. III.l, where uu u2, eu e2, yu y2\ U+ -» Un. The subsystem H1 is linear and time-invariant and is represented by
where G(-) is Laplace transformable, and furthermore, where Jf, Q) e s3nXn and the pair (^T, # ) constitutes a prcf of G. The subsystem H2 is memoryless and is represented by
where 0 : W x U+ -> Un; 4> is continuous in its first argument and regulated in its second. Suppose that uuu2eLnp=>
yuy2eLnpe
U.t.c, if there exist a constant matrix K eUnXn and real constants y and /? (with ft = 0 whenever p < oo) such that
138
V
APPLICATIONS
OF THE S M A L L G A I N
THEOREM
and if 8
(a)
inf
|det[/ + KG(s)]\ > 0
Res>0
9 10
(b) det[^0) + Kjy{s)} ^ 0, (c)
whenever
Re s > 0 and det §{s) = 0
\\HK(-)U-y<\
where HK(s) 4 G(s)[I + KGis)]-1 = [I +
11
G&Ky'Gis)
Then, for eachp e [1, oo], 12
uuu2e
Lnp =>el9e29yi9y2e
Kp
and the system is LP stable. Proof The details of the proof are left as an exercise. Apply the loop shifting theorem (III.6.3). In view of (8) and (9) and Theorem (IV.4.27), the function HK(-)e jtfnXn. Assumption (10) and the small gain theorem lead readily to the conclusion (12). :: Exercise 1 Explain why it is assumed in (7) that fi = 0 if p < oo, while fi may be nonzero if p = oo. If (j> satisfies a global Lipschitz condition, we can invoke the incremental form of the small gain theorem (III.3.1). Thus, we state the following corollary. 13
Corollary
If in the assumptions of Theorem (1) we replace (6) by
14 then the conclusions of Theorem (1) can be strengthened to (a) for each wl5 u2 e Lnp, there is a unique solution el9 e2, yl9 y2e Lnp (and it can be computed iteratively); (b) the solution depends continuously on u1, u2. Remark It is important to note that our results in no way depend on the manner in which 4> varies with t. Exercise 2 When p = oo (i.e., uu u2eLnco), show that condition (7) of Theorem (1) and condition (14) of Corollary (13) can be relaxed so that they have to hold only for all o in some ball whose radius depends on 11^ H^ and ll«2ll».
2
L2 S T A B I L I T Y — C I R C L E
CRITERION
139
Exercise 3 Suppose 0 satisfies (14) for some y eU, and suppose that G(-) contains at most impulses in some neighborhood of the origin. Let G0 be the "strength" of the impulse at t = 0. Show that, if det(7 + KG0) ^ 0, then ul9 u2eLpne=>eue2, yl9 y2eLpne.
2 L2 Stability—circle criterion The results of Section 1 are based on the inequality 1
\\HK*e\\p<\\HK\\s/\\e\\p which is valid for all/?e [1, oo]. Theorem (1.1) and Corollary (1.13) are very powerful in that they provide a sufficient condition for LP stability for all values of/?. However, the application of Theorem (1) to practical situations is, in some instances, limited by the fact that the crucial small gain condition (10) involves \\HK(-)\\^. At the present time, there are no means available for either determining || HK{ •) || ^ or for obtaining an upper bound for || HK{ •) || ^ based solely on the knowledge of HK(jco), co e R + .