用图模拟裂隙网络中的流动和输运
Modeling flow and transport in fracture networks using graphs
摘要:
裂缝形成低渗透性岩石内地下流动的主要通道。因此,准确预测裂缝系统中的流动和输运对于提高地下应用的性能至关重要。这些系统中的裂缝尺寸可以从毫米到公里不等。虽然,使用离散裂缝网络(DFN)方法建模流动和运输被认为是更准确的,由于结合了详细的裂缝网络结构,基于连续的方法,捕获的流动和运输在这样一个广泛的范围内的规模仍然是计算上棘手的。此外,如果必须量化不确定性,则必须运行这些DFN模型的数百个实现。为了减少计算负担,我们解决流和运输的DFN的图形表示。我们研究的准确性,通过比较突破时间和示踪粒子的统计数据之间的基于图形和高保真度DFN的方法,裂缝网络与不同数量的裂缝和程度的异质性的图形方法。我们发现,图形的方法显示出一致的偏差高达一个数量级的突破较慢的DFN方法相比。我们表明,这是由于图形算法的预测不足的压力梯度交叉点上一个给定的裂缝,导致交叉点和较长的旅行时间之间的示踪粒子速度较慢。我们提出了一个偏差校正方法的图形算法,减少DFN和图形预测之间的差异。我们表明,有了这种偏差校正,图形算法的预测显着提高,结果是非常准确的。良好的精度和低计算成本,与$O(10^4)$倍低于DFN的时间,使图形算法,一个理想的技术,纳入不确定性量化方法。
英文摘要:
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. 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 under-prediction 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. 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.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。