%0 Journal Article %1 abate1992fourierseries %A Abate, Joseph %A Whitt, Ward %D 1992 %J Queueing Systems %K Fourier_transform Laplace_inversion fast_fourier_transform laplace_transform numerical_methods %N 1 %P 5--87 %R 10.1007/BF01158520 %T The Fourier-series method for inverting transforms of probability distributions %U https://doi.org/10.1007/BF01158520 %V 10 %X This paper reviews the Fourier-series method for calculating cumulative distribution functions (cdf's) and probability mass functions (pmf's) by numerically inverting characteristic functions, Laplace transforms and generating functions. Some variants of the Fourier-series method are remarkably easy to use, requiring programs of less than fifty lines. The Fourier-series method can be interpreted as numerically integrating a standard inversion integral by means of the trapezoidal rule. The same formula is obtained by using the Fourier series of an associated periodic function constructed by aliasing; this explains the name of the method. This Fourier analysis applies to the inversion problem because the Fourier coefficients are just values of the transform. The mathematical centerpiece of the Fourier-series method is the Poisson summation formula, which identifies the discretization error associated with the trapezoidal rule and thus helps bound it. The greatest difficulty is approximately calculating the infinite series obtained from the inversion integral. Within this framework, lattice cdf's can be calculated from generating functions by finite sums without truncation. For other cdf's, an appropriate truncation of the infinite series can be determined from the transform based on estimates or bounds. For Laplace transforms, the numerical integration can be made to produce a nearly alternating series, so that the convergence can be accelerated by techniques such as Euler summation. Alternatively, the cdf can be perturbed slightly by convolution smoothing or windowing to produce a truncation error bound independent of the original cdf. Although error bounds can be determined, an effective approach is to use two different methods without elaborate error analysis. For this purpose, we also describe two methods for inverting Laplace transforms based on the Post-Widder inversion formula. The overall procedure is illustrated by several queueing examples.

@article{abate1992fourierseries, abstract = {This paper reviews the Fourier-series method for calculating cumulative distribution functions (cdf's) and probability mass functions (pmf's) by numerically inverting characteristic functions, Laplace transforms and generating functions. Some variants of the Fourier-series method are remarkably easy to use, requiring programs of less than fifty lines. The Fourier-series method can be interpreted as numerically integrating a standard inversion integral by means of the trapezoidal rule. The same formula is obtained by using the Fourier series of an associated periodic function constructed by aliasing; this explains the name of the method. This Fourier analysis applies to the inversion problem because the Fourier coefficients are just values of the transform. The mathematical centerpiece of the Fourier-series method is the Poisson summation formula, which identifies the discretization error associated with the trapezoidal rule and thus helps bound it. The greatest difficulty is approximately calculating the infinite series obtained from the inversion integral. Within this framework, lattice cdf's can be calculated from generating functions by finite sums without truncation. For other cdf's, an appropriate truncation of the infinite series can be determined from the transform based on estimates or bounds. For Laplace transforms, the numerical integration can be made to produce a nearly alternating series, so that the convergence can be accelerated by techniques such as Euler summation. Alternatively, the cdf can be perturbed slightly by convolution smoothing or windowing to produce a truncation error bound independent of the original cdf. Although error bounds can be determined, an effective approach is to use two different methods without elaborate error analysis. For this purpose, we also describe two methods for inverting Laplace transforms based on the Post-Widder inversion formula. The overall procedure is illustrated by several queueing examples.}, added-at = {2018-02-01T07:10:37.000+0100}, author = {Abate, Joseph and Whitt, Ward}, biburl = {https://www.bibsonomy.org/bibtex/211461f0a26f90d30312118118bc941ab/peter.ralph}, day = 01, doi = {10.1007/BF01158520}, interhash = {6a2922c32af58ee253e6b5a6403cac39}, intrahash = {11461f0a26f90d30312118118bc941ab}, issn = {1572-9443}, journal = {Queueing Systems}, keywords = {Fourier_transform Laplace_inversion fast_fourier_transform laplace_transform numerical_methods}, month = jan, number = 1, pages = {5--87}, timestamp = {2024-04-23T18:06:25.000+0200}, title = {The {Fourier}-series method for inverting transforms of probability distributions}, url = {https://doi.org/10.1007/BF01158520}, volume = 10, year = 1992 }