.png){kind=icon}
.png){kind=icon}
Return
MULTIGRID METHODS FOR TENSOR STRUCTURED MARKOV CHAINS WITH LOW RANK APPROXIMATION
.png){kind=icon}
OA
AI
DOI：10.1137/140994447.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Tensor structured Markov chains are part of stochastic models of many practical applications, e.g., in the description of complex production or telephone networks. The most interesting question in Markov chain models is the determination of the stationary distribution as a description of the long-term behavior of the system. This involves the computation of the eigenvector corresponding to the dominant eigenvalue or equivalently the solution of a singular linear system of equations. Due to the tensor structure of the models the dimension of the operators grows rapidly and a direct solution without exploiting the tensor structure becomes infeasible. Algebraic multigrid methods have proven to be efficient when dealing with Markov chains without using tensor structure. In this work we present an approach to adapt the algebraic multigrid framework to the tensor frame, using not only the tensor structure in matrix-vector multiplications but also tensor structured coarse-grid operators and tensor representations of the solution vector.
Keywords:
multigrid method
tensor truncation
tensor train
Markov chains
singular linear system
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
2.6
Papers:
5.1K
Citations:
1.8W