Micol Pennacchio
Research Subjects
Micol Pennacchio has a total of 35 co-authors. Here are the top co-authors by number of shared publications:
- Silvia Bertoluzza
IMATI “E. Magenes”, CNR, Pavia, Italy
11 shared publications - Daniele Prada
IMATI “E. Magenes”, CNR, Pavia, Italy
10 shared publications Luciano Guerri
Università del Piemonte Orientale
5 shared publicationsBruno Taccardi
University of Utah
4 shared publicationsSilvia Bertoluzza
4 shared publicationsValeria Simoncini
4 shared publications
Latest Publications
- 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
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
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. - Open Access
Weakly imposed Dirichlet boundary conditions for 2D and 3D Virtual Elements
In the framework of virtual element discretizazions, we address the problem of imposing non homogeneous Dirichlet boundary conditions in a weak form, both on polygonal/polyhedral domains and on two/three dimensional domains with curved boundaries. We consider a Nitsche's type method [43,41], and the stabilized formulation of the Lagrange multiplier method proposed by Barbosa and Hughes in [9]. We prove that also for the virtual element method (VEM), provided the stabilization parameter is suitably chosen (large enough for Nitsche's method and small enough for the Barbosa-Hughes Lagrange multiplier method), the resulting discrete problem is well posed, and yields convergence with optimal order on polygonal/polyhedral domains. On smooth two/three dimensional domains, we combine both methods with a projection approach similar to the one of [31]. We prove that, given a polygonal/polyhedral approximation $\Omega_h$ of the domain $\Omega$, an optimal convergence rate can be achieved by using a suitable correction depending on high order derivatives of the discrete solution along outward directions (not necessarily orthogonal) at the boundary facets of $\Omega_h$. Numerical experiments validate the theory.Open AccessWeakly imposed Dirichlet boundary conditions for 2D and 3D Virtual Elements
In the framework of virtual element discretizazions, we address the problem of imposing non homogeneous Dirichlet boundary conditions in a weak form, both on polygonal/polyhedral domains and on two/three dimensional domains with curved boundaries. We consider a Nitsche's type method [43,41], and the stabilized formulation of the Lagrange multiplier method proposed by Barbosa and Hughes in [9]. We prove that also for the virtual element method (VEM), provided the stabilization parameter is suitably chosen (large enough for Nitsche's method and small enough for the Barbosa-Hughes Lagrange multiplier method), the resulting discrete problem is well posed, and yields convergence with optimal order on polygonal/polyhedral domains. On smooth two/three dimensional domains, we combine both methods with a projection approach similar to the one of [31]. We prove that, given a polygonal/polyhedral approximation $\Omega_h$ of the domain $\Omega$, an optimal convergence rate can be achieved by using a suitable correction depending on high order derivatives of the discrete solution along outward directions (not necessarily orthogonal) at the boundary facets of $\Omega_h$. Numerical experiments validate the theory. - 1 January 2020
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Numerical Analysis
- Vol. 58 (3) , 1556-1591
FETI-DP for the Three Dimensional Virtual Element Method
We deal with the finite element tearing and interconnecting dual primal preconditioner for elliptic problems discretized by the virtual element method. We extend the result of [S. Bertoluzza, M. Pe...
- 1 January 2020
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Numerical Analysis
- Vol. 58 (3) , 1556-1591
FETI-DP for the Three Dimensional Virtual Element Method
We deal with the finite element tearing and interconnecting dual primal preconditioner for elliptic problems discretized by the virtual element method. We extend the result of [S. Bertoluzza, M. Pe...
- 21 June 2019
- Published by European Mathematical Society - EMS - Publishing House GmbH in Rendiconti Lincei, Matematica e Applicazioni
- Vol. 30 (2) , 391-412
High order VEM on curved domains
We deal with the virtual element method (VEM) for solving the Poisson equation on a domain \Omega with curved boundary. Given a polygonal approximation \Omega_h of the domain \Omega , the standard order m VEM [6], for m increasing, leads to a suboptimal convergence rate. We adapt the approach of [14] 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 \Omega_h , which, to retain computability, is evaluated after applying the projector \Pi^{\nabla} onto the space of polynomials. Numerical experiments confirm the theory.
- 21 June 2019
- Published by European Mathematical Society - EMS - Publishing House GmbH in Rendiconti Lincei, Matematica e Applicazioni
- Vol. 30 (2) , 391-412
High order VEM on curved domains
We deal with the virtual element method (VEM) for solving the Poisson equation on a domain \Omega with curved boundary. Given a polygonal approximation \Omega_h of the domain \Omega , the standard order m VEM [6], for m increasing, leads to a suboptimal convergence rate. We adapt the approach of [14] 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 \Omega_h , which, to retain computability, is evaluated after applying the projector \Pi^{\nabla} onto the space of polynomials. Numerical experiments confirm the theory.
- 5 January 2019
- Published by Springer Nature
- p. 157-164
FETI-DP Preconditioners for the Virtual Element Method on General 2D Meshes
- 5 January 2019
- Published by Springer Nature
- p. 157-164
FETI-DP Preconditioners for the Virtual Element Method on General 2D Meshes
- Open Access
Algebraic Multigrid Methods For Virtual Element Discretizations: A Numerical Study
We investigate the performance of algebraic multigrid methods for the solution of the linear system of equations arising from a Virtual Element discretization. We provide numerical experiments on very general polygonal meshes for a model elliptic problem with and without highly heterogeneous diffusion coefficients and we draw conclusions regarding the efficacy of the method.
Open AccessAlgebraic Multigrid Methods For Virtual Element Discretizations: A Numerical Study
We investigate the performance of algebraic multigrid methods for the solution of the linear system of equations arising from a Virtual Element discretization. We provide numerical experiments on very general polygonal meshes for a model elliptic problem with and without highly heterogeneous diffusion coefficients and we draw conclusions regarding the efficacy of the method.
- Open Access
FETI-DP preconditioners for the Virtual Element Method on general 2D meshes
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.
Open AccessFETI-DP preconditioners for the Virtual Element Method on general 2D meshes
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.
- 10 November 2017
- Published by Springer Nature in Calcolo
- Vol. 54 (4) , 1565-1593
BDDC and FETI-DP for the virtual element method
- 10 November 2017
- Published by Springer Nature in Calcolo
- Vol. 54 (4) , 1565-1593
BDDC and FETI-DP for the virtual element method