Abstract
For the matrix analogues of Markov chains of the M/G/1 type, we derive a stable recursive scheme to compute the steady state probability vector. This scheme, which is the natural generalization of a clever device attributed to P.J. Burke in the M/G/1 case, is substantially superior to the Gauss-Seidel iterative scheme.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
