Two families of C1-Pk Fraeijs de Veubeke-Sander finite elements on quadrilateral meshes
Shangyou Zhang
TL;DR
This work extends the $C^1$-$P_k$ Fraeijs de Veubeke-Sander finite elements to general quadrilateral meshes by subdividing each quadrilateral into four triangles and using four $P_k$ pieces per quad. It introduces two global finite element spaces: a full space $V_h^{(1)}$ on the macro-mesh and a condensed space $V_h^{(2)}$ with edge-dof condensation, both enabling $C^1$ continuity across quadrilaterals. Uni-solvency is established via a key lemma on triangular patches, and optimal convergence is proven for $k\ge 3$ with the error bound $|u-u_h|_0 + h|u-u_h|_1 + h^2|u-u_h|_2 \le C h^{k+1} |u|_{k+1}$. Numerical tests show that the full-space elements retain optimal convergence for interface problems, while condensed elements offer higher accuracy in smooth cases but may degrade to $O(h^{1/2})$ when coefficient jumps occur, highlighting a trade-off between degrees of freedom and robustness.
Abstract
We extend the $C^1$-$P_3$ Fraeijs de Veubeke-Sander finite element to two families of $C^1$-$P_k$ ($k>3$) macro finite elements on general quadrilateral meshes. On each quadrilateral, four $P_k$ polynomials are defined on the four triangles subdivided from the quadrilateral by its two diagonal lines. The first family of $C^1$-$P_k$ finite elements is the full $C^1$-$P_k$ space on the macro-mesh. Thus the element can be applied to interface problems. The second family of $C^1$-$P_k$ finite elements condenses all internal degrees of freedom by moving them to the four edges. Thus the second element method has much less unknowns but is more accurate than the first one. We prove the uni-solvency and the optimal order convergence. Numerical tests and comparisons with the $C^1$-$P_k$ Argyris are provided.
