Multigrid methods combined with low-rank approximation for tensor structured Markov chains
read the original abstract
Markov chains that describe interacting subsystems suffer, on the one hand, from state space explosion but lead, on the other hand, to highly structured matrices. In this work, we propose a novel tensor-based algorithm to address such tensor structured Markov chains. Our algorithm combines a tensorized multigrid method with AMEn, an optimization-based low-rank tensor solver, for addressing coarse grid problems. Numerical experiments demonstrate that this combination overcomes the limitations incurred when using each of the two methods individually. As a consequence, Markov chain models of unprecedented size from a variety of applications can be addressed.
This paper has not been read by Pith yet.
Forward citations
Cited by 1 Pith paper
-
Tensor methods for the computation of MTTA in large systems of loosely interconnected components
Decoupling local and synchronization transitions yields a linearly convergent MTTA algorithm that is accelerated to quadratic convergence and represented in tensor-train format, enabling computation on systems with up...
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.