An invariant subspace approach in m/g/l and g/m/l type markov chains

DOI10.1080/15326349708807433zbMath0896.60061OpenAlexW2092378115MaRDI QIDQ4354598

Khosrow Sohraby, Nail Akar

Publication date: 1 October 1998

Published in: Communications in Statistics. Stochastic Models (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/15326349708807433

zbMATH Keywords

convergence ratesmatrix sign functionnonlinear matrix equationspolynomial and rational matricesM/G/1 and G/M/1 type Markov chainsleft and right invariant subspacesmatrix fractional descriptions

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)

Related Items (16)

Efficient computation of the extreme solutions of $X+A^*X^{-1}A=Q$ and $X-A^*X^{-1}A=Q$ ⋮ Infinite- and finite-buffer Markov fluid queues: a unified analysis ⋮ A probabilistic algorithm for finding the rate matrix of a block-GI/M/1 Markov chain ⋮ A probabilistic algorithm for determining the fundamental matrix of a block M/G/1 Markov chain ⋮ Condition numbers and backward error of a matrix polynomial equation arising in stochastic models ⋮ A numerically efficient method for the \(MAP/D/1/K\) queue via rational approximations ⋮ Computational procedures for a class of GI/D/\(k\) systems in discrete time ⋮ Matrix-analytic solution of infinite, finite and level-dependent second-order fluid models ⋮ A. B. Clarke's Tandem Queue Revisited—Sojourn Times ⋮ On the Dual Relationship Between Markov Chains of GI/M/1 and M/G/1 Type ⋮ A fast Newton-Shamanskii iteration for a matrix equation arising from M/G/1-type Markov chains ⋮ The morphing of fluid queues into Markov-modulated Brownian motion ⋮ Solving matrix polynomial equations arising in queueing problems ⋮ Relaxed functional iteration techniques for the numerical solution of \(M/G/1\) type Markov chains ⋮ Queue-length, waiting-time and service batch size analysis for the discrete-time \(GI/D-MSP^{\text{(a,b)}}/1/\infty\) queueing system ⋮ A Fast Newton's Iteration for M/G/1-Type and GI/M/1-Type Markov Chains

This page was built for publication: An invariant subspace approach in m/g/l and g/m/l type markov chains