NANov 26, 2016
The fully nonconforming virtual element method for biharmonic problemsP. F. Antonietti, G. Manzini, M. Verani
In this paper we address the numerical approximation of linear fourth-order elliptic problems on polygonal meshes. In particular, we present a novel nonconforming virtual element discretization of arbitrary order of accuracy for biharmonic problems. The approximation space is made of possibly discontinuous functions, thus giving rise to the fully nonconforming virtual element method. We derive optimal error estimates in a suitable (broken) energy norm and present numerical results to assess the validity of the theoretical estimates.
NANov 10, 2018
The conforming virtual element method for polyharmonic problemsP. F. Antonietti, G. Manzini, M. Verani
In this work, we exploit the capability of virtual element methods in accommodating approximation spaces featuring high-order continuity to numerically approximate differential problems of the form $Δ^p u =f$, $p\ge1$. More specifically, we develop and analyze the conforming virtual element method for the numerical approximation of polyharmonic boundary value problems, and prove an abstract result that states the convergence of the method in the energy norm.
NAJun 11, 2017
A multigrid algorithm for the $p$-version of the Virtual Element MethodP. F. Antonietti, L. Mascotto, M. Verani
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.