Electronic Resource
Springer
Numerische Mathematik
51 (1987), S. 143-180
ISSN:
0945-3245
Keywords:
AMS(MOS): 65N20
;
65F10
;
60K25
;
CR: G1.3
Source:
Springer Online Journal Archives 1860-2000
Topics:
Mathematics
Notes:
Summary Markovian queueing networks having overflow capacity are discussed. The Kolmogorov balance equations result in a linear homogeneous system, where the right null-vector is the steady-state probability distribution for the network. Preconditioned conjugate gradient methods are employed to find the null-vector. The preconditioner is a singular matrix which can be handled by separation of variables. The resulting preconditioned system is nonsingular. Numerical results show that the number of iterations required for convergence is roughly constant independent of the queue sizes. Analytic results are given to explain this fast convergence.
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1007/BF01396747
Permalink
|
Location |
Call Number |
Expected |
Availability |