Based on recurrence equation theory and relative error (rather than absolute error) analysis, the concept and criterion for the stability of a recurrence equation are clarified. A family of recursions, called congruent recursions, is proved to be strongly stable in evaluating its non-negative solutions. A type of strongly unstable recursion is identified. The recursive formula discussed by Panjer (1981) is proved to be strongly stable in evaluating the compound Poisson and the compound Negative Binomial (including Geometric) distributions. For the compound Binomial distribution, the recursion is shown to be unstable. A simple method to cope with this instability is proposed. Many other recursions are reviewed. Illustrative numerical examples are given.
