Justification of the saturation assumption

被引:13
作者
Carstensen, C. [1 ]
Gallistl, D. [2 ]
Gedicke, J. [3 ]
机构
[1] Humboldt Univ, Inst Math, Unter Linden 6, D-10099 Berlin, Germany
[2] Univ Bonn, Inst Numer Simulat, Wegelerstr 6, D-53115 Bonn, Germany
[3] Heidelberg Univ, Interdisziplinares Zentrum Wissensch Rechnen IWR, Math Methoden Simulat, Neuenheimer Feld 368, D-69120 Heidelberg, Germany
基金
新加坡国家研究基金会;
关键词
FINITE-ELEMENT-METHOD;
D O I
10.1007/s00211-015-0769-7
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
The saturation assumption is widely used in computational science and engineering, usually without any rigorous theoretical justification and even despite of counterexamples for some coarse meshes known in the mathematical literature. On the other hand, there is overwhelming numerical evidence at least in an asymptotic regime for the validity of the saturation. In the generalized form, the assumption states, for any , that parallel to vertical bar u - (U) over cap vertical bar parallel to(2) <= (1 - epsilon/C)parallel to vertical bar u - U vertical bar parallel to(2) + epsilon osc(2)(f, N) (SA) for the exact solution u and the first-order conforming finite element solution U (resp. ) of the Poisson model problem with respect to a regular triangulation (resp. ) and its uniform refinement within the class of admissible triangulations. The point is that the patch-oriented oscillations vanish for constant right-hand sides and may be of higher order for smooth f, while the strong reduction factor involves some universal constant C which exclusively depends on the set of admissible triangulations and so on the initial triangulation only. This paper proves the inequality (SA) for the energy norms of the errors for any admissible triangulation in up to computable pathological situations characterized by failing the weak saturation test (WS). This computational test (WS) for some triangulation states that the solutions U and do not coincide for the constant right-hand side . The set of possible counterexamples is characterized as with no interior node or exactly one interior node which is the vertex of all triangles and is a particular uniform bisec3 refinement. In particular, the strong saturation assumption holds for all triangulations with more than one degree of freedom. The weak saturation test (WS) is only required for zero or one degree of freedom and gives a definite outcome with O(1) operations. The only counterexamples known so far are regular n-polygons. The paper also discusses a generalization to linear elliptic second-order PDEs with small convection to prove that saturation is somehow generic and fails only in very particular situations characterised by (WS).
引用
收藏
页码:1 / 25
页数:25
相关论文
共 15 条
[1]  
Ainsworth M., 2000, PURE APPL MATH NEW Y
[2]   A POSTERIORI ERROR-ESTIMATES BASED ON HIERARCHICAL BASES [J].
BANK, RE ;
SMITH, RK .
SIAM JOURNAL ON NUMERICAL ANALYSIS, 1993, 30 (04) :921-935
[3]   A convergent adaptive finite element method for an optimal design problem [J].
Bartels, Soren ;
Carstensen, Carsten .
NUMERISCHE MATHEMATIK, 2008, 108 (03) :359-385
[4]   Edge residuals dominate A posteriori error estimates for low order finite element methods [J].
Carsten, C ;
Verfürth, R .
SIAM JOURNAL ON NUMERICAL ANALYSIS, 1999, 36 (05) :1571-1587
[5]   An adaptive finite element method with asymptotic saturation for eigenvalue problems [J].
Carstensen, C. ;
Gedicke, J. ;
Mehrmann, V. ;
Miedlar, A. .
NUMERISCHE MATHEMATIK, 2014, 128 (04) :615-634
[6]   Each averaging technique yields reliable a posteriori error control in FEM on unstructured grids. Part I: Low order conforming, nonconforming, and mixed FEM [J].
Carstensen, C ;
Bartels, S .
MATHEMATICS OF COMPUTATION, 2002, 71 (239) :945-969
[7]  
Carstensen C, 1999, RAIRO-MATH MODEL NUM, V33, P1187
[8]   Quasi-optimal convergence rate for an adaptive finite element method [J].
Cascon, J. Manuel ;
Kreuzer, Christian ;
Nochetto, Ricardo H. ;
Siebert, Kunibert G. .
SIAM JOURNAL ON NUMERICAL ANALYSIS, 2008, 46 (05) :2524-2550
[9]   Small data oscillation implies the saturation assumption [J].
Dörfler, W ;
Nochetto, RH .
NUMERISCHE MATHEMATIK, 2002, 91 (01) :1-12
[10]   A convergent adaptive algorithm for Poisson's equation [J].
Dorfler, W .
SIAM JOURNAL ON NUMERICAL ANALYSIS, 1996, 33 (03) :1106-1124