[WPI] [cs2223] [cs2223 text] [News] [Notes] [Recurrence]
There are only a few types of recurrence relations which can be solved in closed form - which means any term in the sequence can be evaluated by plugging numbers into an equation instead of having to calculate the entire sequence. Classifying the recurrence relation helps to decide which, if any, techniques can be used to solve it.
Here is a generic recurrence relation, consisting of a sequence of terms An.
The right side f(n), is some function of n, the number of An in the sequence. In the standard form, the right side of a recurrence relation can contain any function of n, but must not contain any of the An.
There are four characteristics of the recurrence relation to note.
A recurrence relation is homogeneous if the right side is zero. The above recurrence relation is non-homogeneous, but this one is homogeneous.
A recurrence relation is linear if there are no products or powers of the sequence elements. The above recurrence relations are non-linear. These recurrence relations are linear.
These recurrence relations are non-linear.
The order of the recurrence relation is the number of steps along the sequence from the first to the last members in the relation.
The last recurrence relation does not have a constant order. That complicates the solution.
We make a distinction between recurrence relations in which the coefficients which multiply the sequential terms are constant, such as these
and those recurrence relations in which the coefficients are not constant - they vary with n, such as these.
There are two classes of recurrence relations which are always solvable so it is important to recognize them.
The solution techniques for these two classes of recurrence relation are discussed in detail in the Recurrence page. Other recurrence relations are generally harder to solve, although a few special cases have been solved.
|[cs2223 text] [News] [Notes] [Recurrence]|