This work extends the zeroth-order tree/cotree (TC) decomposition method into higher order (HO) interpolatory elements and develops the constraints operator required for the elimination of spurious solutions for general HO spectral basis. Earlier methods explicitly enforce the divergence condition that requires a mixed finite element (FE) formulation with both H 1 and H (∇∧) expansions and involves repeated solutions of the Poisson equation. A recent approach, which avoids the mixed formulation and the Poisson problem, uses TC decomposition of edge DoF over the primal graph and construction of integration and gradient matrices. The approach is easily applied to HO hierarchical elements but becomes quite complex for HO spectral elements. In the presence of internal DoF, it is difficult to utilize the primal graph for an explicit decomposition of the spectral DoF. In contrast, this work utilizes the dual grid, resulting in an explicit decomposition of DoF and construction of constraint equations from a fixed element matrix. Thus, mixed formulation and the Poisson problems are avoided while eliminating the need for evaluation of integration and gradient matrices. The proposed constraints matrix is element-geometry independent and possesses an explicit sparsity formulation reducing the need for dynamic memory allocation. Numerical examples are included for verification.
16953. The transformations are developed for a different purpose, i.e. explicit imposition of divergence conditions. 4. The subsequent fast implementations are based on the nice properties of first-order polynomial basis, i.e. for the first-order polynomial basis the resulting G and Q are made of simple {0, ±1} entries only but this property does not generalize to HO cases.
ON A SINGLE ELEMENTThis section covers the following matters: