Back to Dynamical systems

Exercise 9

Avg difficulty 2.5

Gil Strang defines the Gibonacci numbers GnG_n as follows. We begin with G0=0G_0 = 0 and G1=1G_1=1. A subsequent Gibonacci number is the average of the two previous; that is, Gn+2=12(Gn+Gn+1)G_{n+2} = \frac12(G_{n}+G_{n+1}). We then have Gn+2=12Gn+12Gn+1Gn+1=Gn+1.\begin{aligned} G_{n+2} & {}={} \frac12 G_{n} + \frac 12 G_{n+1} \\ G_{n+1} & {}={} G_{n+1}\text{.} \\ \end{aligned}

  1. If xn=[Gn+1Gn]\xvec_n=\twovec{G_{n+1}}{G_n}, find the matrix AA such that xn+1=Axn\xvec_{n+1} = A\xvec_n.

  2. Find the eigenvalues and associated eigenvectors of AA.

  3. Explain why this dynamical system does not neatly fit into one of the six types that we saw in this section.

  4. Write x0\xvec_{0} as a linear combination of eigenvectors of AA.

  5. Write xn\xvec_n as a linear combination of eigenvectors of AA.

  6. What happens to GnG_n as nn becomes very large?

Austin, Understanding Linear Algebra, §4.4 Dynamical systems, Exercise 9

AI Tutor

Adapted from Understanding Linear Algebra © 2023 David Austin. Licensed under CC BY 4.0. Source: Understanding Linear Algebra. Imported at revision 3e6dced.