Algebraic multigrid techniques for discontinuous Galerkin methods with varying polynomial order

Journal Article

© 2014, Springer International Publishing Switzerland.We present a parallel algebraic multigrid (AMG) algorithm for the implicit solution of the Darcy problem discretized by the discontinuous Galerkin (DG) method that scales optimally for regular and irregular meshes. The main idea centers on recasting the preconditioning problem so that existing AMG solvers for nodal lower order finite elements can be leveraged. This is accomplished by a transformation operator which maps the solution from a Lagrange basis representation to a Legendre basis representation. While this mapping function must be user supplied, we demonstrate how easily it can be constructed for somepopular finite element representations includingquadrilateral/hexahedral and triangular/tetrahedral DG formulations. Furthermore, we show that the mapping does not depend on the Jacobian transformation between reference and physical space and so it can be constructed with very limited mesh information. Parallel performance studies demonstrate the versatility of this approach.

Full Text

Duke Authors

Cited Authors

  • Siefert, C; Tuminaro, R; Gerstenberger, A; Scovazzi, G; Collis, SS

Published Date

  • 2014

Published In

Volume / Issue

  • 18 / 5

Start / End Page

  • 597 - 612

International Standard Serial Number (ISSN)

  • 1420-0597

Digital Object Identifier (DOI)

  • 10.1007/s10596-014-9419-x