Matrix geometric method

From testwiki
Jump to navigation Jump to search

Template:Short description In probability theory, the matrix geometric method is a method for the analysis of quasi-birth–death processes, continuous-time Markov chain whose transition rate matrices with a repetitive block structure.[1] The method was developed "largely by Marcel F. Neuts and his students starting around 1975."[2]

Method description

The method requires a transition rate matrix with tridiagonal block structure as follows

Q=(B00B01B10A1A2A0A1A2A0A1A2A0A1A2)

where each of B00, B01, B10, A0, A1 and A2 are matrices. To compute the stationary distribution π writing π Q = 0 the balance equations are considered for sub-vectors πi

π0B00+π1B10=0π0B01+π1A1+π2A0=0π1A2+π2A1+π3A0=0πi1A2+πiA1+πi+1A0=0

Observe that the relationship

πi=π1Ri1

holds where R is the Neut's rate matrix,[3] which can be computed numerically. Using this we write

(π0π1)(B00B01B10A1+RA0)=(00)

which can be solve to find π0 and π1 and therefore iteratively all the πi.

Computation of R

The matrix R can be computed using cyclic reduction[4] or logarithmic reduction.[5][6]

Matrix analytic method

Template:Main The matrix analytic method is a more complicated version of the matrix geometric solution method used to analyse models with block M/G/1 matrices.[7] Such models are harder because no relationship like πi = π1 Ri – 1 used above holds.[8]

References

Template:Reflist

Template:Queueing theory


Template:Probability-stub