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

A general class of constraint preconditioners for generalized saddle point linear systems

Author

Listed:
  • Wu, Hong-Yu

Abstract

We propose a general class of constraint preconditioners for solving generalized saddle point linear systems, derived from a general matrix splitting of the (1,1) block of the coefficient matrix. This new constraint preconditioner can not only reduce to some existing constraint preconditioners, but also induce new constraint preconditioners under some certain matrix splitting schemes. Then we present invertibility conditions of the proposed constraint preconditioner and establish the convergence analysis of the corresponding constraint preconditioning iteration method. Numerical examples are provided to confirm that the proposed preconditioner outperforms existing ones when suitable matrix splitting schemes are chosen.

Suggested Citation

  • Wu, Hong-Yu, 2025. "A general class of constraint preconditioners for generalized saddle point linear systems," Applied Mathematics and Computation, Elsevier, vol. 489(C).
    • Handle: RePEc:eee:apmaco:v:489:y:2025:i:c:s009630032400609x
    DOI: 10.1016/j.amc.2024.129148
    as

    Download full text from publisher

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

      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:489:y:2025:i:c:s009630032400609x. 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.