A new approach for flow simulation in very complex discrete fracture networks based on PDE-constrained optimization has been recently proposed in Berrone et al. (SIAM J Sci Comput 35(2):B487–B510, 2013b; J Comput Phys 256:838–853, 2014) with the aim of improving robustness with respect to geometrical complexities. This is an essential issue, in particular for applications requiring simulations on geometries automatically generated like the ones used for uncertainty quantification analyses and hydro-mechanical simulations. In this paper, implementation of this approach in order to exploit Nvidia Compute Unified Device Architecture is discussed with the main focus to speed up the linear algebra operations required by the approach, being this task the most computational demanding part of the approach. Furthermore, two different approaches for linear algebra operations and two storage formats for sparse matrices are compared in terms of computational efficiency and memory constraints.
Fast and robust flow simulations in discrete fracture networks with GPGPUs / Berrone, S.; D’Auria, A.; Vicini, F.. - In: GEM. - ISSN 1869-2672. - STAMPA. - 10:1(2019). [10.1007/s13137-019-0121-y]
|Titolo:||Fast and robust flow simulations in discrete fracture networks with GPGPUs|
|Data di pubblicazione:||2019|
|Digital Object Identifier (DOI):||http://dx.doi.org/10.1007/s13137-019-0121-y|
|Appare nelle tipologie:||1.1 Articolo in rivista|
File in questo prodotto:
|Berrone2019_Article_FastAndRobustFlowSimulationsIn.pdf||2. Post-print / Author's Accepted Manuscript||Non Pubblico - Accesso privato/ristretto||Administrator Richiedi una copia|