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

Convergence of two-stage iterative scheme for K-weak regular splittings of type II

Author

Listed:
  • Shekhar, Vaibhav
  • Nayak, Snigdhashree
  • Mishra, Nachiketa
  • Mishra, Debasisha

Abstract

Monotone matrices play a key role in the convergence theory of regular splittings and different types of weak regular splittings. If monotonicity fails, then it is difficult to guarantee the convergence of the above-mentioned classes of matrices. In such a case, K-monotonicity is sufficient for the convergence of K-regular and K-weak regular splittings, where K is a proper cone in Rn. However, the convergence theory of a two-stage iteration scheme in a general proper cone setting is a gap in the literature. Especially, the same study for weak regular splittings of type II (even if in standard proper cone setting, i.e., K=R+n), is open. To this end, we propose convergence theory of two-stage iterative scheme for K-weak regular splittings of both types in the proper cone setting. We provide some sufficient conditions which guarantee that the induced splitting from a two-stage iterative scheme is a K-regular splitting and then establish some comparison theorems. We also study K-monotone convergence theory of the stationary two-stage iterative method in case of a K-weak regular splitting of type II. The most interesting and important part of this work is on M-matrices appearing in the Covid-19 pandemic model. Finally, numerical computations are performed using the proposed technique to compute the next generation matrix involved in the pandemic model. The computation of large PageRank matrices shows that the two-stage Gauss-Seidel method performs better than the Gauss-Seidel methods.

Suggested Citation

  • Shekhar, Vaibhav & Nayak, Snigdhashree & Mishra, Nachiketa & Mishra, Debasisha, 2021. "Convergence of two-stage iterative scheme for K-weak regular splittings of type II," Applied Mathematics and Computation, Elsevier, vol. 410(C).
    • Handle: RePEc:eee:apmaco:v:410:y:2021:i:c:s0096300321005609
    DOI: 10.1016/j.amc.2021.126471
    as

    Download full text from publisher

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

    References listed on IDEAS

    as
    1. He, Qiang & Wang, Xingwei & Lei, Zhencheng & Huang, Min & Cai, Yuliang & Ma, Lianbo, 2019. "TIFIM: A Two-stage Iterative Framework for Influence Maximization in Social Networks," Applied Mathematics and Computation, Elsevier, vol. 354(C), pages 338-352.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Mao, Fubing & Ma, Lijia & He, Qiang & Xiao, Gaoxi, 2020. "Match making in complex social networks," Applied Mathematics and Computation, Elsevier, vol. 371(C).
    2. Wenguo Yang & Shengminjie Chen & Suixiang Gao & Ruidong Yan, 2020. "Boosting node activity by recommendations in social networks," Journal of Combinatorial Optimization, Springer, vol. 40(3), pages 825-847, October.
    3. Liu, Panfeng & Li, Longjie & Fang, Shiyu & Yao, Yukai, 2021. "Identifying influential nodes in social networks: A voting approach," Chaos, Solitons & Fractals, Elsevier, vol. 152(C).
    4. Li, Qi & Cheng, Le & Wang, Wei & Li, Xianghua & Li, Shudong & Zhu, Peican, 2023. "Influence maximization through exploring structural information," Applied Mathematics and Computation, Elsevier, vol. 442(C).
    5. Gong, Yudong & Liu, Sanyang & Bai, Yiguang, 2021. "A probability-driven structure-aware algorithm for influence maximization under independent cascade model," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 583(C).

    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:410:y:2021:i:c:s0096300321005609. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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.