4.2: Classifications of Model Equations
( \newcommand{\kernel}{\mathrm{null}\,}\)
There are some technical terminologies I need to introduce before moving on to further discussions:
Linear system A dynamical equation whose rules involve just a linear combination of state variables (a constant times a variable, a constant, or their sum).
Nonlinear system Anything else (e.g., equation involving squares, cubes, radicals, trigonometric functions, etc., of state variables).
First-order system A difference equation whose rules involve state variables of the immediate past (at time t−1) onlya.
Higher-order system Anything else.
aNote that the meaning of “order” in this context is different from the order of terms in polynomials.
Autonomous system A dynamical equation whose rules don’t explicitly include time t or any other external variables.
Non-autonomous system A dynamical equation whose rules do include time t or other external variables explicitly.
Decide whether each of the following examples is (1) linear or nonlinear, (2) first-order or higher-order, and (3) autonomous or non-autonomous
- xt=axt−1+b
- xt=axt−1+bxt−2+cxt−3
- xt=axt−1(1−xt−1)
- xt=axt−1+bxt−22+c√xt−1xt−3
- xt=axt−1xt−2+bxt−3+sin(t)
- xt=axt−1+byt−1,yt=cxt−1+dyt−1
Also, there are some useful things that you should know about these classifications:
Non-autonomous, higher-order difference equations can always be converted into autonomous, first-order forms, by introducing additional state variables.
For example, the second-order difference equation
xt=xt−1+xt−2
(which is called the Fibonacci sequence can be converted into a first-order form by introducing a “memory” variable y as follows:
yt=xt−1
Using this, xt−2 can be rewritten as yt−1. Therefore the equation can be rewritten as follows:
xt=xt−1+yt−1yt=xt−1
This is now first-order. This conversion technique works for third-order or any higher-order equations as well, as long as the historical dependency is finite. Similarly, a non-autonomous equation
xt=xt−1+t
can be converted into an autonomous form by introducing a “clock” variable z as follows:
zt=zt−1+1,z0=1
This definition guarantees zt−1=t. Using this, the equation can be rewritten as
xt=xt−1+zt−1,
which is now autonomous. These mathematical tricks might look like some kind of cheating, but they really aren’t. The take-home message on this is that autonomous first-order equations can cover all the dynamics of any non-autonomous, higher-order equations. This gives us confidence that we can safely focus on autonomous first-order equations without missing anything fundamental. This is probably why autonomous first-order difference equations are called by a particular name: iterative maps.
Convert the following difference equations into an autonomous, first-order form.
1. xt=xt−1(1−xt−1)sint
2. xt=xt−1+xt−2−xt−3
Another important thing about dynamical equations is the following distinction between linear and nonlinear systems:
Linear equations are always analytically solvable, while nonlinear equations don’t have analytical solutions in general.
Here, an analytical solution means a solution written in the form of xt=f(t) without using state variables on the right hand side. This kind of solution is also called a closed form solution because the right hand side is “closed,” i.e., it only needs t and doesn’t need x. Obtaining a closed-form solution is helpful because it gives you a way to calculate (i.e., predict) the system’s state directly from t at any point in time in the future, without actually simulating the whole history of its behavior. Unfortunately this is not possible for nonlinear systems in most cases.