We give a new, simple, dimension-independent definition of the serendipity finite element family. The shape functions are the span of all monomials which are linear in at least s−r of the variables where s is the degree of the monomial or, equivalently, whose superlinear degree (total degree with respect to variables entering at least quadratically) is at most r. The degrees of freedom are given by moments of degree at most r−2d on each face of dimension d. We establish unisolvence and a geometric decomposition of the space.
%0 Journal Article
%1 Arnold2011Serendipity
%A Arnold, Douglas N.
%A Awanou, Gerard
%B Foundations of Computational Mathematics
%D 2011
%I Springer
%J Foundations of Computational Mathematics
%K 41a10-approximation-by-polynomials 41a63-multidimensional-approximations-and-expansions 65n30-pdes-bvps-finite-elements
%N 3
%P 337--344
%R 10.1007/s10208-011-9087-3
%T The Serendipity Family of Finite Elements
%U http://dx.doi.org/10.1007/s10208-011-9087-3
%V 11
%X We give a new, simple, dimension-independent definition of the serendipity finite element family. The shape functions are the span of all monomials which are linear in at least s−r of the variables where s is the degree of the monomial or, equivalently, whose superlinear degree (total degree with respect to variables entering at least quadratically) is at most r. The degrees of freedom are given by moments of degree at most r−2d on each face of dimension d. We establish unisolvence and a geometric decomposition of the space.
@article{Arnold2011Serendipity,
abstract = {{We give a new, simple, dimension-independent definition of the serendipity finite element family. The shape functions are the span of all monomials which are linear in at least s−r of the variables where s is the degree of the monomial or, equivalently, whose superlinear degree (total degree with respect to variables entering at least quadratically) is at most r. The degrees of freedom are given by moments of degree at most r−2d on each face of dimension d. We establish unisolvence and a geometric decomposition of the space.}},
added-at = {2019-03-01T00:11:50.000+0100},
author = {Arnold, Douglas N. and Awanou, Gerard},
biburl = {https://www.bibsonomy.org/bibtex/25be618a51444cd0e81c242afea935662/gdmcbain},
booktitle = {Foundations of Computational Mathematics},
citeulike-article-id = {8957389},
citeulike-linkout-0 = {http://dx.doi.org/10.1007/s10208-011-9087-3},
citeulike-linkout-1 = {http://www.springerlink.com/content/r75126581hhx6943},
citeulike-linkout-2 = {http://link.springer.com/article/10.1007/s10208-011-9087-3},
day = 1,
doi = {10.1007/s10208-011-9087-3},
interhash = {c225a761ef19a152c27c94d758b7c2c9},
intrahash = {5be618a51444cd0e81c242afea935662},
issn = {1615-3375},
journal = {Foundations of Computational Mathematics},
keywords = {41a10-approximation-by-polynomials 41a63-multidimensional-approximations-and-expansions 65n30-pdes-bvps-finite-elements},
month = mar,
number = 3,
pages = {337--344},
posted-at = {2017-10-12 23:12:11},
priority = {2},
publisher = {Springer},
timestamp = {2019-03-01T00:11:50.000+0100},
title = {{The Serendipity Family of Finite Elements}},
url = {http://dx.doi.org/10.1007/s10208-011-9087-3},
volume = 11,
year = 2011
}