谷歌浏览器插件
订阅小程序
在清言上使用

Dual‐grid‐based Tree/cotree Decomposition of Higher‐order Interpolatory H(∇∧, Ω) Basis

International journal for numerical methods in engineering(2010)

引用 1|浏览22
暂无评分
摘要
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 H1 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. Copyright © 2010 John Wiley & Sons, Ltd.
更多
查看译文
关键词
finite element method (FEM),tree/cotree (TC),null-space,dual/primal graph,H (del boolean AND, Omega)/curl-conforming basis,Krylov solver(s),spurious/non-physical solutions,high-order interpolatory vector basis
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要