Browsing by Keywords "Near Complete Decomposability"

Now showing items 1-2 of 2

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

Dayar T.; Stewart, W. J. (SIAM, 2000)

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 ...
Stochastic automata networks and near complete decomposability

Gusak, O.; Dayar T.; Fourneau, J. M. (SIAM, 2002)

Stochastic automata networks (SANs) have been developed and used in the last fifteen years as a modeling formalism for large systems that can be decomposed into loosely connected components. In this work, we extend the ...