Multigrid algorithms for \(hp\)-version interior penalty discontinuous Galerkin methods on polygonal and polyhedral meshes (Q1697273): Difference between revisions

The paper deals with the numerical solution of the linear elliptic problem using the discontinuous Galerkin method with emphasis on the solution of the arising linear algebraic systems. Namely, the authors analyze the convergence properties of two-level and W-cycle multigrid solvers. The sequence of coarser grids is generated by joint of neighbouring elements. It is proved that the convergence is uniform with respect to the granularity of the grid and the polynomial approximation degree \(p\), provided that the number of smoothing steps, which depends on \(p\), is chosen sufficiently large. An analogous result is obtained for the W-cycle multigrid algorithm, which is proved to be uniformly convergent with respect to the mesh size, the polynomial approximation degree, and the number of levels, provided the number of smoothing steps is chosen sufficiently large. Numerical experiments are presented which underpin the theoretical predictions; moreover, the proposed multilevel solvers are shown to be convergent in practice, even when some of the theoretical assumptions are not fully satisfied.