20.05.2014 Views

link to my thesis

link to my thesis

link to my thesis

SHOW MORE
SHOW LESS

Create successful ePaper yourself

Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.

8.3. A REPARAMETERIZATION OF THE MODEL REDUCTION PROBLEM 145<br />

This yields the expression:<br />

∏<br />

k − δ l )<br />

k>l,k,lj(δ ∏ k + δ i )<br />

k>j(δ ∏ (−δ i − δ l )<br />

j>l<br />

m i,j =<br />

∏<br />

. (8.36)<br />

(δ k − δ l )<br />

k>l<br />

Canceling common fac<strong>to</strong>rs yields:<br />

∏<br />

k + δ i )<br />

k>j(δ ∏ (−δ i − δ l )<br />

j>l<br />

m i,j = ∏<br />

k − δ j )<br />

k>j(δ ∏ (δ j − δ l )<br />

j>l<br />

(8.37)<br />

= (−δ i − δ 1 ) ···(−δ i − δ j−1 )(−δ i − δ j+1 ) ···(−δ i − δ N )<br />

.<br />

(δ j − δ 1 ) ···(δ j − δ j−1 )(δ j − δ j+1 ) ···(δ j − δ N )<br />

The denomina<strong>to</strong>r expression equals d ′ (δ j ), while the numera<strong>to</strong>r equals − d(−δi)<br />

(δ . The<br />

i+δ j)<br />

polynomial d(s) has its zeros at δ 1 ,δ 2 ,...,δ N in the open left-half plane Π − , which are<br />

all of multiplicity 1. Therefore it holds that, d(−δ i ) 0, (δ i + δ j ) 0 and d ′ (δ j ) 0<br />

for all pairs (i, j). Hence, the entries m i,j are non-zeros for all pairs (i, j), which<br />

proves the theorem.<br />

□<br />

Note that Equation (8.32) can be regarded as a system of N equations in the<br />

N unknowns x 1 ,...,x N with coefficients that depend on the parameters provided<br />

by ρ(δ i ). For the case of co-order k = 1 the number of free parameters in ρ(δ i )is<br />

k − 1 = 0. This case was studied in [50]. As in that paper, we intend <strong>to</strong> proceed here<br />

by solving for the quantities x 1 ,x 2 ,...,x N , which then determine the polynomial<br />

ã(s), from which q 0 and a(s) can be obtained. Subsequently, the polynomial b(s) can<br />

be obtained as described in Section 8.6.<br />

In the co-order k case, where k>1, the solutions x 1 ,x 2 ,...,x N should satisfy<br />

the additional constraints ã N−1 = ··· =ã N−k+1 = 0 <strong>to</strong>o. These constraints can in<br />

view of Equation (8.27) be cast in the form of a linear constraint on the parameters<br />

x 1 ,...,x N with coefficients that depend on δ 1 ,...,δ N only. Moreover, note that for<br />

all values for k ≥ 1 a feasible solution requires that x i 0 for all i =1,...,N,so<br />

that the trivial solution <strong>to</strong> the system of equations (8.32) must be discarded.<br />

Furthermore it is important here <strong>to</strong> note that for k ≥ 1 the system of equations<br />

(8.32) for the quantities x 1 ,x 2 ,...,x N is in Gröbner basis form with respect <strong>to</strong> any<br />

<strong>to</strong>tal degree monomial ordering for fixed values of ρ 0 ,ρ 1 ,...,ρ k−1 . This observation is<br />

crucial as it provides a way <strong>to</strong> solve this system of equations by applying the Stetter-<br />

Möller matrix method mentioned in Section 3.3. This is studied in Section 8.5 of this<br />

chapter.

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

Saved successfully!

Ooh no, something went wrong!