[WPI] [cs2223] [cs2223 text] [News] [Notes] 

cs2223, D97/98 Recurrence Relation Notes

Notes on how to solve Recurrence Relations

• Classifying Recurrence Relations. A generic classification. Only two types are easy to solve:
• Method of Undetermined Coefficients A powerful and general technique for solving a large class of linear recurrence relations with constant coefficients. This method differs somewhat from the one presented in Chapter 4 of the text. They are equivalent so you don't have to learn both - pick the one you find easiest to use.
• Method of Summing Factors A technique which almost always works with linear first-order recurrence relations.

Examples of how to write and solve Recurrence Relations

• Word Problems The problems are stated using words and figures
• Algorithms The problems are stated using algorithms written in C

[cs2223 text] [News] [Notes]

Contents ©1994-1998, Norman Wittels
Updated 07Apr98
Updated 19Mar98