Abstract. The problem of the computation of the rate matrix $G$ associated with discrete-time QBD Markov chains is analyzed. We present a shifted cyclic reduction algorithm and show that the speed of convergence of the latter modified algorithm is always faster than that of the original cyclic reduction.

  <dvi>  <postscript>  files of the paper

Back to Beatrice Meini's home page.