Abstract
We propose new methods which combine aggregation with point and block iterative techniques for computing the stationary probability vector of a finite ergodic Markov chain. These techniques are also compared numerically with several methods which have recently appeared in the literature for the class of nearly completely decomposable Markov chains.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.