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

A block version of left-looking AINV preconditioner with one by one or two by two block pivots

Author

Listed:
  • Rafiei, Amin
  • Bollhöfer, Matthias
  • Benkhaldoun, Fayssal

Abstract

In this paper, we present a block format of left-looking AINV preconditioner for a nonsymmetric matrix. This preconditioner has block 1 × 1 or 2 × 2 pivot entries. It is introduced based on a block format of Gaussian Elimination process which has been studied in [14]. We have applied the multilevel nested dissection reordering as the preprocessing and have compared this block preconditioner by the plain left-looking AINV preconditioner. If we mix the multilevel nested dissection by the maximum weighted matching process, then the numerical experiments indicate that the number of 2 × 2 pivot entries in the block preconditioner will grow up. In this case, the block preconditioner makes GMRES method convergent in a smaller number of iterations. In the numerical section, we have also compared the ILUT and block left-looking AINV preconditioners.

Suggested Citation

  • Rafiei, Amin & Bollhöfer, Matthias & Benkhaldoun, Fayssal, 2019. "A block version of left-looking AINV preconditioner with one by one or two by two block pivots," Applied Mathematics and Computation, Elsevier, vol. 350(C), pages 366-385.
    • Handle: RePEc:eee:apmaco:v:350:y:2019:i:c:p:366-385
    DOI: 10.1016/j.amc.2019.01.012
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0096300319300207
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.amc.2019.01.012?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:350:y:2019:i:c:p:366-385. 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.