20.05.2014 Views

link to my thesis

link to my thesis

link to my thesis

SHOW MORE
SHOW LESS

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

196 CHAPTER 11. H 2 MODEL-ORDER REDUCTION FROM ORDER N TO N-3<br />

The system of equations (11.1) and the two additional constraints in (11.2) represent<br />

N + 2 equations in N + 2 unknowns. The N + 2 unknowns show up as the N<br />

quantities x 1 ,...,x N <strong>to</strong>gether with the unknown parameters ρ 1 and ρ 2 in (11.1).<br />

When a solution (x 1 ,...,x N ,ρ 1 ,ρ 2 ) of the system of equations (11.1) is known,<br />

and this solution also satisfies the additional constraints ã N−1 = 0 and ã N−2 =0<br />

in (11.2), then an approximation G(s) of order N − 3 can be computed. To obtain<br />

the globally optimal approximation G(s), all the solutions (x 1 ,...,x N ,ρ 1 ,ρ 2 ) are<br />

required <strong>to</strong> select the best one. Section 11.1 describes how solutions of (11.1), which<br />

satisfy both the additional constraints (11.2), can be obtained by using the Stetter-<br />

Möller matrix method. This approach leads <strong>to</strong> a two-parameter eigenvalue problem<br />

involving two matrices and one common eigenvec<strong>to</strong>r. Linearizing and solving such a<br />

two parameter polynomial eigenvalue problem are the subjects of the Sections 11.2<br />

and 11.3. Section 11.4 shows how <strong>to</strong> arrive at an approximation G(s) once these<br />

solutions of the system of equations (11.1) and the constraints (11.2) are known. As<br />

a proof of principle, an example is worked out in Section 11.5.<br />

11.1 Solving the system of quadratic equations<br />

Suppose a system of the form (11.1) <strong>to</strong>gether with the constraints (11.2) is given.<br />

The idea now is <strong>to</strong> use the Stetter-Möller method in the same way as in the previous<br />

chapters <strong>to</strong> find solutions x 1 ,...,x N , and ρ 1 and ρ 2 which lead <strong>to</strong> approximations<br />

G(s) of order N − 3.<br />

Using the polynomials in (11.2) we apply the Stetter-Möller matrix method and<br />

consider the linear multiplication opera<strong>to</strong>rs AãN−1 (ρ 1 ,ρ 2 ) and AãN−2 (ρ 1 ,ρ 2 ) within<br />

the quotient space C(ρ 1 ,ρ 2 )[x 1 ,...,x N ]/I(ρ 1 ,ρ 2 ). Here I(ρ 1 ,ρ 2 ) denotes the ideal<br />

generated by the parameterized set of polynomials of the quadratic system of equations<br />

(11.1). With respect <strong>to</strong> an identical monomial basis B as in (8.47), these linear<br />

opera<strong>to</strong>rs are represented by the matrices AãN−1 (ρ 1 ,ρ 2 ) T and AãN−2 (ρ 1 ,ρ 2 ) T , which<br />

denote multiplication by ã N−1 and ã N−2 .<br />

We know from Section 3.3 that the eigenvalues λ in the eigenvalue problem AãN−i<br />

(ρ 1 ,ρ 2 ) T v = λv, coincide with the values of the polynomial ã N−i at the solutions<br />

of the system of equations (11.1), for i = 1, 2. Because the values of ã N−1 and<br />

ã N−2 are required <strong>to</strong> be zero, the resulting problem is: AãN−1 (ρ 1 ,ρ 2 ) T v = 0 and<br />

AãN−2 (ρ 1 ,ρ 2 ) T v = 0. Thus, actually we are searching here for values of ρ 1 and ρ 2<br />

which make the matrices AãN−1 (ρ 1 ,ρ 2 ) T and AãN−2 (ρ 1 ,ρ 2 ) T simultaneously singular.<br />

Both the matrices AãN−1 (ρ 1 ,ρ 2 ) T and AãN−2 (ρ 1 ,ρ 2 ) T are rational in ρ 1 and<br />

ρ 2 and can be made polynomial in ρ 1 and ρ 2 . Using Theorem 10.1 the matrices<br />

AãN−1 (ρ 1 ,ρ 2 ) T and AãN−2 (ρ 1 ,ρ 2 ) T are made polynomial in ρ 1 and ρ 2 by multiplying<br />

elementwise the rows of the matrices with well chosen quantities. The polynomial matrices<br />

in ρ 1 and ρ 2 are denoted by the matrices Ãã N−1<br />

(ρ 1 ,ρ 2 ) T and Ãã N−2<br />

(ρ 1 ,ρ 2 ) T .<br />

These matrices have dimensions 2 N × 2 N and the <strong>to</strong>tal degree of ρ 1 and ρ 2 occurring<br />

in the polynomial matrices is N − 1 (analogous <strong>to</strong> the result in Corollary 10.2).

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!