On compact solution vectors in Kronecker-based Markovian analysis
Embargo Lift Date: 2019-10-01
Orhan, M. C.
132 - 149
Item Usage Stats
MetadataShow full item record
State based analysis of stochastic models for performance and dependability often requires the computation of the stationary distribution of a multidimensional continuous-time Markov chain (CTMC). The infinitesimal generator underlying a multidimensional CTMC with a large reachable state space can be represented compactly in the form of a block matrix in which each nonzero block is expressed as a sum of Kronecker products of smaller matrices. However, solution vectors used in the analysis of such Kronecker-based Markovian representations require memory proportional to the size of the reachable state space. This implies that memory allocated to solution vectors becomes a bottleneck as the size of the reachable state space increases. Here, it is shown that the hierarchical Tucker decomposition (HTD) can be used with adaptive truncation strategies to store the solution vectors during Kronecker-based Markovian analysis compactly and still carry out the basic operations including vector–matrix multiplication in Kronecker form within Power, Jacobi, and Generalized Minimal Residual methods. Numerical experiments on multidimensional problems of varying sizes indicate that larger memory savings are obtained with the HTD approach as the number of dimensions increases. © 2017 Elsevier B.V.
Hierarchical tucker decomposition
Reachable state space
Continuous time systems
Continuous time Markov chain
Generalized minimal residual methods
Published Version (Please cite this version)http://dx.doi.org/10.1016/j.peva.2017.08.002
Showing items related by title, author, creator and subject.
Okuyan, E.; Okuyan, C. (Elsevier, 2015)In this paper, we present a revised version of BilKristal 3.0 tool. Raycast screenshot functionality is added to provide improved visual analysis. We added atomic distance analysis functionality to assess crystalline ...
Okuyan, E.; Okuyan, E. (Elsevier, 2015)In this paper, we present a revised version of BilKristal 2.0 tool. We added defect quantification functionality to assess crystalline defects. We improved visualization capabilities by adding transparency support and ...
Rudloff, B.; Ulus, F.; Vanderbei, R. (Springer, 2017)In this paper, a parametric simplex algorithm for solving linear vector optimization problems (LVOPs) is presented. This algorithm can be seen as a variant of the multi-objective simplex (the Evans–Steuer) algorithm (Math ...