On the exponent of exponential convergence of the -version FEM spaces
arXiv:1704.08046
Abstract
We study the exponent of the exponential rate of convergence in terms of the number of degrees of freedom for various non-standard {-version} finite element spaces employing reduced cardinality basis. More specifically, we show that serendipity finite element methods and discontinuous Galerkin finite element methods with total degree basis have a faster exponential convergence with respect to the number of degrees of freedom than their counterparts employing the tensor product basis for quadrilateral/hexahedral elements, for piecewise analytic problems under -refinement. The above results are proven by using a new -optimal error bound for the -orthogonal projection onto the total degree basis, and for the -projection onto the serendipity finite element space over tensor product elements with dimension . These new -optimal error bounds lead to a larger exponent of the exponential rate of convergence with respect to the number of degrees of freedom. Moreover, these results show that part of the basis functions in basis {plays} no roles in achieving the -optimal error bound in the Sobolev space. The sharpness of theoretical results is also verified by a series of numerical examples.