Steady-state analysis of google-like stochastic matrices with block iterative methods
Electronic Transactions on Numerical Analysis
Please cite this item using this persistent URLhttp://hdl.handle.net/11693/21654
A Google-like matrix is a positive stochastic matrix given by a convex combination of a sparse, nonnegative matrix and a particular rank one matrix. Google itself uses the steady-state vector of a large matrix of this form to help order web pages in a search engine. We investigate the computation of the steady-state vectors of such matrices using block iterative methods. The block partitionings considered include those based on block triangular form and those having triangular diagonal blocks obtained using cutsets. Numerical results show that block Gauss-Seidel with partitionings based on block triangular form is most often the best approach. However, there are cases in which a block partitioning with triangular diagonal blocks is better, and the Gauss-Seidel method is usually competitive. Copyright © 2011, Kent State University.
- Research Paper 
Showing items related by title, author, creator and subject.
Dayar, T. (2009)Kronecker products are used to define the underlying Markov chain (MC) in various modeling formalisms, including compositional Markovian models, hierarchical Markovian models, and stochastic process algebras. The motivation ...
Buchholz P.; Dayar, T. (2005)Kronecker structured representations are used to cope with the state space explosion problem in Markovian modeling and analysis. Currently, an open research problem is that of devising strong preconditioners to be used ...
Uysal, E.; Dayar, T. (1998)This paper presents iterative methods based on splittings (Jacobi, Gauss-Seidel, Successive Over Relaxation) and their block versions for Stochastic Automata Networks (SANs). These methods prove to be better than the power ...