Numerical algorithms for Panjer recursion by applying Bernstein approximation
The authors consider the compound risk model in actuarial science. They compute the distribution of the total loss \(S=\sum_{i=1}^NX_i\) using Panjer recursion when the number of claims \(N\) belongs to \((a,b,l)\) family i.e., for the probability function \(p^n\) of \(N\) \(\frac{p_k}{p_{k-1}}=a+\frac{b}{k}\), \(k=l+1,l+2,\dots\), holds for any \(l\geq 0\) and some constants \(a\), \(b\). For total claims with continuous distribution, the numerical calculation of \(S\) by applying Panjer recursion involves an approximation of the integration. In order to simplify the numerical algorithms, the authors apply Bernstein approximation for the continuous distribution function and obtain approximated recursive equations which are used for computing the approximated values of the compound distribution. A theoretical error bound for the approximation is also obtained.
- A generalization of Panjer's recursion and numerically stable risk aggregation
- Panjer recursion versus FFT for compound distributions
- scientific article; zbMATH DE number 849081
- Recursions for the individual risk model
- Computation of Compound Distributions II: Discretization Errors and Richardson Extrapolation
- Bivariate recursive equations on excess-of-loss reinsurance
- Computation of Compound Distributions II: Discretization Errors and Richardson Extrapolation
- Computing compound distributions faster!
- Finding efficient recursions for risk aggregation by computer algebra
- scientific article; zbMATH DE number 3988680 (Why is no real title available?)
- Numerical evaluation of the compound Poisson distribution: Recursion or Fast Fourier Transform?
- Recursive equations for compound distribution with the severity distribution of the mixed type
- Solving Ordinary Differential Equations I
- Speedy convolution algorithms and Panjer recursions for phase-type distributions
- THE BERNSTEIN COPULA AND ITS APPLICATIONS TO MODELING AND APPROXIMATIONS OF MULTIVARIATE DISTRIBUTIONS
This page was built for publication: Numerical algorithms for Panjer recursion by applying Bernstein approximation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q384623)