SYMPOSIUM MINISYMPOSIA

ABSTRACT

One conventional way for solving a nonlinear matrix equation arising in the M/G/1 type or G/M/1 Markov chain is the iterative methods. In this paper we develop a shifting technique, and it is used to shift the given nonlinear matrix equation, which results in the corresponding shifted iterative methods. It turns out that the shifted iterative methods are always faster than the original ones in their speed of convergence, and may be hundreds times faster if the traffic intensity is close to one.

Getting More Information

To obtain more information about the meeting send e-mail to: fscc98@pax.st.usm.edu.

Return to PAX
Return to USM

USM
inquire@delphi.st.usm.edu
Updated
http://pax.st.usm.edu