Computing the fundamental matrix of an M/G/1–type Markov chain

Emma Hunt ()
Additional contact information
Emma Hunt: The University of Adelaide

Chapter Chapter 9 in Optimization, 2009, pp 167-188 from Springer

Abstract: Abstract A treatment is given of a probabilistic approach, Algorithm H, to the determination of the fundamental matrix of a block-structured $$M/G/1$$ –type Markov chain. Comparison is made with the cyclic reduction algorithm.

Keywords: Block Markov chain; fundamental matrix; Algorithm H convergence rates; LR Algorithm; CR Algorithm (search for similar items in EconPapers)
Date: 2009
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:spochp:978-0-387-98096-6_9

Ordering information: This item can be ordered from
http://www.springer.com/9780387980966

DOI: 10.1007/978-0-387-98096-6_9

Access Statistics for this chapter

More chapters in Springer Optimization and Its Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().