Efficient low-order refined preconditioners for high-order matrix-free continuous and discontinuous Galerkin methods

From MaRDI portal
Publication:5132003

DOI10.1137/19M1282052zbMATH Open1452.65051arXiv1908.07071OpenAlexW3091293834MaRDI QIDQ5132003FDOQ5132003


Authors: Will Pazner Edit this on Wikidata


Publication date: 9 November 2020

Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)

Abstract: In this paper, we design preconditioners for the matrix-free solution of high-order continuous and discontinuous Galerkin discretizations of elliptic problems based on FEM-SEM equivalence and additive Schwarz methods. The high-order operators are applied without forming the system matrix, making use of sum factorization for efficient evaluation. The system is preconditioned using a spectrally equivalent low-order (p=1) finite element operator discretization on a refined mesh. The low-order refined mesh is anisotropic and not shape regular in the polynomial degree of the high-order operator, requiring specialized solvers to treat the anisotropy. We make use of an element-structured, geometric multigrid V-cycle with ordered ILU(0) smoothing. The preconditioner is parallelized through an overlapping additive Schwarz method that is robust in h and p. The method is extended to interior penalty and BR2 discontinuous Galerkin discretizations, for which it is also robust in the size of the penalty parameter. Numerical results are presented on a variety of examples, verifying the uniformity of the preconditioner.


Full work available at URL: https://arxiv.org/abs/1908.07071




Recommendations




Cites Work


Cited In (15)

Uses Software





This page was built for publication: Efficient low-order refined preconditioners for high-order matrix-free continuous and discontinuous Galerkin methods

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5132003)