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.
58 CHAPTER 5. ND-SYSTEMS APPROACH IN POLYNOMIAL OPTIMIZATION<br />
<strong>to</strong> ξ 2 times its preceding row. Obviously, in such a situation the value y 0,0 can not<br />
be zero and it therefore can be used <strong>to</strong> produce a normalized common eigenvec<strong>to</strong>r<br />
(1,ξ 1 ,ξ 2 1,ξ 2 ,ξ 1 ξ 2 ,ξ 2 1ξ 2 ,ξ 2 2,ξ 1 ξ 2 2,ξ 2 1ξ 2 2) T of the matrices A T x 1<br />
and A T x 2<br />
from which the<br />
multi-eigenvalue (ξ 1 ,ξ 2 ) can be read off directly.<br />
5.2 Usage of the nD-system in polynomial optimization<br />
Modern methods for the solution of large eigenvalue problems have the attractive<br />
feature that they do not operate on the matrix A T r directly. Instead they iteratively<br />
perform the action of the linear opera<strong>to</strong>r at hand, for which it suffices <strong>to</strong><br />
implement a computer routine that computes this action for any given vec<strong>to</strong>r. The<br />
nD-systems approach supports this and it offers a framework <strong>to</strong> compute the action<br />
of A T r on a vec<strong>to</strong>r v, by initializing the initial state as w 0,...,0 := v and using<br />
the n recursions (5.3) in combination with the relationship (5.10) <strong>to</strong> obtain the vec<strong>to</strong>r<br />
r(σ 1 ,...,σ n )w 0,...,0 = A T r w 0,...,0 . Such an approach entirely avoids an explicit<br />
construction of the matrix A r . Note that r(σ 1 ,...,σ n )w 0,...,0 consists of a linear<br />
combination of state vec<strong>to</strong>rs w t1,...,t n<br />
; each monomial term r α1,...,α n<br />
x α1<br />
1 ···xαn n that<br />
occurs in r(x 1 ,...,x n ) corresponds <strong>to</strong> a weighted state vec<strong>to</strong>r r α1,...,α n<br />
w α1,...,α n<br />
. This<br />
makes clear that for any choice of polynomial r the vec<strong>to</strong>r r(σ 1 ,...,σ n )w 0,...,0 can be<br />
constructed from the same multidimensional time series y t1,...,t n<br />
which is completely<br />
determined by (and computable from) the n difference equations (5.3) and the initial<br />
state w 0,...,0 .<br />
There are two possible ways <strong>to</strong> retrieve the minimal value and the global minimizer(s)<br />
of the polynomial p λ (x 1 ,...,x n ).<br />
(i) If attention is focused on the computation of all the stationary points of the<br />
criterion p λ first, then the actions of the matrices A T x i<br />
, for all i = 1,...,n, play<br />
a central role since their eigenvalues constitute the coordinates of these stationary<br />
points. Given an initial state w 0,...,0 , which is composed of m n values of the time<br />
series y t1,...,t n<br />
(those for which t j