The matrix form of the recursion relation
uo = 1, u1=2, un = 6un-1 − 8un-2, n > 2
is written as
Wn-1 = Awn-2,
where
wn-2 = , wn-1 =
,
and =
(a) Using
W0 =
=
compute w1, w2, w3, and w4.Then make a list of the terms of the recurrence relation u2, u3, u4, u5.
(b) Express wn-1 as a matrix times w0.
We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.