Numerical evaluation of the compound Poisson distribution: Recursion or Fast Fourier Transform? (Q3339141)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3872524
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Numerical evaluation of the compound Poisson distribution: Recursion or Fast Fourier Transform? |
scientific article; zbMATH DE number 3872524 |
Statements
Numerical evaluation of the compound Poisson distribution: Recursion or Fast Fourier Transform? (English)
0 references
1984
0 references
aggregate claim distribution
0 references
compound Poisson distribution
0 references
recursive method
0 references
fast Fourier transform
0 references
0.8727163076400757
0 references
0.8682407736778259
0 references
0.8174262046813965
0 references
0.8019568920135498
0 references
0.7975117564201355
0 references
In recent years two important methods for the numerical calculation of the aggregate claim distribution of a compound Poisson distribution have been developed: The recursive method of \textit{H. Panjer} [Recursive evaluation of a family of compound distributions. Astin Bull. 12, 22-26 (1981)] and the method using fast Fourier transform (FFT) of \textit{J. Bertram} [Bl., Dtsch. Ges. Versicherungsmath. 15, 175-194 (1981; Zbl 0472.62104)]. The author compares both methods by measuring the computational effort by the number of complex multiplications. If \(\{\) 1,2,...,\(s\}\) denotes the finite support of the (arithmetical) claim size distribution, then among others the author derives the very interesting result, that the FFT method is the better one (in the sense above) if \(s\geq 255\) whereas for \(s\leq 63\) the recursive formula should be preferred.
0 references