Numerical approximation of probability mass functions via the inverse discrete Fourier transform
From MaRDI portal
Publication:2513667
DOI10.1007/s11009-013-9366-3zbMath1323.65005arXiv1212.6546OpenAlexW2949514193MaRDI QIDQ2513667
Publication date: 28 January 2015
Published in: Methodology and Computing in Applied Probability (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1212.6546
fast Fourier transformcharacteristic functiondiscrete Fourier transformsemi-Markov processfirst passage distribution
Stationary stochastic processes (60G10) Markov renewal processes, semi-Markov processes (60K15) Numerical methods for discrete and fast Fourier transforms (65T50)
Related Items
Likelihood computation in the normal-gamma stochastic frontier model, Error bounds for cumulative distribution functions of convolutions via the discrete Fourier transform, Using semi-Markov chains to solve semi-Markov processes
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Application of high order numerical quadratures to numerical inversion of the Laplace transform
- The first-passage times of phase semi-Markov processes
- Semi-Markov chains and hidden semi-Markov models toward applications. Their use in reliability and DNA analysis.
- The Fourier-series method for inverting transforms of probability distributions
- Multi-precision Laplace transform inversion
- First-passage-time moments of Markov processes
- Error Bounds for Numerical Inversion of a Probability Characteristic Function
- Flowgraph Models for Multistate Time‐to‐Event Data
- Markov Renewal Processes with Finitely Many States