Convergence and Optimality of Adaptive Least Squares Finite Element Methods
Convergence and Optimality of Adaptive Least Squares Finite Element Methods
复制标题
自适应最小二乘有限元方法的收敛性和最优性
DOI:
--
复制
发表时间:
2015
影响因子:
2.9
通讯作者:
Eun‐Jae Park
中科院分区:
文献类型:
--
作者:
C. Carstensen;Eun‐Jae Park
The first-order div least squares finite element methods (LSFEMs) allow for an immediate a posteriori error control by the computable residual of the least squares functional. This paper establishes an adaptive refinement strategy based on some equivalent refinement indicators. Since the first-order div LSFEM measures the flux errors in $H$(div), the data resolution error measures the $L^2$ norm of the right-hand side $f$ minus the piecewise polynomial approximation $Pi f$ without a mesh-size factor. Hence the data resolution term is neither an oscillation nor of higher order and consequently requires a particular treatment, e.g., by the thresholding second algorithm due to Binev and DeVore. The resulting novel adaptive LSFEM with separate marking converges with optimal rates relative to the notion of a nonlinear approximation class.