Many time-dependent problems in the field of computational fluid dynamics can be solved using space-time methods. However, such methods can encounter issues with computational cost and robustness. In order to address these issues, efficient, node-centered edge-based schemes are currently being developed. In these schemes, a median-dual tessellation of the space-time domain is constructed based on an initial triangulation. These methods are node-centered or node-based, as the primary components of the discretization are median-dual regions (polytopes) which surround the mesh nodes. These methods are extremely robust, as the median-dual regions will often maintain a positive volume and other good geometric properties, even in cases when some of the associated simplices have negative volumes, or other poor geometric properties. Unfortunately, it is not straightforward to construct median-dual regions or deduce their properties on triangulations for $d \geq 3$. In this work, we provide the first rigorous definition of median-dual regions on triangulations in any number of dimensions. In addition, we introduce a new method for computing the hypervolume of a median-dual region in $\mathbb{R}^d$. Furthermore, we provide a new approach for computing the directed-hyperarea vectors for faces of a median-dual region in $\mathbb{R}^{4}$. These geometric properties are key for developing node-centered edge-based schemes in any number of dimensions. We conclude our work by analyzing the computational complexity of the edge-based schemes, and performing numerical experiments in two, three, and four dimensions. We successfully demonstrate their effectiveness by obtaining accurate solutions to several canonical problems.
The analysis of FETI-DP preconditioner for full DG discretization of elliptic problems
Warsaw University(华沙大学);Universidad Nacional de Colombia(哥伦比亚国立大学);Worcester Polytechnic Institute(伍斯特理工学院);Instituto Nacional de Matemática Pura e Aplicada (IMPA)(巴西纯粹与应用数学国家研究所)
Lower Bounds of the Discretization for Piecewise Polynomials
Institute of Computational Mathematics, Academy of Mathematics and Systems Science, Chinese Academy of Sciences(中国科学院数学与系统科学研究院计算数学研究所);Center for Computational Mathematics and Applications and Department of Mathematics, Pennsylvania State University(宾夕法尼亚州立大学计算数学与应用中心及数学系)
Adaptive Hybridizable Discontinuous Galerkin discretization of the Grad-Shafranov equation by extension from polygonal subdomains
New York University, Courant Institute of Mathematical Sciences(纽约大学 库朗数学科学研究所);Universidad de Concepción, Department of Mathematical Engineering(康塞普西翁大学 数学工程系);Universidad de Concepción, Center for Research in Mathematical Engineering(康塞普西翁大学 数学工程研究中心)