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.

74 CHAPTER 5. ND-SYSTEMS APPROACH IN POLYNOMIAL OPTIMIZATION<br />

n time directions, it is non-minimal and especially for points near the initial<br />

hypercube more efficient paths can be constructed.<br />

• The equalizing method performs best for points having (almost) equal coordinates<br />

(thus, points near the diagonal, for example the points (10, 10), (50, 50) or<br />

(100, 100)). For n = 2 this method generates stable patterns which constitute<br />

an optimal solution <strong>to</strong> the shortest path problem for y t1,t 2<br />

with t 1 = t 2 . For<br />

other points it is less efficient. Increasing the dimension n for this method does<br />

not influence this behavior.<br />

• The axis method performs well for points near the coordinate axes, (for example<br />

the points (0, 10), (0, 50) or (0, 100)). For n = 2 this method generates stable<br />

patterns which constitute an optimal solution <strong>to</strong> the shortest path problem for<br />

y t1,t 2<br />

with t 1 =0ort 2 = 0. Increasing the dimension n for this method does<br />

not influence this behavior.<br />

• The diagonal method does not exhibit a linear numerical complexity with respect<br />

<strong>to</strong> |t| and is highly inefficient.<br />

To further support and visualize these statements, some simulation experiments<br />

have been performed with n = 2 and m = 3, where the requested state vec<strong>to</strong>rs are<br />

further away from the origin: w 0,500 , w 125,375 , w 250,250 , w 375,125 and w 500,0 .<br />

For the linear, diagonal, equalizing and axis methods, the points which are required<br />

for computing the state vec<strong>to</strong>rs w 0,500 , w 250,250 , and w 125,375 , respectively, are<br />

displayed in three separate plots in the Figures 5.12, 5.13, 5.14 and 5.15.<br />

Figure 5.12: Points required by the Linear method for computing state vec<strong>to</strong>rs at<br />

time instants (0, 500), (250, 250), and (125, 375) with a 3 × 3 initial state<br />

From the Figures 5.12, 5.13, 5.14, and 5.15 one can see that the linear method has<br />

the best performance as it computes the fewest numbers of points in each situation<br />

and that the diagonal method has a highly inefficient performance for all locations<br />

of the requested state vec<strong>to</strong>rs. The equalizing and axis methods are only efficient in<br />

some specific situations: Figure 5.14 shows that the equalizing method is only efficient

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

Saved successfully!

Ooh no, something went wrong!