This paper proposes a new solution algorithm for steady state models describing skip-free processes to the left where each level has one phase. The computational complexity of the algorithm is independent of the number of levels of the system. If the skip parameter of the skip-free process is significantly smaller than the number of levels of the system, our algorithm numerically outperforms existing algorithms for skip-free processes. The proposed algorithm is based on a novel method for applying generalized Fibonacci series to the solution of steady state models.
@article{1413,
title = {A new solution algorithm for skip-free processes to the left},
journal = {CUBO, A Mathematical Journal},
volume = {12},
year = {2010},
language = {en},
url = {http://dml.mathdoc.fr/item/1413}
}
Bauer, Claus. A new solution algorithm for skip-free processes to the left. CUBO, A Mathematical Journal, Tome 12 (2010) . http://gdmltest.u-ga.fr/item/1413/