arXiv subjects
Publications and source records attributed to Silvia Bertoluzza.
We build and analyze Balancing Domain Decomposition by Constraint (BDDC) and Finite Element Tearing and Interconnecting Dual Primal (FETI-DP) preconditioners for elliptic problems discretized by the virtual element method (VEM). We prove polylogarithmic condition number bounds, independent of the number of subdomains, the mesh size, and jumps in the diffusion coefficients. Numerical experiments confirm the theory.
We deal with the virtual element method (VEM) for solving the Poisson equation on a domain $Ω$ with curved boundaries. Given a polygonal approximation $Ω_h$ of the domain $Ω$, the standard order $m$ VEM [6], for $m$ increasing, leads to a suboptimal convergence rate. We adapt the approach of [16] to VEM and we prove that an optimal convergence rate can be achieved by using a suitable correction depending on high order normal derivatives of the discrete solution at the boundary edges of $Ω_h$, which, to retain computability, is evaluated after applying the projector $Π^\nabla$ onto the space of polynomials. Numerical experiments confirm the theory.
We deal with the Finite Element Tearing and Interconnecting Dual Primal (FETI-DP) preconditioner for elliptic problems discretized by the virtual element method (VEM). We extend the result of [22] to the three dimensional case. We prove polylogarithmic condition number bounds, independent of the number of subdomains, the mesh size, and jumps in the diffusion coefficients. Numerical experiments validate the theory
We propose a Discontinuous Galerkin method for the Poisson equation on polygonal tessellations in two dimensions, stabilized by penalizing, locally in each element $K$, a residual term involving the fluxes, measured in the norm of the dual of $H^1(K)$. The scalar product corresponding to such a norm is numerically realized via the introduction of a (minimal) auxiliary space inspired by the Virtual Element Method. Stability and optimal error estimates in the broken $H^1$ norm are proven under a weak shape regularity assumption allowing the presence of very small edges. The results of numerical tests confirm the theoretical estimates.
We address the issue of designing robust stabilization terms for the nonconforming virtual element method. To this end, we transfer the problem of defining the stabilizing bilinear form from the elemental nonconforming virtual element space, whose functions are not known in closed form, to the dual space spanned by the known functionals providing the degrees of freedom. By this approach, we manage to construct different bilinear forms yielding optimal or quasi-optimal stability bounds and error estimates, under weaker assumptions on the tessellation than the ones usually considered in this framework. In particular, we prove optimality under geometrical assumptions allowing a mesh to have a very large number of arbitrarily small edges per element. Finally, we numerically assess the performance of the VEM for several different stabilizations fitting with our new framework on a set of representative test cases.
In this work we report some results, obtained within the framework of the ERC Project CHANGE, on the impact on the performance of the virtual element method of the shape of the polygonal elements of the underlying mesh. More in detail, after reviewing the state of the art, we present a) an experimental analysis of the convergence of the VEM under condition violating the standard shape regularity assumptions, b) an analysis of the correlation between some mesh quality metrics and a set of different performance indexes, and c) a suitably designed mesh quality indicator, aimed at predicting the quality of the performance of the VEM on a given mesh.
We introduce a new stabilization for discontinuous Galerkin methods for the Poisson problem on polygonal meshes, which induces optimal convergence rates in the polynomial approximation degree $p$. In the setting of [S. Bertoluzza and D. Prada, A polygonal discontinuous Galerkin method with minus one stabilization, ESAIM Math. Mod. Numer. Anal. (DOI: 10.1051/m2an/2020059)], the stabilization is obtained by penalizing, in each mesh element $K$, a residual in the norm of the dual of $H^1(K)$. This negative norm is algebraically realized via the introduction of new auxiliary spaces. We carry out a $p$-explicit stability and error analysis, proving $p$-robustness of the overall method. The theoretical findings are demonstrated in a series of numerical experiments.
In this paper we consider the Virtual Element discretization of a minimal surface problem, a quasi-linear elliptic partial differential equation modeling the problem of minimizing the area of a surface subject to a prescribed boundary condition. We derive optimal error estimate and present several numerical tests assessing the validity of the theoretical results.
Problems with localized nonhomogeneous material properties arise frequently in many applications and are a well-known source of difficulty in numerical simulations. In certain applications (including additive manufacturing), the physics of the problem may be considerably more complicated in relatively small portions of the domain, requiring a significantly finer local mesh compared to elsewhere in the domain. This can make the use of a uniform mesh numerically unfeasible. While nonuniform meshes can be employed, they may be challenging to generate (particularly for regions with complex boundaries) and more difficult to precondition. The problem becomes even more prohibitive when the region requiring a finer-level mesh changes in time, requiring the introduction of refinement and derefinement techniques. To address the aforementioned challenges, we employ a technique related to the Fat boundary method as a possible alternative. We analyze the proposed methodology, from a mathematical point of view and validate our findings on two-dimensional numerical tests.
We analyze the performance of a state-of-the-art domain decomposition approach, the Finite Element Tearing and Interconnecting Dual Primal (FETI-DP) method, for the efficient solution of very large linear systems arising from elliptic problems discretized by the Virtual Element Method. We provide numerical experiments on a model linear elliptic problem with highly heterogeneous diffusion coefficients on arbitrary Voronoi meshes, which we modify by adding nodes and edges deriving from the intersection with an unrelated coarse decomposition. The experiments confirm also in this case that the FETI-DP method is numerically scalable with respect to both the problem size and number of subdomains, and its performance is robust with respect to jumps in the diffusion coefficients and shape of the mesh elements.
The solutions of elliptic problems with a Dirac measure in right-hand side are not H1 and therefore the convergence of the finite element solutions is suboptimal. Graded meshes are standard remedy to recover quasi-optimality, namely optimality up to a log-factor, for low order finite elements in L2-norm. Optimal (or quasi-optimal for the lowest order case) convergence has been shown in L2-seminorm, where the L2-seminorm is defined as the L2-norm on a subdomain which excludes the singularity. Here we show a quasi-optimal convergence for the Hs-seminorm, s \textgreater{} 0, and an optimal convergence in H1-seminorm for the lowest order case, on a family of quasi- uniform meshes in dimension 2. This question is motivated by the use of the Dirac measure as a reduced model in physical problems, and a high accuracy at the singularity of the finite element method is not required. Our results are obtained using local Nitsche and Schatz-type error estimates, a weak version of Aubin-Nitsche duality lemma and a discrete inf-sup condition. These theoretical results are confirmed by numerical illustrations.