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

Variants of the Uzawa method for three-order block saddle point problem

Author

Listed:
  • Wang, Na-Na
  • Li, Ji-Cheng
  • Li, Guo
  • Kong, Xu

Abstract

In this paper, we first propose three kinds of variants of the Uzawa method for solving three-order block saddle point problem and study the convergence conditions of the proposed methods. Second, we obtain the approximate optimal relaxation factors of the three proposed Uzawa type methods by using variable control method. Finally, the experimental results show that our proposed Uzawa type methods for solving three-order block saddle point problem have less workload per iteration step than the corresponding Uzawa type methods for solving standard saddle point problem, which explains that our proposed methods are feasible and efficient.

Suggested Citation

  • Wang, Na-Na & Li, Ji-Cheng & Li, Guo & Kong, Xu, 2017. "Variants of the Uzawa method for three-order block saddle point problem," Applied Mathematics and Computation, Elsevier, vol. 305(C), pages 188-202.
    • Handle: RePEc:eee:apmaco:v:305:y:2017:i:c:p:188-202
    DOI: 10.1016/j.amc.2017.01.051
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0096300317300693
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.amc.2017.01.051?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. Li, Ji-Cheng & Wang, Na-Na & Kong, Xu, 2015. "Uzawa-Low method and preconditioned Uzawa-Low method for three-order block saddle point problem," Applied Mathematics and Computation, Elsevier, vol. 269(C), pages 626-636.
    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:305:y:2017:i:c:p:188-202. 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.