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

The BGS–Uzawa and BJ–Uzawa iterative methods for solving the saddle point problem

Author

Listed:
  • Huang, Na
  • Ma, Changfeng

Abstract

In this paper, we propose two new iterative methods for solving the nonsingular saddle point problem based on partitioning the coefficient matrix. One is combining the block Gauss–Seidel iterative method with the Uzawa iterative method, and the other one is combining the block Jacobi iterative method with the Uzawa iterative method. Then we study the convergence of the two novel methods under suitable restrictions on the iteration parameters, respectively. Numerical experiments are also presented to illustrate the behavior of the considered algorithms.

Suggested Citation

  • Huang, Na & Ma, Changfeng, 2015. "The BGS–Uzawa and BJ–Uzawa iterative methods for solving the saddle point problem," Applied Mathematics and Computation, Elsevier, vol. 256(C), pages 94-108.
    • Handle: RePEc:eee:apmaco:v:256:y:2015:i:c:p:94-108
    DOI: 10.1016/j.amc.2014.12.156
    as

    Download full text from publisher

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

    Citations

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


    Cited by:

    1. 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.
    2. 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:256:y:2015:i:c:p:94-108. 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.