Sparse shape functions for tetrahedral p-FEM using integrated Jacobi polynomials
In this paper, we investigate the discretization of an elliptic boundary value problem in 3D by means of the hp-version of the finite element method using a mesh of tetrahedrons. We present several bases based on integrated Jacobi polynomials in which the element stiffness matrix has O(p(3)) nonzero entries, where p denotes the polynomial degree. The proof of the sparsity requires the assistance of computer algebra software. Several numerical experiments show the efficiency of the proposed bases for higher polynomial degrees p.
computer algebra high-order finite elements orthogonal polynomials solution of discretized equations