Iterative aggregation: disaggregation methods and ordering algorithms

Authors:
Ivana Pultarová
Affiliations:
Czech Technical University in Prague, Prague, Czech Republic
Venue:
Proceedings of the 3rd International Conference on Performance Evaluation Methodologies and Tools
Year:
2008

Citing 6
Cited 0

State Space Orderings for Gauss--Seidel in Markov Chains Revisited

SIAM Journal on Scientific Computing
An Implementation of Tarjan's Algorithm for the Block Triangularization of a Matrix

ACM Transactions on Mathematical Software (TOMS)
A Survey of Eigenvector Methods for Web Information Retrieval

SIAM Review
A Reordering for the PageRank Problem

SIAM Journal on Scientific Computing
Convergence Analysis of a PageRank Updating Algorithm by Langville and Meyer

SIAM Journal on Matrix Analysis and Applications
On the Convergence of a Class of Multilevel Methods for Large Sparse Markov Chains

SIAM Journal on Matrix Analysis and Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

The paper presents some modifications of two-level methods for computing stationary probability distribution vector of large discrete time Markov chains. The approach considered is an iterative aggregation - disaggregation method. Two types of permuting the events are considered in order to improve the convergence.