Robust multigrid for high-order discontinuous Galerkin methods: a fast Poisson solver suitable for high-aspect ratio Cartesian grids

From MaRDI portal
Publication:1674495

DOI10.1016/J.JCP.2016.09.041zbMATH Open1422.65412arXiv1603.02524OpenAlexW2294214032MaRDI QIDQ1674495FDOQ1674495


Authors: J. Stiller Edit this on Wikidata


Publication date: 25 October 2017

Published in: Journal of Computational Physics (Search for Journal in Brave)

Abstract: We present a polynomial multigrid method for nodal interior penalty and local discontinuous Galerkin formulations of the Poisson equation on Cartesian grids. For smoothing we propose two classes of overlapping Schwarz methods. The first class comprises element-centered and the second face-centered methods. Within both classes we identify methods that achieve superior convergence rates, prove robust with respect to the mesh spacing and the polynomial order, at least up to P=32. Consequent structure exploitation yields a computational complexity of O(PN), where N is the number of unknowns. Further we demonstrate the suitability of the face-centered method for element aspect ratios up to 32.


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




Recommendations




Cites Work


Cited In (13)





This page was built for publication: Robust multigrid for high-order discontinuous Galerkin methods: a fast Poisson solver suitable for high-aspect ratio Cartesian grids

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