Iterative aggregation/disaggregation methods for computing some characteristics of Markov chains
From MaRDI portal
Recommendations
- Iterative aggregation/disaggregation methods for computing some characteristics of Markov chains. II: Fast convergence
- Convergence theory of some classes of iterative aggregation/disaggregation methods for computing stationary probability vectors of stochastic matrices
- Numerical Experiments with Iteration and Aggregation for Markov Chains
- Iterative aggregation/disaggregation techniques for nearly uncoupled markov chains
- Aggregation/Disaggregation Methods for Computing the Stationary Distribution of a Markov Chain
Cited in
(8)- Parallel implementation of an aggregation/disaggregation method for evaluating quasi-stationary behavior in continuous-time Markov chains
- Iterative aggregation/disaggregation methods for computing some characteristics of Markov chains. II: Fast convergence
- scientific article; zbMATH DE number 4192967 (Why is no real title available?)
- Iterative aggregation/disaggregation techniques for nearly uncoupled markov chains
- Aggregation of the policy iteration method for nearly completely decomposable Markov chains
- Numerical Experiments with Iteration and Aggregation for Markov Chains
- scientific article; zbMATH DE number 1064100 (Why is no real title available?)
- Aggregation/disaggregation iterative methods applied to Leontev systems and Markov chains.
This page was built for publication: Iterative aggregation/disaggregation methods for computing some characteristics of Markov chains
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4433870)