๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Overcoming Instability In Computing The Fundamental Matrix For A Markov Chain

โœ Scribed by Heyman, Daniel P.; O'Leary, Dianne P.

Book ID
118215415
Publisher
Society for Industrial and Applied Mathematics
Year
1998
Tongue
English
Weight
601 KB
Volume
19
Category
Article
ISSN
0895-4798

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

A probabilistic algorithm for determinin
A probabilistic algorithm for determining the fundamental matrix of a block M/G/1 markov chain
โœ E. Hunt ๐Ÿ“‚ Article ๐Ÿ“… 2003 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 496 KB

A simple probabilistic algorithm is given for the determination of the fundamental matrix of a block M/G/1 Markov chain. The algorithm does not require the chain to be positive recurrent. A prima facie case for its value is made with a standard testbench example.

On the numerical solution of a nonlinear
On the numerical solution of a nonlinear matrix equation in Markov chains
โœ Chun-Hua Guo ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 786 KB

We consider iterative methods for t;le minimal nonnegativc :~oiu)i()n of the matrix equation G = ~, (), ,G', where the matrices ,4, are nonnegative and \'~ ,)..I, is stocha:4ic. Convergence theory lbr an 'inversion frec algorithm is established. The convergence rale of this algorithm is sho,s'.i ~o