skip to main content

DOE PAGESDOE PAGES

This content will become publicly available on March 9, 2019

Title: Modeling flow and transport in fracture networks using graphs

Fractures form the main pathways for flow in the subsurface within low-permeability rock. For this reason, accurately predicting flow and transport in fractured systems is vital for improving the performance of subsurface applications. Fracture sizes in these systems can range from millimeters to kilometers. Although modeling flow and transport using the discrete fracture network (DFN) approach is known to be more accurate due to incorporation of the detailed fracture network structure over continuum-based methods, capturing the flow and transport in such a wide range of scales is still computationally intractable. Furthermore, if one has to quantify uncertainty, hundreds of realizations of these DFN models have to be run. To reduce the computational burden, we solve flow and transport on a graph representation of a DFN. We study the accuracy of the graph approach by comparing breakthrough times and tracer particle statistical data between the graph-based and the high-fidelity DFN approaches, for fracture networks with varying number of fractures and degree of heterogeneity. Due to our recent developments in capabilities to perform DFN high-fidelity simulations on fracture networks with large number of fractures, we are in a unique position to perform such a comparison. We show that the graph approach showsmore » a consistent bias with up to an order of magnitude slower breakthrough when compared to the DFN approach. We show that this is due to graph algorithm's underprediction of the pressure gradients across intersections on a given fracture, leading to slower tracer particle speeds between intersections and longer travel times. We present a bias correction methodology to the graph algorithm that reduces the discrepancy between the DFN and graph predictions. We show that with this bias correction, the graph algorithm predictions significantly improve and the results are very accurate. In conclusion, the good accuracy and the low computational cost, with O(10 4) times lower times than the DFN, makes the graph algorithm an ideal technique to incorporate in uncertainty quantification methods.« less
Authors:
ORCiD logo [1] ; ORCiD logo [1] ; ORCiD logo [1] ; ORCiD logo [1] ; ORCiD logo [1]
  1. Los Alamos National Laboratory (LANL), Los Alamos, NM (United States)
Publication Date:
Report Number(s):
LA-UR-17-25905
Journal ID: 2470-0045 ; 2470-0053 (Electronic)
Grant/Contract Number:
AC52-06NA25396; 20170103DR
Type:
Accepted Manuscript
Journal Name:
Physical Review E
Additional Journal Information:
Journal Volume: 97; Journal Issue: 3
Research Org:
Los Alamos National Lab. (LANL), Los Alamos, NM (United States)
Sponsoring Org:
USDOE
Country of Publication:
United States
Language:
English
Subject:
58 GEOSCIENCES; 97 MATHEMATICS AND COMPUTING; Earth Sciences; Mathematics; subsurface, flow, transport, graph theory, fractures, breakthrough, particle tracking
OSTI Identifier:
1427375
Alternate Identifier(s):
OSTI ID: 1425242

Karra, S., O'Malley, D., Hyman, J. D., Viswanathan, H. S., and Srinivasan, G.. Modeling flow and transport in fracture networks using graphs. United States: N. p., Web. doi:10.1103/PhysRevE.97.033304.
Karra, S., O'Malley, D., Hyman, J. D., Viswanathan, H. S., & Srinivasan, G.. Modeling flow and transport in fracture networks using graphs. United States. doi:10.1103/PhysRevE.97.033304.
Karra, S., O'Malley, D., Hyman, J. D., Viswanathan, H. S., and Srinivasan, G.. 2018. "Modeling flow and transport in fracture networks using graphs". United States. doi:10.1103/PhysRevE.97.033304.
@article{osti_1427375,
title = {Modeling flow and transport in fracture networks using graphs},
author = {Karra, S. and O'Malley, D. and Hyman, J. D. and Viswanathan, H. S. and Srinivasan, G.},
abstractNote = {Fractures form the main pathways for flow in the subsurface within low-permeability rock. For this reason, accurately predicting flow and transport in fractured systems is vital for improving the performance of subsurface applications. Fracture sizes in these systems can range from millimeters to kilometers. Although modeling flow and transport using the discrete fracture network (DFN) approach is known to be more accurate due to incorporation of the detailed fracture network structure over continuum-based methods, capturing the flow and transport in such a wide range of scales is still computationally intractable. Furthermore, if one has to quantify uncertainty, hundreds of realizations of these DFN models have to be run. To reduce the computational burden, we solve flow and transport on a graph representation of a DFN. We study the accuracy of the graph approach by comparing breakthrough times and tracer particle statistical data between the graph-based and the high-fidelity DFN approaches, for fracture networks with varying number of fractures and degree of heterogeneity. Due to our recent developments in capabilities to perform DFN high-fidelity simulations on fracture networks with large number of fractures, we are in a unique position to perform such a comparison. We show that the graph approach shows a consistent bias with up to an order of magnitude slower breakthrough when compared to the DFN approach. We show that this is due to graph algorithm's underprediction of the pressure gradients across intersections on a given fracture, leading to slower tracer particle speeds between intersections and longer travel times. We present a bias correction methodology to the graph algorithm that reduces the discrepancy between the DFN and graph predictions. We show that with this bias correction, the graph algorithm predictions significantly improve and the results are very accurate. In conclusion, the good accuracy and the low computational cost, with O(104) times lower times than the DFN, makes the graph algorithm an ideal technique to incorporate in uncertainty quantification methods.},
doi = {10.1103/PhysRevE.97.033304},
journal = {Physical Review E},
number = 3,
volume = 97,
place = {United States},
year = {2018},
month = {3}
}