We describe a computational procedure for evaluating the quasi-stationary distributions of a continuous-time Markov chain. Our method, which is an 'iterative version' of Arnoldi's algorithm, is ...
Bunches of individual customers approach a single servicing facility according to a stationary compound Poisson process. The resulting waiting line process is studied in continuous time by the method ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback