Go to CCP Homepage Go to Materials Page Go to Linear Algebra Materials Go to Table of Contents
Go Back One Page Go Forward One Page

Difference Equations

Part 4: The General Case

Given numbers a1, a2, ... , an, with an different from 0, and a sequence {zk}, the equation

yk+n + a1 yk+n-1 + .... + an-1 yk+1 + an yk = zk

is a linear difference equation of order n. If {zk} is the zero sequence {0, 0, ... }, then the equation is homogeneous. Otherwise, it is nonhomogeneous.

A linear difference equation of order n is also called a linear recurrence relation of order n, because it can be used to compute recursively each yk from the preceding y-values. More specifically, if y0, y1, ... , yn-1 are specified, then there is a unique sequence {yk} that satisfies the equation, for we can calculate, for k = 0, 1, 2, and so on,

yn = z0 - (a1 yn-1 + a2 yn-2 + ... + an-1 y1 + an y0),

yn+1 = z1 - (a1 yn + a2 yn-1 + ... + an-1 y2 + an y1),

yn+2 = z2 - (a1 yn+1 + a2 yn + ... + an-1 y3 + an y2),

and so on.

In Part 1 we introduced the name S for the set of all sequences. Suppose n numbers a1, a2, ... , an (again with an different from 0) are given, but we don't specify the sequence {zk}. Then the equation

yk+n + a1 yk+n-1 + .... + an-1 yk+1 + an yk = zk

describes a linear transformation T: S -> S with T({yk}) = {zk}. The null space (or kernel) N of T is the set of solutions of the homogeneous equation

yk+n + a1 yk+n-1 + .... + an-1 yk+1 + an yk = 0
.

  1. Explain why N is an n-dimensional vector space. [Hints: First say why N is a vector space. Then refer to the discussion above about initial values determining a unique solution. Think of

    (y0, y1, ... , yn-1)

    as an arbitrary element of Rn, and define a linear transformation U: Rn -> N by mapping a vector of initial values to the corresponding solution. Show that U is an isomorphism.]

Now suppose we do specify the sequence {zk}. Then solving the equation

yk+n + a1 yk+n-1 + .... + an-1 yk+1 + an yk = zk

is the same as solving T({yk}) = {zk} for {yk}. This is just like solving the matrix-vector equation Ax = b, where A and b are known. And we know that we can separate the solution process into two steps: First find the general solution x0 of the homogeneous equation Ax = 0. Then find one particular solution xp of Ax = b. The general solution of Ax = b is x0+xp.

  1. Show that an exponential sequence, yk = rk, is a solution of the homogeneous equation

    yk+n + a1 yk+n-1 + .... + an-1 yk+1 + an yk = 0

    if and only if

    rn + a1 rn-1 + ... + an-1 r + an = 0.

The polynomial equation is Step 2 is called the auxiliary equation or characteristic equation. Its solutions r1, r2, ..., are called characteristic roots of the difference equation.

We saw in Part 3 that two exponential sequences based on different characteristic roots are linearly independent. This is true for any number of exponential sequences with distinct bases, but the general argument is much harder. If the auxiliary equation has n distinct roots, then these exponential sequences provide a basis for the null space N of T. But there is no guarantee that there will be n distinct roots -- and even if there are, they may not all be real numbers. In this module we will consider only situations in which the characteristic roots are real and distinct.

  1. Suppose

    rn + a1 rn-1 + ... + an-1 r + an = 0

    is the characteristic equation of an n-th order linear difference equation. Explain why r = 0 cannot be one of the characteristic roots.

Now we consider the linear independence of exponential sequences {rk} belonging to distinct characteristic roots. Suppose r1, r2, ..., rn are distinct roots of the characteristic equation

rn + a1 rn-1 + ... + an-1 r + an = 0.

If the sequences {r1k}, {r2k}, ..., {rnk} are linearly dependent, then there exist scalars c1, c2, ..., cn, not all of which are 0, such that

c1 r1k + c2 r2k + ... + cn rnk = 0

for every k = 0, 1, 2, ... .

  1. Explain why the vector c = [c1,c2,...,cn]T would have to be a solution of the matrix equation Rc = 0, where R is the matrix

    vandermonde

    [Hint: Write out the equation preceding this step for the specific cases of k = 0, 1, 2, ..., n-1.] The matrix R is called a Vandermonde matrix of order n.

  2. Experiment in your worksheet with determinants of Vandermonde matrices of orders 3, 4, and 5. Explain why such a determinant can never be 0 if the numbers r1, r2, ..., rn are distinct. Then explain why the corresponding exponential sequences must be linearly independent.

In the next Part we will put this theory to work and solve a specific third-order linear difference equation.

Go to CCP Homepage Go to Materials Page Go to Linear Algebra Materials Go to Table of Contents
Go Back One Page Go Forward One Page


modules at math.duke.edu Copyright CCP and the author(s), 1999