Journal Article10.1287/IJOC.7.1.36
Numerical Inversion of Laplace Transforms of Probability Distributions
Joseph Abate,Ward Whitt +1 more
794
TL;DR: A simple algorithm for numerically inverting Laplace transforms is presented, designed especially for probability cumulative distribution functions, but it applies to other functions as well.
read more
Abstract: We present a simple algorithm for numerically inverting Laplace transforms. The algorithm is designed especially for probability cumulative distribution functions, but it applies to other functions as well. Since it does not seem possible to provide effective methods with simple general error bounds, we simultaneously use two different methods to confirm the accuracy. Both methods are variants of the Fourier-series method. The first, building on Dubner and Abate (Dubner, H., J. Abate. 1968. Numerical inversion of Laplace transforms by relating them to the finite Fourier cosine transform. JACM 15 115–123.) and Simon, Stroot, and Weiss (Simon, R. M., M. T. Stroot, G. H. Weiss. 1972. Numerical inversion of Laplace transforms with application to percentage labeled experiments. Comput. Biomed. Res. 6 596–607.), uses the Bromwich integral, the Poisson summation formula and Euler summation; the second, building on Jagerman (Jagerman, D. L. 1978. An inversion technique for the Laplace transform with applications....
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Sojourn Times in the M/PH/1 Processor Sharing Queue
TL;DR: An algorithm to compute the sojourn time distribution in the processor sharing, single server queue with Poisson arrivals and phase type distributed service times and the validity of the reduced service rate (RSR) approximation is used.
Waiting time and other first-passage time measures in an (s,S) inventory system with repeated attempts and finite retrial group
TL;DR: A continuous review inventory system in which unsatisfied demands are sent to a pool and are repeated until being satisfied, and performance measures related to the waiting time and first-passage times of the system are studied.
17
On classes of Bitcoin-inspired infinite-server queueing systems
TL;DR: It is shown that a time-dependent version of the distributional Little’s law can be used to study the time- dependent behavior of this model, as well as a related model where blocks are communicated to a user at a rate that is allowed to vary with time.
17
An exact subexponential-time lattice algorithm for Asian options
Tian-Shyr Dai,Yuh-Dauh Lyuu +1 more
TL;DR: This paper proposes a novel lattice structure for pricing Asian options, and proposes the first exact, convergent lattice algorithm to break the long-standing exponential-time barrier.
17
On the infimum attained by a reflected L\'evy process
TL;DR: In this article, the authors considered a Levy-driven queue and derived the distribution of the minimal value attained in an interval of length $t$ (where it is assumed that the queue is in stationarity at the beginning of the interval).
17