Answers are grounded in this paper and cite their sources.
We propose a systematic methodology for the construction of hanging variables to connect finite elements of unequal refinement levels within a nested tetrahedral mesh. While conventional refinement schemes introduce irregular elements at such interfaces which must be removed when the mesh is further refined, the suggested approach keeps the discretization perfectly nested. Thanks to enhanced regularity, mesh-based methods such as refinement algorithms or intergrid transfer operators for use in multigrid solvers can be implemented in a much simpler fashion. This paper covers H/sup 1/ and H(curl) basis functions for triangular or tetrahedral elements.
No takes yet. Share an insight, caveat, or question.
Hill et al. (2004) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: