Buchholz, P.Dayar T.2016-02-082016-02-0820040010-485X1436-5057http://hdl.handle.net/11693/24195The paper presents a class of numerical methods to compute the stationary distribution of Markov chains (MCs) with large and structured state spaces. A popular way of dealing with large state spaces in Markovian modeling and analysis is to employ Kronecker-based representations for the generator matrix and to exploit this matrix structure in numerical analysis methods. This paper presents various multilevel (ML) methods for a broad class of MCs with a hierarchcial Kronecker structure of the generator matrix. The particular ML methods are inspired by multigrid and aggregation-disaggregation techniques, and differ among each other by the type of multigrid cycle, the type of smoother, and the order of component aggregation they use. Numerical experiments demonstrate that so far ML methods with successive over-relaxation as smoother provide the most effective solvers for considerably large Markov chains modeled as HMMs with multiple macrostates.EnglishAggregation-DisaggregationKronecker-Based Numerical TechniquesMarkov ChainsMultigridMultilevel MethodsAggregation-DisaggregationKronecker-Based Numerical TechniquesMultigridMultilevel MethodsComputational MethodsMathematical ModelsMatrix AlgebraNumerical MethodsPetri NetsProblem SolvingQueueing NetworksVectorsMarkov ProcessesArticle10.1007/s00607-004-0074-2