Abstract
Preconditioned conjugate gradient methods are employed to find the steady-state probability distribution of Markovian queuing networks that have overflow capacity. Different singular preconditioners that can be handled by separation of variables are discussed. The resulting preconditioned systems are nonsingular. Numerical results show that the number of iterations required for convergence grows very slowly with the queue sizes.
| Original language | English |
|---|---|
| Pages (from-to) | 57-78 |
| Journal | Numerische Mathematik |
| Volume | 54 |
| Issue number | 1 |
| DOIs | |
| Publication status | Published - Jan 1988 |
| Externally published | Yes |
Research Keywords
- AMS(MOS): 65N20, 65F10, 60K25
- CR: G1.Z
Fingerprint
Dive into the research topics of 'Iterative methods for overflow queuing models II'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver