L. Gazzola, M. Ferronato, S. Berrone, S. Pieraccini, S. Scialò
{"title":"提高DFN模型计算效率的块预处理策略的数值研究","authors":"L. Gazzola, M. Ferronato, S. Berrone, S. Pieraccini, S. Scialò","doi":"10.4995/yic2021.2021.12234","DOIUrl":null,"url":null,"abstract":"Simulation of fluid flow dynamics in fractured porous media is an important issue in several subsurface models. The intricate network generated by hundreds of fractures produces complex multi-scale geometries that can be modelled in different ways. In contrast to homogenization-based techniques, discrete fracture network (DFN) models explicitly represent the fracture planes and their properties, prescribing continuity constraints for the fluid flow along the linear intersections. We focus on the formulation of the DFN model as a PDE-constrained optimization problem as originally proposed in [1]. This approach uses a non-conforming mesh and decouples the global problem in local ones, thus being suitable for an effective parallel implementation [2]. Imposing the flow continuity by a Lagrange-multiplier technique gives rise to a linearized algebraic problem where the global matrix K has a symmetric saddle-point structure with a rank-deficient leading block. In this work, we focus on accelerating the iterative solution of the system with matrix K by introducing effective block preconditioning techniques. First, an appropriate permutation of K is performed, in order to avoid a singular leading block though losing the global symmetry. Then, we restrict K to the coarse space of the fracture traces and solve inexactly the projected matrix by either an explicit or a matrix-free approach. The granular properties and the structure of K blocks are properly exploited in order to guarantee an efficient parallel implementation. The proposed algorithm is tested in applications of increasing size to verify its robustness and effectiveness in the acceleration of the iterative linear solver.[1] S. Berrone, S. Pieraccini, S. Scialò. A PDE-constrained optimization formulation for Discrete Fracture Network flows, SIAM J. Sci. Comput., Vol. 35, pp. B487-B510, (2013) [2] S. Berrone, S. Scialò, F. Vicini. Parallel meshing, discretization and computation of flow in massive Discrete Fracture Networks, SIAM J. Sci. Comput., Vol. 41, pp. C317-C338, (2019) ","PeriodicalId":406819,"journal":{"name":"Proceedings of the YIC 2021 - VI ECCOMAS Young Investigators Conference","volume":"7 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-07-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Numerical investigation on a block preconditioning strategy to improve the computational efficiency of DFN models\",\"authors\":\"L. Gazzola, M. Ferronato, S. Berrone, S. Pieraccini, S. Scialò\",\"doi\":\"10.4995/yic2021.2021.12234\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Simulation of fluid flow dynamics in fractured porous media is an important issue in several subsurface models. The intricate network generated by hundreds of fractures produces complex multi-scale geometries that can be modelled in different ways. In contrast to homogenization-based techniques, discrete fracture network (DFN) models explicitly represent the fracture planes and their properties, prescribing continuity constraints for the fluid flow along the linear intersections. We focus on the formulation of the DFN model as a PDE-constrained optimization problem as originally proposed in [1]. This approach uses a non-conforming mesh and decouples the global problem in local ones, thus being suitable for an effective parallel implementation [2]. Imposing the flow continuity by a Lagrange-multiplier technique gives rise to a linearized algebraic problem where the global matrix K has a symmetric saddle-point structure with a rank-deficient leading block. In this work, we focus on accelerating the iterative solution of the system with matrix K by introducing effective block preconditioning techniques. First, an appropriate permutation of K is performed, in order to avoid a singular leading block though losing the global symmetry. Then, we restrict K to the coarse space of the fracture traces and solve inexactly the projected matrix by either an explicit or a matrix-free approach. The granular properties and the structure of K blocks are properly exploited in order to guarantee an efficient parallel implementation. The proposed algorithm is tested in applications of increasing size to verify its robustness and effectiveness in the acceleration of the iterative linear solver.[1] S. Berrone, S. Pieraccini, S. Scialò. A PDE-constrained optimization formulation for Discrete Fracture Network flows, SIAM J. Sci. Comput., Vol. 35, pp. B487-B510, (2013) [2] S. Berrone, S. Scialò, F. Vicini. Parallel meshing, discretization and computation of flow in massive Discrete Fracture Networks, SIAM J. Sci. Comput., Vol. 41, pp. C317-C338, (2019) \",\"PeriodicalId\":406819,\"journal\":{\"name\":\"Proceedings of the YIC 2021 - VI ECCOMAS Young Investigators Conference\",\"volume\":\"7 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2021-07-07\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the YIC 2021 - VI ECCOMAS Young Investigators Conference\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.4995/yic2021.2021.12234\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the YIC 2021 - VI ECCOMAS Young Investigators Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.4995/yic2021.2021.12234","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1
摘要
裂缝性多孔介质中流体流动动力学的模拟是几种地下模型的重要问题。数百条裂缝形成的复杂网络产生了复杂的多尺度几何形状,可以用不同的方法进行建模。与基于均质化的技术相比,离散裂缝网络(DFN)模型明确地表示裂缝面及其性质,规定了流体沿线性交叉点流动的连续性约束。我们将重点放在DFN模型的表述上,作为一个pde约束优化问题,该问题最初在b[1]中提出。该方法使用非一致性网格,将全局问题解耦到局部问题中,因此适合于有效的并行实现。利用拉格朗日乘子技术施加流的连续性,产生了一个线性化的代数问题,其中全局矩阵K具有一个缺乏秩的对称鞍点结构。在这项工作中,我们着重于通过引入有效的块预处理技术来加速矩阵K的系统迭代解。首先,对K进行适当的排列,以避免在失去全局对称性的情况下出现奇异先导块。然后,我们将K限制在裂缝轨迹的粗空间,并通过显式或无矩阵方法不精确地求解投影矩阵。适当地利用K块的颗粒特性和结构,以保证有效的并行实现。在不断扩大的应用中对该算法进行了测试,以验证其在迭代线性求解器加速方面的鲁棒性和有效性S. Berrone, S. Pieraccini, S. Scialò。基于pde约束的离散裂缝网络流优化方法[j]。第一版。《中国科学》,Vol. 35, pp. B487-B510 (2013), [2] S. Berrone, S. Scialò, F. Vicini。大型离散裂缝网络的并行网格化、离散化与计算[j] .岩石力学与工程学报。第一版。, Vol. 41, pp. C317-C338, (2019)
Numerical investigation on a block preconditioning strategy to improve the computational efficiency of DFN models
Simulation of fluid flow dynamics in fractured porous media is an important issue in several subsurface models. The intricate network generated by hundreds of fractures produces complex multi-scale geometries that can be modelled in different ways. In contrast to homogenization-based techniques, discrete fracture network (DFN) models explicitly represent the fracture planes and their properties, prescribing continuity constraints for the fluid flow along the linear intersections. We focus on the formulation of the DFN model as a PDE-constrained optimization problem as originally proposed in [1]. This approach uses a non-conforming mesh and decouples the global problem in local ones, thus being suitable for an effective parallel implementation [2]. Imposing the flow continuity by a Lagrange-multiplier technique gives rise to a linearized algebraic problem where the global matrix K has a symmetric saddle-point structure with a rank-deficient leading block. In this work, we focus on accelerating the iterative solution of the system with matrix K by introducing effective block preconditioning techniques. First, an appropriate permutation of K is performed, in order to avoid a singular leading block though losing the global symmetry. Then, we restrict K to the coarse space of the fracture traces and solve inexactly the projected matrix by either an explicit or a matrix-free approach. The granular properties and the structure of K blocks are properly exploited in order to guarantee an efficient parallel implementation. The proposed algorithm is tested in applications of increasing size to verify its robustness and effectiveness in the acceleration of the iterative linear solver.[1] S. Berrone, S. Pieraccini, S. Scialò. A PDE-constrained optimization formulation for Discrete Fracture Network flows, SIAM J. Sci. Comput., Vol. 35, pp. B487-B510, (2013) [2] S. Berrone, S. Scialò, F. Vicini. Parallel meshing, discretization and computation of flow in massive Discrete Fracture Networks, SIAM J. Sci. Comput., Vol. 41, pp. C317-C338, (2019)