Comparison of partitioning techniques for two-level iterative solvers on large, sparse Markov chains

SIAM Journal of Scientific Computing

Volumn 21, Issue 5, 2000, Pages 1691-1705

  Dayar, Tuǧrul ^a   Stewart, William J ^b  

^a BILKENT UNIVERSITY   (Turkey)

^b North Carolina State University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CONSTRAINT THEORY; LINEAR EQUATIONS; MARKOV PROCESSES; MATRIX ALGEBRA; PROBLEM SOLVING; VECTORS;

KRYLOV SUBSPACE METHODS; NEAR COMPLETE DECOMPOSABILITY; PARTITIONING; TWO LEVEL ITERATIVE SOLVERS;

ITERATIVE METHODS;

EID: 0033709988     PISSN: 10648275     EISSN: None     Source Type: None    
DOI: 10.1137/S1064827598338159     Document Type: Article

References (34)

1. Ö. ARAS AND T. DAYAR, Complete buffer sharing with pushout thresholds in ATM networks under bursty arrivals, in the Proceedings of the First Symposium on Computer Networks, Istanbul, Turkey, 1996, pp. 144-156.
2. O. AXELSSON, Iterative Solution Methods, Cambridge University Press, Cambridge, UK, 1994.
3. V. A. BARKER, Numerical solution of sparse singular systems of equations arising from ergodic Markov chains, Comm. Statist. Stochastic Models, 5 (1989), pp. 355-381.
4. R. BARRETT, M. BERRY, T. CHAN, J. DEMMEL, J. DONATO, J. DONGARRA, V. EIJKHOUT, R. POZO, C. ROMINE, AND H. VAN DER VORST, Templates for the Solution of Linear Systems, SIAM, Philadelphia, PA, 1994.
5. M. BENZI AND M. TUMA, A comparision of some preconditioning techniques for general sparse matrices, in Iterative Methods in Linear Algebra, II, IMACS Series in Computational and Applied Mathematics, Vol. 3, S. Margenov and P. Vassilevski, eds., IMACS, New Brunswick, NJ, 1996, pp. 191-203.
6. A. BERMAN AND R. J. PLEMMONS, Nonnegative Matrices in the Mathematical Sciences, SIAM, Philadelphia, PA, 1994.
7. J. J. BUONI, Incomplete factorization of singular M-matrices, SIAM J. Alg. Discrete Methods, 7 (1986), pp. 193-198.
8. H. CHOI AND D. B. SZYLD, Application of threshold partitioning of sparse matrices to Markov chains, in the Proceedings of the IEEE International Computer Performance and Dependability Symposium IPDS'96, Urbana, IL, 1996, pp. 158-165.
9. T. DAYAR, Permuting Markov Chains to Nearly Completely Decomposable Form, Tech. Report BU-CEIS-9808, Department of Computer Engineering and Information Science, Bilkent University, Ankara, Turkey, August 1998; available via ftp from ftp://ftp.cs.bilkent.edu.tr/pub/tech-reports/1998/BU-CEIS-9808.ps.z.
10. T. DAYAR AND W. J. STEWART, Comparison of Partitioning Techniques for Two-Level Iterative Solvers on Large, Sparse Markov Chains, Tech. Report BU-CEIS-9805, Department of Computer Engineering and Information Science, Bilkent University, Ankara, Turkey, April 1998; Available via ftp from ftp://ftp.cs.bilkent.edu.tr/pub/tech-reports/1998/BU-CEIS-9805.ps.z.
11. T. DAYAR AND W. J. STEWART, On the effects of using the Grassmann-Taksar-Heyman method in iterative aggregation-disaggregation, SIAM J. Sci. Comput., 17 (1996), pp. 287-303.
12. R. W. FREUND AND M. HOCHBRUCK, On the use of two QMR algorithms for solving singular systems and applications in Markov chain modelling, Numer. Linear Algebra Appl., 1 (1994), pp. 403-420.
13. A. GREENBAUM, Iterative Methods for Solving Linear Systems, SIAM, Philadelphia, PA, 1997.
14. D. GROSS, B. GU, AND R. M. SOLAND, The biconjugate gradient method for obtaining the steady-state probability distributions of Markovian multiechelon repairable item inventory systems, in The Numerical Solution of Markov Chains, W. J. Stewart, ed., M. Dekker, New York, 1991, pp. 473-489.
15. N. J. HIGHAM, Accuracy and Stability of Numerical Algorithms, SIAM, Philadelphia, PA, 1996.
16. S. T. LEUTENEGGER AND G. H. HORTON, On the utility of the multi-level algorithm for the solution of nearly completely decomposable Markov chains, in Computations with Markov Chains: Proceedings of the Second International Workshop on the Numerical Solution of Markov Chains, W. J. Stewart, ed., Kluwer, Boston, MA, 1995, pp. 425-442.
17. I. MAREK AND D. B. SZYLD, Iterative and semi-iterative methods for computing stationary probability vectors of Markov operators, Math. Comp., 61 (1993), pp. 719-731.
18. I. MAREK AND D. B. SZYLD, Local convergence of the (exact and inexact) iterative aggregation method for linear systems and Markov operators, Numer. Math., 69 (1994), pp. 61-82.
19. I. MAREK AND P. MAYER, Convergence analysis of an iterative aggregation/disaggregation method for computing stationary probability vectors of stochastic matrices, Numer. Linear Algebra Appl., 5 (1998), pp. 253-274.
20. Matrix Market, A Repository of Test Matrices at the National Institute of Standards and Technology, http://math.nist.gov/MatrixMarket.
21. J. A. MEIJERINK AND H. A. VAN DER VORST, An iterative solution method for linear systems of which the coefficient matrix is a symmetric M-matrix, Math. Comp., 31 (1977), pp. 148-162.
22. C. D. MEYER, The role of the group generalized inverse in the theory of finite Markov chains, SIAM Rev., 17 (1975), pp. 443-464.
23. C. D. MEYER, Stochastic complementation, uncoupling Markov chains, and the theory of nearly reducible systems, SIAM Rev., 31 (1989), pp. 240-272.
24. V. MIGALLÓN, J. PENADÉS, AND D. B. SZYLD, Block two-stage methods for singular systems and Markov chains, Numer. Linear Algebra Appl., 3 (1996), pp. 413-426.
25. J. O'NEIL AND D. B. SZYLD, A block ordering method for sparse matrices, SIAM J. Sci. Statist. Comput., 11 (1990), pp. 811-823.
26. B. PHILIPPE, Y. SAAD, AND W. J. STEWART, Numerical methods in Markov chain modelling, Oper. Res., 40 (1992), pp. 1156-1179.
27. Y. SAAD, Projection methods for the numerical solution of Markov chain models, in The Numerical Solution of Markov Chains, W. J. Stewart, ed., M. Dekker, New York, 1991, pp. 455-471.
28. Y. SAAD, Preconditioned Krylov subspace methods for the numerical solution of Markov chains, in Computations with Markov Chains: Proceedings of the Second International Workshop on the Numerical Solution of Markov Chains, W. J. Stewart, ed., Kluwer, Boston, MA, 1995, pp. 49-64.
29. Y. SAAD, Iterative Solution of Sparse Linear Systems, PWS Publishing, New York, 1996.
30. G. W. STEWART, W. J. STEWART, AND D. F. MCALLISTER, A two-stage iteration for solving nearly completely decomposable Markov chains, in Recent Advances in Iterative Methods, IMA Vol. Math. Appl. 60, G. H. Golub, A. Greenbaum, and M. Luskin, eds., Springer-Verlag, New York, 1994, pp. 201-216.
31. W. J. STEWART, MARCA: Markov Chain Analyzer. A software package for Markov modelling, in The Numerical Solution of Markov Chains, W. J. Stewart, ed., M. Dekker, New York, 1991, pp. 37-62.
32. W. J. STEWART, Introduction to the Numerical Solution of Markov Chains, Princeton University Press, Princeton, NJ, 1994.
33. W. J. STEWART, Marca Models: A Database of Markov Chain Models, http://www.csc.ncsu.edu /faculty/WStewart/MARCA_Models/MARCA-Models.html.
34. W. J. STEWART AND W. WU, Numerical experiments with iteration and aggregation for Markov chains, ORSA J. Comput., 4 (1992), pp. 336-350.