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.
10.6. EXAMPLES 181<br />
5. Compute the non-zero finite eigenvalues ρ 1 and the corresponding eigenvec<strong>to</strong>rs<br />
w of the regular generalized eigenvalue problem (F + ρ 1 G)w =0.<br />
6. Determine the corresponding solutions (x 1 ,...,x N ) by computing solutions v<br />
<strong>to</strong> the polynomial eigenvalue problem Ãã N−1<br />
(ρ 1 ) T v = 0 and by reading off<br />
the values of x 1 ,...,x N from the entries of the eigenvec<strong>to</strong>rs v at the specified<br />
positions. These solutions (x 1 ,...,x N ) are constructed <strong>to</strong> satisfy the constraint<br />
ã N−1 = 0 in (10.3).<br />
7. Extend the already computed solution set (for q 0 0) with any solutions <strong>to</strong><br />
(10.5), for q 0 = 0, which also satisfy the linear constraint (10.3).<br />
8. Compute all the corresponding H 2 -criterion values, i.e., by substituting (x 1 ,<br />
..., x N ) and the corresponding ρ 1 in<strong>to</strong> the third order polynomial specified in<br />
Equation (10.42).<br />
9. Select the feasible solution (ˆx 1 ,...,ˆx N ) and ˆρ 1 that produces the smallest (positive)<br />
real criterion value.<br />
10. Use the selected solution (ˆx 1 ,...,ˆx N ) and ˆρ 1 <strong>to</strong> compute the real stable polynomial<br />
ã(s) from Equation (8.27). This is a polynomial of order N − 2 since<br />
the coefficient ã N−1 is zero. Furthermore, read off q 0 from the coefficient ã N−2<br />
as q 0 =(−1) N−2 ã N−2 .<br />
11. Compute a(s) from ã(s) and q 0 .<br />
12. Compute b(s) using Equation (8.49).<br />
13. The globally optimal approximation G(s) of order N − 2 is given by G(s) =<br />
b(s)/a(s).<br />
10.6 Examples<br />
In this section three worked examples are presented <strong>to</strong> illustrate the co-order k =2<br />
techniques discussed in this chapter.<br />
In Subsection 10.6.1 a system of order 6 is reduced <strong>to</strong> order 4. The approximation<br />
of order 4 is computed by applying the co-order k = 1 technique of Chapter 9 twice<br />
and the co-order k = 2 technique of the present chapter once. The co-order k =2<br />
technique is applied here without computing the Kronecker canonical form. Instead,<br />
a balancing method is used <strong>to</strong> improve the ill-conditioning of the singular matrix<br />
pencil. The results for both approaches are very similar.<br />
Subsection 10.6.2 describes the reduction of a system of order 7 <strong>to</strong> a globally<br />
optimal H 2 approximation of order 5. Computing the Kronecker canonical form is<br />
necessary in this example, because otherwise all the eigenvalues of the singular matrix<br />
pencil are incorrectly specified <strong>to</strong> be 0, indeterminate or infinite by all the numerical<br />
methods we have available, due <strong>to</strong> ill-conditioning of the singular pencil.