Discrete Time Dynamical Systems
We'll go over systems in which time is discrete rather than continuous. These systems are called difference equations, @recursion-relations, iterated maps, or simply maps. These can be interesting; even in one dimension they can exhibit oscillations and chaos.
A difference equation has the general form
where is a time-like variable, and may be vectors,
Solutions to difference equations are sequences If is the initial condition, then
So the solution is Long term dynamics are given by moving along this sequence as
We will consider ourselves, for now, with @autonomous-systems where there is no explicit dependence on i.e.
So and
Example: If we start with then so the solution is the sequence
Orbits and Fixed Points
A sequence is called the orbit (or solution) starting from This is analogous to a trajectory in a continuous time dynamical system.
Referenced by (1 direct, 2 transitive)
Direct references:
Transitive (depth 1):
A fixed point in a DTDS is a point whose further iteration does not change, i.e. Fixed points satisfy
Stability of Linear Maps
Consider
Starting with so our general solution is
Fixed points satisfy Therefore, is always a fixed point, and if then every is a fixed point, i.e. the map is just
Given that is always a fixed point of a linear map, we'll consider different cases of the value of and how it impacts the stability of
If then as Thus, grows without bound and is unstable.
If then as Thus, and keeps the same sign. Hence, is stable.
If then for all Hence is stable.
If then as but alternates sign (oscillates.) Hence, is stable.
If then as and oscillates with increasing magnitude. Hence is unstable.
If then so the solution alternates between and The fixed point is unstable.
If then for all so every point is a stable fixed point.
In summary, if then is stable. if then is unstable.