link to my thesis
link to my thesis
link to my thesis
Create successful ePaper yourself
Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.
136 CHAPTER 8. H 2 MODEL-ORDER REDUCTION<br />
In this <strong>thesis</strong> the approach of [50] is generalized and extended and, as a result, the<br />
H 2 model reduction problem from order N <strong>to</strong> N − 1, N − 2, and N − 3 is solved. For<br />
computing the real approximations of orders N − 1, N − 2, and N − 3, the algebraic<br />
Stetter-Möller matrix method for solving systems of polynomial equations of Section<br />
3.3 is used. This approach guarantees that the globally best approximation <strong>to</strong> the<br />
given system is found (while typically many local optima exist).<br />
For compact notation we introduce the concept of a co-order: the case where the<br />
order of the given system of order N is reduced <strong>to</strong> order N − k is called the co-order<br />
k case.<br />
Remark 8.1. In the algebraic approach <strong>to</strong> global H 2 -approximation of [50], it is convenient<br />
<strong>to</strong> impose the technical condition that all the N zeros of d(s), the poles of<br />
H(s), are distinct for the co-order k = 1 case. Extensions may be developed in the<br />
future <strong>to</strong> handle the case with poles of multiplicities larger than 1 <strong>to</strong>o, but this will<br />
complicate notation and the numerical procedures. In the setup presented in this and<br />
in the next chapters we shall impose a similar constraint for ease of exposition for all<br />
co-orders k.<br />
This chapter is structured as follows: in Section 8.2 the H 2 model-order reduction<br />
problem is introduced and formulated. In Section 8.3 a system of quadratic equations<br />
is constructed for the co-order k case, by reparameterizing the H 2 model-order<br />
reduction problem introduced in Section 8.2. This is a generalization of the algebraic<br />
approach taken in [50]. The system of equations here contains the variables<br />
x 1 ,...,x N , and the additional real-valued parameters ρ 1 ,ρ 2 ,...,ρ k−1 . It is in a particular<br />
Gröbner basis form from which it is immediately clear that it admits a finite<br />
number of solutions. In Section 8.4 a homogeneous polynomial of degree three is given<br />
for the co-order k case which coincides with the H 2 model-order reduction criterion<br />
for the difference between H(s) and G(s) at the stationary points. This is again a<br />
generalization of the third order polynomial for the co-order k = 1 case presented in<br />
[50]. Section 8.5 shows how the Stetter-Möller matrix method of Section 3.3 is used<br />
<strong>to</strong> solve the system of quadratic equations in the co-order k case.<br />
Applying the Stetter-Möller matrix method transforms the problem in<strong>to</strong> an associated<br />
eigenvalue problem. From the solutions of this eigenvalue problem, the<br />
corresponding feasible solutions for the real approximation G(s) of order N − k can<br />
be selected. The H 2 -criterion is used <strong>to</strong> select the globally best approximation: the<br />
smallest real criterion value yields the globally optimal approximation.<br />
Following this approach for the co-order k = 1 case, leads <strong>to</strong> a large conventional<br />
eigenvalue problem. The transformation in<strong>to</strong> an eigenvalue problem and computing<br />
its solutions is the subject of Chapter 9. This largely builds on [50] but in Chapter 9<br />
this technique is extended <strong>to</strong> a matrix-free version by using an nD-system approach<br />
as presented in Chapter 5. In this way we are able <strong>to</strong> compute the globally optimal<br />
approximation G(s) of order N − 1 of a given system H(s) of order N.<br />
In the Chapters 10 and 11 the more difficult problems of computing a globally<br />
optimal real H 2 -approximation G(s) for the co-order k = 2 and k = 3 case are