Analyzing large sparse Markov chains of Kronecker products
2009 Sixth International Conference on the Quantitative Evaluation of Systems
5 - 5
Item Usage Stats
Kronecker products are used to define the underlying Markov chain (MC) in various modeling formalisms, including compositional Markovian models, hierarchical Markovian models, and stochastic process algebras. The motivation behind using a Kronecker structured representation rather than a flat one is to alleviate the storage requirements associated with the MC. With this approach, systems that are an order of magnitude larger can be analyzed on the same platform. In the Kronecker based approach, the generator matrix underlying the MC is represented using Kronecker products  of smaller matrices and is never explicitly generated. The implementation of transient and steady-state solvers rests on this compact Kronecker representation, thanks to the existence of an efficient vector-Kronecker product multiplication algorithm known as the shuffle algorithm . The transient distribution can be computed through uniformization using vector-Kronecker product multiplications. The steady-state distribution also needs to be computed using vector-Kronecker product multiplications, since direct methods based on complete factorizations, such as Gaussian elimination, normally introduce new nonzeros which cannot be accommodated. The two papers ,  provide good overviews of iterative solution techniques for the analysis of MCs based on Kronecker products. Issues related to reachability analysis, vector-Kronecker product multiplication, hierarchical state space generation in Kronecker based matrix representations for large Markov models are surveyed in . Throughout our discussion, we make the assumption that the MC at hand does not have unreachable states, meaning it is irreducible. And we take an algebraic view  to discuss recent results related to the analysis of MCs based on Kronecker products independently from modeling formalisms. We provide background material on the Kronecker representation of the generator matrix underlying a CTMC, show that it has a rich structure which is nested and recursive, and introduce a small CTMC whose generator matrix is expressed as a sum of Kronecker products; this CTMC is used as a running example throughout the discussion. We also consider preprocessing of the Kronecker representation so as to expedite numerical analysis. We discuss permuting the nonzero structure of the underlying CTMC symmetrically by reordering, changing the orders of the nested blocks by grouping, and reducing the size of the state space by lumping. The steady-state analysis of CTMCs based on Kronecker products is discussed for block iterative methods, multilevel methods, and preconditioned projection methods, respectively. The results can be extended to DTMCs based on Kronecker products with minor modifications. Areas that need further research are mentioned as they are discussed. Our contribution to this area over the years corresponds to work along iterative methods based on splittings and their block versions , associated preconditioners to be used with projection methods , near complete decomposability , a method based on iterative disaggregation for a class of lumpable MCs , a class of multilevel methods , and a recent method based on decomposition for weakly interacting subsystems . © 2009 IEEE.
KeywordsBlock iterative methods
Preconditioned projection methods
Block iterative method
Published Version (Please cite this version)http://dx.doi.org/10.1109/QEST.2009.12
Showing items related by title, author, creator and subject.
Algorithms for linear and convex feasibility problems: A brief study of iterative projection, localization and subgradient methods Özaktaş, Hakan (Bilkent University, 1998)Several algorithms for the feasibility problem are investigated. For linear systems, a number of different block projections approaches have been implemented and compared. The parallel algorithm of Yang and Murty is ...
Fast acceleration algorithm based on DFT expansion for the iterative MoM analysis of electromagnetic radiation/scattering from two-dimensional large phased arrays Ertürk, Vakur B.; Chou, H. T. (IEEE, 2002)An acceleration algorithm based on Discrete Fourier Transform (DFT) is developed to reduce the computational complexity and memory storages of iterative methods of moment (IMoM) solution to O(Ntot), where Ntot is the total ...
Efficient analysis of large phased arrays using iterative MoM with DFT-based acceleration algorithm Ertürk, V. B.; Chou, H-T. (John Wiley & Sons, Inc., 2003)A discrete Fourier transform (DFT)-based iterative method of moments (IMoM) algorithm is developed to provide an O(Ntot) computational complexity and memory storages for the efficient analysis of electromagnetic ...