13.08.2018 Views

[Studies in Computational Intelligence 481] Artur Babiarz, Robert Bieda, Karol Jędrasiak, Aleksander Nawrat (auth.), Aleksander Nawrat, Zygmunt Kuś (eds.) - Vision Based Systemsfor UAV Applications (2013, Sprin

Create successful ePaper yourself

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

Estimation of Solution of Discrete L<strong>in</strong>ear Time-Vary<strong>in</strong>g System 319<br />

As previously, we can only estimate an upper bound for growth rate.<br />

Example 3. Consider system (1) with (A(n)) n∈N given by<br />

[ s<strong>in</strong>n<br />

A(n)=<br />

Namely, its elements are as follows<br />

5 + 1 1<br />

1<br />

n+20<br />

n+10<br />

cosn<br />

5<br />

+ 1<br />

a 11 (n)= s<strong>in</strong>n<br />

5 + 1 a 12 (n)= 1<br />

n+10<br />

a 21 (n)=<br />

n+20 1 a 22 (n)= cosn<br />

5<br />

+ 1 .<br />

Apply<strong>in</strong>g the above-mentioned elements of (A(n)) n∈N to (3) and (4) we obta<strong>in</strong> (5)<br />

<strong>in</strong> the follow<strong>in</strong>g form<br />

]<br />

.<br />

Because,<br />

a (1)<br />

11 (n) =a 11(n)ã 11 (n)=(a 11 (n)) 2 − 1 = s<strong>in</strong>2 n + 10s<strong>in</strong>n<br />

25<br />

a (1)<br />

12 (n) =a 11(n)ã 12 (n)=(a 11 (n) − 1) a 12 (n)= s<strong>in</strong>n<br />

a (1)<br />

21 (n) =a 12(n)ã 11 (n)=a 12 (n)((a 11 (n)) + 1)=<br />

a (1)<br />

22 (n) =a 12(n)ã 12 (n)=(a 12 (n)) 2 =<br />

a (2)<br />

11 (n) =a 21(n)ã 21 (n)=(a 21 (n)) 2 =<br />

1<br />

(n 3 + 10) 2<br />

1<br />

(n 2 + 20) 2<br />

a (2)<br />

12 (n) =a 21(n)ã 22 (n)=a 21 (n)(a 22 (n)+1) =<br />

5n + 50<br />

10 + s<strong>in</strong>n<br />

5n + 50<br />

10 + cosn<br />

5n + 100<br />

a (2)<br />

21 (n) =a 22(n)ã 21 (n)=(a 22 (n) − 1) a 21 (n)= cosn<br />

5n + 100<br />

a (2)<br />

22 (n) =a 22(n)ã 22 (n)=(a 22 (n)) 2 − 1 = cos2 n + 10cosn<br />

25<br />

b(n)= 1 2<br />

s<br />

∑<br />

i, j,k=1<br />

∣<br />

∣a (i)<br />

∣ ∣∣<br />

jk (n)+a(i) kj (n) =<br />

1<br />

[∣ ∣ ∣ ∣ ∣ ∣ ∣∣a (1)<br />

∣∣ ∣∣a<br />

11<br />

2<br />

(n)+a(1) 11 (n) (1)<br />

∣∣ ∣∣a +<br />

12 (n)+a(1) 21 (n) (1)<br />

∣∣+<br />

+<br />

21 (n)+a(1) 12 (n) ∣ ∣ ∣ ∣ ∣<br />

∣<br />

∣a (1)<br />

∣∣ ∣∣a<br />

22 (n)+a(1) 22 (n) (2)<br />

∣∣ ∣∣a +<br />

11 (n)+a(2) 11 (n) (2)<br />

∣∣+<br />

+<br />

12 (n)+a(2) 21 (n) ∣ ∣ ∣] ∣<br />

∣a (2)<br />

∣∣ ∣∣a<br />

21 (n)+a(2) 12 (n) (2)<br />

∣∣ +<br />

22 (n)+a(2) 22 (n) =

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

Saved successfully!

Ooh no, something went wrong!