Multilevel solutions for structured Markov chains

SIAM Journal on Matrix Analysis and Applications

Volumn 22, Issue 2, 2001, Pages 342-357

  Buchholz, Peter ^a  

^a DRESDEN UNIVERSITY OF TECHNOLOGY   (Germany)

Author keywords

Aggregation disaggregation; Continuous time Markov chains; Iterative solution techniques; Stationary analysis

Indexed keywords

EID: 0042330211     PISSN: 08954798     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0895479898342419     Document Type: Article

References (28)

1. G. BIRKHOFF AND R. E. LYNCH, Numerical Solution of Elliptic Problems, SIAM Stud. Appl. Math. 6, SIAM, Philadelphia, 1984.
2. A. BRANDT, Multi-level adaptive solutions to boundary value problems, Math. Comp., 31 (1977), pp. 333-390.
3. W. L. BRIGGS, A Multigrid Tutorial, SIAM, Philadelphia, 1987.
4. P. BUCHHOLZ, An aggregation/disaggregation algorithm for stochastic automata networks, Probab. Engrg. Inform. Sci., 11 (1997), pp. 229-253.
5. P. BUCHHOLZ, An adaptive aggregation/disaggregation algorithm for hierarchical Markovian models, European J. Oper. Res., 116 (1999), pp. 85-104.
6. P. BUCHHOLZ, Structured analysis approaches for large Markov chains, Appl. Numer. Math., 31 (1999), pp. 375-404.
7. P. BUCHHOLZ, Projection methods for the analysis of stochastic automata networks, in Numerical Solution of Markov Chains, B. Plateau, W. J. Stewart, and M. Silva, eds., Prensas Universitarias de Zaragoza, 1999, pp. 149-168.
8. P. BUCHHOLZ, G. CIARDO, S. DONATELLI, AND P. KEMPER, Complexity of Kronecker operations and sparse matrices with applications to the solution of Markov models, INFORMS J. Comput., to appear.
9. P. E. BUIS AND W. R. DYKSEN, Efficient vector and parallel manipulation of tensor products, ACM Trans. Math. Software, 22 (1996), pp. 18-23.
10. R. CHAN, Iterative methods for overflow queueing networks I, Numer. Math., 51 (1987), pp. 143-180.
11. R. CHAN, Iterative methods for overflow queueing networks II, Numer. Math., 54 (1988), pp. 57-78.
12. R. CHAN AND W. CHING, Circulant preconditioned for stochastic automata networks, Numer. Math., to appear.
13. M. DAVIO, Kronecker products and shuffle algebra, IEEE Trans. Comput., 30 (1981) pp. 116-125.
14. T. DAYAR AND W. J. STEWART, Comparison of partitioning techniques for two-level iterative solvers on large, sparse Markov chains, SIAM J. Sci. Comput., 21 (2000), pp. 1691-1705.
15. S. DONATELLI, Superposed generalized stochastic Petri nets: Definition and efficient solution, in Application and Theory of Petri Nets, Zaragoza, 1994, R. Valette, ed., Lecture Notes in Comput. Sci. 815, Springer-Verlag, Berlin, 1994, pp. 258-277.
16. P. FERNANDES, B. PLATEAU, AND W. J. STEWART, Efficient descriptor-vector multiplication in stochastic automata networks, J. ACM, 45 (1998), pp. 381-414.
17. R. W. FREUND AND M. HOCHDRUCK, On the use of two QMR for solving singular systems and applications in Markov chain modelling, Numer. Linear Algebra Appl., 1 (1994), pp. 403-420.
18. G. HORTON AND S. LEUTENEGGER, A multi-level solution algorithm for steady state Markov-chains, ACM Perform. Eval. Rev., 22 (1994), pp. 191-200.
19. L. KAUFMAN, Matrix methods for queuing problems, SIAM J. Sci. Statist. Comput., 4 (1983), pp. 525-552.
20. I. MAREK AND P. MAYER, Convergence analysis of an iterative aggregation/disaggregation method for computing the probability vector of stochastic matrices, Numer. Linear Algebra Appl., 5 (1998), pp. 253-274.
21. D. MITRA AND I. MITRANI, Analysis of a kanban discipline for cell coordination in production lines II: Stochastic demands, Oper. Res., 39 (1991), pp. 807-823.
22. B. PLATEAU, On the stochastic structure of parallelism and synchronisation models for distributed algorithms, ACM Perform. Eval. Rev., 13 (1985), pp. 142-154.
23. B. PLATEAU AND K. ATIF, Stochastic automata networks for modeling parallel systems, IEEE Trans. Software Engrg., 17 (1991), pp. 1093-1108.
24. P. SCHWEITZER AND K. W. KINDLE, An iterative aggregation-disaggregation algorithm for solving linear equations, Appl. Math. Comput., 18 (1986), pp. 313-353.
25. W. J. STEWART, Introduction to the Numerical Solution of Markov Chains, Princeton University Press, Princeton, NJ, 1994.
26. W.J. STEWART, K. ATIF, AND B. PLATEAU, The numerical solution of stochastic automata networks, European J. Oper. Res., 86 (1995), pp. 503-525.
27. E. UYSAL AND T. DAYAR, Iterative methods based on splittings for stochastic automata networks, European J. Oper. Res., 110 (1998), pp. 166-186.
28. H. A. VAN DER VORST, Bi-CGSTAB: A fast and smoothly converging variant of Bi-CG for the solution of nonsymmetric linear systems, SIAM J. Sci. Statist. Comput., 13 (1992), pp. 631-644.