This thesis is about computing the stationary distribution of homogeneous continuous time Markov chains (which leads to solving a linear system with right-hand size zero) by a multigrid approach. The difficulty when dealing with these kinds of problems is the so-called curse of dimensionality. Therefore it is important that the multigrid approach exploits the naturally given tensor structure of these models for being an efficient iterative solver, and also to use a low-rank format, for example to guarantee an efficient matrix-vector multiplication. In this thesis, the Tensor Train format is the format of choice. For the construction of a multigrid hierarchy which maintains the tensor structure, the elements of a convergence analysis of multigrid methods are considered first, and then each ingredient of the multigrid method is discussed separately, with the focus on its capability to be used for tensor structured problems. As an extension of this structure-reliant choice of ingredients, an adaptive construction of the entries of the interpolation operator is also considered.
Overall, there is a therefore a variety of different choices for each ingredient, which are then tested and judged by numerical tests. Furthermore, it turns out that a combination with the tensor solver Alternating Minimal Energy (AMEn) can overcome the limitations of both the tensorized multigrid method and AMEn. Further numerical tests are performed for analyzing the efficiency of this combination.