10.5: Repeated Eigenvalues with One Eigenvector
( \newcommand{\kernel}{\mathrm{null}\,}\)
Example: Find the general solution of ˙x1=x1−x2,˙x2=x1+3x2.
The equations in matrix form are
ddt(x1x2)=(1−113)(x1x2)
The ansatz x=veλt leads to the characteristic equation
0=det(A−λI)=λ2−4λ+4=(λ−2)2.
Therefore, λ=2 is a repeated eigenvalue. The associated eigenvector is found from −v1−v2=0, or v2=−v1; and normalizing with v1=1, we have
λ=2,v=(1−1)
We have thus found a single solution to the ode, given by
x1(t)=c1(1−1)e2t
and we need to find the missing second solution to be able to satisfy the initial conditions. An ansatz of t times the first solution is tempting, but will fail. Here, we will cheat and find the missing second solution by solving the equivalent secondorder, homogeneous, constant-coefficient differential equation.

If A has only a single linearly independent eigenvector v, then Equation ??? can be solved for w (otherwise, it cannot). Using A,λ and v of our present example, Equation ??? is the system of equations given by
(−1−111)(w1w2)=(1−1)
The first and second equation are the same, so that w2=−(w1+1). Therefore,
w=(w1−(w1+1))=w1(1−1)+(0−1)
Notice that the first term repeats the first found solution, i.e., a constant times the eigenvector, and the second term is new. We therefore take w1=0 and obtain
w=(0−1)
as before.
The phase portrait for this ode is shown in Fig. 10.3. The dark line is the single eigenvector v of the matrix A. When there is only a single eigenvector, the origin is called an improper node.