Related papers: Numerical studies of serendipity and tensor produc…
Many conforming finite elements on squares and cubes are elegantly classified into families by the language of finite element exterior calculus and presented in the Periodic Table of the Finite Elements. Use of these elements varies, based…
Using the notion of multivariate lower set interpolation, we construct nodal basis functions for the serendipity family of finite elements, of any order and any dimension. For the purpose of computation, we also show how to express these…
Using the language of finite element exterior calculus, we define two families of $H^1$-conforming finite element spaces over pyramids with a parallelogram base. The first family has matching polynomial traces with tensor product elements…
We present an implementation of the trimmed serendipity finite element family, using the open source finite element package Firedrake. The new elements can be used seamlessly within the software suite for problems requiring $H^1$, \hcurl,…
We introduce new Hermite-style and Bernstein-style geometric decompositions of the cubic order serendipity finite element spaces $S_3(I^2)$ and $S_3(I^3)$, as defined in the recent work of Arnold and Awanou [Found. Comput. Math. 11 (2011),…
We introduce a finite element construction for use on the class of convex, planar polygons and show it obtains a quadratic error convergence estimate. On a convex n-gon satisfying simple geometric criteria, our construction produces 2n…
A tensor in applied mathematics is usually defined as a multidimensional array of numbers. This presumes a choice of basis in $\mathbb{R}^n$ or in some other vector space, and tensorial concepts are defined accordingly. In this article we…
We present a higher order stabilization-free virtual element method applied to plane elasticity problems. We utilize a serendipity approach to reduce the total number of degrees of freedom from the corresponding high-order approximations.…
We construct new families of direct serendipity and direct mixed finite elements on general planer convex polygons that are $H^1$ and $H(div)$ conforming, respectively, and possess optimal order of accuracy for any order. They have a…
While solving Partial Differential Equations (PDEs) with finite element methods (FEM), serendipity elements allow us to obtain the same order of accuracy as rectangular tensor-product elements with many fewer degrees of freedom (DOFs). To…
The classical serendipity and mixed finite element spaces suffer from poor approximation on nondegenerate, convex quadrilaterals. In this paper, we develop $\textit{direct serendipity}$ and $\textit{direct mixed}$ finite element spaces,…
We introduce a new variant of Nodal Virtual Element spaces that mimics the "Serendipity Finite Element Methods" (whose most popular example is the 8-node quadrilateral) and allows to reduce (often in a significant way) the number of…
This paper is concerned with the approximation of tensors using tree-based tensor formats, which are tensor networks whose graphs are dimension partition trees. We consider Hilbert tensor spaces of multivariate functions defined on a…
We introduce the family of trimmed serendipity finite element differential form spaces, defined on cubical meshes in any number of dimensions, for any polynomial degree, and for any form order. The relation between the trimmed serendipity…
Large-scale eigenvalue problems arise in various fields of science and engineering and demand computationally efficient solutions. In this study, we investigate the subspace approximation for parametric linear eigenvalue problems, aiming to…
Tensors of order three or higher have found applications in diverse fields, including image and signal processing, data mining, biomedical engineering and link analysis, to name a few. In many applications that involve for example time…
One of the most used approaches in simulating materials is the tight-binding approximation. When using this method in a material simulation, it is necessary to compute the eigenvalues and eigenvectors of the Hamiltonian describing the…
The method of self-similar factor approximants is completed by defining the approximants of odd orders, constructed from the power series with the largest term of an odd power. It is shown that the method provides good approximations for…
Tensor methods have become a promising tool to solve high-dimensional problems in the big data era. By exploiting possible low-rank tensor factorization, many high-dimensional model-based or data-driven problems can be solved to facilitate…
In the framework of generalized finite element methods for elliptic equations with rough coefficients, efficiency and accuracy of the numerical method depend critically on the use of appropriate basis functions. This work explores several…