Skip to main content
SpringerLink
Log in

A new iterative method for solving Large-Scale Markov chains

  • Conference paper
  • First Online:
Quantitative Evaluation of Computing and Communication Systems (TOOLS 1995)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 977))

Abstract

In this paper, we propose a new iterative method for solving Large-Scale Markov chains. This method combines some of the well known techniques such as aggregation, Gauss-Seidel effect and overrelaxation. Our aim is to take advantage of those techniques for accelerating the convergence rate.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. W-L Cao and W.J. Stewart. Iterative aggregation/disaggregation techniques for nearly uncoupled Markov chains. J. Assoc. Comp. Mach. 32, 3 (1985), 702–719.

    Google Scholar 

  2. P. J. Courtois. Decomposability; Queuing and Computer System Applications. Academic Press, Orlando, Florida, 1977.

    Google Scholar 

  3. P.J. Courtois and P. Semal, Bounds for the positive eigenvectors of nonnegative matrices and their approximation by decomposition. J. Assoc. Comp. Mach. 31 (1984), 804–825.

    Google Scholar 

  4. R. Koury, D.F. McAllister and W.J. Stewart. Methods for computing stationary distributions of NCD Markov chains. SIAM J. Alg. Disc. Math. 5, 2 (1984), 164–186.

    Google Scholar 

  5. P.J. Schweitzer. Aggregation methods for large Markov chains. International Workshop oh Applied Mathematics and Performance Reliability Models of Computer Communication Systems. University of Pisa, Italy, (1983) 225–234.

    Google Scholar 

  6. W.J. Stewart and A. Touzene. On Solving coupling Matrices arising in Iterative Aggregation/Disagregation Methods. In proceedings of International Workshop on Modeling, Analysis and Simulation of Computer and Telecommunication Systems (MASCOTS '94), Durham, USA, January 1994.

    Google Scholar 

  7. W.J. Stewart and W. Wu. Numerical Experiments with Iteration and Aggregation for Markov Chains. ORSA Journal on Computing, July–August, 1992.

    Google Scholar 

  8. E.Gelenbe J. Labetoulle R. Marie and W. J. Stewart. Reseaux de files d'attentes — modelisation et traitement numerique. Ed. des hommes et technique de l'AFCET, 1980.

    Google Scholar 

  9. R. S. Varga. Matrix Iteratives Analysis. Prentice Hall, Englewood Cliffs, N.J., 1963.

    Google Scholar 

  10. Y. Saad. Krylov Subspace Methods for Solving Unsymetric Linear Systems. Mathematics of Computation, 37, 105–126.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. College of Computer Science and Information Sciences Department of Computer Science, King Saud University, P.O. Box 51178, 11543, Riyadh, Saudi Arabia

    Abderezak Touzene

Authors
  1. Abderezak Touzene
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Heinz Beilner Falko Bause

Rights and permissions

Reprints and permissions

Copyright information

© 1995 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Touzene, A. (1995). A new iterative method for solving Large-Scale Markov chains. In: Beilner, H., Bause, F. (eds) Quantitative Evaluation of Computing and Communication Systems. TOOLS 1995. Lecture Notes in Computer Science, vol 977. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0024315

Download citation

  • DOI: https://doi.org/10.1007/BFb0024315

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-60300-9

  • Online ISBN: 978-3-540-44789-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation