In order to determine the stationary distribution for discrete time quasi-birth-death Markov chains, it is necessary to find the minimal nonnegative solution of a quadratic matrix equation. The Newton-Shamanskii method is applied to solve this equation, and the sequence of matrices produced is monotonically increasing and converges to its minimal nonnegative solution. Numerical results illustrate the effectiveness of this procedure.Mathematics, AppliedSCI(E)0ARTICLEgpeichang@126.com4386-395
AbstractWe consider the numerical computation of stationary distributions for level dependent quasi-...
We examine the question of solving the extinction probability of a particular class of continuous-ti...
In this thesis, we study methods for computing the invariant probability measure for certain quasi-b...
In order to determine the extinction probability of a Markovian binary tree, it is necessary to find...
For the nonlinear matrix equations arising in the analysis of M/G/1-type and GI/M/1-type Markov chai...
Abstract Pure algebraic proofs of some known and some new results on the minimal nonnegative solutio...
Matrix equations of the kind A(1)X(2)+A(0)X+A(-1)=X, where both the matrix coefficients and the unkn...
A large number of queueing systems may be modelled as infinite Markov chains for which the transitio...
AbstractIn this paper, based on matrix structure analysis, we derive and analyze efficient algorithm...
We determine the equilibrium distribution for a class of quasi-birth-and-death (QBD) processes using...
In this paper, based on matrix structure analysis, we derive and analyze efficient algorithms to sol...
AbstractWe consider iterative methods for the minimal nonnegative solution of the matrix equation G ...
We revisit the shift technique applied to Quasi-Birth and Death (QBD) processes He et al. (2001) [13...
In the research area of one dimensional stochastic processes, Markov chains acquire special importan...
This paper describes and compares several methods for computing stationary probability distributions...
AbstractWe consider the numerical computation of stationary distributions for level dependent quasi-...
We examine the question of solving the extinction probability of a particular class of continuous-ti...
In this thesis, we study methods for computing the invariant probability measure for certain quasi-b...
In order to determine the extinction probability of a Markovian binary tree, it is necessary to find...
For the nonlinear matrix equations arising in the analysis of M/G/1-type and GI/M/1-type Markov chai...
Abstract Pure algebraic proofs of some known and some new results on the minimal nonnegative solutio...
Matrix equations of the kind A(1)X(2)+A(0)X+A(-1)=X, where both the matrix coefficients and the unkn...
A large number of queueing systems may be modelled as infinite Markov chains for which the transitio...
AbstractIn this paper, based on matrix structure analysis, we derive and analyze efficient algorithm...
We determine the equilibrium distribution for a class of quasi-birth-and-death (QBD) processes using...
In this paper, based on matrix structure analysis, we derive and analyze efficient algorithms to sol...
AbstractWe consider iterative methods for the minimal nonnegative solution of the matrix equation G ...
We revisit the shift technique applied to Quasi-Birth and Death (QBD) processes He et al. (2001) [13...
In the research area of one dimensional stochastic processes, Markov chains acquire special importan...
This paper describes and compares several methods for computing stationary probability distributions...
AbstractWe consider the numerical computation of stationary distributions for level dependent quasi-...
We examine the question of solving the extinction probability of a particular class of continuous-ti...
In this thesis, we study methods for computing the invariant probability measure for certain quasi-b...