An invariant subspace approach in m/g/l and g/m/l type markov chains
From MaRDI portal
Publication:4354598
Recommendations
Cited in
(16)- A numerically efficient method for the \(MAP/D/1/K\) queue via rational approximations
- Infinite- and finite-buffer Markov fluid queues: a unified analysis
- A fast Newton-Shamanskii iteration for a matrix equation arising from M/G/1-type Markov chains
- Matrix-analytic solution of infinite, finite and level-dependent second-order fluid models
- Efficient computation of the extreme solutions of $X+A^*X^{-1}A=Q$ and $X-A^*X^{-1}A=Q$
- The morphing of fluid queues into Markov-modulated Brownian motion
- Computational procedures for a class of GI/D/\(k\) systems in discrete time
- A. B. Clarke's Tandem Queue Revisited—Sojourn Times
- A probabilistic algorithm for finding the rate matrix of a block-GI/M/1 Markov chain
- On the dual relationship between Markov chains of GI/M/1 and M/G/1 type
- Queue-length, waiting-time and service batch size analysis for the discrete-time \(GI/D-MSP^{\text{(a,b)}}/1/\infty\) queueing system
- Condition numbers and backward error of a matrix polynomial equation arising in stochastic models
- A fast Newton's iteration for M/G/1-type and GI/M/1-type Markov chains
- Relaxed functional iteration techniques for the numerical solution of \(M/G/1\) type Markov chains
- A probabilistic algorithm for determining the fundamental matrix of a block M/G/1 Markov chain
- Solving matrix polynomial equations arising in queueing problems
This page was built for publication: An invariant subspace approach in m/g/l and g/m/l type markov chains
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4354598)