|
Matrix Models 2.
|
|
| The w recursion relations can be expressed as a single matrix relation (the picture at right is not part of the equation, thanks): | |
 |
|
|
This can be even more succinctly written: n(t+1) = L n(t) where n(t+1) and n(t) are the columns of population values, and L is the square matrix defining the recursion. |
Finally note that n(t) = L n(t-1) = L2 n(t-2) = ... = Lt n(0), which gives us a nice way of determining the populations at any time t in terms of a set of starting populations at time t = 0. |
| On the next page we'll look at some examples. Your browser will need to be able to handle JavaScript. | |
|
|
|