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

Communication-hiding pipelined BiCGSafe methods for solving large linear systems

Author

Listed:
  • Huynh, Viet Q.H.
  • Suito, Hiroshi

Abstract

Recently, a new variant of the BiCGStab method, known as the pipelined BiCGStab, has been proposed. This method can achieve a higher degree of scalability and speed-up rates through a mechanism in which the communication phase for the computation of the inner product can be overlapped with the computation of the matrix-vector product. Meanwhile, several generalized iteration methods with better convergence behavior than BiCGStab exist, such as ssBiCGSafe, BiCGSafe, and GPBi-CG. Among these methods, ssBiCGSafe, which requires a single phase of computing inner products per iteration, is best suited for high-performance computing systems. As described herein, inspired by the success of the pipelined BiCGStab method, we propose pipelined variations of the ssBiCGSafe method in which only one phase of inner product computation per iteration is required and this phase of inner product computation can be overlapped with the matrix-vector computation. Through numerical experimentation, we demonstrate that the proposed methods engender improvements in convergence behavior and execution time compared to the pipelined BiCGStab and ssBiCGSafe methods.

Suggested Citation

  • Huynh, Viet Q.H. & Suito, Hiroshi, 2023. "Communication-hiding pipelined BiCGSafe methods for solving large linear systems," Applied Mathematics and Computation, Elsevier, vol. 449(C).
  • Handle: RePEc:eee:apmaco:v:449:y:2023:i:c:s0096300323000371
    DOI: 10.1016/j.amc.2023.127868
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0096300323000371
    Download Restriction: Full text for ScienceDirect subscribers only

    File URL: https://libkey.io/10.1016/j.amc.2023.127868?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:449:y:2023:i:c:s0096300323000371. 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.