Silvia Bertoluzza
Research Subjects
Research Interests
Silvia Bertoluzza has a total of 35 co-authors. Here are the top co-authors by number of shared publications:
- Daniele Prada
IMATI “E. Magenes”, CNR, Pavia, Italy
12 shared publications - Micol Pennacchio
IMATI “E. Magenes”, CNR, Pavia, Italy
11 shared publications - Fabio Credali
Computer, Electrical and Mathematical Sciences and Engineering Division, King Abdullah University of Science and Technology, Thuwal 23955, Saudi Arabia
4 shared publications - Paola Francesca Antonietti
Dipartimento di Matematica MOX-Laboratory for Modeling and Scientific Computing Politecnico di Milano Piazza Leonardo da Vinci 32 - 20133 Milano Italy
4 shared publications - Christophe Prud'Homme
Cemosis IRMA UMR 7501 University of Strasbourg CNRS
3 shared publications - Abdoulaye Samaké
Université des Sciences, des Techniques et des Technologies de Bamako
2 shared publications
Latest Publications
- 12 August 2026
- Published by Elsevier in Computers & Mathematics with Applications
- Vol. 219, 421-442
Avoiding stabilization terms in virtual elements for eigenvalue problems: The reduced basis virtual element method
- 12 August 2026
- Published by Elsevier in Computers & Mathematics with Applications
- Vol. 219, 421-442
Avoiding stabilization terms in virtual elements for eigenvalue problems: The reduced basis virtual element method
- Open Access
Avoiding stabilization terms in virtual elements for eigenvalue problems: The Reduced Basis Virtual Element Method
We present the novel Reduced Basis Virtual Element Method (rbVEM) for solving the Laplace eigenvalue problem. This approach is based on the virtual element method and exploits the reduced basis technique to obtain an explicit representation of the virtual (non-polynomial) contribution to the discrete space. rbVEM yields a fully conforming discretization of the considered problem, so that stabilization terms are avoided. We prove that rbVEM provides the correct spectral approximation with optimal error estimates. Theoretical results are supplemented by an exhaustive numerical investigation.
Open AccessAvoiding stabilization terms in virtual elements for eigenvalue problems: The Reduced Basis Virtual Element Method
We present the novel Reduced Basis Virtual Element Method (rbVEM) for solving the Laplace eigenvalue problem. This approach is based on the virtual element method and exploits the reduced basis technique to obtain an explicit representation of the virtual (non-polynomial) contribution to the discrete space. rbVEM yields a fully conforming discretization of the considered problem, so that stabilization terms are avoided. We prove that rbVEM provides the correct spectral approximation with optimal error estimates. Theoretical results are supplemented by an exhaustive numerical investigation.
- Open Access
The MINI mixed virtual element for the Stokes equation
We present and discuss a generalization of the popular MINI mixed finite element for the 2D Stokes equation by means of conforming virtual elements on polygonal meshes. We prove optimal error estimates for both velocity and pressure. Theoretical results are confirmed by several numerical tests performed with different choices of polynomial accuracy and meshes.
Open AccessThe MINI mixed virtual element for the Stokes equation
We present and discuss a generalization of the popular MINI mixed finite element for the 2D Stokes equation by means of conforming virtual elements on polygonal meshes. We prove optimal error estimates for both velocity and pressure. Theoretical results are confirmed by several numerical tests performed with different choices of polynomial accuracy and meshes.
- Open Access
A stabilized three fields formulation for Discrete Fracture Networks
We propose a hybridized domain decomposition formulation of the discrete fracture network model, allowing for independent discretization of the individual fractures. A natural norm stabilization, obtained by penalizing the residual measured in the norm for the space where it naturally lives, is added to the local problem in the individual fracture so that no compatibility condition of inf-sup type is required between the Lagrange multiplier and the primal unknown, which can then be discretized independently of each other. Optimal stability and error estimates are proven, which are confirmed by numerical tests.
Open AccessA stabilized three fields formulation for Discrete Fracture Networks
We propose a hybridized domain decomposition formulation of the discrete fracture network model, allowing for independent discretization of the individual fractures. A natural norm stabilization, obtained by penalizing the residual measured in the norm for the space where it naturally lives, is added to the local problem in the individual fracture so that no compatibility condition of inf-sup type is required between the Lagrange multiplier and the primal unknown, which can then be discretized independently of each other. Optimal stability and error estimates are proven, which are confirmed by numerical tests.
- Open Access
- 9 May 2024
- Published by Springer Nature in Numerische Mathematik
- Vol. 156 (3) , 1163-1196
Interior estimates for the virtual element method
- 9 May 2024
- Published by Springer Nature in Numerische Mathematik
- Vol. 156 (3) , 1163-1196
Open AccessInterior estimates for the virtual element method
- Open Access
Best approximation results and essential boundary conditions for novel types of weak adversarial network discretizations for PDEs
In this paper, we provide a theoretical analysis of the recently introduced weakly adversarial networks (WAN) method, used to approximate partial differential equations in high dimensions. We address the existence and stability of the solution, as well as approximation bounds. More precisely, we prove the existence of discrete solutions, intended in a suitable weak sense, for which we prove a quasi-best approximation estimate similar to Cea's lemma, a result commonly found in finite element methods. We also propose two new stabilized WAN-based formulas that avoid the need for direct normalization. Furthermore, we analyze the method's effectiveness for the Dirichlet boundary problem that employs the implicit representation of the geometry. The key requirement for achieving the best approximation outcome is to ensure that the space for the test network satisfies a specific condition, known as the inf-sup condition, essentially requiring that the test network set is sufficiently large when compared to the trial space. The method's accuracy, however, is only determined by the space of the trial network. We also devise a pseudo-time XNODE neural network class for static PDE problems, yielding significantly faster convergence results than the classical DNN network.
Open AccessBest approximation results and essential boundary conditions for novel types of weak adversarial network discretizations for PDEs
In this paper, we provide a theoretical analysis of the recently introduced weakly adversarial networks (WAN) method, used to approximate partial differential equations in high dimensions. We address the existence and stability of the solution, as well as approximation bounds. More precisely, we prove the existence of discrete solutions, intended in a suitable weak sense, for which we prove a quasi-best approximation estimate similar to Cea's lemma, a result commonly found in finite element methods. We also propose two new stabilized WAN-based formulas that avoid the need for direct normalization. Furthermore, we analyze the method's effectiveness for the Dirichlet boundary problem that employs the implicit representation of the geometry. The key requirement for achieving the best approximation outcome is to ensure that the space for the test network satisfies a specific condition, known as the inf-sup condition, essentially requiring that the test network set is sufficiently large when compared to the trial space. The method's accuracy, however, is only determined by the space of the trial network. We also devise a pseudo-time XNODE neural network class for static PDE problems, yielding significantly faster convergence results than the classical DNN network.
- Open Access
The virtual element method on polygonal pixel-based tessellations
We analyze and validate the virtual element method combined with a boundary correction similar to the one in [1,2], to solve problems on two dimensional domains with curved boundaries approximated by polygonal domains obtained as the union of squared elements out of a uniform structured mesh, such as the one that naturally arises when the domain is issued from an image. We show, both theoretically and numerically, that resorting to the use of polygonal elements allows to satisfy, for any order, the assumptions required for the stability of the method, thus allowing to fully exploit the potential of higher order methods, the efficiency of which is ensured by a novel static condensation strategy acting on the edges of the decomposition.
Open AccessThe virtual element method on polygonal pixel-based tessellations
We analyze and validate the virtual element method combined with a boundary correction similar to the one in [1,2], to solve problems on two dimensional domains with curved boundaries approximated by polygonal domains obtained as the union of squared elements out of a uniform structured mesh, such as the one that naturally arises when the domain is issued from an image. We show, both theoretically and numerically, that resorting to the use of polygonal elements allows to satisfy, for any order, the assumptions required for the stability of the method, thus allowing to fully exploit the potential of higher order methods, the efficiency of which is ensured by a novel static condensation strategy acting on the edges of the decomposition.
- Open Access
Reduced basis stabilization and post-processing for the virtual element method
We present a reduced basis method for cheaply constructing (possibly rough) approximations to the nodal basis functions of the virtual element space, and propose to use such approximations for the design of the stabilization term in the virtual element method and for the post-processing of the solution.
Open AccessReduced basis stabilization and post-processing for the virtual element method
We present a reduced basis method for cheaply constructing (possibly rough) approximations to the nodal basis functions of the virtual element space, and propose to use such approximations for the design of the stabilization term in the virtual element method and for the post-processing of the solution.
- Open Access
Localization of trace norms in two and three dimensions
We extend a localization result for the $H^{1/2}$ norm by B. Faermann to a wider class of subspaces of $H^{1/2}(Γ)$, and we prove an analogous result for the $H^{-1/2}(Γ)$ norm, $Γ$ being the boundary of a bounded polytopal domain $Ω$ in $\mathbb{R}^n$, $n=2,3$. As a corollary, we obtain equivalent, better localized, norms for both $H^{1/2}(Γ)$ and $H^{-1/2}(Γ)$, which can be exploited, for instance, in the design of preconditioners or of stabilized methods.Open AccessLocalization of trace norms in two and three dimensions
We extend a localization result for the $H^{1/2}$ norm by B. Faermann to a wider class of subspaces of $H^{1/2}(Γ)$, and we prove an analogous result for the $H^{-1/2}(Γ)$ norm, $Γ$ being the boundary of a bounded polytopal domain $Ω$ in $\mathbb{R}^n$, $n=2,3$. As a corollary, we obtain equivalent, better localized, norms for both $H^{1/2}(Γ)$ and $H^{-1/2}(Γ)$, which can be exploited, for instance, in the design of preconditioners or of stabilized methods. - Open Access
Interior estimates for the Virtual Element Method
We analyze the local accuracy of the virtual element method. More precisely, we prove an error bound similar to the one holding for the finite element method, namely, that the local $H^1$ error in a interior subdomain is bounded by a term behaving like the best approximation allowed by the local smoothness of the solution in a larger interior subdomain plus the global error measured in a negative norm.Open AccessInterior estimates for the Virtual Element Method
We analyze the local accuracy of the virtual element method. More precisely, we prove an error bound similar to the one holding for the finite element method, namely, that the local $H^1$ error in a interior subdomain is bounded by a term behaving like the best approximation allowed by the local smoothness of the solution in a larger interior subdomain plus the global error measured in a negative norm.