We introduce a new iterative method for the computation of the minimal nonnegative solution G of the matrix equation X = Sigma(i=0)(+infinity) X(i)A(i), arising in the numerical solution of M/G/1 type Markov chains. The idea consists in applying a relaxation technique to customarily used functional iteration formulas. The proposed method is easy to implement and outperforms, in terms of number of iterations and execution time, the standard functional iteration techniques.
Relaxed functional iteration techniques for the numerical solution of M/G/1 type Markov chains
Favati P;
1998
Abstract
We introduce a new iterative method for the computation of the minimal nonnegative solution G of the matrix equation X = Sigma(i=0)(+infinity) X(i)A(i), arising in the numerical solution of M/G/1 type Markov chains. The idea consists in applying a relaxation technique to customarily used functional iteration formulas. The proposed method is easy to implement and outperforms, in terms of number of iterations and execution time, the standard functional iteration techniques.File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
