
# 3.4: Eigenvalue Method

$$\newcommand{\vecs}[1]{\overset { \scriptstyle \rightharpoonup} {\mathbf{#1}} }$$

$$\newcommand{\vecd}[1]{\overset{-\!-\!\rightharpoonup}{\vphantom{a}\smash {#1}}}$$

In this section we will learn how to solve linear homogeneous constant coefficient systems of ODEs by the eigenvalue method. Suppose we have such a system

$\vec{x}' = P \vec{x},$

where $$P$$ is a constant square matrix. We wish to adapt the method for the single constant coefficient equation by trying the function $$e^{\lambda t}$$. However, $$\vec{x}$$ is a vector. So we try $$\vec{x}=\vec{v}e^{\lambda t}$$, where $$\vec{v}$$ is an arbitrary constant vector. We plug this $$\vec{x}$$ into the equation to get

$\lambda \vec{v}e^{\lambda t}=P\vec{v}e^{\lambda t}.$

We divide by $$e^{\lambda t}$$ and notice that we are looking for a scalar $$\lambda$$ and a vector $$\vec{x}$$ that satisfy the equation

$\lambda \vec{v}= P \vec{v}.$

To solve this equation we need a little bit more linear algebra, which we now review.

## 3.4.1 Eigenvalues and eigenvectors of a matrix

Let $$A$$ be a constant square matrix. Suppose there is a scalar $$\lambda$$ and a nonzero vector $$\vec{v}$$ such that

$A \vec{v}= \lambda \vec{v}.$

$$\left[ \begin{array}{cc} 2 & 1 \\ 0 & 1 \end{array} \right]$$

We then call $$\lambda$$ an eigenvalue of $$A$$ and $$\vec{x}$$ is said to be a corresponding eigenvector.
Example 3.4.1
The matrix $$\left[ \begin{array}{cc} 2 & 1 \\ 0 & 1 \end{array} \right]$$ has an eigenvalue of $$\lambda = 2$$ with a corresponding eigenvector $$\left[ \begin{array}{c} 1 \\ 0 \end{array} \right]$$
because
$\left[ \begin{array}{cc} 2 & 1 \\ 0 & 1 \end{array} \right] \left[ \begin{array}{c} 1 \\ 0 \end{array} \right]= \left[ \begin{array}{c} 2 \\ 0 \end{array} \right]= 2\left[ \begin{array}{c} 1 \\ 0 \end{array} \right]. \nonumber$

Let us see how to compute the eigenvalues for any matrix. We rewrite the equation for an eigenvalue as

$(A - \lambda I)\vec{v}= \vec{0}.\nonumber$

We notice that this equation has a nonzero solution $$\vec{v}$$ only if $$A - \lambda I$$ is not invertible. Were it invertible, we could write $$(A - \lambda I)^{-1}(A - \lambda I)\vec{v}= (A - \lambda I)^{-1}\vec{0},$$ which implies $$\vec{v}= \vec{0}.$$ Therefore, $$A$$ has the eigenvalue $$\lambda$$ if and only if $$\lambda$$ solves the equation

$det(A - \lambda I)=0.\nonumber$

Consequently, we will be able to find an eigenvalue of $$A$$ without finding a corresponding eigenvector. An eigenvector will have to be found later, once $$\lambda$$ is known.

Example 3.4.2

Find all eigenvalues of $$\left[ \begin{array}{ccc} 2 & 1 & 1 \\ 1 & 2 & 0 \\ 0 & 0 & 2 \end{array} \right]$$.

We write

$det \left( \left[ \begin{array}{ccc} 2 & 1 & 1 \\ 1 & 2 & 0 \\ 0 & 0 & 2 \end{array} \right] - \lambda \left[ \begin{array}{ccc} 1 & 0 & 0 \\ 0 & 1 & 0 \\ 0 & 0 & 1 \end{array} \right]\right)= det \left( \left[ \begin{array}{ccc} 2- \lambda & 1 & 1 \\ 1 & 2- \lambda & 0 \\ 0 & 0 & 2- \lambda \end{array} \right] \right)= (2- \lambda)((2- \lambda)^2-1)=-(\lambda-1)(\lambda-2)(\lambda-3).\nonumber$

So the eigenvalues are $$\lambda=1,\lambda=2,$$ and $$\lambda=3.$$

Note that for an $$n \times n$$ matrix, the polynomial we get by computing $$det(A-\lambda I)$$ will be of degree $$n$$, and hence we will in general have $$n$$ eigenvalues. Some may be repeated, some may be complex.

To find an eigenvector corresponding to an eigenvalue $$\lambda$$, we write

$(A - \lambda I)\vec{v}= \vec{0},\nonumber$

and solve for a nontrivial (nonzero) vector $$\vec{v}$$. If $$\lambda$$ is an eigenvalue, this will always be possible.

Example 3.4.3.

Find an eigenvector of $$\left[ \begin{array}{ccc} 2 & 1 & 1 \\ 1 & 2 & 0 \\ 0 & 0 & 2 \end{array} \right]$$ corresponding to the eigenvalue $$\lambda = 3$$.

We write

$(A - \lambda I)\vec{v}=\left( \left[ \begin{array}{ccc} 2 & 1 & 1 \\ 1 & 2 & 0 \\ 0 & 0 & 2 \end{array} \right] - 3 \left[ \begin{array}{ccc} 1 & 0 & 0 \\ 0 & 1 & 0 \\ 0 & 0 & 1 \end{array} \right]\right)\left[ \begin{array}{c} v_1 \\ v_2 \\ v_3 \end{array} \right]=\left[ \begin{array}{ccc} -1 & 0 & 0 \\ 1 & -1 & 0 \\ 0 & 0 & -1 \end{array} \right]\left[ \begin{array}{c} v_1 \\ v_2 \\ v_3 \end{array} \right] = \vec{0}.\nonumber$

It is easy to solve this system of linear equations. We write down the augmented matrix

$=\left[ \begin{array}{ccc|c} -1 & 0 & 0 &0\\ 1 & -1 & 0 &0\\ 0 & 0 & -1 &0 \\ \end{array} \right],\nonumber$

and perform row operations (exercise: which ones?) until we get:

$=\left[ \begin{array}{ccc|c} 1 & -1 & 0 &0\\ 0 & 0 & 1 &0\\ 0 & 0 & 0 &0 \\ \end{array} \right].\nonumber$

The entries of $$\vec{v}$$ have to satisfy the equations $$v_1-v_2=0, v_3=0$$ and $$v_2$$ is a free variable. We can pick $$v_2$$ to be arbitrary (but nonzero), let $$v_1=v_2,$$ and of course $$v_3=0.$$ For example, if we pick $$v_2=1,$$ then $$\vec{v} =\left[ \begin{array}{c} 1 \\ 1 \\ 0 \end{array} \right].$$ Let us verify that $$\vec{v}$$ really is an eigenvector corresponding to $$\lambda= 3$$:

$\left[ \begin{array}{ccc} 2 & 1 & 1 \\ 1 & 2 & 0 \\ 0 & 0 & 2 \end{array} \right]\left[ \begin{array}{c} 1 \\ 1 \\ 0 \end{array} \right]=\left[ \begin{array}{c} 3 \\ 3 \\ 0 \end{array} \right]=3\left[ \begin{array}{c} 1 \\ 1 \\ 0 \end{array} \right].\nonumber$

Yay! It worked.

Exercise $$\PageIndex{1}$$:

(easy): Are eigenvectors unique? Can you find a different eigenvector for $$\lambda= 3$$ in the example above? How are the two eigenvectors related?

Exercise $$\PageIndex{2}$$:

Note that when the matrix is $$2 \times 2$$ you do not need to write down the augmented matrix and do row operations when computing eigenvectors (if you have computed the eigenvalues correctly). Can you see why? Try it for the matrix $$v_2.$$

## 3.4.2 The eigenvalue method with distinct real eigenvalues

We have the system of equations

$\vec{x}'=P\vec{x}.$

We find the eigenvalues $$\lambda_1, \lambda_2, \ldots , \lambda_n$$ of the matrix $$P$$, and corresponding eigenvectors $$\vec{x}_1, \vec{x}_2, \ldots , \vec{x}_n.$$ Now we notice that the functions $$\vec{v}_1e^{\lambda_1t},\vec{v}_2e^{\lambda_2t}, \ldots , \vec{v}_ne^{\lambda_nt}$$ are solutions of the system of equations and hence $$\vec{x}=c_1 \vec{v}_1e^{\lambda_1t}+ c_2 \vec{v}_2e^{\lambda_2t} + \cdots + c_n \vec{v}_ne^{\lambda_nt}$$ is a solution.

Theorem 3.4.1. Take $$\vec{x}'=P\vec{x}$$. If $$P$$ is an $$n \times n$$ constant matrix that has $$n$$ distinct real eigenvalues $$\lambda_1,\lambda_2, \ldots, \lambda_n,$$ then there exist $$n$$ linearly independent corresponding eigenvectors$$\vec{v}_1,\vec{v}_2, \ldots, \vec{v}_n,$$ and the general solution to $$\vec{x}'=P\vec{x}$$ can be written as

$\vec{x}=c_1 \vec{v}_1e^{\lambda_1t}+ c_2 \vec{v}_2e^{\lambda_2t} + \cdots + c_n \vec{v}_ne^{\lambda_nt}.$

The corresponding fundamental matrix solution is $$X(t)= [\vec{v}_1e^{\lambda_1t}~~~ \vec{v}_2e^{\lambda_2t} ~~~ \cdots ~~~ \vec{v}_ne^{\lambda_nt}]$$. That is, $$X(t)$$ is the matrix whose $$j^{\rm{th}}$$ column is $$\vec{v}_je^{\lambda_jt}$$.

Example $$\PageIndex{4}$$:

Consider the system

$\vec{x}'=\left[ \begin{array}{ccc} 2 & 1 & 1 \\ 1 & 2 & 0 \\ 0 & 0 & 2 \end{array} \right] \vec{x}. \nonumber$

Find the general solution.

Earlier, we found the eigenvalues are $$1, 2, 3.$$ We found the eigenvector $$\left[ \begin{array}{c} 1 \\ 1 \\ 0 \end{array} \right]$$ for the eigenvalue 3. Similarly we find the eigenvector $$\left[ \begin{array}{c} 1 \\ -1 \\ 0 \end{array} \right]$$ for the eigenvalue 1, and $$\left[ \begin{array}{c} 0 \\ 1 \\ -1 \end{array} \right]$$ for the eigenvalue 2 (exercise: check). Hence our general solution is

$\vec{x}=c_1 \left[ \begin{array}{c} 1 \\ -1 \\ 0 \end{array} \right]e^t+c_2 \left[ \begin{array}{c} 0 \\ 1 \\ -1 \end{array} \right]e^{2t} + c_3 \left[ \begin{array}{c} 1 \\ 1 \\ 0 \end{array} \right]e^{3t} = \left[ \begin{array}{c} c_1e^t + c_3e^{3t} \\ -c_1e^t+c_2e^{2t}+c_3e^{3t} \\ -c_2e^{2t} \end{array} \right]. \nonumber$

In terms of a fundamental matrix solution

$\vec{x}=X(t) \vec{c}=\left[ \begin{array}{ccc} e^t & 0 & e^{3t} \\ -e^t & e^{2t} & e^{3t} \\ 0 & -e^{2t} & 0 \end{array} \right] \left[ \begin{array}{c} c_1 \\ c_2 \\ c_3 \end{array} \right].\nonumber$

Exercise $$\PageIndex{3}$$

Check that this $$\vec{x}$$ really solves the system.

Note: If we write a homogeneous linear constant coefficient $$n^{\rm{th}}$$ order equation as a first order system (as we did in § 3.1), then the eigenvalue equation

$det(P - \lambda I) =0 \nonumber$

is essentially the same as the characteristic equation we got in § 2.2 and § 2.3.

## 3.4.3 Complex eigenvalues

A matrix might very well have complex eigenvalues even if all the entries are real. For example, suppose that we have the system

$\vec{x}'= \left[ \begin{array}{cc} 1 & 1 \\ -1 & 1 \end{array} \right] \vec{x}.$

Let us compute the eigenvalues of the matrix $$P=\left[ \begin{array}{cc} 1 & 1 \\ -1 & 1 \end{array} \right].$$

$det(P - \lambda I) =det \left( \left[ \begin{array}{cc} 1- \lambda & 1 \\ -1 & 1- \lambda \end{array} \right] \right)=(1-\lambda)^2 + 1=\lambda^2-2\lambda+2= 0.$

Thus $$\lambda = 1 \pm i.$$ The corresponding eigenvectors are also complex. First take $$\lambda = 1 - i,$$

$(P-(1-i)I)\vec{v}=\vec{0},$

$\left[ \begin{array}{cc} i & 1 \\ -1 & i \end{array} \right] \vec{v}=\vec{0}.$

The equations $$iv_1+v_2=0$$ and $$-v_1+iv_2=0$$ are multiples of each other. So we only need to consider one of them. After picking $$v_2=1$$, for example, we have an eigenvector $$\vec{v}=\left[ \begin{array}{c}i\\1 \end{array} \right]$$. In similar fashion we find that $$\left[ \begin{array}{c}-i\\1 \end{array} \right]$$ is an eigenvector corresponding to the eigenvalue $$1+i$$.

We could write the solution as

$\vec{x}=c_1\left[ \begin{array}{c} i \\ 1 \end{array} \right]e^{(1-i)t}+c_2\left[ \begin{array}{c} -i \\ 1 \end{array} \right]e^{(1+i)t}= \left[ \begin{array}{c} c_1ie^{(1-i)t}-c_2ie^{(1+i)t} \\ c_1e^{(1-i)t}+c_2e^{(1+i)t} \end{array} \right].$

We would then need to look for complex values $$c_1$$ and $$c_2$$ to solve any initial conditions. It is perhaps not completely clear that we get a real solution. We could use Euler’s formula and do the whole song and dance we did before, but we will not. We will do something a bit smarter first.

We claim that we did not have to look for a second eigenvector (nor for the second eigenvalue). All complex eigenvalues come in pairs (because the matrix $$P$$ is real).

First a small side note. The real part of a complex number $$z$$ can be computed as $$\frac{z+\bar{z}}{2}$$, where the bar above $$z$$ means $$\overline{a+ib}=a-ib$$. This operation is called the complex conjugate. If $$a$$ is a real number, then $$\bar{a}=a$$. Similarly we can bar whole vectors or matrices. If a matrix $$P$$ is real, then $$\bar{P}=P$$. We note that $$\overline{P \vec{x}}=\bar{P} \bar{\vec{x}}=P \bar{\vec{x}}.$$. Therefore,

$\overline{(P- \lambda I) \vec{v }} = (P- \bar{\lambda} I) \bar{\vec{v }}.$

So if $$\vec{v}$$ is an eigenvector corresponding to the eigenvalue $$\lambda=a+ib$$, then $$\bar{\vec{v}}$$ is an eigenvector corresponding to the eigenvalue $$\bar{\lambda}=a-ib$$.

Suppose that $$a+ib$$ is a complex eigenvalue of $$P$$, and $$\vec{v}$$ is a corresponding eigenvector. Then

$\vec{x}_1=\vec{v}e^{(a+ib)t}$

is a solution (complex valued) of $$\vec{x}'=P\vec{x}$$. Euler’s formula shows that $$\overline{e^{a+ib}}=e^{a-ib}$$, and so

$\vec{x}_2=\overline{\vec{x_1}}=\bar{\vec{v}}e^{(a+ib)t}$

is also a solution. The function

$\vec{x}_3 = {\rm{Re~}} \vec{x}_1= {\rm{Re~}} \vec{v}e^{(a+ib)t}=\frac{\vec{x}_1+\overline{\vec{x_1}}}{2}=\frac{\vec{x}_1+\vec{x_2}}{2}$

is also a solution. And $$\vec{x}_3$$ is real-valued! Similarly as $${\rm{Im~}}z= \frac{z-\bar{z}}{2i}$$ is the imaginary part, we find that

$\vec{x}_4= {\rm{Im~}} \vec{x}_1= \frac{\vec{x}_1-\overline{\vec{x_1}}}{2i}=\frac{\vec{x}_1-\vec{x_2}}{2i}$

is also a real-valued solution. It turns out that $$\vec{x}_3$$ and $$\vec{x}_4$$ are linearly independent. We will use Euler’s formula to separate out the real and imaginary part.

Returning to our problem,

$\vec{x}_1=\left[ \begin{array}{c} i \\ 1 \end{array} \right]e^{(1-i)t}=\left[ \begin{array}{c} i \\ 1 \end{array} \right](e^t\cos t-ie^t \sin t) = \left[ \begin{array}{c} ie^t \cos t+e^t \sin t \\ e^t\cos t-ie^t \sin t \end{array} \right].$

Then

${\rm{Re~}} \vec{x}_1= \left[ \begin{array}{c} e^t \sin t \\ e^t\cos t \end{array} \right],$

${\rm{Im~}} \vec{x}_1= \left[ \begin{array}{c} e^t \cos t \\ -e^t\sin t \end{array} \right],$

are the two real-valued linearly independent solutions we seek.

Exercise $$\PageIndex{4}$$:

Check that these really are solutions.

The general solution is

$\vec{x}=c_1 \left[ \begin{array}{c} e^t \sin t \\ e^t\cos t \end{array} \right] + c_2 \left[ \begin{array}{c} e^t \cos t \\ -e^t\sin t \end{array} \right]= \left[ \begin{array}{c} c_1 e^t \sin t +c_2 e^t \cos t \\ c_1 e^t \cos t -c_2 e^t \sin t \end{array} \right].\nonumber$

This solution is real-valued for real $$c_1$$ and $$c_2$$. Now we can solve for any initial conditions that we may have.

Let us summarize as a theorem.

Theorem 3.4.2. Let $$P$$ be a real-valued constant matrix. If $$P$$ has a complex eigenvalue $$a+ib$$ and a corresponding eigenvector $$\vec{v}$$, then $$P$$ also has a complex eigenvalue $$a-ib$$ with a corresponding eigenvector $$\bar{\vec{v}}$$. Furthermore, $$\vec{x}' = P \vec{x}$$ has two linearly independent real-valued solutions

$\vec{x}_1= {\rm{Re~}} \vec{v} e^{(a+ib)t}, ~~~~ {\it{and}} ~~~~ \vec{x}_2= {\rm{Im~}} \vec{v} e^{(a+ib)t}.$

For each pair of complex eigenvalues $$a+ib$$ and $$a-ib$$, we get two real-valued linearly independent solutions. We then go on to the next eigenvalue, which is either a real eigenvalue or another complex eigenvalue pair. If we have $$n$$ distinct eigenvalues (real or complex), then we end up with $$n$$ linearly independent solutions.

We can now find a real-valued general solution to any homogeneous system where the matrix has distinct eigenvalues. When we have repeated eigenvalues, matters get a bit more complicated and we will look at that situation in § 3.7.