Fine error bounds for approximate asymmetric saddle point problems

被引:0
|
作者
Ruas, Vitoriano [1 ]
机构
[1] Sorbonne Univ, Inst Jean Rond Alembert, Fac Sci & Ingn, CNRS,UMR 7190, Campus Pierre & Marie Curie, F-75005 Paris, France
来源
COMPUTATIONAL & APPLIED MATHEMATICS | 2024年 / 43卷 / 04期
关键词
Asymmetric saddle-point problem; Error bounds; Inf-sup conditions; Mixed finite elements; Stability constants; UNIQUENESS; EXISTENCE;
D O I
10.1007/s40314-024-02678-7
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
The theory of mixed finite element methods for solving different types of elliptic partial differential equations in saddle point formulation is well established since many decades. This topic was mostly studied for variational formulations defined upon the same product spaces of both shape- and test-pairs of primal variable-multiplier. Whenever either these spaces or the two bilinear forms involving the multiplier are distinct, the saddle point problem is asymmetric. The three inf-sup conditions to be satisfied by the product spaces stipulated in work on the subject, to guarantee well-posedness, are known [(see, e.g., Exercise 2.14 of Ern and Guermond (Theory and practice of finite elements, Applied mathematical, sciences, Springer, 2004)]. However, the material encountered in the literature addressing the approximation of this class of problems left room for improvement and clarifications. After making a brief review of the existing contributions to the topic that justifies such an assertion, in this paper we set up finer global error bounds for the pair primal variable-multiplier solving an asymmetric saddle point problem. Besides well-posedness, the three constants in the aforementioned inf-sup conditions are identified as all that is needed for determining the stability constant appearing therein, whose expression is exhibited. As a complement, refined error bounds depending only on these three constants are given for both unknowns separately.
引用
收藏
页数:10
相关论文
共 50 条
  • [1] Generalization Bounds for Stochastic Saddle Point Problems
    Zhang, Junyu
    Hong, Mingyi
    Wang, Mengdi
    Zhang, Shuzhong
    24TH INTERNATIONAL CONFERENCE ON ARTIFICIAL INTELLIGENCE AND STATISTICS (AISTATS), 2021, 130 : 568 - +
  • [2] INTERVAL BOUNDS AND EQUIVALENT PROBLEMS IN SADDLE-POINT PROBLEMS
    CHAN, WL
    HO, LF
    LAU, WT
    NONLINEAR ANALYSIS-THEORY METHODS & APPLICATIONS, 1986, 10 (09) : 931 - 942
  • [3] AN IMPLICIT APPROXIMATE INVERSE PRECONDITIONER FOR SADDLE POINT PROBLEMS
    Le Borne, Sabine
    Ngufor, Che
    ELECTRONIC TRANSACTIONS ON NUMERICAL ANALYSIS, 2010, 37 : 173 - 188
  • [4] An implicit approximate inverse preconditioner for saddle point problems
    Borne, Sabine Le
    Ngufor, Che
    Electronic Transactions on Numerical Analysis, 2010, 37 : 173 - 188
  • [5] Approximate saddle point assertions for a general class of approximation problems
    Breckner, WW
    Sekatzek, M
    Tammer, C
    APPROXIMATION, OPTIMIZATION AND MATHEMATICAL ECONOMICS, 2001, : 71 - 80
  • [6] A sharp error bound of the approximate solutions for saddle point linear systems
    Miyajima, Shinya
    JOURNAL OF COMPUTATIONAL AND APPLIED MATHEMATICS, 2015, 277 : 36 - 46
  • [7] A shift-splitting preconditioner for asymmetric saddle point problems
    Shi-Liang Wu
    Davod Khojasteh Salkuyeh
    Computational and Applied Mathematics, 2020, 39
  • [8] A shift-splitting preconditioner for asymmetric saddle point problems
    Wu, Shi-Liang
    Salkuyeh, Davod Khojasteh
    COMPUTATIONAL & APPLIED MATHEMATICS, 2020, 39 (04):
  • [9] Two block triangular preconditioners for asymmetric saddle point problems
    Li, Cui-Xia
    Wu, Shi-Liang
    APPLIED MATHEMATICS AND COMPUTATION, 2015, 269 : 456 - 463
  • [10] Structured backward error analysis for generalized saddle point problems
    Bing Zheng
    Peng Lv
    Advances in Computational Mathematics, 2020, 46