![Sample our Computer Science journals, sign in here to start your access, latest two full volumes FREE to you for 14 days]({"type":"image" , "src" : "/sda/5928/TOC-Subject-Sample-2021-Computer-Science.jpg"})
Abstract
The permeability of a 3D geological fracture network is determined by triangulating the fractures and solving the 2D Darcy's equation in each fracture. Here, the numerical modelling aims to simulate a great number of networks made up of a great number of fractures i.e. from 103 to 106 fractures. Parallel computing allows us to solve very large linear systems improving the realism of simulations. Several algorithms to simulating fluid flow are proposed for the cases of significant matrix permeability. In the case of a weak permeability matrix, the flow is focused in the fractures having a strong permeability and fluids percolate through networks of interconnected fractures. In this paper, we present a complete parallel algorithm for solving flow equations in fracture networks. We consider an imprevious matrix. The different parts of the algorithm are detailed. Numerical examples using the mixed finite element (MFE) method for various fracture networks illustrate the efficiency and robustness of the proposed algorithm. To the best of our knowledge, results for parellel simulation of fluid flow in discrete-fractured media with impervious matrix using the MFE method are the first to appear in the literature.