Note on functional iteration technique for \(M/G/1\) type Markov chains (Q846335)
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 5667906
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Note on functional iteration technique for \(M/G/1\) type Markov chains |
scientific article; zbMATH DE number 5667906 |
Statements
Note on functional iteration technique for \(M/G/1\) type Markov chains (English)
0 references
9 February 2010
0 references
The mean convergence rate of the iterative approximation of the nonnegative solution \(G\) of the following matrix equation \( X= \sum^{\infty}_{i=0}X^iA_i \), which comes from the M/G/1 queuing system and studied completely by \textit{B. Meini} [Numer. Math. 78, No.~1, 39--58 (1997; Zbl 0889.65145)], is shown related to the second eigenvalue of \(G\) .
0 references
stochastic matrices
0 references
minimal nonnegative solution
0 references
Markov chains
0 references
iterative methods
0 references
mean asymptotic convergence rate
0 references
matrix equation
0 references
0 references
0.8799682259559631
0 references
0.8799682259559631
0 references
0.8419463038444519
0 references
0.8419463038444519
0 references
0.8361595273017883
0 references
