Find in Library
Search millions of books, articles, and more
Indexed Open Access Databases
A multi-power and multi-splitting inner-outer iteration for PageRank computation
oleh: Pu Bing-Yuan, Wen Chun, Hu Qian-Ying
Format: | Article |
---|---|
Diterbitkan: | De Gruyter 2020-12-01 |
Deskripsi
As an effective and possible method for computing PageRank problem, the inner-outer (IO) iteration has attracted wide interest in the past few years since it was first proposed by Gleich et al. (2010). In this paper, we present a variant of the IO iteration, which is based on multi-step power and multi-step splitting and is denoted by MPMIO. The description and convergence are discussed in detail. Numerical examples are given to illustrate the effectiveness of the proposed method.