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

A generalized relaxed positive-definite and skew-Hermitian splitting preconditioner for non-Hermitian saddle point problems

Author

Listed:
  • Fan, Hong-tao
  • Zhu, Xin-yun

Abstract

For non-Hermitian saddle point problems with the non-Hermitian positive definite (1,1)-block, Zhang et al. (2014) presented a relaxed positive-definite and skew-Hermitian splitting (RPSS) preconditioner to accelerate the convergence rates of the Krylov subspace iteration methods such as GMRES. In this paper, the convergence property of the GRPSS iteration method is proved and a generalized RPSS (GRPSS) preconditioner is proposed. The GRPSS preconditioner is much closer to the coefficient matrix than the RPSS preconditioner in certain norm, which straightforwardly results in an GRPSS iteration method. We employing the GRPSS preconditioner to accelerate some Krylov subspace methods (like GMRES). The spectral distribution of the preconditioned matrix is described and an upper bound of the degree of the minimal polynomial of the preconditioned matrix is obtained. Finally, numerical experiments of a model Navier–Stokes equation are presented to illustrate the efficiency of the GRPSS preconditioner.

Suggested Citation

  • Fan, Hong-tao & Zhu, Xin-yun, 2015. "A generalized relaxed positive-definite and skew-Hermitian splitting preconditioner for non-Hermitian saddle point problems," Applied Mathematics and Computation, Elsevier, vol. 258(C), pages 36-48.
    • Handle: RePEc:eee:apmaco:v:258:y:2015:i:c:p:36-48
    DOI: 10.1016/j.amc.2015.01.119
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0096300315001514
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.amc.2015.01.119?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. Zhong-Zhi Bai, 2001. "Modified Block SSOR Preconditioners for Symmetric Positive Definite Linear Systems," Annals of Operations Research, Springer, vol. 103(1), pages 263-282, March.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Fan, Hong-Tao & Zhang, Yan-Jun & Li, Ya-Jing, 2019. "A modified block preconditioner for complex nonsymmetric indefinite linear systems," Applied Mathematics and Computation, Elsevier, vol. 358(C), pages 455-467.
    2. Wu, Hongyu & Xiang, Shuhuang, 2021. "A new constraint preconditioner based on the PGSS iteration method for non-Hermitian generalized saddle point problems," Applied Mathematics and Computation, Elsevier, vol. 396(C).
    3. Shen, Hai-Long & Wu, Hong-Yu & Shao, Xin-Hui, 2021. "A simplified PSS preconditioner for non-Hermitian generalized saddle point problems," Applied Mathematics and Computation, Elsevier, vol. 394(C).

    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. Dai, Ping-Fan & Li, Jicheng & Bai, Jianchao & Qiu, Jinming, 2019. "A preconditioned two-step modulus-based matrix splitting iteration method for linear complementarity problem," Applied Mathematics and Computation, Elsevier, vol. 348(C), pages 542-551.

    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:258:y:2015:i:c:p:36-48. 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.