kw.\*:("Near complete decomposability")
Results 1 to 3 of 3
Selection :
Stochastic automata networks and near complete decomposabilityGUSAK, Oleg; DAYAR, Tugrul; FOURNEAU, Jean-Michel et al.SIAM journal on matrix analysis and applications. 2002, Vol 23, Num 2, pp 581-599, issn 0895-4798Article
Componentwise bounds for nearly completely decomposable Markov chains using stochastic comparison and reorderingPEKERGIN, Nihal; DAYAR, Tugrul; ALPARSLAN, Denizhan N et al.European journal of operational research. 2005, Vol 165, Num 3, pp 810-825, issn 0377-2217, 16 p.Article
Comparison of partitioning techniques for two-level iterative solvers on large, sparse Markov chainsDAYAR, Tugrul; STEWART, William J.SIAM journal on scientific computing (Print). 2000, Vol 21, Num 5, pp 1691-1705, issn 1064-8275Conference Paper