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

The generalized modified shift-splitting preconditioners for nonsymmetric saddle point problems

Author

Listed:
  • Huang, Zheng-Ge
  • Wang, Li-Gong
  • Xu, Zhong
  • Cui, Jing-Jing

Abstract

For a nonsymmetric saddle point problem, the modified shift-splitting (MSS) preconditioner has been proposed by Zhou et al. By replacing the parameter α in (2,2)-block in the MSS preconditioner by another parameter β, a generalized MSS (GMSS) preconditioner is established in this paper, which results in a fixed point iteration called the GMSS iteration method. We provide the convergent and semi-convergent analysis of the GMSS iteration method, which show that this method is convergence and semi-convergence if the related parameters satisfy suitable restrictions. Meanwhile, the distribution of eigenvalues and the forms of the eigenvectors of the preconditioned matrix are analyzed in detail. Finally, numerical examples show that the GMSS method is more feasibility and robustness than the MSS, Uzawa-HSS and PU-STS methods as a solver, and the GMSS preconditioner outperforms the GSOR, Uzawa-HSS, MSS and LMSS preconditioners for the GMRES method for solving both the nonsingular and the singular saddle point problems with nonsymmetric positive definite and symmetric dominant (1,1) parts.

Suggested Citation

  • Huang, Zheng-Ge & Wang, Li-Gong & Xu, Zhong & Cui, Jing-Jing, 2017. "The generalized modified shift-splitting preconditioners for nonsymmetric saddle point problems," Applied Mathematics and Computation, Elsevier, vol. 299(C), pages 95-118.
    • Handle: RePEc:eee:apmaco:v:299:y:2017:i:c:p:95-118
    DOI: 10.1016/j.amc.2016.11.038
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0096300316307147
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.amc.2016.11.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.

    References listed on IDEAS

    as
    1. Yang, Ai-Li & Li, Xu & Wu, Yu-Jiang, 2015. "On semi-convergence of the Uzawa–HSS method for singular saddle-point problems," Applied Mathematics and Computation, Elsevier, vol. 252(C), pages 88-98.
    2. Chen, Cai-Rong & Ma, Chang-Feng, 2015. "A generalized shift-splitting preconditioner for singular saddle point problems," Applied Mathematics and Computation, Elsevier, vol. 269(C), pages 947-955.
    3. Chen, Fang, 2015. "On choices of iteration parameter in HSS method," Applied Mathematics and Computation, Elsevier, vol. 271(C), pages 832-837.
    4. Huang, Na & Ma, Chang-Feng & Xie, Ya-Jun, 2015. "An inexact relaxed DPSS preconditioner for saddle point problem," Applied Mathematics and Computation, Elsevier, vol. 265(C), pages 431-447.
    5. Tang, Jia & Xie, Ya-Jun & Ma, Chang-Feng, 2015. "A modified product preconditioner for indefinite and asymmetric generalized saddle-point matrices," Applied Mathematics and Computation, Elsevier, vol. 268(C), pages 303-310.
    Full references (including those not matched with items on IDEAS)

    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. Ling, Si-Tao & Liu, Qing-Bing, 2017. "New local generalized shift-splitting preconditioners for saddle point problems," Applied Mathematics and Computation, Elsevier, vol. 302(C), pages 58-67.
    2. Li, Zhizhi & Chu, Risheng & Zhang, Huai, 2019. "Accelerating the shift-splitting iteration algorithm," Applied Mathematics and Computation, Elsevier, vol. 361(C), pages 421-429.
    3. Ke, Yi-Fen & Ma, Chang-Feng, 2017. "The dimensional splitting iteration methods for solving saddle point problems arising from time-harmonic eddy current models," Applied Mathematics and Computation, Elsevier, vol. 303(C), pages 146-164.
    4. Tang, Jia & Xie, Ya-Jun & Ma, Chang-Feng, 2015. "A modified product preconditioner for indefinite and asymmetric generalized saddle-point matrices," Applied Mathematics and Computation, Elsevier, vol. 268(C), pages 303-310.
    5. Li, Chengliang & Ma, Changfeng & Xu, Xiaofang, 2020. "A class of efficient parameterized shift-splitting preconditioners for block two-by-two linear systems," Applied Mathematics and Computation, Elsevier, vol. 369(C).
    6. Huang, Zheng-Ge & Wang, Li-Gong & Xu, Zhong & Cui, Jing-Jing, 2020. "An efficient preconditioned variant of the PSS preconditioner for generalized saddle point problems," Applied Mathematics and Computation, Elsevier, vol. 376(C).
    7. Cao, Yang & Yi, Shi-Chao, 2016. "A class of Uzawa-PSS iteration methods for nonsingular and singular non-Hermitian saddle point problems," Applied Mathematics and Computation, Elsevier, vol. 275(C), pages 41-49.
    8. Kai Jiang & Jianghao Su & Juan Zhang, 2022. "A Data-Driven Parameter Prediction Method for HSS-Type Methods," Mathematics, MDPI, vol. 10(20), pages 1-24, October.
    9. Miao, Shu-Xin, 2017. "A new Uzawa-type method for saddle point problems," Applied Mathematics and Computation, Elsevier, vol. 300(C), pages 95-102.
    10. Dai, Lifang & Liang, Maolin & Fan, Hongtao, 2015. "A new generalized parameterized inexact Uzawa method for solving saddle point problems," Applied Mathematics and Computation, Elsevier, vol. 265(C), pages 414-430.
    11. Chen, Cai-Rong & Ma, Chang-Feng, 2015. "A generalized shift-splitting preconditioner for singular saddle point problems," Applied Mathematics and Computation, Elsevier, vol. 269(C), pages 947-955.
    12. Huang, Na & Ma, Chang-Feng & Xie, Ya-Jun, 2015. "An inexact relaxed DPSS preconditioner for saddle point problem," Applied Mathematics and Computation, Elsevier, vol. 265(C), pages 431-447.

    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:299:y:2017:i:c:p:95-118. 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.