The conjugate gradient method for queueing networks
The author advocates using the conjugate gradient method to compute the stationary distribution for non-Jackson queueing networks. The corresponding networks are characterised by \(n \times n\) matrices taken from the class \(\mathbf Q\) of matrices \({\mathbf A} = (a_{ij})\) such that \(a_{ij} \leq 0\), \(i \neq j\), and \(\sum a_{ij} = 0,1 \leq j \leq n\), with stationary distribution satisfying \({\mathbf A}{\mathbf p} = 0\). The author argues that the numerical results guarantee the convergence of the algorithm and demonstrates its power by an example.
- Conjugate gradient method approach to queue theory
- The conjugate gradient method for computing all the extremal stationary probability vectors of a stochastic matrix
- Iterative methods for overflow queuing models. II
- Iterative methods for overflow queueing models. I
- scientific article; zbMATH DE number 956800
This page was built for publication: The conjugate gradient method for queueing networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1899336)