IDEAS home Printed from https://ideas.repec.org/h/spr/sprchp/978-1-4615-2241-6_5.html
   My bibliography  Save this book chapter

A Parallel Block Projection Method of the Cimmino Type for Finite Markov Chains

In: Computations with Markov Chains

Author

Listed:
  • M. Benzi

    (Universitá di Bologna, Dipartimento di Matematica)

  • F. Sgallari

    (Universitá di Bologna, Dipartimento di Matematica)

  • G. Spaletta

    (Universitá di Bologna, Dipartimento di Matematica)

Abstract

A parallel block projection method is used to approximate the stationary vector of a finite Markov chain. Block projection methods are very attractive for solving large chains thanks to their potential for parallel computation and robustness. We show that the block Cimmino method is particularly well-suited if the chain is nearly uncoupled, a condition which is often met in the applications. This is due to the favorable spectral distribution of the iteration matrix, in contrast with more traditional iterative solvers which are known to exhibit poor convergence rates when applied to nearly uncoupled problems. We consider conjugate gradient acceleration, and we experiment with different block partitionings and row reorderings of the rate matrix. The results of numerical experiments on a simple reliability model, carried out on the CRAY T3D massively parallel computer, are discussed. The test results point to the fact that this method is well suited for the parallel solution of nearly uncoupled Markov chains.

Suggested Citation

  • M. Benzi & F. Sgallari & G. Spaletta, 1995. "A Parallel Block Projection Method of the Cimmino Type for Finite Markov Chains," Springer Books, in: William J. Stewart (ed.), Computations with Markov Chains, chapter 5, pages 65-80, Springer.
    • Handle: RePEc:spr:sprchp:978-1-4615-2241-6_5
    DOI: 10.1007/978-1-4615-2241-6_5
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a
    for a similarly titled item that would be available.

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:sprchp:978-1-4615-2241-6_5. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.