Pages that link to "Item:Q3742447"
From MaRDI portal
The following pages link to Iterative Methods for Computing Stationary Distributions of Nearly Completely Decomposable Markov Chains (Q3742447):
Displayed 11 items.
- Aggregation/disaggregation iterative methods applied to Leontev systems and Markov chains. (Q558543) (← links)
- On a Rayleigh-Ritz refinement technique for nearly uncoupled stochastic matrices (Q794135) (← links)
- Iterative algorithms for large stochastic matrices (Q808164) (← links)
- Block iterative algorithms for stochastic matrices (Q1088381) (← links)
- Estimating equilibrium probabilities for band diagonal Markov chains using aggregation and disaggregation techniques (Q1310051) (← links)
- Convergence theory of some classes of iterative aggregation/disaggregation methods for computing stationary probability vectors of stochastic matrices (Q1870052) (← links)
- Iterative aggregation/disaggregation methods for computing some characteristics of Markov chains. II: Fast convergence (Q1873162) (← links)
- Further Comparisons of Direct Methods for Computing Stationary Distributions of Markov Chains (Q3028309) (← links)
- Comparacion numerica de algoritmos para calcular distribuciones estacionarias de cadenas de Markov finitas (Q4022757) (← links)
- An iterative aggregation/disaggregation procedure for modelling the long-term behaviour of continuous-time evanescent random processes (Q4346981) (← links)
- Convergent Iterations for Computing Stationary Distributions of Markov Chains (Q4727280) (← links)