In this paper, we consider the numerical inversion of a variety of generating functions （GFs） that arise in the area of engineering and non-engineering fields. Three classes of GFs are taken into account in a compre...In this paper, we consider the numerical inversion of a variety of generating functions （GFs） that arise in the area of engineering and non-engineering fields. Three classes of GFs are taken into account in a comprehensive manner： classes of probability generating functions （PGFs） that are given in rational and non-rational forms, and a class of GFs that are not PGFs. Among others, those PGFs that are not explicitly given but contain a number of unknowns are largely considered as they are often encountered in many interesting applied problems. For the numerical inversion of GFs, we use the methods of the discrete （fast） Fourier transform and the Taylor series expansion. Through these methods, we show that it is remarkably easy to obtain the desired sequence to any given accuracy, so long as enough numerical precision is used in computations. Since high precision is readily available in current software packages and programming languages, one can now lift, with little effort, the so-called Laplacian curtain that veils the sequence of interest. To demonstrate, we take a series of representative examples： the PGF of the number of customers in the discrete-time Geo^X/Geo/c queue, the same in the continuous-time M^X/D/c queue, and the GFs arising in the discrete-time renewal process.展开更多
基金support provided by the Department of Mathematics and Computer Science, Royal Military College of Canada, Kingston where he held a Visiting Research Fellowship under NSERC Grant
文摘In this paper, we consider the numerical inversion of a variety of generating functions （GFs） that arise in the area of engineering and non-engineering fields. Three classes of GFs are taken into account in a comprehensive manner： classes of probability generating functions （PGFs） that are given in rational and non-rational forms, and a class of GFs that are not PGFs. Among others, those PGFs that are not explicitly given but contain a number of unknowns are largely considered as they are often encountered in many interesting applied problems. For the numerical inversion of GFs, we use the methods of the discrete （fast） Fourier transform and the Taylor series expansion. Through these methods, we show that it is remarkably easy to obtain the desired sequence to any given accuracy, so long as enough numerical precision is used in computations. Since high precision is readily available in current software packages and programming languages, one can now lift, with little effort, the so-called Laplacian curtain that veils the sequence of interest. To demonstrate, we take a series of representative examples： the PGF of the number of customers in the discrete-time Geo^X/Geo/c queue, the same in the continuous-time M^X/D/c queue, and the GFs arising in the discrete-time renewal process.
