Systems of First Order Linear Differential Equations

We will now turn our attention to solving systems of simultaneous

homogeneous first order linear differential equations. The solutions of such
systems require much linear algebra (Math 220). But since it is not a
prerequisite for this course, we have to limit ourselves to the simplest
instances: those systems of two equations and two unknowns only. But first,
we shall have a brief overview and learn some notations and terminology.

A system of n linear first order differential equations in n unknowns (an n ×

n system of linear equations) has the general form:

x1′ = a11 x1 + a12 x2 + … + a1n xn + g1

x2′ = a21 x1 + a22 x2 + … + a2n xn + g2
x3′ = a31 x1 + a32 x2 + … + a3n xn + g3 (*)
: : :
: : :
xn′ = an1 x1 + an2 x2 + … + ann xn + gn

Where the coefficients aij’s, and gi’s are arbitrary functions of t. If every
term gi is constant zero, then the system is said to be homogeneous.
Otherwise, it is a nonhomogeneous system if even one of the g’s is nonzero.
The system (*) is most often given in a shorthand format as a matrix-vector
equation, in the form:
x′ = Ax + g

 x ′   a11 a12 ... a1n   x1   g1 

 1′  
 x 2  a 21 a 22 ... a 2 n   x 2   g 2 
 ′  a a32 ... a3n   x3   g 3 
 x3  =  31   + 
 :   : : : :  :  : 
   : : : :  :  : 
 :       
 x ′  a n1 an 2 ... a nn   x n   g n 
 n 

x′ A x g

Where the matrix of coefficients, A, is called the coefficient matrix of the

system. The vectors x′, x, and g are

x ′   x1   g1 
 1′  x  g 
 x2   2  2
 ′  x3   g3 
 x3 
x′ =  , x=  , g=  .
:  : :
 ′  xn   g n 
 x n 

For a homogeneous system, g is the zero vector. Hence it has the form

x′ = Ax.
Fact: Every n-th order linear equation is equivalent to a system of n first
order linear equations.

Examples:

(i) The mechanical vibration equation m u″ + γ u′ + k u = F(t) is equivalent to

x1′ = x2

−k γ F (t )
x2′ = x1 − x2 +
m m m

Note that the system would be homogeneous (respectively,

nonhomogeneous) if the original equation is homogeneous
(respectively, nonhomogeneous).

(ii) y″′ − 2y″ + 3y′ − 4y = 0 is equivalent to

x1 ′ = x2
x2 ′ = x3
x3 ′ = 4 x1 − 3 x2 + 2 x3
This process can be easily generalized. Given an n-th order linear equation

any(n) + an−1 y(n−1) + an−2 y(n−2) + … + a2 y″ + a1 y′ + a0 y = g(t).

Make the substitutions: x1 = y, x2 = y′, x3 = y″, … , xn = y(n−1), and xn′ = y(n).

The first n − 1 equations follow thusly. Lastly, substitute the x’s into the
original equation to rewrite it into the n-th equation and obtain the system of
the form:

x1 ′ = x2
x2 ′ = x3
x3 ′ = x4
: : :
: : :
xn−1′ = xn

′ − a0 a a a g (t )
xn = x1 − 1 x2 − 2 x3 − ... − n−1 xn +
an an an an an

Note: The reverse is also true. Given an n × n system of linear equations, it

can be rewritten into a single n-th order linear equation. (The result is not
unique. There are multiple ways to do this.)
Exercises:

1 – 3 Convert each linear equation into a system of first order equations.

1. y″ − 4y′ + 5y = 0

2. y″′ − 5y″ + 9y = t cos 2t

3. y(4) + 3y″′ − πy″ + 2πy′ − 6y = 11

4. Rewrite the system you found in (a) Exercise 1, and (b) Exercise 2, into a
matrix-vector equation.

5. Convert the third order linear equation below into a system of 3 first
order equation using (a) the usual substitutions, and (b) substitutions in the
reverse order: x1 = y″, x2 = y′, x3 = y. Deduce the fact that there are multiple
ways to rewrite each n-th order linear equation into a linear system of n
equations.
y″′ + 6y″ + y′ − 2y = 0

Answers:
1. x1 ′ = x 2 2. x1 ′ = x 2
x2′ = −5x1 + 4x2 x2 ′ = x3
x3′ = −9x1 + 5x3 + t cos 2t
3. x1 ′ = x2
x2 ′ = x3
x3 ′ = x4
x4 ′ = 6x1 − 2πx2 + πx3 − 3x4
 0 1 0  0 
 0 1  0 0 1  0 
4. (a) x′ =  x (b) x′ =  x + 
− 5 4 − 9 0 5 t cos 2t

5. (a) x1 ′ = x 2 (b) x1′ = −6x1 − x2 + 2x3

x2 ′ = x3 x2 ′ = x1
x3′ = 2x1 − x2 − 6x3 x3 ′ = x2
 A Crash Course in (2 × 2) Matrices

Several weeks worth of matrix algebra in an hour… (Relax, we will only

study the simplest case, that of 2 × 2 matrices.)

Review topics:

1. What is a matrix (pl. matrices)?

A matrix is any rectangular array of numbers (called entries). Each

entry’s position is addressed by the row and column (in that order)
where it is located. For example, a52 represents the entry positioned at
the 5th row and the 2nd column of the matrix A.

2. The size of a matrix

The size of a matrix is specified by 2 numbers

[number of rows] × [number of columns].

Therefore, an m × n matrix is a matrix that contains m rows and n

columns. A matrix that has equal number of rows and columns is
called a square matrix. A square matrix of size n × n is usually
referred to simply as a square matrix of size (or order) n.

Notice that if the number of rows or columns is 1, the result (respectively, a

1 × n, or an m × 1 matrix) is just a vector. A 1 × n matrix is called a row
vector, and an m × 1 matrix is called a column vector. Therefore, vectors are
really just special types of matrices. Hence, you will probably notice the
similarities between many of the matrix operations defined below and vector
operations that you might be familiar with.
3. Two special types of matrices

Identity matrices (square matrices only)

The n × n identity matrix is often denoted by In.

1 0 0
1 0 0 1 0 
I2 = 0 1  , I3 =   , etc.
  0 0 1

Properties (assume A and I are of the same size):

AI = IA = A
In x = x, x = any n × 1 vector

Zero matrices – matrices that contain all-zero entries.

Properties:

A+0=0+A=A
A0 = 0 = 0A

4. Arithmetic operations of matrices

(i) Addition / subtraction

a b   e f  a ± e b ± f 
c d  ±  g =
h  c ± g d ± h 
  
(ii) Scalar Multiplication

a b  ka kb 
k = , for any constant k.
 c d   kc kd 

(iii) Matrix multiplication

a b  e f  ae + bg af + bh 
c d  g =
   h  ce + dg cf + dh 

The matrix multiplication AB = C is defined only if there are as many

rows in B as there are columns in A. For example, when A is m × k
and B is k × n. The product matrix C is going to be of size m × n, and
whose ij-th entry, cij, is equal to the vector dot product between the i-
th row of A and the j-th column of B. Since vectors are matrices, we
can also multiply together a matrix and a vector, assuming the above
restriction on their sizes is met. The product of a 2 × 2 matrix and a 2-
entry column vector is

a b   x  ax + by 
 c d   y  =  cx + dy  .
    

Note 1: Two square matrices of the same size can always be

multiplied together. Because, obviously, having the same number of
rows and columns, they satisfy the size requirement outlined above.

Note 2: In general, AB ≠ BA. Indeed, depending on the sizes of A

and B, one product might not even be defined while the other product
is.
5. Determinant (square matrices only)

For a 2 × 2 matrix, its determinant is given by the formula

a b 
det   = ad − bc
c d 
Note: The determinant is a function whose domain is the set of all
square matrices of a certain size, and whose range is the set of all real
(or complex) numbers.

6. Inverse matrix (of a square matrix)

Given an n × n square matrix A, if there exists a matrix B (necessarily

of the same size) such that

AB = BA = In,

then the matrix B is called the inverse matrix of A, denoted A−1. The
inverse matrix, if it exists, is unique for each A. A matrix is called
invertible if it has an inverse matrix.

a b 
Theorem: For any 2 × 2 matrix A = c d  ,
 
its inverse, if exists, is given by

1  d − b
−1
A = ad − bc − c a  .
 

Theorem: A square matrix is invertible if and only if its

determinant is nonzero.
 1 − 2  2 − 3
Examples: Let A = 5 2  and B = − 1 4  .
   

1 − 2  2 − 3  2 − 2 − 4 − (−3)
(i) 2A − B = 2  −
  =
 
5 2  − 1 4  10 − (−1) 4 − 4 
 0 − 1
= 11 0 
 

1 − 2  2 − 3  2 + 2 − 3 − 8  4 − 11
(ii) AB = 5 2  − 1 4  = 10 − 2 − 15 + 8 = 8 − 7 
      
On the other hand:
 2 − 3 1 − 2  2 − 15 − 4 − 6 − 13 − 10
BA = − 1 4  5 2  = − 1 + 20 2 + 8  =  19 10 
     

(iii) det(A) = 2 − (−10) = 12, det(B) = 8 − 3 = 5.

Since neither is zero, as a result, they are both invertible matrices.

1  2 2  1  2 2  1 / 6 1/ 6 
−1
(iv) A =
= =
− 5 1  12 − 5 1  − 5 / 12 1 / 12
2 − (−10)      
7. Systems of linear equations (also known as linear systems)

A system of linear (algebraic) equations, Ax = b, could have zero,

exactly one, or infinitely many solutions. (Recall that each linear
equation has a line as its graph. A solution of a linear system is a
common intersection point of all the equations’ graphs − and there are
only 3 ways a set of lines could intersect.)

If the vector b on the right-hand side is the zero vector, then the
system is called homogeneous. A homogeneous linear system always
has a solution, namely the all-zero solution (that is, the origin). This
solution is called the trivial solution of the system. Therefore, a
homogeneous linear system Ax = 0 could have either exactly one
solution, or infinitely many solutions. There is no other possibility,
since it always has, at least, the trivial solution. If such a system has n
equations and exactly the same number of unknowns, then the number
of solution(s) the system has can be determined, without having to
solve the system, by the determinant of its coefficient matrix:

Theorem: If A is an n × n matrix, then the homogeneous linear

system Ax = 0 has exactly one solution (the trivial solution) if and
only if A is invertible (that is, it has a nonzero determinant). It
will have infinitely many solutions (the trivial solution, plus
infinitely many nonzero solutions) if A is not invertible
(equivalently, has zero determinant).
8. Eigenvalues and Eigenvectors

Given a square matrix A, suppose there are a constant r and a nonzero

vector x such that
Ax = r x,

then r is called an Eigenvalue of A, and x is an Eigenvector of A

corresponding to r.

Do eigenvalues/vectors always exist for any given square matrix?

The answer is yes. How do we find them, then?

Rewrite the above equation, we get Ax − r x = 0. The next step would

be to factor out x. But doing so would give the expression
(A − r ) x = 0.
Notice that it requires us to subtract a number from an n × n matrix.
That’s an undefined operation. Hence, we need to further refined it by
rewriting the term r x = r I x, and then factoring out x, obtaining

(A − r I) x = 0.

This is an n × n system of homogeneous linear (algebraic) equations,

where the coefficient matrix is (A − r I). We are looking for a nonzero
solution x of this system. Hence, by the theorem we have just seen,
the necessary and sufficient condition for the existence of such a
nonzero solution, which will become an eigenvector of A, is that the
coefficient matrix (A − r I) must have zero determinant. Set its
determinant to zero and what we get is a degree n polynomial
equation in terms of r. The case of a 2 × 2 matrix is as follow:

a b  1 0 a − r b 
A − rI = 
c d −r 0 1  =  c d − r  .
    
 Its determinant, set to 0, yields the equation

a − r b 
det   = (a − r )(d − r ) − bc = r 2 − (a + d )r + (ad − bc) = 0
 c d − r

It is a degree 2 polynomial equation of r, as you can see.

This polynomial on the left is called the characteristic polynomial of

the (original) matrix A, and the equation is the characteristic equation
of A. The root(s) of the characteristic polynomial are the eigenvalues
of A. Since any degree n polynomial always has n roots (real and/or
complex; not necessarily distinct), any n × n matrix always has at least
one, and up to n different eigenvalues.

Once we have found the eigenvalue(s) of the given matrix, we put

each specific eigenvalue back into the linear system (A − r I) x = 0 to
find the corresponding eigenvectors.
 2 3
Examples: A= 4 3
 

2 3 1 0   2 − r 3 
A − rI =   − r =
0 1   4
4 3    3 − r  .

Its characteristic equation is

2 − r 3 
det   = (2 − r )(3 − r ) − 12 = r 2 − 5r − 6 = (r + 1)(r − 6) = 0
 4 3 − r

The eigenvalues are, therefore, r = −1 and 6.

Next, we will substitute each of the 2 eigenvalues into the matrix

equation (A − r I) x = 0.

For r = −1, the system of linear equations is

2 + 1 3   3 3 0 
(A − r I) x = (A + I) x =  x = x =
 4 3 + 1  4 4
 
0  .
 

Notice that the matrix equation represents a degenerated system of 2

linear equations. Both equations are constant multiples of the
equation x1 + x2 = 0. There is now only 1 equation for the 2
unknowns, therefore, there are infinitely many possible solutions.
This is always the case when solving for eigenvectors. Necessarily,
there are infinitely many eigenvectors corresponding to each
eigenvalue.
 Solving the equation x1 + x2 = 0, we get the relation x2 = − x1. Hence,
the eigenvectors corresponding to r = −1 are all nonzero multiples of

1
k1 =   .
− 1

Similarly, for r = 6, the system of equations is

2 − 6 3  − 4 3  0 
(A − r I) x = (A − 6 I) x =  x = x =
 4 3 − 6  4 − 3
 
0  .
 

Both equations in this second linear system are equivalent to

4 x1 − 3 x2 = 0. Its solutions are given by the relation 4 x1 = 3 x2.
Hence, the eigenvectors corresponding to r = 6 are all nonzero
multiples of

 3
k2 =   .
4

Note: Every nonzero multiple of an eigenvector is also an eigenvector.

Two short-cuts to find eigenvalues:

1. If A is a diagonal or triangular matrix, that is, if it has the form

a 0  a b  a 0 
 0 d  , or  0 d  , or c d  .
     
Then the eigenvalues are just the main diagonal entries, r = a and d in all 3
examples above.

2. If A is any 2 × 2 matrix, then its characteristic equation is

a − r b 
det   = r 2 − (a + d )r + (ad − bc) = 0
 c d − r

If you are familiar with terminology of linear algebra, the characteristic

equation can be memorized rather easily as

r 2 − Trace(A) r + det(A) = 0.

Note: For any square matrix A, Trace(A) = [sum of all entries on the main
diagonal (running from top-left to bottom-right)]. For a 2 × 2 matrix A,
Trace(A) = a + d.
A short-cut to find eigenvectors (of a 2 × 2 matrix):

Similarly, there is a trick that enables us to find the eigenvectors of any 2 × 2

matrix without having to go through the whole process of solving systems of
linear equations. This short-cut is especially handy when the eigenvalues
are complex numbers, since it avoids the need to solve the linear equations
which will have complex number coefficients. (Warning: This method does
not work for any matrix of size larger than 2 × 2.)

We first find the eigenvalue(s) and then write down, for each eigenvalue, the
matrix (A − r I) as usual. Then we take any row of (A − r I) that is not
consisted of entirely zero entries, say it is the row vector (α , β). We put a
minus sign in front of one of the entries, for example, (α , −β). Then an
engenvector of the matrix A is found by switching the two entries in the
above vector, that is, k = (−β , α).

2 3
Example: Previously, we have seen A = 4 3 .
 
The characteristic equation is
r 2 − Trace(A) r + det(A) = r 2 − 5r − 6 = (r + 1)(r − 6) =0,

 3 3
which has roots r = −1 and 6. For r = −1, the matrix (A − r I) is  .
4 4

Take the first row, (3, 3), which is a non-zero vector; put a minus sign to the
first entry to get (−3, 3); then switch the entry, we now have k1 = (3, −3). It
is indeed an eigenvector, since it is a nonzero constant multiple of the vector
we found earlier.

On very rare occasions, both rows of the matrix (A − r I) have all zero
entries. If so, the above algorithm will not be able to find an eigenvector.
Instead, under this circumstance any non-zero vector will be an eigenvector.
Exercises:

− 5 − 1 2 0
Let C = 7 3  and D= − 2 − 1 .
  
1. Compute: (i) C + 2D and (ii) 3C – 5D.

2. Compute: (i) CD and (ii) DC.

3. Compute: (i) det(C), (ii) det(D), (iii) det(CD), (iv) det(DC).

4. Compute: (i) C −1, (ii) D −1, (iii) (CD) −1.

5. Find the eigenvalues and their corresponding eigenvectors of C and D.

Answers:
− 1 − 1 − 25 − 3
1. (i) 
1   31 14 
, (ii)
3  
− 8 1  − 10 − 2
2. (i)    3 − 1
, (ii)
 8 − 3 
3. (i) −8, (ii) −2, (iii) 16, (iv) 16
− 3 / 8 − 1 / 8 1 / 2 0  − 3 / 16 − 1 / 16
4. (i) 
5 / 8   − 1 − 1  − 1/ 2 − 1/ 2 
, (ii) , (iii)
 7/8    
 s  s 
5. (i) r1 = 2, k1 =   ; r2 = −4, k 2 =   ; s = any nonzero number
− 7 s  − s 
 s  0
(ii) r1 = 2, k1 =   ; r2 = −1, k 2 =   ; s = any nonzero number
− 2 s / 3 s
Solution of 2 × 2 systems of first order linear equations

Consider a system of 2 simultaneous first order linear equations

x1 ′ = a x1 + b x2
x2 ′ = c x1 + d x2

It has the alternate matrix-vector representation

a b 
x′ =  c d  x.
 
Or, in shorthand x′ = Ax, if A is already known from context.

We know that the above system is equivalent to a second order

homogeneous linear differential equation. As a result, we know that the
general solution contains two linearly independent parts. As well, the
solution will be consisted of some type of exponential functions. Therefore,
assume that x = k e rt is a solution of the system, where k is a vector of
coefficients (of x1 and x2). Substitute x and x′ = r k e rt into the equation
x′ = Ax, and we have

r k e rt = A k e rt.

Since e rt is never zero, we can always divide both sides by e rt and get

r k = A k.

We see that this new equation is exactly the relation that defines eigenvalues
and eigenvectors of the coefficient matrix A. In other words, in order for a
function x = k e rt to satisfy our system of differential equations, the number r
must be an eigenvalue of A, and the vector k must be an eigenvector of A
corresponding to r. Just like the solution of a second order homogeneous
linear equation, there are three possibilities, depending on the number of
distinct, and the type of, eigenvalues the coefficient matrix A has.
The possibilities are that A has

I. Two distinct real eigenvalues

II. Complex conjugate eigenvalues
III. A repeated eigenvalue

A related note, (from linear algebra,) we know that eigenvectors that each
corresponds to a different eigenvalue are always linearly independent from
each others. Consequently, if r1 and r2 are two different eigenvalues, then
their respective eigenvectors k1 anf k2, and therefore the corresponding
solutions, are always linearly independent.
Case I Distinct real eigenvalues

If the coefficient matrix A has two distinct real eigenvalues r1 and r2, and
their respective eigenvectors are k1 and k2. Then the 2 × 2 system x′ = Ax
has a general solution

x = C1 k1 e r1 t + C2 k2 e r2 t .

2 3
Example: x′ = 4 3 x.
 
We have already found that the coefficient matrix has eigenvalues
r = −1 and 6. And they each respectively has an eigenvector
1  3
k1 =   , k2 =   .
− 1 4
Therefore, a general solution of this system of differential equations is

 1  −t 3 6 t
x = C1   e + C2   e
− 1 4
 3 − 2 1
Example: x′ = 2 − 2 x, x(0) = −1
   

The characteristic equation is r 2 − r − 2 = (r + 1)(r − 2) = 0. The

eigenvalues are r = −1 and 2. They have, respectively, eigenvectors

For r = −1, the system is

3 + 1 − 2  4 − 2 0 
(A − r I) x = (A + I) x =  x = x =
 2 − 2 + 1 2 − 1 
 
0  .
 

Solving the bottom equation of the system: 2x1 − x2 = 0, we get the

relation x2 = 2 x1. Hence,

1 
k1 =   ,
2
For r = 2, the system is

3 − 2 −2  1 − 2  0 
(A − r I) x = (A − 2 I) x =  x = x =
 2 − 2 − 2  2 − 4
 
0  .
 

Solving the first equation of the system: x1 − 2x2 = 0, we get the

relation x1 = 2x2. Hence,

2
k2 =   .
1 
Therefore, a general solution is

1   2 2 t
x = C1   e −t + C2 1  e .
2  

Apply the initial values,

1  2 0 C1 + 2C2   1 

x(0) = C1   e 0 + C2 1  e = 2C + C  = − 1 .
 2    1 2  

That is
C1 + 2C2 = 1
2C1 + C2 = −1 .

We find C1 = −1 and C2 = 1, hence we have the particular solution

1  −t  2  2 t  − e − t + 2e 2 t 
x= −   e +   e =  −t 2t  .
 2 1   − 2e + e 
 Case II Complex conjugate eigenvalues

If the coefficient matrix A has two distinct complex conjugate eigenvalues

λ ± µi. Also suppose k = a + b i is an eigenvector (necessarily has complex-
valued entries) of the eigenvalue λ + µi. Then the 2 × 2 system x′ = Ax has a
real-valued general solution

x = C1 eλ t (a cos( µ t ) − b sin( µ t ) ) + C2 e λ t (a sin( µ t ) + b cos( µ t ) )

A little detail: Similar to what we have done before, first there was the
complex-valued general solution in the form
x = C1 k1 e( λ + µi ) t + C2 k2 e( λ − µi ) t .
We “filter out” the imaginary parts by carefully choosing two sets of
coefficients to obtain two corresponding real-valued solutions that are also
linearly independent:

u = eλ t (a cos( µ t ) − b sin( µ t ) )
v = eλ t (a sin( µ t ) + b cos( µ t ) )
The real-valued general solution above is just x = C1 u + C2 v. In particular,
it might be useful to know how u and v could be derived by expanding the
following complex-valued expression (the front half of the complex-valued
general solution):

k1 e( λ + µi ) t = (a + bi)eλt e( µt )i = eλt (a + bi)(cos(µ t ) + i sin( µ t ))

= eλt (a cos(µ t ) + ia sin( µ t ) + ib cos(µ t ) + i 2b sin( µ t ))
= eλt (a cos(µ t ) − b sin( µ t )) + i eλt (a sin( µ t ) + b cos(µ t ))

Then, u is just the real part of this complex-valued function, and v is its
imaginary part.
 2 − 5 
Example: x′ = 1 − 2  x
 

The characteristic equation is r 2 + 1 = 0, giving eigenvalues r = ± i.

That is, λ = 0 and µ =1.

Take the first (the one with positive imaginary part) eigenvalue r = i,
and find one of its eigenvectors:

2 − i −5  0 
(A − r I) x =  x =
 1 − 2 − i  0  .
 

Solving the first equation of the system: (2 − i) x1 − 5x2 = 0, we get

the relation (2 − i) x1 = 5x2. Hence,

 5  5   0 
k=   = 2 + − 1 i = a + bi
 2 − i     
a b

Therefore, a general solution is

 5 0   5  0 

x = C1 e0t    cos(t ) −   sin(t )  + C2 e0 t    sin(t ) +   cos(t ) 
  2 − 1   2 − 1 
 5 cos(t )   5 sin(t ) 
= C1   + C2  
 2 cos(t ) + sin(t )   2 sin(t ) − cos(t ) 
  − 1 − 6 0
Example: x′ = 3 5  x, x(0) =  2 .
  

The characteristic equation is r 2 − 4r + 13 = 0, giving eigenvalues

r = 2 ± 3i. Thus, λ = 2 and µ =3.

Take r = 2 + 3i and find one of its eigenvectors:

− 1 − ( 2 + 3i ) −6  − 3 − 3i − 6  0
(A − r I) x =   x =  3  = 0  .
 3 5 − ( 2 + 3i )   3 − 3i   

Solving the second equation of the system: 3x1 + (3 − 3i) x2 = 0, we

get the relation x1 = (−1 + i) x2. Hence,

− 1 + i  − 1 1
k=   =  1  +  0  i = a + bi
 1     

The general solution is

 − 1 1   − 1 1 
x = C1 e 2t    cos(3t ) −   sin(3t )  + C2 e 2 t    sin(3t ) +   cos(3t ) 
 1  0   1  0  
 − cos(3t ) − sin(3t )  2 t  cos(3t ) − sin(3t ) 
= C1 e 2t
 + C2 e  
 cos( 3t )   sin( 3 t ) 
Apply the initial values to find C1 and C2:

 − 1 1   − 1 1 
x(0) = C1 e 0    cos(0) −   sin(0)  + C2 e 0    sin(0) +   cos(0) 
 1  0    1  0  
− 1 1 − C + C2  0
= C1   + C2   =  1  = 
1 0  C1  2

Therefore, C1 = 2 and C2 = 2. Consequently, the particular solution is

 − cos(3t ) − sin(3t )   cos(3t ) − sin(3t ) 

x = 2e 2t   + 2e 2t  
 cos(3t )   sin(3t ) 
2t  − 4 sin(3t ) 
=e   
 2 cos(3t ) + 2 sin(3t ) 
Case III Repeated real eigenvalue

Suppose the coefficient matrix A has a repeated real eigenvalues r, there are
2 sub-cases.

(i) If r has two linearly independent eigenvectors k1 and k2. Then the 2 × 2
system x′ = Ax has a general solution

x = C1 k1 e rt + C2 k2 e rt.

Note: For 2 × 2 matrices, this possibility only occurs when the coefficient
matrix A is a scalar multiple of the identity matrix. That is, A has the form

1 0   k 0 
k
0 1  = 0 k  , for any constant k.
   

2 0 
Example: x′ = 0 2 x.
 

The eigenvalue is r = 2 (repeated). There are 2 sets of linearly

independent eigenvectors, which could be represented by any 2
nonzero vectors that are not constant multiples of each other. For
example
1  0 
k1 =   , k2 =   .
0  1 
Therefore, a general solution is

1  0  2 t
x = C1   e 2t + C2 1  e .
0   
(ii) If r, as it usually does, only has one linearly independent eigenvector k.
Then the 2 × 2 system x′ = Ax has a general solution

x = C1 k e rt + C2 (k t e rt + η e rt).

Where the second vector η is any solution of the nonhomogeneous linear

system of algebraic equations

(A − r I ) η = k .

1 − 4   − 2
Example: x′ = 4 − 7  x, x(0) =  1  .
   

The eigenvalue is r = −3 (repeated). The corresponding system is

1 + 3 −4  4 − 4 0 
(A − r I) x =  x = x =
 4 − 7 + 3 4 − 4
 
0  .
 

Both equations of the system are 4x1 − 4x2 = 0, we get the same
relation x1 = x2. Hence, there is only one linearly independent
eigenvector:

1
k= .
1
Next, solve for η:

4 − 4 1
4 − 4 η = 1 .
  

1 
 + η 2
It has solution in the form η =  4 .
η
 2 

1 / 4
Choose η2 = 0, we get η =  0  .
 

A general solution is, therefore,

1 − 3 t  1 −3t 1 4 − 3t 

x = C1   e + C2    t e +   e 
1  1 0 

Apply the initial values to find C1 = 1 and C2 = −12. The particular

solution is

1  1 1 4  − 12t − 2 − 3t

x =   e− 3 t − 12    t e −3t +   e − 3t  =   e
1  1 0   − 12t + 1
Summary: Solving a Homogeneous System of Two Linear
First Order Equations in Two Unknowns

Given:
x′ = Ax.

First find the two eigenvalues, r, and their respective corresponding

eigenvectors, k, of the coefficient matrix A. Depending on the eigenvalues
and eigenvectors, the general solution is:

I. Two distinct real eigenvalues r1 and r2:

x = C1 k1 e r1 t + C2 k2 e r2 t .

II. Two complex conjugate eigenvalues λ ± µi, where λ + µi has as an

eigenvector k = a + b i:

x = C1 eλ t (a cos( µ t ) − b sin( µ t ) ) + C2 e λ t (a sin( µ t ) + b cos( µ t ) )

III. A repeated real eigenvalue r:

(i) When two linearly independent eigenvectors exist –

x = C1 k1 e rt + C2 k2 e rt.
(ii) When only one linearly independent eigenvector exist –

x = C1 k e rt + C2 (k t e rt + η e rt).
Note: Solve the system (A − r I) η = k to find the vector η.
Exercises:

1 – 4 Find the general solution of each system below.

2 7  − 3 6
1. x′ =   x. 2. x′ =   x.
− 5 −10 − 3 3

8 − 4 − 3 2 
3. x′ =   x. 4. x′ =   x.
1 4  −1 − 5

5 – 9 Solve the following initial value problems.

−1 −1  − 4
5. x′ =   x, x(0) =  2 .
 1 −1  

− 4 0  5
6. x′ =   x, x(3) =   .
 0 − 4 −2

1 4 0 
x′ = 
3 
7. x, x(1) =   .
2 3

6 8 8
x′ =  x(0) =   .
6 
8. x,
2 0

 6 3 − 1
x′ =  x(20) =   .
1 
9. x,
− 2 − 1

10. For each of the initial value problems #5 through #9, how does the
solution behave as t → ∞?

11. Find the general solution of the system below, and determine the
possible values of α and β such that the initial value problem has a solution
that tends to the zero vector as t → ∞.
 − 5 − 1 α 
x′ =   x, x(0) =   .
 7 3  β 
Answers:

 7  −3 t  1  −5 t
1. x = C1   e + C 2   e
 − 5  − 1
cos( 3t ) + sin( 3t )   − cos( 3t ) + sin( 3t ) 
2. x = C1   + C 2  
 cos( 3t )   sin( 3t ) 
2 6 t  2 6t 1 6t 
3. x = C 1  e + C 
2  t e +  e 

1  1 0 
− 4 t  cos( t ) − sin( t )  − 4 t  cos( t ) + sin( t ) 
4. x = C 1 e  − cos( t )  + C 2 e  − sin( t ) 
   
−t  − 4 cos t − 2 sin t 
− +
 5e 4 t 12

5. x = e  2 cos t − 4 sin t  6. x =  − 4 t + 12 
   − 2e 
2e5t −5 − 2e −t +1   4e 2t + 4e10t 
7. x =  5t −5 −t +1  8. x =  10 t 
 2e + e  − 2e + 2e 
2t

 5e 3t −60 − 6e 4t −80 
9. x =  3t −60 
− 5e + 4e 4t −80 
0 
10. For #5 and #6, tlim x(t ) =   . For #7, #8, and #9, the limits do not exist,
→∞
0 
as x(t) moves infinitely far away from the origin.
 1  2t  1  −4t
11. x = C 1   e + C 2   e ; the particular solution will tend to
− 7   − 1
zero as t → ∞ provided that C1 = 0, which can be achieved whenever the
initial condition is such that α = −β (i.e., α + β = 0, including the case α = β =
0).