Convergence Rates of Adaptive Methods, Besov Spaces, and Multilevel Approximation

被引:0
作者
Tsogtgerel Gantumur
机构
[1] McGill University,Department of Mathematics and Statistics
来源
Foundations of Computational Mathematics | 2017年 / 17卷
关键词
Approximation classes; Adaptivity; Finite element methods; Convergence rates; Besov spaces; Multilevel approximation; 41A25; 41A65; 65N15; 65N30;
D O I
暂无
中图分类号
学科分类号
摘要
This paper concerns characterizations of approximation classes associated with adaptive finite element methods with isotropic h-refinements. It is known from the seminal work of Binev, Dahmen, DeVore and Petrushev that such classes are related to Besov spaces. The range of parameters for which the inverse embedding results hold is rather limited, and recently, Gaspoz and Morin have shown, among other things, that this limitation disappears if we replace Besov spaces by suitable approximation spaces associated with finite element approximation from uniformly refined triangulations. We call the latter spaces multievel approximation spaces and argue that these spaces are placed naturally halfway between adaptive approximation classes and Besov spaces, in the sense that it is more natural to relate multilevel approximation spaces with either Besov spaces or adaptive approximation classes, than to go directly from adaptive approximation classes to Besov spaces. In particular, we prove embeddings of multilevel approximation spaces into adaptive approximation classes, complementing the inverse embedding theorems of Gaspoz and Morin. Furthermore, in the present paper, we initiate a theoretical study of adaptive approximation classes that are defined using a modified notion of error, the so-called total error, which is the energy error plus an oscillation term. Such approximation classes have recently been shown to arise naturally in the analysis of adaptive algorithms. We first develop a sufficiently general approximation theory framework to handle such modifications, and then apply the abstract theory to second-order elliptic problems discretized by Lagrange finite elements, resulting in characterizations of modified approximation classes in terms of memberships of the problem solution and data into certain approximation spaces, which are in turn related to Besov spaces. Finally, it should be noted that throughout the paper we paid equal attention to both conforming and non-conforming triangulations.
引用
收藏
页码:917 / 956
页数:39
相关论文
共 31 条
[1]  
Binev P(2004)Adaptive finite element methods with convergence rates Numer. Math. 97 219-268
[2]  
Dahmen W(1967)Piecewise polynomial approximations of functions of classes Mat. Sb. (N.S.) 73 331-335
[3]  
DeVore R(2010)Quasi-optimal convergence rate of an adaptive discontinuous Galerkin method SIAM J. Numer. Anal. 48 734-771
[4]  
Birman MS(2008)Quasi-optimal convergence rate for an adaptive finite element method SIAM J. Numer. Anal. 46 2524-2550
[5]  
Solomyak MZ(2001)Adaptive wavelet methods for elliptic operator equations: convergence rates Math. Comp. 70 27-75
[6]  
Bonito A(2004)Whitney estimates for convex domains with applications to multivariate piecewise polynomial approximation Found. Comput. Math. 4 345-368
[7]  
Nochetto RH(1996)A convergent adaptive algorithm for Poisson’s equation SIAM J. Numer. Anal. 33 1106-1124
[8]  
Cascon JM(2014)Adaptive FEM with optimal convergence rates for a certain class of nonsymmetric and possibly nonlinear problems SIAM J. Numer. Anal. 52 601-625
[9]  
Kreuzer C(2007)An optimal adaptive wavelet method without coarsening of the iterands Math. Comp. 76 615-629
[10]  
Nochetto RH(2000)Data oscillation and convergence of adaptive FEM SIAM J. Numer. Anal. 38 466-488