Numerical evaluation of the compound Poisson distribution: Recursion or Fast Fourier Transform?

From MaRDI portal
Publication:3339141

DOI10.1080/03461238.1984.10413759zbMath0547.62069OpenAlexW2039184792MaRDI QIDQ3339141

Hans Bühlmann

Publication date: 1984

Published in: Scandinavian Actuarial Journal (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/03461238.1984.10413759




Related Items

Proportional convergence and tail-cutting techniques in evaluating aggregate claim distributionsCompound model for two dependent kinds of claimFeller-Ross-Approximation für SummenverteilungenRecursions and fast Fourier transforms for a new bivariate aggregate claims modelComputing compound distributions faster!Numerical algorithms for Panjer recursion by applying Bernstein approximationThe total claims amount of largest claims reinsurance treaties revisitedForecasting aggregate claims using score‐driven time series modelsSome applications of the fast Fourier transform algorithm in insurance mathematics This paper is dedicated to Professor W. S. Jewell on the occasion of his 60th birthdayDetermination of the distribution of total loss from the fractional moments of its exponentialA new method for evaluating the distribution of aggregate claimsSpeedy convolution algorithms and Panjer recursions for phase-type distributionsSecuritization of motor insurance loss rate risksNegative claim amounts, Bessel functions, linear programming and Miller's algorithmImproved recursions for some compound Poisson distributionsOn maximum likelihood estimation for count data modelsCompound bivariate Lagrangian Poisson distributionsPanjer recursion versus FFT for compound distributionsThe discrete-time risk model with correlated classes of businessHow to (and how not to) compute stop-loss premiums in practice



Cites Work