Multigrid algorithms for symmetric discontinuous Galerkin methods on graded meshes (Q639372): Difference between revisions

The authors consider the Poisson equation (along with homogeneous Dirichlet conditions) in a nonconvex domain and, simultaneously, 4 symmetric discontinuous Galerkin (DG) methods for the computation of its weak solution. After reviewing the regularity results in weighted Sobolev spaces for such boundary value problems, they turn to the proof of quasi-optimal error estimates when graded meshes are used for the DG methods. After formulating the corresponding multigrid algorithms, they prove the uniform convergence of this algorithms for sufficiently much smoothing iterations. In the case of the W-cycle, the proof is rather standard, but for the V- and F-cycle it is more delicate and rests on earlier work of the first author [see, e.g., Math. Comput. 73, No.~247, 1041--1066 (2004; Zbl 1052.65102)]. Finally, numerical results are presented for an L-shaped domain and for all 4 DG methods showing that in any case already a few smoothing iterations are enough.