We consider a class of Markov chains for which the stationary probability vector, when it exists, is of the matrix-geometric form. The essential step in the computational algorithm usually is the evaluation of a matrix
%0 Journal Article
%1 ranaswami86
%A Ramswami, V.
%A Latouche, G.
%D 1986
%I Springer-Verlag
%J Operations-Research-Spektrum
%K queueing.theory
%N 4
%P 209-218
%R 10.1007/BF01721131
%T A general class of Markov processes with explicit matrix-geometric solutions
%V 8
%X We consider a class of Markov chains for which the stationary probability vector, when it exists, is of the matrix-geometric form. The essential step in the computational algorithm usually is the evaluation of a matrix
@article{ranaswami86,
abstract = {We consider a class of Markov chains for which the stationary probability vector, when it exists, is of the matrix-geometric form. The essential step in the computational algorithm usually is the evaluation of a matrix},
added-at = {2014-08-01T22:21:25.000+0200},
author = {Ramswami, V. and Latouche, G.},
biburl = {https://www.bibsonomy.org/bibtex/2378cf512942c59194f30ea39d604565d/ytyoun},
doi = {10.1007/BF01721131},
interhash = {f1e072eb933a232832fcf4d0d078c70d},
intrahash = {378cf512942c59194f30ea39d604565d},
issn = {0171-6468},
journal = {Operations-Research-Spektrum},
keywords = {queueing.theory},
language = {English},
number = 4,
pages = {209-218},
publisher = {Springer-Verlag},
timestamp = {2014-08-01T22:21:25.000+0200},
title = {A general class of Markov processes with explicit matrix-geometric solutions},
volume = 8,
year = 1986
}