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

The convergence theory for the restricted version of the overlapping Schur complement preconditioner

Author

Listed:
  • Lu, Xin
  • Liu, Xing-ping
  • Gu, Tong-xiang

Abstract

The restricted version of the overlapping Schur complement (SchurRAS) preconditioner was introduced by Li and Saad (2006) for the solution of linear system Ax=b, and numerical results have shown that the SchurRAS method outperforms the restricted additive Schwarz (RAS) method both in terms of iteration count and CPU time. In this paper, based on meticulous derivation, we give an algebraic representation of the SchurRAS preconditioner, and prove that the SchurRAS method is convergent under the condition that A is an M-matrix and it converges faster than the RAS method.

Suggested Citation

  • Lu, Xin & Liu, Xing-ping & Gu, Tong-xiang, 2018. "The convergence theory for the restricted version of the overlapping Schur complement preconditioner," Applied Mathematics and Computation, Elsevier, vol. 339(C), pages 422-430.
    • Handle: RePEc:eee:apmaco:v:339:y:2018:i:c:p:422-430
    DOI: 10.1016/j.amc.2018.07.038
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0096300318306039
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.amc.2018.07.038?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:339:y:2018:i:c:p:422-430. 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.