Overcoming Instability In Computing The Fundamental Matrix For A Markov Chain
From MaRDI portal
Recommendations
Cited in
(10)- New ways of solving large Markov chains
- The ODE method for stability of skip-free Markov chains with applications to MCMC
- Stable computation with the fundamental matrix of a Markov chain
- A partitioning algorithm for computing limiting distributions of ill-conditioned Markov chains
- scientific article; zbMATH DE number 4060973 (Why is no real title available?)
- scientific article; zbMATH DE number 510823 (Why is no real title available?)
- Rounding errors in certain algorithms involving Markov chains
- STOCHASTIC ANALYSIS OF CELLULAR AUTOMATA WITH APPLICATION TO THE VOTER MODEL
- A performance comparison of density-of-states methods
- An iterative algorithm for computing mean first passage times of Markov chains
This page was built for publication: Overcoming Instability In Computing The Fundamental Matrix For A Markov Chain
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4389090)