Linear dynamical system

Linear dynamical systems are dynamical systems whose evaluation functions are linear. While dynamical systems, in general, do not have closed-form solutions, linear dynamical systems can be solved exactly, and they have a rich set of mathematical properties. Linear systems can also be used to understand the qualitative behavior of general dynamical systems, by calculating the equilibrium points of the system and approximating it as a linear system around each such point.

Introduction

In a linear dynamical system, the variation of a state vector
(an $N$-dimensional vector denoted $\mathbf$) equals a constant matrix
(denoted $\mathbf$) multiplied by
$\mathbf$. This variation can take two forms: either
as a flow, in which $\mathbf$ varies
continuously with time

:$\frac \mathbf(t) = \mathbf \mathbf(t)$

or as a mapping, in which
$\mathbf$ varies in discrete steps

:$\mathbf_ = \mathbf \mathbf_$

These equations are linear in the following sense: if
$\mathbf(t)$ and $\mathbf(t)$
are two valid solutions, then so is any linear combination
of the two solutions, e.g.,
$\mathbf(t) \ \stackrel\ \alpha \mathbf(t) + \beta \mathbf(t)$
where $\alpha$ and $\beta$
are any two scalars. The matrix $\mathbf$
need not be symmetric.

Linear dynamical systems can be solved exactly, in contrast to most nonlinear ones. Occasionally, a nonlinear system can be solved exactly by a change of variables to a linear system. Moreover, the solutions of (almost) any nonlinear system can be well-approximated by an equivalent linear system near its fixed points. Hence, understanding linear systems and their solutions is a crucial first step to understanding the more complex nonlinear systems.

Solution of linear dynamical systems

If the initial vector $\mathbf_ \ \stackrel\ \mathbf(t=0)$
is aligned with a right eigenvector $\mathbf_$ of
the matrix $\mathbf$, the dynamics are simple

:$\frac \mathbf(t) = \mathbf \mathbf_ = \lambda_ \mathbf_$

where $\lambda_$ is the corresponding eigenvalue;
the solution of this equation is
:$\mathbf(t) = \mathbf_ e^$
as may be confirmed by substitution.

If $\mathbf$ is diagonalizable, then any vector in an $N$-dimensional space can be represented by a linear combination of the right and left eigenvectors (denoted $\mathbf_$) of the matrix $\mathbf$.

:$\mathbf_ = \sum_^ \left( \mathbf_ \cdot \mathbf_ \right) \mathbf_$

Therefore, the general solution for $\mathbf(t)$ is
a linear combination of the individual solutions for the right
eigenvectors
:$\mathbf(t) = \sum_^ \left( \mathbf_ \cdot \mathbf_ \right) \mathbf_ e^$

Similar considerations apply to the discrete mappings.

Classification in two dimensions

The roots of the characteristic polynomial det(A - λI) are the eigenvalues of A. The sign and relation of these roots, $\lambda_n$, to each other may be used to determine the stability of the dynamical system
:$\frac \mathbf(t) = \mathbf \mathbf(t).$
For a 2-dimensional system, the characteristic polynomial is of the form $\lambda^2-\tau\lambda+\Delta=0$ where $\tau$ is the trace and $\Delta$ is the determinant of A. Thus the two roots are in the form:
:$\lambda_1=\frac$
:$\lambda_2=\frac{2}$,
and $\Delta=\lambda_1\lambda_2$ and $\tau=\lambda_1+\lambda_2$. Thus if $\Delta<0$ then the eigenvalues are of opposite sign, and the fixed point is a saddle. If $\Delta>0$ then the eigenvalues are of the same sign. Therefore, if $\tau>0$ both are positive and the point is unstable, and if $\tau<0$ then both are negative and the point is stable. The discriminant will tell you if the point is nodal or spiral (i.e. if the eigenvalues are real or complex).

See also

* Linear system
* Dynamical system
* List of dynamical system topics
* Matrix differential equation

Dynamical systems