Iterate a matrix recurrence and recognise an eventual steady state in a regular process.
Key skillsIterate a matrix recurrence and recognise an eventual steady state in a regular process.
The study design publishes this in the combined Units 3–4 list; the stated content applies to Unit 4.
Build the idea
Matrix-capable technology can generate many states quickly, but a clear state convention and a correct update order are essential. A table exposes convergence more clearly than a single large power. Verify an early step manually and check preserved quantities such as a closed population total. Apparent numerical steadiness should be interpreted relative to a stated tolerance. Abstraction keeps state totals and transition rates; decomposition separates inputs, iteration and checking.
Try the sample task
Enter T=[[0.75,0.25],[0.25,0.75]] and column S0=[[160],[40]] in a matrix tool. Generate S(n+1)=TS(n) for n=0–4, then compare with T5 S0. State the expected states.
The full worksheet includes the worked solution and remaining task set.
What this activity covers
This focused activity develops the stated idea through one context. It is practice, not evidence that every application or subclause of a broad study-design bullet has been mastered.