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

Parallel multisplitting iteration methods based on M-splitting for the PageRank problem

Author

Listed:
  • Huang, Na
  • Ma, Chang-Feng

Abstract

A class of iterative schemes based on the regular splitting is proposed for PageRank computation. By some specific splitting, these methods will reduce to some well-known iterative schemes, like Jacobi method and successive overrelaxation method. To suit computational requirements of the modern high-speed multiprocessor environments, we further study synchronous parallel counterparts for the new splitting iteration methods. By using the M-splitting of the coefficient matrix, we establish the convergence theory of these synchronous multisplitting iteration methods. Finally, some numerical experiments are presented to illustrate the feasibility, stability and effectiveness of the proposed algorithms.

Suggested Citation

  • Huang, Na & Ma, Chang-Feng, 2015. "Parallel multisplitting iteration methods based on M-splitting for the PageRank problem," Applied Mathematics and Computation, Elsevier, vol. 271(C), pages 337-343.
    • Handle: RePEc:eee:apmaco:v:271:y:2015:i:c:p:337-343
    DOI: 10.1016/j.amc.2015.09.016
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0096300315012345
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.amc.2015.09.016?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.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Tian, Zhaolu & Liu, Yong & Zhang, Yan & Liu, Zhongyun & Tian, Maoyi, 2019. "The general inner-outer iteration method based on regular splittings for the PageRank problem," Applied Mathematics and Computation, Elsevier, vol. 356(C), pages 479-501.
    2. Yajun Xie & Lihua Hu & Changfeng Ma, 2023. "A Parameterized Multi-Splitting Iterative Method for Solving the PageRank Problem," Mathematics, MDPI, vol. 11(15), pages 1-12, July.

    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:271:y:2015:i:c:p:337-343. 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.