Robust preconditioners for DG-discretizations with arbitrary polynomial degrees

DOI10.1007/978-3-319-05789-7_51zbMATH Open1382.65378arXiv1212.6385OpenAlexW1602579916MaRDI QIDQ3133665FDOQ3133665

Wolfgang Dahmen, C. Canuto, K. Brix

Publication date: 5 February 2018

Published in: Lecture Notes in Computational Science and Engineering (Search for Journal in Brave)

Abstract: Discontinuous Galerkin (DG) methods offer an enormous flexibility regarding local grid refinement and variation of polynomial degrees for a variety of different problem classes. With a focus on diffusion problems, we consider DG discretizations for elliptic boundary value problems, in particular the efficient solution of the linear systems of equations that arise from the Symmetric Interior Penalty DG method. We announce a multi-stage preconditioner which produces uniformly bounded condition numbers and aims at supporting the full flexibility of DG methods under mild grading conditions. The constructions and proofs are detailed in an upcoming series of papers by the authors. Our preconditioner is based on the concept of the auxiliary space method and techniques from spectral element methods such as Legendre-Gau{ss}-Lobatto grids. The presentation for the case of geometrically conforming meshes is complemented by numerical studies that shed some light on constants arising in four basic estimates used in the second stage.

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

Recommendations

• Multilevel preconditioning of discontinuous Galerkin spectral element methods. I: Geometrically conforming meshes.
• Robust and efficient preconditioners for the discontinuous Galerkin time-stepping method
• Uniform subspace correction preconditioners for discontinuous Galerkin methods with \(hp\)-refinement
• Efficient preconditioning for the discontinuous Galerkin finite element method by low-order elements
• ASM-BDDC preconditioners with variable polynomial degree for CG- and DG-SEM

zbMATH Keywords

discontinuous Galerkin methodsnumerical examplepreconditionerelliptic boundary value problemsspectral element methodLegendre-Gauß-Lobatto grids

Mathematics Subject Classification ID

Preconditioners for iterative methods (65F08) Boundary value problems for second-order elliptic equations (35J25) Finite element, Rayleigh-Ritz and Galerkin methods for boundary value problems involving PDEs (65N30)

Cites Work

• Spectral Methods
• Iterative Methods by Space Decomposition and Subspace Correction
• The auxiliary space method and optimal multigrid preconditioning techniques for unstructured grids
• Title not available (Why is that?)
• Preconditioners for nonconforming discretizations
• Nested dyadic grids associated with Legendre-Gauss-Lobatto grids
• Title not available (Why is that?)

Cited In (1)

• Nested dyadic grids associated with Legendre-Gauss-Lobatto grids

This page was built for publication: Robust preconditioners for DG-discretizations with arbitrary polynomial degrees

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