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

Abstract

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$.

References in corpus (9)

• Firedrake: automating the finite element method by composing abstractions
• A performance comparison of continuous and discontinuous Galerkin methods with fast multigrid solvers
• TSFC: a structure-preserving form compiler
• Approximate tensor-product preconditioners for very high order discontinuous Galerkin methods
• PCPATCH: software for the topological construction of multigrid relaxation methods
• GPU accelerated spectral finite elements on all-hex meshes
• Efficient low-order refined preconditioners for high-order matrix-free continuous and discontinuous Galerkin methods
• Scaling to the stars -- a linearly scaling elliptic solver for $p$-multigrid
• Fast Tensor Product Schwarz Smoothers for High-Order Discontinuous Galerkin Methods

Cited by in corpus (4)

• $hp$-robust multigrid solver on locally refined meshes for FEM discretizations of symmetric elliptic PDEs
• Smoothers with localized residual computations for geometric multigrid methods
• Tensor-product vertex patch smoothers for biharmonic problems
• FIAT: improving performance and accuracy for high-order finite elements