Dayar, T.Noyan, G. N.2016-02-082016-02-0820111068-9613http://hdl.handle.net/11693/21654A 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.EnglishBlock iterative methodsCutsetsGooglePageRankPartitioningsPower methodStochastic matricesTriangular blocksBlock iterative methodCutsetsArticle