IDEAS home Printed from https://ideas.repec.org/a/eee/apmaco/v338y2018icp87-100.html
   My bibliography  Save this article

A preprocessed multi-step splitting iteration for computing PageRank

Author

Listed:
  • Gu, Chuanqing
  • Jiang, Xianglong
  • Nie, Ying
  • Chen, Zhibing

Abstract

The PageRank algorithm plays an important role in determining the importance of Web pages. The multi-step splitting iteration (MSPI) method for calculating the Pagerank problem is an iterative framework of combining the multi-step classical power method with the inner-outer method. In this paper, we present a preprocessed MSPI method called the Arnoldi-MSPI iteration, which is the MSPI method modified with the thick restarted Arnoldi algorithm. The implementation and convergence of the new method are discussed in detail. Numerical experiments are given to show that our method has a good computational effect when the damping factor is close to 1.

Suggested Citation

  • Gu, Chuanqing & Jiang, Xianglong & Nie, Ying & Chen, Zhibing, 2018. "A preprocessed multi-step splitting iteration for computing PageRank," Applied Mathematics and Computation, Elsevier, vol. 338(C), pages 87-100.
    • Handle: RePEc:eee:apmaco:v:338:y:2018:i:c:p:87-100
    DOI: 10.1016/j.amc.2018.05.033
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0096300318304429
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.amc.2018.05.033?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:apmaco:v:338:y:2018:i:c:p:87-100. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: https://www.journals.elsevier.com/applied-mathematics-and-computation .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.