1992
DOI: 10.1007/bf01158520
|View full text |Cite
|
Sign up to set email alerts
|

The Fourier-series method for inverting transforms of probability distributions

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

4
522
0

Year Published

1998
1998
2008
2008

Publication Types

Select...
3
3
2

Relationship

0
8

Authors

Journals

citations
Cited by 607 publications
(526 citation statements)
references
References 86 publications
4
522
0
Order By: Relevance
“…For this purpose, we applied the two-dimensional transform inversion algorithms in Choudhury, Lucantoni and Whitt [12]. These algorithms are based on the Fourier-series method [13], and are enhancements and generalizations of the Euler and LatticePoisson algorithms described there. We note that the same multidimensional transform inversion algorithms can be used to obtain numerical results from the expressions in this paper.…”
Section: Introductionmentioning
confidence: 99%
“…For this purpose, we applied the two-dimensional transform inversion algorithms in Choudhury, Lucantoni and Whitt [12]. These algorithms are based on the Fourier-series method [13], and are enhancements and generalizations of the Euler and LatticePoisson algorithms described there. We note that the same multidimensional transform inversion algorithms can be used to obtain numerical results from the expressions in this paper.…”
Section: Introductionmentioning
confidence: 99%
“…We recommend first computing the asymptotic parameters as discussed above to be used as a stopping criteria for an inversion algorithm such as the one presented in Abate and Whitt [68] for the inversion; see [8], [11], [12], [81] and [88] for applications and discussions of this.…”
Section: Numerical Transform Inversionmentioning
confidence: 99%
“…The waiting time distributions given by the transforms (14)- (16) can be computed by numerically solving the associated Volterra integral equations (see, e.g., Neuts [93] [2]) or by numerically inverting the transforms directly (see e.g., Abate and Whitt [68] and Choudhury, Lucantoni and Whitt [81]). …”
Section: Computing Waiting Time Distributionsmentioning
confidence: 99%
See 1 more Smart Citation
“…As W * (θ) is unlikely to have an analytical inversion, we invert it numerically using the Euler method [11] to obtain the response time pdf f W (t). The cumulative distribution function W (t) is also easily obtained by inverting W * (θ)/θ.…”
Section: Data Transfer Timementioning
confidence: 99%