Multigrid algorithms for high order discontinuous Galerkin methods
Thursday 23rd January 2014
Antonietti, P.F.; Sarti, M.; Verani, M.
In this paper we study the performance of a W-cycle multigrid algorithm for high order Discontinuous Galerkin discretizations of the Poisson problem. We recover the well known uniformity of the rate of convergence with respect to the mesh size and the number of levels and study the dependence on the polyonomial order p employed. The theoretical estimates are verified by two- and three-dimensional numerical tests.