Smoothed Aggregation Multigrid for Markov Chains
From MaRDI portal
Publication:3079317
DOI10.1137/080719157zbMath1209.65011OpenAlexW2140202900MaRDI QIDQ3079317
No author found.
Publication date: 2 March 2011
Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/080719157
numerical resultsMarkov chainalgebraic multigridstochastic matricesmultilevel methodsmoothed aggregationstationary probability vector
Computational methods in Markov chains (60J22) Computational methods for sparse matrices (65F50) Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Numerical analysis or methods applied to Markov chains (65C40) Iterative numerical methods for linear systems (65F10) Stochastic matrices (15B51)
Related Items
A cost-effective smoothed multigrid with modified neighborhood-based aggregation for Markov chains, Aggregation Methods for Computing Steady States in Statistical Physics, Computational evaluation of multi-iterative approaches for solving graph-structured large linear systems, Triangular and skew-symmetric splitting method for numerical solutions of Markov chains, Block-accelerated aggregation multigrid for Markov chains with application to PageRank problems, Numerical Methods for Gremban's Expansion of Signed Graphs, Convergence of multi-level iterative aggregation-disaggregation methods, Top-level acceleration of adaptive algebraic multilevel methods for steady-state solution to Markov chains, The extrapolation-accelerated multilevel aggregation method in PageRank computation, Fast multilevel methods for Markov chains, Restricted additive Schwarz methods for Markov chains, Physiology and pathology of iterative aggregation–disaggregation methods, Accelerated multigrid for graph Laplacian operators, Multigrid Methods for Tensor Structured Markov Chains with Low Rank Approximation, Iterant recombination with one-norm minimization for multilevel Markov chain algorithms via the ellipsoid method, Algebraic Two-Level Convergence Theory for Singular Systems, A probabilistic algorithm for aggregating vastly undersampled large Markov chains
