We propose a quality-based optimization strategy to reduce the total number of degrees of freedom associated with a discrete problem defined over a polygonal tessellation with the Virtual Element Method. The presented Quality Agglomeration algorithm relies only on the geometrical properties of the problem polygonal mesh, agglomerating groups of neighboring elements. We test this approach in the context of fractured porous media, in which the generation of a global conforming mesh on a Discrete Fracture Network leads to a considerable number of unknowns, due to the presence of highly complex geometries (e.g. thin triangles, large angles, small edges) and the significant size of the computational domains. We show the efficiency and the robustness of our approach, applied independently on each fracture for different network configurations, exploiting the flexibility of the Virtual Element Method in handling general polygonal elements.
Mesh quality agglomeration algorithm for the virtual element method applied to discrete fracture networks / Sorgente, Tommaso; Vicini, Fabio; Berrone, Stefano; Biasotti, Silvia; Manzini, Gianmarco; Spagnuolo, Michela. - In: CALCOLO. - ISSN 0008-0624. - ELETTRONICO. - 60:2(2023), pp. 1-27. [10.1007/s10092-023-00517-5]
Mesh quality agglomeration algorithm for the virtual element method applied to discrete fracture networks
Fabio Vicini;Stefano Berrone;
2023
Abstract
We propose a quality-based optimization strategy to reduce the total number of degrees of freedom associated with a discrete problem defined over a polygonal tessellation with the Virtual Element Method. The presented Quality Agglomeration algorithm relies only on the geometrical properties of the problem polygonal mesh, agglomerating groups of neighboring elements. We test this approach in the context of fractured porous media, in which the generation of a global conforming mesh on a Discrete Fracture Network leads to a considerable number of unknowns, due to the presence of highly complex geometries (e.g. thin triangles, large angles, small edges) and the significant size of the computational domains. We show the efficiency and the robustness of our approach, applied independently on each fracture for different network configurations, exploiting the flexibility of the Virtual Element Method in handling general polygonal elements.File | Dimensione | Formato | |
---|---|---|---|
PRE-PRINT.pdf
accesso riservato
Descrizione: Pre-Print https://arxiv.org/abs/2208.09639
Tipologia:
1. Preprint / submitted version [pre- review]
Licenza:
Non Pubblico - Accesso privato/ristretto
Dimensione
10.66 MB
Formato
Adobe PDF
|
10.66 MB | Adobe PDF | Visualizza/Apri Richiedi una copia |
EDITOR.pdf
accesso aperto
Descrizione: Definitiva
Tipologia:
2a Post-print versione editoriale / Version of Record
Licenza:
Creative commons
Dimensione
4.25 MB
Formato
Adobe PDF
|
4.25 MB | Adobe PDF | Visualizza/Apri |
Pubblicazioni consigliate
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
https://hdl.handle.net/11583/2981561