Relaxed functional iteration techniques for the numerical solution of M/G/1 type Markov chains
- 1 September 1998
- journal article
- Published by Springer Nature in BIT Numerical Mathematics
- Vol. 38 (3) , 510-526
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- Performance evaluation of a worst case model of the MetaRing MAC protocol with global fairnessPerformance Evaluation, 1997
- An invariant subspace approach in m/g/l and g/m/l type markov chainsCommunications in Statistics. Stochastic Models, 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
- Solving certain queueing problems modelled by toeplitz matricesCalcolo, 1993
- A logarithmic reduction algorithm for quasi-birth-death processesJournal of Applied Probability, 1993
- Nonlinear Matrix Equations in Applied Probability—Solution Techniques and Open ProblemsSIAM Review, 1988
- A stable recursion for the steady state vector in markov chains of m/g/1 typeCommunications in Statistics. Stochastic Models, 1988
- Iteration methods for finding all zeros of a polynomial simultaneouslyMathematics of Computation, 1973