NECESSARY AND SUFFICIENT CONDITIONS FOR GLOBAL GEOMETRIC CONVERGENCE OF BLOCK GAUSS-SEIDEL ITERATION ALGORITHM APPLIED TO MARKOV CHAINS
DOI10.15807/JORSJ.40.283zbMATH Open0894.90106OpenAlexW2170982571MaRDI QIDQ4366141FDOQ4366141
Authors: Ushio Sumita, Nobuko Igaki 
Publication date: 18 November 1997
Published in: Journal of the Operations Research Society of Japan (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.15807/jorsj.40.283
Recommendations
- scientific article; zbMATH DE number 3886983
- Convergent Iterations for Computing Stationary Distributions of Markov Chains
- Block iterative algorithms for stochastic matrices
- On the convergence of jacobi and gauss-seidel iteration for steady-state probabilities of finite-state continuous-time markov chains
- A New Algorithm for Computing the Ergodic Probability Vector for Large Markov Chains
large-scale Markov chainsblock Gauss-Seidel algorithmergodic Markov chainsglobal geometric convergence
Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Operations research and management science (90B99)
This page was built for publication: NECESSARY AND SUFFICIENT CONDITIONS FOR GLOBAL GEOMETRIC CONVERGENCE OF BLOCK GAUSS-SEIDEL ITERATION ALGORITHM APPLIED TO MARKOV CHAINS
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4366141)
