9

A refined resolvent decomposition of a regular polynomial matrix and application to the solution of regular PMDs

Abstract

This chapter presents a resolvent decomposition which is a refinement of the state-of-the-art results. It is formulated in terms of the notions of the finite Jordan pairs, infinite Jordan pairs, and the generalized infinite Jordan pairs. We make clear the issue of infinite Jordan pair noted by a number of references. This refined resolvent decomposition captures the essential feature of the system structure. Further, the redundant information, which is included in the known resolvent decomposition, is deleted through a certain transformation, thus the resulting resolvent decomposition inherits the advantages of the reported results. This refined resolvent decomposition facilitates computation of the inverse matrix of A(s) due to the fact that the dimensions of the matrices used are of minimal.

Based on this proposed resolvent decomposition, a complete solution of a polynomial matrix description (PMD) follows that reflects the detailed structure of the zero state response and the zero input response of the system. The complete impulsive properties of the system are also displayed in our solution. Such impulsive properties are not completely displayed in the known solution. Although for the homogeneous case this problem is considered in the literatures, the complete impulsive properties of the system for the general nonhomogeneous regular PMD are not discussed. Our approach is stable in numerical computation terms, for it avoids an extraordinarily large number of polynomial manipulations.

Keywords

Resolvent decomposition; The finite Jordan pairs; Infinite Jordan pairs; The generalized infinite Jordan pairs; Polynomial matrix description; The zero state response; The zero input response

9.1 Introduction

Regular polynomial matrix descriptions (PMDs) are described by

Σ:T(ρ)β(t)=E(ρ)u(t)y(t)=C(ρ)β(t)+D(ρ)u(t),t0

si1_e

where ρ := d/dt is the differential operator,

T(ρ)Rρl×l,rankR[ρ]T(ρ)=l,

si2_e

EρRρl×m,CρRρp×l,

si3_e

D(ρ)Rρp×m,

si4_e

βt:[0,+)Rlsi5_e is the pseudo-state of Σ,u(t):0,+Rmsi6_e is the control input and y(t) the output of Σ′. Σ′can be written in the form:

eq00009-01-9780081019467
eq00009-02-9780081019467

In order to investigate the solution of the above PMD, we thus focus our interests on the following form of equation

Σ:A(ρ)ξ(t)=Bu(t),t0,

si7_e  (9.1)

where AρRρr×rsi8_e, with rankRρAρ=r,ξ(t)Rr,BRr×m,u(t)Rmsi9_e. The homogeneous case of Σ is

Σ0:A(ρ)ξ(t)=0,t0.

si10_e  (9.2)

Both regular generalized state space systems which are described by

Eẋ=Ax(t)+Bu(t),

si11_e

where E is a singular matrix, rank(ρEA) = r, and the (regular) state space systems which are described by

ẋ=Ax(t)+Bu(t)

si12_e

are special cases of the regular PMDs (Eq. 9.1).

The solution of the above PMDs can be proposed on the basis of any resolvent decomposition of A(s) given by

A1(s)=C(sInJ)1Z+C(sJIε)1Z,

si13_e  (9.3)

where (C, J) is the finite Jordan pair of A(s), and (C,J)si14_e is the infinite Jordan pair [13, 17] of A(s). Such resolvent decompositions are not unique, but play an important role in formulating the solution of regular PMDs. The difficulties in the problem of obtaining the solution of the PMD are specific to the particular resolvent decomposition used. From a computation point of view, when the matrices in Eq. (9.3) are of minimal dimensions, it is obviously easiest to obtain the inverse matrix of A(s).

There is fundamental interest (notably [13, 17, 102]) in the solution of the regular PMD and its homogeneous case. For Eq. (9.1) Gohberg et al. [17] proposed a particular resolvent decomposition, and the solution of it was formulated according to this decomposition. However, the impulsive property of the system at t = 0 was not properly considered in this work. One advantage of this resolvent Decomposition, however, is that it is constructive, due to the fact that the matrices Z,Zsi15_e in Eq. (9.3) are formulated in terms of the finite and infinite Jordan pairs. On the other hand in this resolvent decomposition, there appears to be certain redundant information, in that the dimensions of the infinite Jordan pair are much larger than is usually necessary, this in turn brings some inconvenience in computing the inverse matrix of A(s).

In fact some of the infinite elementary divisors [18] that correspond to the infinite poles of A(s) actually contribute nothing to the solution, as will be seen subsequently. Thus a resolvent decomposition can be proposed in a simpler form that has the further advantage of giving a more precise insight into the system structure as well as bringing some convenience in actual computation. Vardulakis [13] obtained a general solution of Eq. (9.1) under the assumption that the initial conditions of ξ(t) are zero. The main idea of this approach is to find minimal realizations of the strictly proper part and the polynomial part of A−1(s) and then to obtain the required resolvent decomposition. Although this procedure does give good insight into the system structure, the realization approach is not so straightforward by itself and it is consequently more difficult to apply in actual computation. Furthermore, in this procedure, no explicit formula for Z and Zsi16_e is available.

In [102] the solution and the impulsive behavior of autonomous linear multivariable systems whose pseudo-state obeys the linear matrix differential equation (9.2) are examined. The impulsive solution part of the general nonhomogeneous PMD (Eq. 9.1) is, however, not displayed in the solution of Eq. (9.2) given by Vardulakis et al. [102]. Apparently, differences arise between the solution of Gohberg et al. [17] and that of Vardulakis [13] due to the fact that these two solutions are expressed through two different resolvent decompositions. Although it is found that the redundant information contained in the solution of Gohberg et al. [17] decouples in the meaning described in this book, an overly large resolvent decomposition definitely brings some inconvenience to actual computation.

The main purpose of this chapter is to present a resolvent decomposition that is a refinement of both results obtained by Gohberg et al. [17] and Vardulakis [13]. It is formulated in terms of the notions of the finite Jordan pairs, infinite Jordan pairs, and the generalized infinite Jordan pairs that were defined by Gohberg et al. [17] and Vardulakis [13]. We clarify the issue of the infinite Jordan pair noted by Gohberg et al. [17] and Vardulakis [13]. This refined resolvent decomposition captures the essential feature of the system structure, and the redundant information that is included in the resolvent decomposition of Gohberg et al. [17] is deleted through certain transformations. The resulting resolvent decomposition thus inherits the advantages of both the results of Gohberg et al. [17] and that of Vardulakis [13].

Based on this proposed resolvent decomposition, a complete solution of a PMD follows that reflects the detailed structure of the zero state response and the zero input response of the system. The complete impulsive properties of the system are also displayed in our solution. Such impulsive properties are not properly displayed in the solution of Gohberg et al. [17]. Although for the homogeneous case it is considered in Vardulakis [13], Vardulakis et al. [102], such a complete treatment of the impulsive properties of the system for the general nonhomogeneous regular PMD is not available in Vardulakis [13] and Vardulakis et al. [102].

Compared with the complete solution of regular PMDs given in Chapter 8, where the solution is proposed based on any resolvent decomposition, the resolvent decomposition obtained in this chapter is of minimal dimension, the solution constructed subsequently is specific to this refined resolvent decomposition.

9.2 Infinite Jordan pairs

In this section, we analyze two definitions of infinite Jordan pairs. The first was given by Gohberg et al. [17] and the other was given by Vardulakis [13]. The essential differences between them are elucidated and these discussions enable us to establish a refined resolvent decomposition.

Let A(s)=A0+A1s++Aq1sq1Rr×r[s]si17_e, rankR[s]A(s)=rsi18_e. SA(S)si19_e denotes the Smith-McMillan form of A(s) at s=si20_e,

SA(s)(s)=diagsq1,sq2,,sqkk,1,,1rhk,1/sq^rh+1,,1/sq^rh,

si21_e

where

q1q2qk>0

si22_e

are the orders of the infinite poles at s=si20_e of A(s), and

q^rq^r1q^rh+1>0

si24_e

are the orders of the infinite zeros at s=si20_e of A(s). The dual polynomial of A(s) is defined as

DA(s)(w):=wq1A1w=A0wq1+A1wq11++Aq1.

si26_e

The local Smith form of DA(s)(w) at w = 0 is

SDA(s)0(w)=wq1SA(s)1w=diag1,wq1q2,,wq1qk,wq1,,wq1,wq1+q^rh+1,,wq1+q^r.

si27_e

It is seen that the polynomial matrices have in general three kinds of IEDs, or equivalently DA(s)(w) has three kinds of finite zero at w = 0. The first kind of IEDs with orders q1qj, j = 2, 3, …, k correspond to the poles of A(s) at s=si20_e. The second kind of IEDs comprise those corresponding to the zeros of A(s) at s=si20_e with orders q1+q^jsi30_e, j = rh + 1, …, r. The third kind with orders q1 is not dynamically important [18].

Let ŨL(w)R[s]r×rsi31_e, ŨR(w)R[s]r×rsi32_e be unimodular matrices reducing DA(s)(w) to its local Smith form SDA(s)0(w)si33_e, i.e.,

U~L(w)DA(s)(w)U~R(w)=SDA(s)0(w).

si34_e

Let uj(w) ∈ R[w]r×1, vj(w) ∈ R[w]r×1, j1,2,,rsi35_e be the columns of ŨR(w)si36_e and ŨL1(w)si37_e, then

DA(s)(w)uj(w)=vj(w)wτ(j),

si38_e

where

τ(j):=q1qj,j=1,2,,kq1+q^j,j=k+1,,r

si39_e

Let

βjq:=1q!uj(q)(0),j=2,3,,r,q=0,1,2,,τ(j)1,

si40_e

then for j = 2, 3, …, r, the vectors

βj0,βj1,,βj(τ(j)1)Rr

si41_e

form a Jordan chain corresponding to the zero w = 0 of the IEDs wτ(j). Now we can compare the two different definitions of the infinite Jordan pair.

Definition 9.2.1

(Gohberg et al. [17])

The generalized infinite Jordan pair (C,J)si42_e of A(s) are defined as

C:=C2,C3,,Ck,Ck+1,,CrRr×v,

si43_e

J:=block diagJ2,,JrRv×v,

si44_e

where

Cj=βj0,βj1,,βj(τ(j)1)Rr×τ(j),j=2,3,,r,

si45_e

eq00009-03-9780081019467

We observe that

1. Jsi46_e is nilpotent with an index of nil-potency q1+q^rsi47_e, because the largest Jordan block is (q1+q^r)×(q1+q^r)si48_e.

2. v=rq1i=1kqisi49_e (the total number of the infinite poles of A(s))
+i=1rq^k+isi50_e (the total number of the infinite zeros of A(s)).

Definition 9.2.2

(Vardulakis [13])

The infinite Jordan pair (C,J)si14_e of A(s) is defined as follows

C:=Ck+1,,CrRr×μ,

si52_e

J:=block diagJk+1,,JrRμ×μ,

si53_e

where

Cj=βj0,βj1,,βjq^jRr×(q^j+1),j=k+1,,r,

si54_e

eq00009-04-9780081019467

We observe that

1. Jsi55_e is nilpotent with an index of nil-potency q^r+1si56_e, because the largest Jordan block is (q^r+1)×(q^r+1)si57_e.

2. μ=j=k+1r(q^j+1)=j=k+1rq^j+rksi58_e.

The above two interpretations of infinite Jordan pairs display an essential difference. For example, the roles that the infinite poles and the infinite zeros play in the system behaviors are considered in totally different manners. It is obvious that vμ, and the dimensions of the generalized infinite Jordan pair of Definition 9.2.1 are unnecessarily larger than that of the infinite Jordan pair of Definition 9.2.2 due to some redundant information being included. This can be seen clearly from the following example.

Example 9.2.1

Consider the polynomial matrix

eq00009-05-9780081019467

its Smith-McMillan form is

eq00009-06-9780081019467

Thus A(s) has two infinite poles at degrees 1 and 3 and an infinite zero at degree 4. The dual polynomial matrix to A(s) is

eq00009-07-9780081019467

and

eq00009-08-9780081019467

is the local Smith form of DA(S)(w) at w = 0, where

eq00009-09-9780081019467

:=u1(w),u2(w),u3(w).

si59_e

So we get three kinds of infinite elementary divisor:

 w2 corresponding to the infinite pole of A(s),

 w7 corresponding to the infinite zero of A(s) and the IED 1 = w0.

From

β2q=1q!u2(q)(0),q=0,1,β3q=1q!u3(q)(0),q=0,1,2,3,4,5,6,

si60_e

we have

eq00009-10-9780081019467

According to Definition 9.2.1, the generalized infinite Jordan pair in the sense of Gohberg et al. [17] is (C,J)si42_e:

eq00009-11-9780081019467
eq00009-12-9780081019467

While the infinite Jordan pair in the sense of Vardulakis [13] is (C,J)si14_e with:

eq00009-13-9780081019467

In the above example it is noted that the dimensions of the generalized infinite Jordan pair, which are 3 × 9 and 9 × 9, are unnecessarily larger than that of the infinite Jordan pair, which are 3 × 5 and 5 × 5. Such a tendency will become more evident as the number of the infinite poles of A(s), the dimension of A(s) and the degree of A(s) are increased. However, the following observation arising from the above two definitions of infinite Jordan pairs suggests the possibility of deleting the redundant information that is contained in the generalized infinite Jordan pair.

Theorem 9.2.1

If (C,J)si42_e is a generalized infinite Jordan pair, there exists an elementary matrix P such that

CP=C,C0,

si64_e

eq00009-14-9780081019467

where C0Rr×(vμ), J′∈ Rμ×(vμ), J0R(vμ)×(vμ), 0 ∈ R(vμμ and (C,J)si14_e is an infinite Jordan pair. Furthermore, J0 is nilpotent with an index of nil-potency q1 − 1.

Proof

Note that Csi66_e is a submatrix of Csi67_e. By a series of interchanging of two columns in Csi67_e, Csi67_e can be brought to the form [C,C0]si70_e. We denote this elementary matrix as P, then P1=PT,CP=[C,C0]si71_e, where C0Rr×(vμ). Similarly, by interchanging the corresponding columns and the corresponding rows of J,Jsi72_e can be brought to a block matrix, i.e.,

eq00009-15-9780081019467

where

J=aσ1,σ2σ1,σ2Rμ×νμ,

si73_e

aσ1,σ2=1,σ1=σ=k+1jq^σ+1,σ2=j=2kτj+q^j+2,j=k+1,,r0,other

si74_e

J0=block diagJ2,,Jk,Jk+1,,Jr,

si75_e

Jj(j=2,3,,k)are Jordan matrix ofq1qj×q1qjj=2,,k,

si76_e

Ji(i=k+1,,r)are Jordan matrix ofq11×q11.

si77_e

It can easily be seen that J0 is nilpotent with an index of nil-potency q1 − 1.

Remark 9.2.1

The above elementary matrix P has the effect of deleting the redundant information in two ways. First, it deletes the redundant information in those blocks in the infinite Jordan pair of Gohberg et al. [17] that corresponds to the infinite zeros and brings them to the correct sizes. Second, it deletes all blocks in C,Jsi78_e that correspond to the infinite poles and all blocks that are not dynamically important. In this way the resulting resolvent decomposition more precisely reflects the relevant system structure, since the deleted blocks in the infinite Jordan pairs display no dynamics in the state solution. This will be seen explicitly when the effect of P on Z has been determined in a subsequent result.

Example 9.2.2

Recall Example 9.2.1, we have

eq00009-16-9780081019467

It is noted that here J0 is nilpotent with index of nil-potency 2.

The key point in here is to find the above elementary matrix P to delete the redundant information. Based on the information carried by the Smith-McMillan form at s=si20_e of A(s), P results from a series of elementary operations from an identity matrix, which is very easy to obtain. Once the redundant information is deleted from the generalized infinite Jordan pair, the generalized infinite Jordan pair and the elementary matrix P are not involved in computation in the solution procedure.

9.3 The solution of regular PMDs

We consider now the homogeneous regular PMD:

A(ρ)ξ(t)=0,t0.

si80_e  (9.4)

Let SA(s)(s)si81_e be the Smith-McMillan form at s=si20_e of A(s)=L[A(ρ)]=A0+A1s++Aq1sq1si83_e:

SA(s)(s)=diagsq1,sq2,,sqk,1sq^k+1,,1sq^rRr×r(s)

si84_e

and if A(s) has at least one zero at s=si20_e then the Laurent expansion of A−1(s) can be written as follows

A1(s)=Hq^rsq^r+Hq^r1sq^r1++H1s+H0+H1s1+H2s2+=Hpol(s)+Hsp(s),

si86_e

where Hpol(s)Rr×rssi87_e is the polynomial part of A−1(s) and Hsp(s) ∈ Rr×r(s) is the strictly proper part of A−1(s). Let a resolvent decomposition of A(s) be given by

A1(s)=C(sJIμ)1Z2+C(sInJ)1Z1,

si88_e

where n:=degdet(A(s))si89_e. It should be noted that (C, J, Z1) is a realization of Hsp(s), and (C,J,Z2)si90_e is a realization of Hpol(s). Considering the Laplace transformation of Eq. (9.4), we obtain

ξ^(s)=A1(s)α^(s)Rr×1,

si91_e  (9.5)

where α^(s)Rr×1[s]si92_e is the initial condition vector associated with the initial values of ξ(t) and its (q1 − 1)-derivatives at t = 0 −, i.e., ξ(0),ξ(1)(0),,ξ(q11)(0)si93_e given by Fossard [108], Pugh [107]

eq00009-17-9780081019467(9.6)

We obtain

eq00009-18-9780081019467(9.7)

where the vector

eq00009-19-9780081019467

eq00009-20-9780081019467(9.8)

Now by taking the inverse L Laplace transformation of Eq. (9.7), we have the following result.

Lemma 9.3.1

(Vardulakis [13])

The general solution of homogeneous PMD (Eq. 9.4) is

ξ(t)=CeJtxs(0)Ci=1q^rδ(t)(i1)Ji1(Jxf(0)),

si94_e

where δ(t) is the Dirac impulse function.

The next result constructs a resolvent decomposition for a regular polynomial matrix, which follows from Gohberg et al. [17].

Lemma 9.3.2

Let A(s)=A0+A1s++Aq1sq1Rr×r[s]si17_e, rankR[s]A(s)=rsi18_e. If (C, J) is the finite Jordan pair of A(s), and (C,J)si42_e is the generalized infinite Jordan pair of A(s) in the sense of Gohberg et al. [17], n:=degdet(A(s))si89_e. Put

eq00009-21-9780081019467

and

eq00009-22-9780081019467(9.9)

then

eq00009-23-9780081019467(9.10)

An interesting observation from Eq. (9.9) is the following.

Proposition 9.3.1

If we partition

Z:=Z1Z2:=Z1Z21Z22,

si99_e

where Z1Rn×r,Z21Rμ×r,Z22R(vμ)×rsi100_e, then

eq00009-24-9780081019467

where Z2Rμ×r.

Proof

Let

Π1Π2Π3:=SV1[0,,0,I]T,

si101_e

where Π1Rn×1, Π2Rμ×1, Π3R(vμ)×1. From Theorem 9.2.1, there exists an elementary matrix PRv×v, such that

eq00009-25-9780081019467

so

eq00009-26-9780081019467

where Q=Jq12J+Jq13JJ0++JJ0q12si102_e.

eq00009-27-9780081019467

Noticing J0 is nilpotent with an index of nil-potency q1 − 1, i.e., J0q11=0,si103_e it follows that:

eq00009-28-9780081019467

The above observation is interesting, not least for the way in which the redundant information contained in Zsi104_e is deleted. More importantly than this, however, is that such a mechanism of decoupling makes the computation of P attractive and facilitates the proposed refined resolvent decomposition.

The following result proposes a new approach to constructing a resolvent decomposition in terms of the finite Jordan pair, the infinite Jordan pair and the generalized infinite Jordan pair, which is fundamental for us to formulate the solution of the PMD. As one of our main results, we are ready to state it as follows.

Theorem 9.3.1

If (C, J) is the finite Jordan pair of A(s) and (C,Jsi105_e) is the infinite Jordan pair of A(s) in the sense of Vardulakis [13], Z:=Z1Z2:=Z1Z21Z22si106_e is given by Lemma 9.3.2, let Z2Rμ×r be given by

Z20=P1Z21Z22,

si107_e

then

eq00009-29-9780081019467(9.11)

Proof

This follows readily from Eq. (9.10) and Theorem 9.2.1 on noting that

eq00009-30-9780081019467

Remark 9.3.1

The resolvent decomposition proposed by Vardulakis [13] reflects the system solution structure precisely; however, the realization approach is not so straightforward by itself. On the other hand in the resolvent decomposition proposed by Gohberg et al. [17] (Lemma 9.3.2), Z1,Z2si108_e were formulated explicitly. However, there is some redundant information as described in Theorem 9.2.1 and it does not give such a precise insight into the system structure. The resolvent decomposition proposed here is a refinement of these two results and inherits the advantages of both results. Due to the fact that the redundant information is deleted, the proposed refined resolvent decomposition has minimal dimensions, the proposed approach has an obvious advantage, i.e., computation of the inverse matrix of A(s) can be carried out more efficiently.

Remark 9.3.2

The proposed resolvent decomposition has a dimension that is exactly the sum of the dimension of the minimal realization of the strictly proper part of A−1(s) and the dimension of the minimal realization of the polynomial part of A−1(s). Such a resolvent decomposition has thus minimal dimension. For a proof of this statement, one can refer to Vardulakis [13].

For the nonhomogeneous regular PMD

A(ρ)ξ(t)=Bu(t),t0

si109_e  (9.12)

the following theorem gives the complete solution.

Theorem 9.3.2

Let A(s)=A0+A1s++Aq1sq1Rr×r[s]si17_e be regular, and let SA(s)(s)=diag[sq1,sq2,,sqk,1/sq^k+1,,1/sqr^]si111_e be the Smith-McMillan form of A(s) at s=si20_e. If (C, J) is the finite Jordan pair of A(s) and (C,Jsi105_e) is the infinite Jordan pair of A(s) (in the sense of Vardulakis [13]), (C, J, Z1) and (C,J,Z2si114_e) satisfy the resolvent decomposition (Eq. 9.11), then the complete solution of regular PMD (Eq. 9.12) is

ξ(t)=CeJtxs(0)+C0teJ(tτ)Z1Bu(τ)dτCi=1qr^δ(t)(i1)Ji1(Jxf(0))Ci=0qr^JiZ2Bu(i)(t),

si115_e  (9.13)

where xs(0),Jxf(0)si116_e are initial values given by Eq. (9.8).

Proof

From Lemma 9.3.1, one knows that

ξ(t)=CeJtxs(0)Ci=1qr^δ(t)(i1)Ji1(Jxf(0))

si117_e

generates the general solution of the homogeneous PMD, so we only need to check that the formula (9.13) does indeed produce a solution of the nonhomogeneous PMD (Eq. 9.12). To this end, when t > 0, we have

ξ(j)(t)=CJjeJtxs(0)+k=0j1CJj1kZ1Bu(k)(t)+C0tJjeJ(tτ)Z1Bu(τ)dτCi=0qr^JiZ2Bu(i+j)(t),

si118_e

so

A(ρ)ξ(t)=j=0q1Ajξ(j)(t)=j=0q1AjCJjeJtxs(0)+j=0q1k=0j1AjCJj1kZ1Bu(k)(t)+0tj=0q1AjCJjeJ(tτ)Z1Bu(τ)dτj=0qr^j=0q1AjCJiZ2Bu(i+j)(t).

si119_e

Using the property j=0q1AjCJj=0si120_e and rearranging the terms, we have

A(ρ)ξ(t)=j=0q1Ajξ(j)(t)=k=0q1+qr^j=k+1q1AjCJj1kZ1j=0kAjCJkjZ2Bu(k)(t).

si121_e

Noticing

eq00009-31-9780081019467

from

A(s)A1(s)=I,

si122_e

it follows that

j=k+1q1AjCJj1kZ1j=0kAjCJkjZ2=I,k=00,k>0.

si123_e

Hence

A(ρ)ξ(t)=Bu(t),

si124_e

which finishes the proof.

Remark 9.3.3

The above solution displays precisely the zero state response by means of

C0teJ(tτ)Z1Bu(τ)dτCi=0qr^JiZ2Bu(i)(t)

si125_e

and the zero input response through the term

CeJtxs(0)Ci=1qr^δ(t)(i1)J(i1)(Jxf(0)).

si126_e

Also the impulsive properties of the system are displayed in this solution due to the fact that the initial conditions of the pseudo-state are considered. Such an impulsive part to the general nonhomogeneous PMDs solution is, however, unavailable from the solution of Gohberg et al. [17] and Vardulakis [13].

Remark 9.3.4

According to Gohberg et al. [17], the solution of PMD (Eq. 9.12) is following (without the impulse solution part):

ξ(t)=CeJtxs(0)+C0teJ(tτ)Z1Bu(τ)dτCi=0qr^+q11(J)iZ2Bu(i)(t),

si127_e

where (C,Jsi128_e) is the infinite Jordan pair in the sense of Gohberg et al. [17]. Z1,Z2si108_e are given by Eq. (9.9). By using Theorem 9.2.1, Proposition 9.3.1 and noticing that Jsi55_e is nilpotent with an index of nil-potency qr^+1si131_e, one finds that

eq00009-32-9780081019467

It is thus clearly seen that the redundant information included in the solution of Gohberg et al. [17] due to using the generalized infinite Jordan pairs does not appear in our solution any more. Also this helps to clarify the mechanism of decoupling in the solution of Gohberg et al. [17].

By comparing our solution with the solution of Gohberg et al. [17] and the solution of Vardulakis [13], it can be seen that, besides the fact that it displays the impulsive solution part, our solution can be carried out more efficiently in actual computation. The main reason for this is that the refined resolvent decomposition does not contain any redundant information, since the infinite Jordan pairs used in our solution are of minimal dimensions, and the matrices Z1 and Z2 are formulated explicitly. The refined resolvent decomposition facilitates computation of the inverse matrix of A(s) because the dimension of the matrices used are minimal. Rather than calculating the inverse matrix A−1(s) with an overly large dimension, it is suggested first to calculate the easily available elementary matrix P to delete all redundant information and then to obtain the inverse matrix with the minimal dimension. Once the refined resolvent decomposition is obtained, the generalized infinite Jordan pair and the elementary matrix P are not necessary for the calculation of the solution of the regular PMD. This thus presents another advantage of this method, which is algorithmically attractive when applied in actual computation.

9.4 Algorithm and examples

As mentioned before, the refined resolvent decomposition plays a key role in our approach, the difficulty in obtaining the solution of the regular PMDs depends on the calculation of this refined resolvent decomposition. To help clarify the construction of this refined resolvent decomposition, for the implementation of Theorem 9.3.1, the following algorithm is now given, which is useful for symbolic computational packages Maple.

Algorithm 9.4.1

(Computation of the refined resolvent decomposition of A(s) ∈ R[s]r×r)

Step 1 Let A(s) = ∑i=0q1Aisi, calculate the Smith form and the finite Jordan pair (C, J).

Step 2 Find the dual polynomial DA(s)(w) of A(s), calculate the local Smith form of DA(s)(w) at w = 0 SDA(s)0(w) and the unimodular matrices ŨL(w), ŨR(w) such that

ŨL(w)DA(s)(w)ŨR(w)=SDA(s)0(w).

si132_e

Step 3 Differentiate the matrix ŨR(w) and then construct the generalized infinite Jordan pair (C′, J′) and the infinite Jordan pair (C, J).

Step 4 Find the elementary matrix P by using Theorem 9.2.1.

Step 5 Calculate V, S and Z′ by Lemma 9.3.2.

Step 6 Partition Z′ = [Z1Z2′] = [Z1Z21Z22′], from [Z20] = P−1 [Z21Z22′] calculate Z2.

Step 7 Finally, obtain the refined resolvent decomposition

A1(s)=C(sInJ)1Z1+C(sJIμ)1Z2.

si133_e

Example 9.4.1

Let

A(s)=1s3001s00s2:=A0+A1s+A2s2+A3s3,

si134_e

with

A0=100010000,A1=000001000,A2=000000001,A3=010000000,

si135_e

r = 3, n = deg det(A(s)) = 2. The finite Jordan pairs of A(s) is (C, J):

C=000111,J=0100.

si136_e

The Smith-McMillan form of A(s) at s=si20_e is

SA(s)(s)=diag[s3,s2,1/s3],

si138_e

so A(s) has two poles at s=si20_e with orders q1 = 3 and q2 = 2 respectively and one zero at s=si20_e with orders q^3=3si141_e. The dual polynomial matrix to A(s) is

DA(s)(w)=wq1A1w=w3100w3w200wR[w]3×3

si142_e

and

ŨL(w)DA(s)(w)ŨR(w)=SDA(s)(w)0=wq1SA(s)1w=1000w000w6

si143_e

is the local Smith form of DAs(w) at w = 0, where

ŨL(w)=100001w31w,ŨR(w)00110w3010.

si144_e

One easily obtains the generalized infinite Jordan pair (C,Jsi128_e) (in the sense of Gohberg et al. [17]) of A(s) as following

eq00009-33-9780081019467(9.14)

eq00009-34-9780081019467(9.15)

and the infinite Jordan pair(C,Jsi105_e) (in the sense of Vardulakis [13]) of A(s) as

C=100000010000,J=0100001000010000.

si147_e

It is easy to find P,

P=0000100100000001000000010000000100000000100000001,

si148_e

such that

010000000001001000000C0000100100000001000000010000000100000000100000001P

si149_e

eq00009-35-9780081019467

0100000001000000010000000100100000000000100000001P10000000001000000010000000100000001000000010000000J0000100100000001000000010000000100000000100000001P

si150_e

eq00009-36-9780081019467

According to Lemma 9.3.2, one has

eq00009-37-9780081019467

so

eq00009-38-9780081019467(9.16)

We obtain

eq00009-39-9780081019467

and from

eq00009-40-9780081019467

we obtain

Z2=100000001010.

si151_e

Hence, by Theorem 9.3.1 we have constructed a resolvent form for the regular polynomial matrix A(s) as following

eq00009-41-9780081019467

Note that in the above refined resolvent decomposition the matrices C,Jsi152_e and Z2 have the minimal dimensions of 3 × 4, 4 × 4, and 4 × 3. Compared to the resolvent decomposition of Gehberg et al. [17] given by

eq00009-42-9780081019467

where CR3×7si153_e, JR7×7si154_e, and Z2R7×3si155_e are given by Eqs. (9.14), (9.15), (9.16), respectively, due to the fact that the redundant information has been deleted, the above refined resolvent decomposition is obviously in a much more concise form which will definitely bring some convenience when applied to the solution of the regular PMDs.

Example 9.4.2

Consider the following regular polynomial matrix

A(s)=i=07Aisi=14s7+58s638s514s4+38s218s1,s212s,14s638s5+14s334s218s+14,14s5+38s414s2+14s1814s212s+12s3+14s612s5,2s1,14s5+14s4+14s314s2+32s+32,14s414s314s2+14s0,s+1,s1,012s5+s4s2+12s,0,12s412s312s2+12s,12s3+12s2+12s12,

si156_e

r = 4, q1 = 7, n = deg det(A(s)) = 5. The finite Jordan pairs of A(s) is (C, J):

C=00000100001001011011,J=1000001100001000001000001.

si157_e

The dual polynomial matrix to A(s) is

DA(s)(w)=wq1A1w=14+58w38w214w3+38w518w6w7,w512w6,14w38w2+14w434w518w6+14w7,14w2+38w314w5+14w618w714w512w6+12w4+14w12w2,2w6w7,14w2+14w3+14w414w5+32w6+32w7,14w314w414w5+14w60,w6+w7,w6w7,012w2+w3w5+12w6,0,12w312w412w5+12w6,12w4+12w5+12w612w7

si158_e

and

ŨL(w)D~A(s)(w)ŨR(w)=SDA(s)0(w)=wq1SA(s)1w=diag{1,w6,w8,w9}

si159_e

is the local Smith form of DA(s)(w) at w = 0. The Smith-McMillan form of A(s) at s=si20_e is

SA(s)(s)=sq1DA(s)1s=diags7,s,1s,1s2

si161_e

so A(s) has two poles at s=si20_e with orders q1 = 7 and q2 = 1 respectively and two zeros at s=si20_e with orders q^3=1si164_e and q^4=2si165_e respectively

v=rq1(q1+q2)+(q^3+q^4)=23μ=(q^3+1)+(q^4+1)=5.

si166_e

Use the local Smith form of DA(s) at w = 0 to find the generalized infinite Jordan pair (C,Jsi128_e) (in the sense of Gohberg et al. [17]) of A(s):

C=0,2,0,0,0,1,0,2,0,0,0,0,2,44932,0,1,1,1,1,1,1,1,3853294,32,385128,70532,360564,148516,2,1,385128,68932,362164,149316,8623128,121532,1,1,0,417128,3173128,8683128,9731128,108964,5075642,1,0,0,0,0,2,1,0,0,0,0,0,0,1,1,0,0,0,0,0,0,01,0,0,0,0,0,1,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0

si168_e  (9.17)

..................Content has been hidden....................

You can't read the all page of ebook, please click here login for view all page.
Reset
3.145.63.136