About cookies on this site Our websites require some cookies to function properly (required). In addition, other cookies may be used with your consent to analyze site usage, improve the user experience and for advertising. For more information, please review your options. By visiting our website, you agree to our processing of information as described in IBM’sprivacy statement. To provide a smooth navigation, your cookie preferences will be shared across the IBM web domains listed here.
Paper
Solutions of the basic matrix equation for m/g/1 and g/m/1 type markov chains
Abstract
Let [formula ommitted] be a sequence of nonnegative matrices such that [formula ommitted] is a substochastic matrix. The unique minimal nonnegative solution of the matrix equation [formula ommitted] has been shown by M. F. Neuts to play a key role in the analysis of M/G/1 type Markov chains. In this paper, all of the power-bounded, matrix solutions of this equation are classified. Among these solutions, the subsets of nonnegative, substochastic and stochastic solutions are identified. In particular, the exact conditions under which the equation has infinitely many power-bounded solutions (infinitely many stochastic solutions) are given. Similar results are obtained for the solutions of the matrix equation [formula ommitted], which appears in the analysis of G/M/1 type Markov chains. © 1994, Taylor & Francis Group, LLC. All rights reserved.