The conjugate gradient method for queueing networks (Q1899336)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 803670
Language Label Description Also known as
default for all languages
No label defined
    English
    The conjugate gradient method for queueing networks
    scientific article; zbMATH DE number 803670

      Statements

      The conjugate gradient method for queueing networks (English)
      0 references
      9 October 1995
      0 references
      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.
      0 references
      numerical example
      0 references
      conjugate gradient method
      0 references
      stationary distribution
      0 references
      non-Jackson queueing networks
      0 references
      convergence
      0 references
      0 references

      Identifiers