An Improved Approach to the PageRank Problems

Algorithm 2

An algorithm based on a separation of the common nodes.

(1) Partition the web nodes which form blocks: into

   blocks: , so the hyperlink matrix has the structure of (12).

(2) Partition the given vector and PageRank vector

   according to the size of the blocks:

    , , , ;

    , , , .

(3) Compute the limiting vector of by iterations as follow:

 (a) Compute ;

 (b) Solve for in

          .

(4) Compute

        ,

        .

(5) Normalize .