Hostname: page-component-cd9895bd7-gbm5v Total loading time: 0 Render date: 2024-12-26T09:46:48.282Z Has data issue: false hasContentIssue false
  • English
  • Français

On the Stability of Recursive Formulas

Published online by Cambridge University Press:  29 August 2014

Harry H. Panjer  and
Shaun Wang
Harry H. Panjer*
Affiliation:
University of Waterloo, Ontario, Canada
Shaun Wang*
Affiliation:
University of Waterloo, Ontario, Canada
*
Faculty of Mathematics, Institute of Insurance & Pension Research, University of Waterloo, Waterloo Ontario, N2L 3G1, Canada.
Faculty of Mathematics, Institute of Insurance & Pension Research, University of Waterloo, Waterloo Ontario, N2L 3G1, Canada.
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

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

Recursive formulacompound distributionprobability of ruindominant solutionsubordinate solutioncongruent recursionindex of error propagationstablestrongly stablestrongly unstablerelative error analysisempirical inflation factor
Type
Articles
Information
ASTIN Bulletin: The Journal of the IAA , Volume 23 , Issue 2 , November 1993 , pp. 227 - 258
Copyright
Copyright © International Actuarial Association 1993

References

REFERENCES

[1] Burden, R. and Faires, J. (1989) Numerical Analysis. Prindle, Weber and Schmidt, Boston, 4th ed.Google Scholar
[2] Cash, J.R. (1979) Stable Recursions: with applications to the numerical solution of stiff systems. Academic Press, London.Google Scholar
[3] Chan, B. (1984) Recursive formulas for compound difference distributions. Trans.Society of Actuaries 36, 171–180.Google Scholar
[4] Dahlquist, G. and Bjorck, A. (1974) Numerical Methods. Prentice-Hall, Inc., Englewood Cliffs, New Jersey. Translated by Anderson, N..Google Scholar
[5] Dickson, D. C. M. and Waters, H. R. (1991). Recursive calculation of survival probabilities. ASTIN Bulletin 21, 199–221.CrossRefGoogle Scholar
[6] Char, B. W.et al. (1991) Maple V: Language Reference Manual. Springer-Verlag, New York.CrossRefGoogle Scholar
[7] Flath, D. E. (1989) Introduction to Number Theory. John Wiley & Sons, Inc., New York.Google Scholar
[8] Gerber, H. U. (1982) On the numerical evaluation of the distribution of aggregate claims and its stop-loss premiums. Insurance: Mathematics and Economics 1, 13–18.Google Scholar
[9] Goovaerts, M. J. and De Vylder, F. (1983) A stable recursive algorithm for evaluation of ultimate ruin probabilities. ASTIN Bulletin 14, 53–59.CrossRefGoogle Scholar
[10] Islam, M. N. and Consul, P. C. (1992) A probability model for automobile claims. Journal of the Swiss Association of Actuaries Heft 1, 83–93.Google Scholar
[11] Oliver, J. (1967) Relative error propagation in the recursive solution of linear recurrence relations. Numerische Mathematik 9, 323–340.CrossRefGoogle Scholar
[12] Panjer, H. H. (1981) Recursive evaluation of a family of compound distributions. ASTIN Bulletin 12, 22–26.CrossRefGoogle Scholar
[13] Panjer, H. H. (1986) Direct calculation of ruin probabilities. The Journal of Risk and Insurance 53, 521–529.CrossRefGoogle Scholar
[14] Panjer, H. H. and Lutek, B. W. (1983) Practical aspects of stop-loss calculations. Insurance: Mathematics and Economics 2, 159–177.Google Scholar
[15] Panjer, H. H. and Willmot, G. E. (1984) Computational techniques in reinsurance models. Transactions of the 22nd International Congress of Actuaries Sydney 4, 111–120.Google Scholar
[16] Press, W. H., Flannery, B. P., Teukolsky, S. A. and Vetterling, W. T. (1988) Numerical Recipes in C. Cambridge University Press, London. The art of scientific computing.Google Scholar
[17] De Pril, N. (1986) Improved recursions for some compound Poisson distributions. Insurance: Mathematics and Economics 5,. 129–132.Google Scholar
[18] Ramsay, C. (1992) Improving Goovaert's and De Vylder's stable recursive algorihm. ASTIN Bulletin 22, 51–59.CrossRefGoogle Scholar
[19] Shiu, E. S. (1984) Discussion on Chan's paper — recursive formulas for compound difference distributions. Trans. Society of Actuaries 36, 181.Google Scholar
[20] Sundt, B. and Jewell, W. S. (1981) Further results on recursive evaluation of compound distributions. ASTIN Bulletin 12, 27–39.CrossRefGoogle Scholar
[21] Willmot, G. E. (1988) Sundt and Jewell's family of discrete distributions. ASTIN Bulletin 18, 17–29.CrossRefGoogle Scholar
[22] Willmot, G. E. and Panjer, H. H. (1987) Difference equation approaches in evaluation of compound distibutions. Insurance: Mathematics and Economics 6, 43–56.Google Scholar
[23] Wimp, J. (1984) Computation With Recurrence Relations. Pitman Advanced Publishing Program, London. Applicable Mathematics Series.Google Scholar