Iterative Methods for Computing Stationary Distributions of Nearly Completely Decomposable Markov Chains
- 1 June 1984
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Algebraic Discrete Methods
- Vol. 5 (2) , 164-186
- https://doi.org/10.1137/0605019
Abstract
No abstract availableKeywords
This publication has 22 references indexed in Scilit:
- Comparison of Some Direct Methods for Computing Stationary Distributions of Markov ChainsSIAM Journal on Scientific and Statistical Computing, 1984
- A Combined Direct-Iterative Method for Certain M-Matrix Linear SystemsSIAM Journal on Algebraic Discrete Methods, 1984
- Solution of Homogeneous Systems of Linear Equations Arising from Compartmental ModelsSIAM Journal on Scientific and Statistical Computing, 1981
- Analysis of Packet Network Congestion Control Using Sparse Matrix AlgorithmsIEEE Transactions on Communications, 1981
- NONNEGATIVE MATRICESPublished by Elsevier ,1979
- Random Injection Control of Multiprogramming in Virtual MemoryIEEE Transactions on Software Engineering, 1978
- Approximation of eigencharacteristics in nearly-completely decomposable stochastic systemsStochastic Processes and their Applications, 1976
- Error Analysis in Nearly-Completely Decomposable Stochastic SystemsEconometrica, 1975
- On Approximate Computer System ModelsJournal of the ACM, 1975
- Approximate Analysis of General Queuing NetworksIBM Journal of Research and Development, 1975