A MULTIGRID ALGORITHM FOR THE p-VERSION OF THE VIRTUAL ELEMENT METHOD

We present a multigrid algorithm for the solution of the linear systems of equations stemming from the p-version of the virtual element discretization of a two-dimensional Poisson problem. The sequence of coarse spaces are constructed decreasing progressively the polynomial approximation degree of the virtual element space, as in standard p-multigrid schemes. The construction of the interspace operators relies on auxiliary virtual element spaces, where it is possible to compute higher order polynomial projectors. We prove that the multigrid scheme is uniformly convergent, provided the number of smoothing steps is chosen sufficiently large. We also demonstrate that the resulting scheme provides a uniform preconditioner with respect to the number of degrees of freedom that can be employed to accelerate the convergence of classical Krylov-based iterative schemes. Numerical experiments validate the theoretical results.