A parallel solver for large-scale Markov chains
Applied Numerical Mathematics - Developments and trends in iterative methods for large systems of equations—in memoriam Rüdiger Weiss
An Algorithmic Approach to Stochastic Bounds
Performance Evaluation of Complex Systems: Techniques and Tools, Performance 2002, Tutorial Lectures
Distributed Numerical Markov Chain Analysis
Proceedings of the 8th European PVM/MPI Users' Group Meeting on Recent Advances in Parallel Virtual Machine and Message Passing Interface
Iterative disaggregation for a class of lumpable discrete-time stochastic automata networks
Performance Evaluation
Adaptive decomposition and approximation for the analysis of stochastic petri nets
Performance Evaluation - Dependable systems and networks-performance and dependability symposium (DSN-PDS) 2002: Selected papers
Structured analysis techniques for large Markov chains
SMCtools '06 Proceeding from the 2006 workshop on Tools for solving structured Markov chains
Advances in Engineering Software
A software tool for the steady-state analysis of Google-like stochastic matrices
Proceedings of the Fourth International ICST Conference on Performance Evaluation Methodologies and Tools
Incomplete WZ factorization as an alternative method of preconditioning for solving Markov chains
PPAM'07 Proceedings of the 7th international conference on Parallel processing and applied mathematics
Smoothed Aggregation Multigrid for Markov Chains
SIAM Journal on Scientific Computing
Recursively Accelerated Multilevel Aggregation for Markov Chains
SIAM Journal on Scientific Computing
Convergence of multi-level iterative aggregation-disaggregation methods
Journal of Computational and Applied Mathematics
A new parallel block aggregated algorithm for solving Markov chains
The Journal of Supercomputing
A new parallel algorithm for solving large-scale Markov chains
The Journal of Supercomputing
| Hi-index | 0.00 |
Experimental results for large, sparse Markov chains, especially the ill-conditioned nearly completely decomposable (NCD) ones, are few. We believe there is need for further research in this area, specifically to aid in the understanding of the effects of the degree of coupling of NCD Markov chains and their nonzero structure on the convergence characteristics and space requirements of iterative solvers. The work of several researchers has raised the following questions that led to research in a related direction: How must one go about partitioning the global coefficient matrix into blocks when the system is NCD and a two-level iterative solver (such as block SOR) is to be employed? Are block partitionings dictated by the NCD form of the stochastic one-step transition probability matrix necessarily superior to others? Is it worth investigating alternative partitionings? Better yet, for a fixed labeling and partitioning of the states, how does the performance of block SOR (or even that of point SOR) compare to the performance of the iterative aggregation-disaggregation (IAD) algorithm? Finally, is there any merit in using two-level iterative solvers when preconditioned Krylov subspace methods are available? We seek answers to these questions on a test suite of 13 Markov chains arising in 7 applications.