Multigrid methods combined with low-rank approximation for tensor structured Markov chains
نویسندگان
چکیده
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.
منابع مشابه
Finding Steady States of Communicating Markov Processes Combining Aggregation/Disaggregation with Tensor Techniques
Stochastic models for interacting processes feature a dimensionality that grows exponentially with the number of processes. This state space explosion severely impairs the use of standard methods for the numerical analysis of such Markov chains. In this work, we develop algorithms for the approximation of steady states of structured Markov chains that consider tensor train decompositions, combi...
متن کاملTensor Low Multilinear Rank Approximation by Structured Matrix Low-Rank Approximation
We present a new connection between higherorder tensors and affinely structured matrices, in the context of low-rank approximation. In particular, we show that the tensor low multilinear rank approximation problem can be reformulated as a structured matrix low-rank approximation, the latter being an extensively studied and well understood problem. We first consider symmetric tensors. Although t...
متن کاملMultigrid Accelerated Tensor Approximation of Function Related Multidimensional Arrays
In this paper, we describe and analyze a novel tensor approximation method for discretized multidimensional functions and operators in Rd, based on the idea of multigrid acceleration. The approach stands on successive reiterations of the orthogonal Tucker tensor approximation on a sequence of nested refined grids. On the one hand, it provides a good initial guess for the nonlinear iterations to...
متن کاملAn Adaptive Algebraic Multigrid Algorithm for Low-Rank Canonical Tensor Decomposition
A new algorithm based on algebraic multigrid is presented for computing the rank-R canonical decomposition of a tensor for small R. Standard alternating least squares (ALS) is used as the relaxation method. Transfer operators and coarse-level tensors are constructed in an adaptive setup phase that combines multiplicative correction and bootstrap algebraic multigrid. An accurate solution is comp...
متن کاملOn-the-Fly Adaptive Smoothed Aggregation Multigrid for Markov Chains
A new adaptive algebraic multigrid scheme is developed for the solution of Markov chains, where the hierarchy of operators is adapted on-the-fly in a setup process that is interlaced with the solution process. The setup process feeds the solution process with improved operators, while the solution process provides the adaptive setup process with better approximations on which to base further-im...
متن کامل