Results 1 
8 of
8
The FourierSeries Method For Inverting Transforms Of Probability Distributions
, 1991
"... This paper reviews the Fourierseries 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 Fourierseries method are remar ..."
Abstract

Cited by 192 (52 self)
 Add to MetaCart
This paper reviews the Fourierseries 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 Fourierseries method are remarkably easy to use, requiring programs of less than fifty lines. The Fourierseries 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 Fourierseries 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...
On the Laguerre method for numerically inverting Laplace transforms
 INFORMS Journal on Computing
, 1996
"... The Laguerre method for numerically inverting Laplace transforms is an old established method based on the 1935 TricomiWidder theorem, which shows (under suitable regularity conditions) that the desired function can be represented as a weighted sum of Laguerre functions, where the weights are coeff ..."
Abstract

Cited by 36 (7 self)
 Add to MetaCart
(Show Context)
The Laguerre method for numerically inverting Laplace transforms is an old established method based on the 1935 TricomiWidder theorem, which shows (under suitable regularity conditions) that the desired function can be represented as a weighted sum of Laguerre functions, where the weights are coefficients of a generating function constructed from the Laplace transform using a bilinear transformation. We present a new variant of the Laguerre method based on: (1) using our previously developed variant of the Fourierseries method to calculate the coefficients of the Laguerre generating function, (2) developing systematic methods for scaling, and (3) using Wynn’s ɛalgorithm to accelerate convergence of the Laguerre series when the Laguerre coefficients do not converge to zero geometrically fast. These contributions significantly expand the class of transforms that can be effectively inverted by the Laguerre method. We provide insight into the slow convergence of the Laguerre coefficients as well as propose a remedy. Before acceleration, the rate of convergence can often be determined from the Laplace transform by applying Darboux’s theorem. Even when the Laguerre coefficients converge to zero geometrically fast, it can be difficult to calculate the desired functions for large arguments because of roundoff errors. We solve this problem by calculating very small Laguerre coefficients with low relative error through appropriate scaling. We also develop another acceleration technique for the case in which the Laguerre coefficients converge to zero geometrically fast. We illustrate the effectiveness of our algorithm through numerical examples. Subject classifications: Mathematics, functions: Laplace transforms. Probability, distributions: calculation by transform inversion. Queues, algorithms: Laplace transform inversion.
Probabilistic scaling for the numerical inversion of nonprobability transforms
 INFORMS J. Computing
, 1997
"... Abstract It is known that probability density functions and probability mass functions can usually be calculated quite easily by numerically inverting their transforms (Laplace transforms and generating functions, respectively) with the Fourierseries method, but other more general functions can be ..."
Abstract

Cited by 7 (5 self)
 Add to MetaCart
(Show Context)
Abstract It is known that probability density functions and probability mass functions can usually be calculated quite easily by numerically inverting their transforms (Laplace transforms and generating functions, respectively) with the Fourierseries method, but other more general functions can be substantially more difficult to invert, because the aliasing and roundoff errors tend to be more difficult to control. In this paper we propose a simple new scaling procedure for nonprobability functions that is based on transforming the given function into a probability density function or a probability mass function and transforming the point of inversion to the mean. This new scaling is even useful for probability functions, because it enables us to compute very small values at large arguments with controlled relative error. Subject classifications: Mathematics, functions: scaling for numerical transform inversion. Queues, algorithms: scaling for numerical transform inversion.
and
"... Abstract. An automatic algorithm evaluating numerically an abscissa of convergence of the inverse Laplace transform is introduced. ..."
Abstract
 Add to MetaCart
(Show Context)
Abstract. An automatic algorithm evaluating numerically an abscissa of convergence of the inverse Laplace transform is introduced.
Transient Analysis of Dependability/Performability Models by Regenerative Randomization with Laplace Transform Inversion?
"... Abstract. In this paper we develop a variant of a previously proposed method (the regenerative randomization method) for the transient analysis of dependability/performability models. The variant is obtained by developing a closedform expression for the solution of the truncated transformed model o ..."
Abstract
 Add to MetaCart
(Show Context)
Abstract. In this paper we develop a variant of a previously proposed method (the regenerative randomization method) for the transient analysis of dependability/performability models. The variant is obtained by developing a closedform expression for the solution of the truncated transformed model obtained in regenerative randomization and using a Laplace transform inversion algorithm. Using models of moderate size of a 5level RAID architecture we compare the new variant with the original randomization method, with randomization with steadystate detection for irreducible models, and with the standard randomization method for transient models (models with absorbing states). The new variant seems to be competitive for models of moderate size. 1
Transient Analysis of Rewarded Continuous Time Markov Models by Regenerative Randomization with Laplace Transform Inversion
, 2003
"... this paper we develop a variant, regenerative randomization with Laplace transform inversion, of a previously proposed method (the regenerative randomization method) for the transient analysis of rewarded continuous time Markov models. Those models find applications in dependability and performab ..."
Abstract
 Add to MetaCart
(Show Context)
this paper we develop a variant, regenerative randomization with Laplace transform inversion, of a previously proposed method (the regenerative randomization method) for the transient analysis of rewarded continuous time Markov models. Those models find applications in dependability and performability analysis of computer and telecommunication systems. The variant differs from regenerative randomization in that the truncated transformed model obtained in that method is solved using a Laplace transform inversion algorithm instead of standard randomization