arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2107.14758math.NAcs.NA
收藏

一种用于高阶FEM的可扩展且稳健的顶点星松弛方法

A scalable and robust vertex-star relaxation for high-order FEM

Pablo D. Brubeck, Patrick E. Farrell

AI总结:

针对高阶FEM中顶点块矩阵组装与分解不可行的问题,提出一种可扩展的直接求解器,通过构造张量积基对角化刚度矩阵块,使问题稀疏化,从而在极高多项式次数下实现高效求解,并可作为不可分问题的预处理器。

摘要:

Pavarino证明了使用顶点块和低阶粗空间的加性Schwarz方法为对称强制问题提供了一个$p$-稳健的求解器。然而,对于非常高的多项式次数,组装或分解每个块的矩阵是不可行的。在这项工作中,我们引入了一种用于可分块问题的直接求解器,该求解器在张量积单元上可扩展至非常高的多项式次数。该求解器构造了一个张量积基,将每个单元内部自由度的刚度矩阵块对角化。因此,单元矩阵的非零结构是将内部自由度连接到其在面上的投影的图。在新的基中,块问题与低阶有限差分离散一样稀疏,同时具有更稀疏的Cholesky分解。因此,即使对于非常高的多项式次数,我们也能够负担得起组装和分解顶点块问题的矩阵。在不可分的情况下,该方法可以通过用可分代理近似问题来作为预处理器应用。我们通过在$p = 15$时求解三维Poisson方程和线性弹性的$H(\mathrm{div})$协调内部惩罚离散化来演示该方法。

英文摘要:

Pavarino proved that the additive Schwarz method with vertex patches and a low-order coarse space gives a $p$-robust solver for symmetric and coercive problems. However, for very high polynomial degree it is not feasible to assemble or factorize the matrices for each patch. In this work we introduce a direct solver for separable patch problems that scales to very high polynomial degree on tensor product cells. The solver constructs a tensor product basis that diagonalizes the blocks in the stiffness matrix for the internal degrees of freedom of each individual cell. As a result, the non-zero structure of the cell matrices is that of the graph connecting internal degrees of freedom to their projection onto the facets. In the new basis, the patch problem is as sparse as a low-order finite difference discretization, while having a sparser Cholesky factorization. We can thus afford to assemble and factorize the matrices for the vertex-patch problems, even for very high polynomial degree. In the non-separable case, the method can be applied as a preconditioner by approximating the problem with a separable surrogate. We demonstrate the approach by solving the Poisson equation and a $H(\mathrm{div})$-conforming interior penalty discretization of linear elasticity in three dimensions at $p = 15$.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑