On the Stability of Recursive Formulas
Authors:
Open Access
- 1 November 1993
- journal article
- Published by Cambridge University Press (CUP) in ASTIN Bulletin
- Vol. 23 (2) , 227-258
Abstract
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.Keywords
This publication has 14 references indexed in Scilit:
- Improving Goovaerts' and De Vylder's Stable Recursive AlgorithmASTIN Bulletin, 1992
- Recursive Calculation of Survival ProbabilitiesASTIN Bulletin, 1991
- Maple V Language Reference Manual1991
- Sundt and Jewell's Family of Discrete DistributionsASTIN Bulletin, 1988
- Direct Calculation of Ruin ProbabilitiesJournal of Risk and Insurance, 1986
- Computation with Recurrence Relations.Mathematics of Computation, 1986
- Practical aspects of stop-loss calculationsInsurance: Mathematics and Economics, 1983
- On the numerical evaluation of the distribution of aggregate claims and its stop-loss premiumsInsurance: Mathematics and Economics, 1982
- Recursive Evaluation of a Family of Compound DistributionsASTIN Bulletin, 1981
- Relative error propagation in the recursive solution of linear recurrence relationsNumerische Mathematik, 1967