Triangular M/G/1-Type and Tree-Like Quasi-Birth-Death Markov Chains

Published Online:https://doi.org/10.1287/ijoc.1100.0387

In applying matrix-analytic methods to M/G/1-type and tree-like quasi-birth-death (QBD) Markov chains, it is crucial to determine the solution to a (set of) nonlinear matrix equation(s). This is usually done via iterative methods. We consider the highly structured subclass of triangular M/G/1-type and tree-like QBD Markov chains that allows for an efficient direct solution of the matrix equation.

INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.