In this paper, we develop subspace correction preconditioners for discontinuous Galerkin (DG) discretizations of elliptic problems with hp-refinement. These preconditioners are based on the decomposition of the DG finite element space into a conforming subspace, and a set of small nonconforming edge spaces. The conforming subspace is preconditioned using a matrix-free low-order refined technique, which in this work, we extend to the hp-refinement context using a variational restriction approach. The condition number of the resulting linear system is independent of the granularity of the mesh h, and the degree of the polynomial approximation p. The method is amenable to use with meshes of any degree of irregularity and arbitrary distribution of polynomial degrees. Furthermore, numerical examples are shown on several test cases involving adaptively and randomly refined meshes, using both the symmetric interior penalty method and the second method of Bassi and Rebay (BR2).
Pazner, Will and Kolev, Tzanio. "Uniform Subspace Correction Preconditioners for Discontinuous Galerkin Methods with hp-Refinement." Communications on Applied Mathematics and Computation, vol. 4, no. 2, Jul. 2021. https://doi.org/10.1007/s42967-021-00136-3
@article{osti_1823212,
author = {Pazner, Will and Kolev, Tzanio},
title = {Uniform Subspace Correction Preconditioners for Discontinuous Galerkin Methods with hp-Refinement},
annote = {In this paper, we develop subspace correction preconditioners for discontinuous Galerkin (DG) discretizations of elliptic problems with hp-refinement. These preconditioners are based on the decomposition of the DG finite element space into a conforming subspace, and a set of small nonconforming edge spaces. The conforming subspace is preconditioned using a matrix-free low-order refined technique, which in this work, we extend to the hp-refinement context using a variational restriction approach. The condition number of the resulting linear system is independent of the granularity of the mesh h, and the degree of the polynomial approximation p. The method is amenable to use with meshes of any degree of irregularity and arbitrary distribution of polynomial degrees. Furthermore, numerical examples are shown on several test cases involving adaptively and randomly refined meshes, using both the symmetric interior penalty method and the second method of Bassi and Rebay (BR2).},
doi = {10.1007/s42967-021-00136-3},
url = {https://www.osti.gov/biblio/1823212},
journal = {Communications on Applied Mathematics and Computation},
issn = {ISSN 2096-6385},
number = {2},
volume = {4},
place = {United States},
publisher = {Springer Nature},
year = {2021},
month = {07}}