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 条
  • [31] Inexact asymmetric forward-backward-adjoint splitting algorithms for saddle point problems
    Fan Jiang
    Xingju Cai
    Deren Han
    Numerical Algorithms, 2023, 94 : 479 - 509
  • [32] Eigenvalue bounds for double saddle-point systems
    Bradley, Susanne
    Greif, Chen
    IMA JOURNAL OF NUMERICAL ANALYSIS, 2023, 43 (06) : 3564 - 3592
  • [34] ERROR BOUNDS FOR ENERGY AND OVERLAP OF APPROXIMATE WAVEFUNCTIONS
    GORDON, RG
    JOURNAL OF CHEMICAL PHYSICS, 1968, 48 (11): : 4984 - &
  • [35] APPROXIMATE ERROR-BOUNDS FOR SIMULATED HYDROGRAPHS
    GAREN, DC
    BURGES, SJ
    JOURNAL OF THE HYDRAULICS DIVISION-ASCE, 1981, 107 (11): : 1519 - 1534
  • [36] Approximate aggregate queries with guaranteed error bounds
    Chun, SJ
    Lee, JH
    Lee, SL
    ROUGH SETS, FUZZY SETS, DATA MINING, AND GRANULAR COMPUTING, 2003, 2639 : 627 - 630
  • [37] Backward error bounds for approximate Krylov subspaces
    Stewart, GW
    LINEAR ALGEBRA AND ITS APPLICATIONS, 2002, 340 : 81 - 86
  • [38] APPROXIMATE INTEGRATION WITH BUILT-IN ERROR BOUNDS
    SARAFYAN, D
    OUTLAW, C
    NOTICES OF THE AMERICAN MATHEMATICAL SOCIETY, 1975, 22 (01): : A247 - A247
  • [39] On the iterative algorithm for saddle point problems
    Cui, Mingrong
    APPLIED MATHEMATICS AND COMPUTATION, 2008, 204 (01) : 10 - 13
  • [40] Robust preconditioners for saddle point problems
    Axelsson, O
    Neytcheva, M
    NUMERICAL METHODS AND APPLICATIONS, 2003, 2542 : 158 - 166