Discrete fracture network (DFN) models explicitly use fracture geometry and network topology to simulate flow and transport through fractured systems. Recent advances in high performance computing have opened the door for flow and transport simulations in large explicit three-dimensional DFN. However, this increase in model fidelity and network size comes at a huge computational cost because of the large number of mesh elements required to represent thousands of fractures (with sizes that can range several orders of magnitude, from mm to km). We will discuss coarse scale graph representations of DFN and how they can be used to exploit geometric and topological properties of DFNs to perform system reduction without loss of accuracy for key quantities of interest. In particular, different graph-representations of DFN models and how they can be used to reduce the computational burden associated with DFN models will be demonstrated.
|Acceptance of Terms and Conditions||Click here to agree|