Simplicial algorithms for computing stationary probabilities of stochastic matrices
DOI10.1016/S0096-3003(97)10097-2zbMATH Open0943.65055OpenAlexW2070190980MaRDI QIDQ1294413FDOQ1294413
Authors: Edmond Jonckheere, Chung-Kuang Chu, Chih-Yung Cheng 
Publication date: 19 August 1999
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0096-3003(97)10097-2
Recommendations
- Graphes et algorithme de calcul de probabilités stationnaires d'un processus markovien discret. (Graphs and algorithm for the computation of stationary probabilities of a discrete Markov process)
- A Simplicial Algorithm for Computing Robust Stationary Points of a Continuous Function on the Unit Simplex
- The computation of stationary distributions of Markov chains through perturbations
- Algorithms for finding steady state probabilities for some special classes of finite state Markov chains
- scientific article; zbMATH DE number 989251
computational complexityMarkov chainsstochastic matricesstationary probabilitiessimplicial algorithmsBrouwer fixed pointvariable grid refinement
Computational methods in Markov chains (60J22) Numerical analysis or methods applied to Markov chains (65C40) Stochastic matrices (15B51)
Cites Work
- Simplicial algorithms on the simplotope
- The Game of Hex and the Brouwer Fixed-Point Theorem
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Extensions of Lemke's algorithm for the linear complementarity problem
- Simplizialzerlegungen von beschränkter Flachheit
- Triangulations and simplicial methods
- Bounded flatness in \(Q\)-triangulated regular \(n\)-simplexes
- Title not available (Why is that?)
This page was built for publication: Simplicial algorithms for computing stationary probabilities of stochastic matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1294413)
