Simplicial algorithms for computing stationary probabilities of stochastic matrices

DOI10.1016/S0096-3003(97)10097-2zbMath0943.65055OpenAlexW2070190980MaRDI QIDQ1294413

Chung-Kuang Chu, Edmond A. Jonckheere, 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

zbMATH Keywords

computational complexityMarkov chainsstochastic matricesstationary probabilitiessimplicial algorithmsBrouwer fixed pointvariable grid refinement

Mathematics Subject Classification ID

Computational methods in Markov chains (60J22) Numerical analysis or methods applied to Markov chains (65C40) Stochastic matrices (15B51)

Cites Work

• Bounded flatness in \(Q\)-triangulated regular \(n\)-simplexes
• Extensions of Lemke's algorithm for the linear complementarity problem
• Triangulations and simplicial methods
• Simplicial algorithms on the simplotope
• Simplizialzerlegungen von beschränkter Flachheit
• The Game of Hex and the Brouwer Fixed-Point Theorem
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item