Andrea Borio

2papers

2 Papers

NAJun 3, 2018
SUPG stabilization for the nonconforming virtual element method for advection-diffusion-reaction equations

Stefano Berrone, Andrea Borio, Gianmarco Manzini

We present the design, convergence analysis and numerical investigations of the nonconforming virtual element method with Streamline Upwind/Petrov-Galerkin (VEM-SUPG) stabilization for the numerical resolution of convection-diffusion-reaction problems in the convective-dominated regime. According to the virtual discretization approach, the bilinear form is split as the sum of a consistency and a stability term. The consistency term is given by substituting the functions of the virtual space and their gradients with their polynomial projection in each term of the bilinear form (including the SUPG stabilization term). Polynomial projections can be computed exactly from the degrees of freedom. The stability term is also built from the degrees of freedom by ensuring the correct scalability properties with respect to the mesh size and the equation coefficients. The nonconforming formulation relaxes the continuity conditions at cell interfaces and a weaker regularity condition is considered involving polynomial moments of the solution jumps at cell interface. Optimal convergence properties of the method are proved in a suitable norm, which includes a contribution from the advective stabilization terms. Experimental results confirm the theoretical convergence rates.

NAFeb 1, 2023
Lowest order stabilization free Virtual Element Method for the 2D Poisson equation

Stefano Berrone, Andrea Borio, Francesca Marcon

We introduce and analyse the first order Enlarged Enhancement Virtual Element Method (E$^2$VEM) for the Poisson problem. The method allows the definition of bilinear forms that do not require a stabilization term, thanks to the exploitation of higher order polynomial projections that are made computable by suitably enlarging the enhancement (from which comes the prefix of the name E$^2$) property of local virtual spaces. The polynomial degree of local projections is chosen based on the number of vertices of each polygon. We provide a proof of well-posedness and optimal order a priori error estimates. Numerical tests on convex and non-convex polygonal meshes confirm the criterium for well-posedness and the theoretical convergence rates.