06.09.2021 Views

Linear Algebra, 2020a

Linear Algebra, 2020a

Linear Algebra, 2020a

SHOW MORE
SHOW LESS

Create successful ePaper yourself

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

Topic: <strong>Linear</strong> Recurrences 475<br />

Write T for the matrix and ⃗v n for the vector with components F(n) and F(n − 1)<br />

so that ⃗v n = T n−1 ⃗v 1 for n 1. If we diagonalize T then we have a fast way<br />

to compute its powers: where T = PDP −1 then T n = PD n P −1 and the n-th<br />

power of the diagonal matrix D is the diagonal matrix whose entries are the<br />

n-th powers of the entries of D.<br />

The characteristic equation of T is λ 2 − λ − 1 = 0. The quadratic formula<br />

gives its roots as (1+ √ 5)/2 and (1− √ 5)/2. (These are sometimes called “golden<br />

ratios;” see [Falbo].) Diagonalizing gives this.<br />

( )<br />

1 1<br />

=<br />

1 0<br />

(<br />

1+ √ 5<br />

2<br />

1− √ 5<br />

2<br />

1 1<br />

)( √ )(<br />

1+ 5<br />

1<br />

2<br />

0<br />

1−<br />

0 √ 5<br />

2<br />

Introducing the vectors and taking the n-th power, we have<br />

( ) ( ) n−1 ( )<br />

F(n) 1 1 f(1)<br />

=<br />

F(n − 1) 1 0 f(0)<br />

) ⎛ (<br />

⎜ ⎝<br />

=<br />

(<br />

1+ √ 5<br />

2<br />

1− √ 5<br />

2<br />

1 1<br />

1+ √ ) n−1<br />

5<br />

2<br />

0<br />

(<br />

The calculation is ugly but not hard.<br />

( )<br />

F(n)<br />

=<br />

F(n − 1)<br />

(<br />

1+ √ 5<br />

2<br />

0<br />

1− √ 5<br />

2<br />

1 1<br />

(<br />

= √ 1 1+ √ 5<br />

2<br />

5<br />

) ⎛ ⎜ ⎝<br />

(<br />

1− √ 5<br />

2<br />

1− √ 5<br />

2<br />

√5 −( 1−√ 5<br />

2 √ ) 5<br />

√−1<br />

1+ √ 5<br />

5 2 √ 5<br />

√−1<br />

1+ √ 5<br />

5 2 √ 5<br />

)<br />

⎞<br />

( 1√5<br />

⎟ −( 1−√ 5<br />

)<br />

2 √ 5 n−1 ⎠<br />

)<br />

)( )<br />

1+ √ ) n−1<br />

5<br />

2<br />

0<br />

(<br />

0<br />

) ⎛ ⎜ ⎝<br />

(<br />

(<br />

1 1 −<br />

⎛ (<br />

= √ 1 1+ √ ) n (<br />

5<br />

2 −<br />

1− √ 5<br />

2<br />

⎝(<br />

) n−1 (<br />

5 −<br />

1+ √ 5<br />

2<br />

We want the first component.<br />

F(n) = 1 √<br />

5<br />

[(<br />

1− √ 5<br />

2<br />

1+ √ ) n−1<br />

5<br />

2<br />

1− √ 5<br />

2<br />

) n<br />

1 + √ ) n (<br />

5<br />

−<br />

2<br />

) n−1<br />

⎞<br />

⎠<br />

1− √ 5<br />

2<br />

) n−1<br />

⎞<br />

⎟<br />

⎠<br />

1 − √ ) n ]<br />

5<br />

2<br />

⎞<br />

⎟<br />

) n−1 ⎠<br />

1<br />

0<br />

( 1 √5<br />

− 1 √<br />

5<br />

)<br />

This formula gives the value of any member of the sequence without having to<br />

first find the intermediate values.<br />

Because (1 − √ 5)/2 ≈ −0.618 has absolute value less than one, its powers<br />

go to zero and so the F(n) formula is dominated by its first term. Although we

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

Saved successfully!

Ooh no, something went wrong!