Welcome!
To use the personalized features of this site, please log in or register.
If you have forgotten your username or password, we can help.
My Menu
Saved Items

Iterative Aggregation/Disaggregation Methods for Computing Some Characteristics of Markov Chains

Ivo MarekContact Information and Petr MayerContact Information

(7)  Faculty of Civil Engineering, Czech Insititute of Technology, Prague, Thäkurova 7, 166 29, Praha, Czech Republic
(8)  Faculty of Mathematics and Physics, Charles University, Prague, Sokolovskä 83, 185 00, Praha 8, Czech Republic
Abstract
A class of iterative aggregation/disaggregation methods (IAD) for computation some important characteristics of Markov chains such as stationary probability vectors and mean first passage times matrices is presented and convergence properties of the corresponding algorithms are analyzed.
Research has been supported by grants No. MSM 210000010 and No. MSM 113200007.

Contact Information Ivo Marek
Email: marek@ms.mff.cuni.cz

Contact Information Petr Mayer
Email: mayer@ms.mff.cuni.cz
Fulltext Preview (Small, Large)
Image of the first page of the fulltext

References secured to subscribers.



Export this chapter
Export this chapter as RIS | Text
 
Remote Address: 38.107.191.108 • Server: mpweb23
HTTP User Agent: CCBot/1.0 (+http://www.commoncrawl.org/bot.html)