There are several numerical techniques to compute the steady-state probabilities for the non-Jackson queueing networks. These methods do not always converge when the coefficient matrix is a nonsingular irreducible M-matrix. In this paper we use the conjugate gradient method to compute the steady-state probabilities for the non-Jackson queueing networks. The power of the conjugate gradient is exploited by a given example of such networks. © 1995.
CITATION STYLE
Moustafa, M. S. (1995). The conjugate gradient method for queueing networks. Applied Mathematics and Computation, 71(2–3), 289–294. https://doi.org/10.1016/0096-3003(94)00159-2
Mendeley helps you to discover research relevant for your work.