Solving m/g/l type markov chains: recent advances and applications
- 1 January 1998
- journal article
- research article
- Published by Taylor & Francis in Communications in Statistics. Stochastic Models
- Vol. 14 (1-2) , 479-496
- https://doi.org/10.1080/15326349808807483
Abstract
A survey on numerical methods, based on Toeplitz matrix computation, for the solution of M/G/l type Markov chains is presented together with some new advances. We show how the block Toeplitz structure, shared by the transition matrices associated with M/G/l type Markov chains, can be exploited as the basis for devising fast and numerically stable algorithms, for the computation of the probability invariant vector and for the solution of the nonlinear matrix equation .Keywords
This publication has 15 references indexed in Scilit:
- Performance evaluation of a worst case model of the MetaRing MAC protocol with global fairnessPerformance Evaluation, 1997
- Improved cyclic reduction for solving queueing problemsNumerical Algorithms, 1997
- On the Solution of a Nonlinear Matrix Equation Arising in Queueing ProblemsSIAM Journal on Matrix Analysis and Applications, 1996
- Newton's iteration for non-linear equations in Markov chainsIMA Journal of Numerical Analysis, 1994
- Solutions of the basic matrix equation for M/G/l AND G/M/1 type markov chainsCommunications in Statistics. Stochastic Models, 1994
- A logarithmic reduction algorithm for quasi-birth-death processesJournal of Applied Probability, 1993
- Improved parallel computations with Toeplitz-like and Hankel-like matricesLinear Algebra and its Applications, 1993
- On the Stability of Transform-Based Circular DeconvolutionSIAM Journal on Numerical Analysis, 1992
- Inverses of Toeplitz Operators, Innovations, and Orthogonal PolynomialsSIAM Review, 1978
- On Direct Methods for Solving Poisson’s EquationsSIAM Journal on Numerical Analysis, 1970