4.7 Article

An efficient algorithm for simulating grout propagation in 2D discrete fracture networks

出版社

PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.ijrmms.2017.07.015

关键词

GroutIUT(2D); EGFP algorithm; Groutability; Sensitivity analyses; DFN

资金

  1. Ministry of Science, Research and Technology of Iran
  2. HKUST
  3. Hong Kong Research Grants Council TBRS grant [T22-603-15N]

向作者/读者索取更多资源

This study is aimed at developing a computationally efficient algorithm to simulate the grout fluid propagation by generalizing the recently developed Explicit Grout Forehead Pressure algorithm to two-dimensional discrete fracture networks. A computer program is developed by using an innovative recursive scheme to track the paths of grout propagation within the fractures, and the results can be visualized using a graphic interface. The efficiency and accuracy of the algorithm is successfully validated using two series of laboratory tests. Finally, sensitivity analyses are conducted to study the influence of key parameters, including initial pressure, grout fluid density, grout viscosity and operation time, on the grout propagation for both dry and saturated in-situ conditions. The study demonstrates that the existence of pore fluid inside the fractured medium can significantly decrease the propagation area. Some other less studied factors are also investigated, such as time-dependent hardening of the grout viscosity, initial yield stress of the grout fluid and rheology properties of the in-situ pore fluid. These factors are also found to be important for improving efficiency of the grout operation.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.7
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据