DeepAI AI Chat
Log In Sign Up

V-cycle multigrid algorithms for discontinuous Galerkin methods on non-nested polytopic meshes

by   P. F. Antonietti, et al.
Politecnico di Milano

In this paper we analyse the convergence properties of V-cycle multigrid algorithms for the numerical solution of the linear system of equations arising from discontinuous Galerkin discretization of second-order elliptic partial differential equations on polytopal meshes. Here, the sequence of spaces that stands at the basis of the multigrid scheme is possibly non nested and is obtained based on employing agglomeration with possible edge/face coarsening. We prove that the method converges uniformly 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.


page 1

page 2

page 3

page 4


Agglomeration-based geometric multigrid schemes for the Virtual Element Method

In this paper we analyse the convergence properties of two-level, W-cycl...

A discontinuous Galerkin scheme for a large class of elliptic equations

We present a discontinuous Galerkin internal-penalty scheme that is appl...

Energy-based discontinuous Galerkin difference methods for second-order wave equations

We combine the newly-constructed Galerkin difference basis with the ener...

Robust Multigrid Methods for Discontinuous Galerkin Discretizations of an Elliptic Optimal Control Problem

We consider discontinuous Galerkin methods for an elliptic distributed o...

Adaptive BEM for elliptic PDE systems, Part I: Abstract framework for weakly-singular integral equations

In the present work, we consider weakly-singular integral equations aris...