Chapter 4 An introduction to multivariable Systems In this chapter a number of tools for the analysis of multivariable systems will be given. In particular, this will include poles and zeros of multivariable sy stems the generalized Ny quist Theorem for st ability analysis of multivariable sy stems, and frequency ses for multi- variable sy stems using singular values. 4.1 Poles and zeros of Multivariable s ystems For a single input single output(SISO) system with the transfer function G(s (4.1) the poles are defined as the values of the complex values s for which G(s)=oo, and the zero as the values of s for which G(s)=0 For a multiple input multiple output(MIMO) system with the transfer matria Gn,1(s Gn,2(s) the poles can be defined in analogy with the definition for SISo system. I.e., as the poles of every scalar transfer function Gll(s). Gn,n,s) in G(s). This definition is reasonable, as at ole. Hence, at least one of the entries in the transfer matrix equals Zeros for multivariable systems, however, can not in a reasonable way be defined simply as the values for which one of the entries of the transfer matrix equals zero, so the multivariable zeros are not directly related to the zeros of the indiviual transfer functions G11(s).Nun,(s) Instead, the zeros of a multivariable sy stem are defined as the values of the complex variable s for which G(s) loses rank. The rank of a matrix A is defined as the number of linearly independent columns of A and denoted by
! "#! $ % && ! ' "(! $ $ $ ) % * $ % $ % + + % $ + ",! (-
Thus, the definition of zeros for multivariable systems becomes Definition 4.1(Zeros for Multivariable Syst ems) The zeros of a transfer matriz G(s are defined as those values of the compler variable s for which rank G(s) is less than its morima valule Zeros defined in this way are called transmission zeros. The reason is the following transfer function G(s)loses rank for 8= %o, it can be shown, see Section 4.3.3, that the exist s an input vector uo#0, such that =0 Hence, the transmission of cert ain input signals is blocked for 8= Zo 4.1.1 Smith-McMillan form of a Transfer matrix Poles and transmission zeros of a transfer matrix G(s can be found, e.g. by transforming G(s)to its Smith-McMillan form. It can be shown that any propertransfer matrix G (s)can be written in its Smith-MCMillan form G(8)=U1(s)M(s)U2(s (4.5) U1(8)(1(8) 0}U2(s) (4.6) where U1(s)and U2(s)are unimodular matrices U(s)is said to be a unimodular matrix,if and only if its determinant det U (s is in dependent of s, i. e. if det U (s) is const ant. M(s) is a pseudo-diagonal matrix, and is called the Smith-McMillan form of G(s). G(s)and M(s) said to be similar, denoted as G(s) M(s). The polyn Ixi(s),i(s) have to be common factors or-equivalently -no common root s). Finally, xi(s),i(s) have to possess the following divisibility pr x(8)ki+1(s) +1(8)(8) The not ati s that the polynomial xi+1(s) is a factor of the poly nomial xi(s)(with no remainder ). Next, the following pole and zero polynomials are defined p(8)=1(s)φ2(s)…q(s x(8)=X1(8)X2(s)…Xr(s) (4.9) Now, it can be shown, that the poles and transmission zeros of the transfer function G(s)can e founds as the roots of p(s) and z(s), respectively. The degree of the pole polynomial p(s) called the McMillan degree of G (s) It can be shown that the Smith-McMillan form M(s of a transfer matrix G(s) can be deter mined by a series of elementary row and column operations on G(). let d(s) be the smallest I A transf (s)is said to be proper if all its entries satisfy Gi;(s)1-Ci< oo for rictly proper if Gil(s)|→0fors→∞
$ ' * $ + ",, % ""! ) + . % % && ' "/! "-! % % && 0 ! ! ' "1! ! % $ ' "2! "3! && % 4
common denominator for the entries Gij (s)of G(s). Then, G(s) can be written as N1(s) 1n(s) G(s)=dsN(s)=ds where N(s)is a poly nomial matrix (not a transfer matrix). There are three element ary types of row or column operations to perform on N(s) Interchange of two rows or columns Multiplication of a row or a column with a const ant Addition of one row or column multiplied with a polynomial to another A common property of these operations is, that they do not change the rank of the matrix ( s). Each of these elementary operations can be represented as a pre- or post multiplication of N(s by a suit able matrix L(s) called an elementary matric. It can be shown, that all element ary matrices are unimodular. Now, N(s can be rewritten as a sequen ce of row and column operations (8)=L1(s)S(s)L2(8) Ln(s)diag{∈1(s),E2(8),……,6r(s),0,0,…,0}L2(s) (4.12) Here, S(s is a pseudo-diagonal polynomial matrix. S(s) is called the Smith form of N(s The polynomials Ei(s) are monic and have the following divisibility properties 1 (4.13) Hence, the Smith form of a polynomial matrix is equivalent to the Smith-McMillan form of a transfer matrix. Now, the point is that the polynomials Ei(s) can be determined from the determinant divisors (4.14) Di()=greatest common divisor for all i x i sub determinants of N(s) (4.15) where every of the greatest common divisors are normalized to a monic polynomial. It can be shown, see [Mac89, Pages 40-43 that the polynomials Ei() are given by (4.16) Hence, the Smith-McMillan form of G(s) is given by M()=(s) 17) In summary, this est ablishes the following procedure for determining the Smith-McMillan form of a transfer matrix G(s)
' "#5! % %! ' & 6 6 + % 7 % ' "##! "#(! ) % ' "#,! ) % && % ' "#"! "#/! 8&23 . "59",: ' "#-! ) && ' "#1! && % '
Procedure 4.1(Smith-McMillan form of a transfer mat rix) 1. Let G(s)be a proper transfer matrit. Find the smallest common denominator d(s) for all entries in G(s)and rewrite G(s)as G(s N(8) (4.18) 2. Determine the Smith form ofN(s) N(8)~S(8)=dag{∈1(8),E2(s),……,6r(s),0,0,…,0} (4.19) where Ei(s)is determined from the determinant divisors D(s) Di(s) ;(s)=D1 8. Then, the Smith-McMillan form of G(s)is given by (8)~M(8) (4.21) The following example has been taken from [ Mac89, Ex. 2.2 Example 4.1(The Smith-McMillan form of a transfer mat rix) Let G(s be given by 2= 22 2 2s-4 The smalles common denominator for Gi(s)is d(s)=82+38+2 and G(s)can be written as 1 G(8)=2+38+282+8-4282-8-8 423) (8-2)(s+2)(2s-4)(s+2) (4.24) The Smith form of the polynomial matrit N(s is given b (8)~S(s)=diag{∈1(8),E2(s)} where Ei( s)is determined from the determinant divisors D(s) e()=D-1(s) i=1,2
"#2! ! " # "#3! "(5! $ % # "(#! % + 8&23 7% ((: ! # "((! "(,! "("! # "(/! "(-!
(4.27) Dgtar a ged i, -i, a2n a-roa2-a-h,a2-Toa2-hg h D2tar a ged a2 n a-T h ' a2-T h h fata2-Tt;zta2-T aata2-fry a a2-Ta ta n orta-or (4.30) nanc ged ochr Ici Inc t ransaf s emi i nmr o T 'mrz Svnlncnx C (4.31) Datar ∈tara a ta n orta -or (4.32) Dstar Inc Na pIncT'wTrt h P tarp grl ch 1 ta n i rta a-0 433) a n ncnc Inc w a arh st wlrn Th hv a cit Irn tho ochr a pht Irn ntIc. cch wt hwcyyaoz chwcx Ic gryc tho bcnr gryhra pt yi srn p tar t gr ch ptar a ta n irta n or (4.34) 7t unix P tar i Inc gryci a a -1, -i, -o tho Inc ht hi a piprh bair a a oz (=2 +tate +p82e Des2riptions a dyce decer (bed by =he dt =e dlt ee relrece)=t =o) cttr a 2 rttrn Bott r (4.36) ttr a catton Do tt r et)be delle=ed tdo Fgure 4.1. SO) t)g=egrt =o)0=ine domt g eorredlo)dd =o as0 he a doto, =he =rt)fer mt =re P tar eorredlo)dog =0 =he dt=e dlt ee decer al=o) tbove et)be wrC=e)td where I Cdt)Cde)=y mt =re of =he ct me dame)do)dt d2. The 0)verce of t dqutre ) o)d gultr ce x Cdgeve) by djx where t djx Cd =he t djog=of X. He)ee, f aI-2 ()o)dgultr, p tar et) be wrC-e)td fental-2r dj taI-2
& % "(1! "(2! "(3! ",5! % ",#! ",(! % # ",,! '% # ","! ",/! % 6 ",-! ",1! "# % ",2! % % ; ",3! ; ; ) ; ""5!