A Simple and Efficient Algorithm to Compute Tail Probabilities from Transforms
From MaRDI portal
(Redirected from Publication:3802575)
Recommendations
- scientific article; zbMATH DE number 2063761
- Numerical Computation of the Moments of a Probability Distribution from its Transform
- Computation of tail probabilities via extrapolation methods and connection with rational and Padé approximants
- Approximation of Tail Probabilities Using theGn-Transform
- Efficient algorithms for tail probabilities of exchangeable lognormal sums
Cited in
(13)- A formula for tail probabilities of Cox distributions
- Numerical Computation of the Moments of a Probability Distribution from its Transform
- An Efficient Algorithm for the Computation of the UTD $T$ Transition Function
- Approximation of Tail Probabilities Using theGn-Transform
- Computation of tail probabilities via extrapolation methods and connection with rational and Padé approximants
- scientific article; zbMATH DE number 2063761 (Why is no real title available?)
- The Fourier-series method for inverting transforms of probability distributions
- Exact and approximate numerical solutions to steady-state single-server queues: \(M/G/1\) -- a unified approach
- A comparison of three random disciplines
- Performance analysis of an ISDN switch with distributed architecture: Circuit switched calls
- Stochastic models of space priority mechanisms with Markovian arrival processes
- Transient and busy period analysis of the GI/G/1 queue: The method of stages
- Queue length distributions from probability generating functions via discrete Fourier transforms
This page was built for publication: A Simple and Efficient Algorithm to Compute Tail Probabilities from Transforms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3802575)
