The Virtual Element Method (VEM) is a recent numerical technology for the solution of partial differential equations on computational grids constituted by polygonal or polyhedral elements of very general shape. The aim of this work is to develop effective linear solvers for a general order VEM approximation designed to approximate three-dimensional scalar elliptic equations in mixed form. The proposed Balancing Domain Decomposition by Constraints (BDDC) preconditioner allows to use conjugate gradient iterations, albeit the algebraic linear systems arising from the discretization of the problem are indefinite, ill-conditioned, and of saddle point nature. The condition number of the resulting positive definite preconditioned system is adaptively controlled by means of deluxe scaling operators and suitable local generalized eigenvalue problems for the selection of optimal primal constraints. Numerical results confirm the theoretical estimates and the reliability of the adaptive procedure, with the experimental condition numbers always very close to the prescribed adaptive tolerance parameter. The scalability and quasi-optimality of the preconditioner are demonstrated, and the performances of the proposed solver are compared with state-of-the-art parallel direct solvers and block preconditioning techniques in a distributed memory setting.
Robust and scalable adaptive BDDC preconditioners for virtual element discretizations of elliptic partial differential equations in mixed form / F. Dassi, S. Zampini, S. Scacchi. - In: COMPUTER METHODS IN APPLIED MECHANICS AND ENGINEERING. - ISSN 0045-7825. - 391:(2022 Mar 01), pp. 114620.1-114620.20. [10.1016/j.cma.2022.114620]
Robust and scalable adaptive BDDC preconditioners for virtual element discretizations of elliptic partial differential equations in mixed form
S. ZampiniPenultimo
;S. ScacchiUltimo
2022
Abstract
The Virtual Element Method (VEM) is a recent numerical technology for the solution of partial differential equations on computational grids constituted by polygonal or polyhedral elements of very general shape. The aim of this work is to develop effective linear solvers for a general order VEM approximation designed to approximate three-dimensional scalar elliptic equations in mixed form. The proposed Balancing Domain Decomposition by Constraints (BDDC) preconditioner allows to use conjugate gradient iterations, albeit the algebraic linear systems arising from the discretization of the problem are indefinite, ill-conditioned, and of saddle point nature. The condition number of the resulting positive definite preconditioned system is adaptively controlled by means of deluxe scaling operators and suitable local generalized eigenvalue problems for the selection of optimal primal constraints. Numerical results confirm the theoretical estimates and the reliability of the adaptive procedure, with the experimental condition numbers always very close to the prescribed adaptive tolerance parameter. The scalability and quasi-optimality of the preconditioner are demonstrated, and the performances of the proposed solver are compared with state-of-the-art parallel direct solvers and block preconditioning techniques in a distributed memory setting.File | Dimensione | Formato | |
---|---|---|---|
bddc_mixed_vem_cmame.pdf
accesso aperto
Tipologia:
Pre-print (manoscritto inviato all'editore)
Dimensione
1.75 MB
Formato
Adobe PDF
|
1.75 MB | Adobe PDF | Visualizza/Apri |
1-s2.0-S0045782522000354-main.pdf
accesso riservato
Tipologia:
Publisher's version/PDF
Dimensione
1.57 MB
Formato
Adobe PDF
|
1.57 MB | Adobe PDF | Visualizza/Apri Richiedi una copia |
Pubblicazioni consigliate
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.