IDEAS home Printed from https://ideas.repec.org/a/spr/coopap/v73y2019i3d10.1007_s10589-019-00094-w.html
   My bibliography  Save this article

The Uzawa-MBB type algorithm for nonsymmetric saddle point problems

Author

Listed:
  • Zhitao Xu

    (Peking University)

  • Li Gao

    (Peking University)

Abstract

The Uzawa type algorithms have shown themselves to be competitive for solving large and sparse saddle point problems. They reduce the original problem to a lower-dimensional linear system and solve the derived equation instead. In this paper, we propose new Uzawa-MBB type and preconditioned Uzawa-MBB type algorithms for the nonsymmetric saddle point problems. The main contributions of the paper are that both of the new algorithms are constructed from optimization algorithms, use a special descent direction based on Xu et al. (A new Uzawa-exact type algorithm for nonsymmetric saddle point problems, 2018. arXiv preprint arXiv:1802.04135 ), and combine the modified Barzilai–Borwein method with modified GLL line search strategy to solve the derived least squares problem. In addition, we analyze the convergence of the two new algorithms. Applications to finite element discretization of Navier–Stokes equation with an unstable pair of approximation spaces, i.e. Q1–P0 pair, are discussed and the results of the numerical experiments of applying our new algorithms are reported, which demonstrate the competitive performance of the preconditioned Uzawa-MBB type algorithms with Krylov subspace methods.

Suggested Citation

  • Zhitao Xu & Li Gao, 2019. "The Uzawa-MBB type algorithm for nonsymmetric saddle point problems," Computational Optimization and Applications, Springer, vol. 73(3), pages 933-956, July.
  • Handle: RePEc:spr:coopap:v:73:y:2019:i:3:d:10.1007_s10589-019-00094-w
    DOI: 10.1007/s10589-019-00094-w
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10589-019-00094-w
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.

    File URL: https://libkey.io/10.1007/s10589-019-00094-w?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. W. Liu & Y. H. Dai, 2001. "Minimization Algorithms Based on Supervisor and Searcher Cooperation," Journal of Optimization Theory and Applications, Springer, vol. 111(2), pages 359-379, November.
    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. K. Sirlantzis & J. D. Lamb & W. B. Liu, 2006. "Novel Algorithms for Noisy Minimization Problems with Applications to Neural Networks Training," Journal of Optimization Theory and Applications, Springer, vol. 129(2), pages 325-340, May.
    2. Zhong-bao Wang & Xue Chen & Jiang Yi & Zhang-you Chen, 2022. "Inertial projection and contraction algorithms with larger step sizes for solving quasimonotone variational inequalities," Journal of Global Optimization, Springer, vol. 82(3), pages 499-522, March.

    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:spr:coopap:v:73:y:2019:i:3:d:10.1007_s10589-019-00094-w. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.