Iterative methods for overflow queuing models. II (Q1099600)

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 4041230
Language Label Description Also known as
default for all languages
No label defined
    English
    Iterative methods for overflow queuing models. II
    scientific article; zbMATH DE number 4041230

      Statements

      Iterative methods for overflow queuing models. II (English)
      0 references
      1988
      0 references
      Preconditioned conjugate gradient methods are employed to find the steady-state probability distribution of Markovian queueing 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.
      0 references
      domain decomposition
      0 references
      proconditioned conjugate gradient methods
      0 references
      singular preconditioners
      0 references
      numerical result
      0 references
      convergence
      0 references
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references
      0 references
      0 references