Numerical inversion of probability generating functions

https://doi.org/10.1016/0167-6377(92)90050-DGet rights and content

Abstract

Random quantities of interest in operations research models can often be determined conveniently in the form of transforms. Hence, numerical transform inversion can be an effective way to obtain desired numerical values of cumulative distribution functions, probability density functions and probability mass functions. However, numerical transform inversion has not been widely used. This lack of use seems to be due, at least in part, to good simple numerical inversion algorithms not being well known. To help remedy this situation, in this paper we present a version of the Fourier-series method for numerically inverting probability generating functions. We obtain a simple algorithm with a convenient error bound from the discrete Poision summation formula. The same general approach applies to other transforms.

Reference (14)

  • DaigleJ.N.

    Queue length distributions from probability generating functions via discrete Fourier transforms

    Oper. Res. Lett.

    (1989)
  • AbateJ. et al.

    The Fourier-series method for inverting transforms of probability distributions

    Queueing Systems

    (1992)
  • BenderE.A.

    Asymptotic methods in enumeration

    SIAM Rev.

    (1974)
  • CaversJ.K.

    On the fast Fourier transform inversion of probability generating functions

    J. Inst. Math. Appl.

    (1978)
  • FellerW.
  • HosonoT.

    Numerical algorithms for Taylor series expansion

    Electron. Commun. Japan

    (1986)
  • JagermanD.L.

    An inversion technique for the Laplace transform

    Bell System Tech. J.

    (1982)
There are more references available in the full text version of this article.

Cited by (185)

View all citing articles on Scopus
View full text