The virtual element method (VEM) is a new family of numerical methods for the approximation of partial differential equations, where the geometry of the polytopal mesh elements can be very general. The aim of this article is to extend the balancing domain decomposition by constraints preconditioner to the solution of the saddle-point linear system arising from a VEM discretization of the two-dimensional Stokes equations. Under suitable hypotesis on the choice of the primal unknowns, the preconditioned linear system results symmetric and positive definite, thus the preconditioned conjugate gradient method can be used for its solution. We provide a theoretical convergence analysis estimating the condition number of the preconditioned linear system. Several numerical experiments validate the theoretical estimates, showing the scalability and quasi-optimality of the method proposed. Moreover, the solver exhibits a robust behavior with respect to the shape of the polygonal mesh elements. We also show that a faster convergence could be achieved with an easy to implement coarse space, slightly larger than the minimal one covered by the theory.

BDDC Preconditioners for Divergence Free Virtual Element Discretizations of the Stokes Equations / T. Bevilacqua, S. Scacchi. - In: JOURNAL OF SCIENTIFIC COMPUTING. - ISSN 0885-7474. - 92:2(2022), pp. 63.1-63.27. [10.1007/s10915-022-01929-1]

BDDC Preconditioners for Divergence Free Virtual Element Discretizations of the Stokes Equations

T. Bevilacqua
Primo
;
S. Scacchi
Ultimo
2022

Abstract

The virtual element method (VEM) is a new family of numerical methods for the approximation of partial differential equations, where the geometry of the polytopal mesh elements can be very general. The aim of this article is to extend the balancing domain decomposition by constraints preconditioner to the solution of the saddle-point linear system arising from a VEM discretization of the two-dimensional Stokes equations. Under suitable hypotesis on the choice of the primal unknowns, the preconditioned linear system results symmetric and positive definite, thus the preconditioned conjugate gradient method can be used for its solution. We provide a theoretical convergence analysis estimating the condition number of the preconditioned linear system. Several numerical experiments validate the theoretical estimates, showing the scalability and quasi-optimality of the method proposed. Moreover, the solver exhibits a robust behavior with respect to the shape of the polygonal mesh elements. We also show that a faster convergence could be achieved with an easy to implement coarse space, slightly larger than the minimal one covered by the theory.
Virtual element method; Divergence free discretization; Saddle-point linear system; Domain decomposition preconditioner
Settore MAT/08 - Analisi Numerica
2022
Article (author)
File in questo prodotto:
File Dimensione Formato  
s10915-022-01929-1.pdf

accesso aperto

Tipologia: Publisher's version/PDF
Dimensione 676.79 kB
Formato Adobe PDF
676.79 kB Adobe PDF Visualizza/Apri
Pubblicazioni consigliate

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/2434/952953
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 1
  • ???jsp.display-item.citation.isi??? 1
social impact