Comparacion numerica de algoritmos para calcular distribuciones estacionarias de cadenas de Markov finitas
From MaRDI portal
Publication:4022757
DOI10.1007/BF02888264zbMath0757.60065OpenAlexW1557129045WikidataQ60214977 ScholiaQ60214977MaRDI QIDQ4022757
Antonio López-Quílez, Enriqueta Vercher
Publication date: 17 January 1993
Published in: Trabajos de Investigacion Operativa (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/40631
Cites Work
- Unnamed Item
- Unnamed Item
- An algorithmic approach for a special class of Markov chains
- An algorithm for Ph/Ph/c queues
- Technical Note—A Markov Chain Partitioning Algorithm for Computing Steady State Probabilities
- Comparison of Some Direct Methods for Computing Stationary Distributions of Markov Chains
- Regenerative Analysis and Steady State Distributions for Markov Chains
- Iterative Methods for Computing Stationary Distributions of Nearly Completely Decomposable Markov Chains
This page was built for publication: Comparacion numerica de algoritmos para calcular distribuciones estacionarias de cadenas de Markov finitas