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

Preconditioned AHSS-PU alternating splitting iterative methods for saddle point problems

Author

Listed:
  • Zheng, Qing-Qing
  • Ma, Chang-Feng

Abstract

In order to solve large sparse saddle point problems (SPP) quickly and efficiently, Wang and Zhang recently studied the preconditioned accelerated Hermitian and skew-Hermitian splitting (PAHSS) methods. Through accelerating the PAHSS iteration algorithms by using parameterized Uzawa (PU) method, a preconditioned AHSS-PU alternating splitting iterative method (PAHSS-PU method) for solving saddle point problems is proposed in this paper. The convergence results of this new method are given under some suitable conditions. Moreover, we can obtain that if the parameters are suitable selected, then the PAHSS-PU algorithm will outperform the PAHSS algorithm and some Uzawa-type methods in the same precision condition. Numerical experiments are presented to illustrate the theoretical results and examine the numerical effectiveness of the PAHSS-PU method.

Suggested Citation

  • Zheng, Qing-Qing & Ma, Chang-Feng, 2016. "Preconditioned AHSS-PU alternating splitting iterative methods for saddle point problems," Applied Mathematics and Computation, Elsevier, vol. 273(C), pages 217-225.
    • Handle: RePEc:eee:apmaco:v:273:y:2016:i:c:p:217-225
    DOI: 10.1016/j.amc.2015.09.073
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0096300315013119
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.amc.2015.09.073?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:273:y:2016:i:c:p:217-225. 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.