Sparsity optimized high order finite element functions for \(H(\mathrm{curl})\) on tetrahedra (Q394759): Difference between revisions

The paper is concerned with the construction of sparsity basis functions for \(H\)(curl) Sobolev-type spaces. These optimized basis are mainly defined by using Jacobi-type polynomials and means over general tetrahedra. The first part deals with the variational formulation for Maxwell's equations, in relationship with the finite element method and the function space \(H\)(curl). Next, the authors define the basis functions on a general three-dimensional simplex. Sparsity optimization of high-order basis functions on simplices relies on using particularly chosen Jacobi-type polynomials and some of their basic properties that are introduced in the next section. In the following, the algorithm is described that evaluates the integrals which yield the entries of the inner blocks of the local system matrices. This is done by using Mathematica, and a rewriting procedure is used to explicitly evaluate the inner products.