Y.Y. Li, K.S. Leung, et al.
J Combin Optim
For Markov chains of M/G/1 type that are not skip-free to the left, the corresponding G matrix is shown to have special structure and be determined by its first block row. An algorithm that takes advantage of this structure is developed for computing G. For non-skip-free M/G/1 type Markov chains, the algorithm significantly reduces the computational complexity of calculating the G matrix, when compared with reblocking to a system that is skip-free to the left and then applying usual iteration schemes to find G. A similar algorithm to calculate the R matrix for G/M/1 type Markov chains that are not skip-free to the right is also described.
Y.Y. Li, K.S. Leung, et al.
J Combin Optim
Harpreet S. Sawhney
IS&T/SPIE Electronic Imaging 1994
S.F. Fan, W.B. Yun, et al.
Proceedings of SPIE 1989
Mario Blaum, John L. Fan, et al.
IEEE International Symposium on Information Theory - Proceedings