An efficient workflow for meshing large scale discrete fracture networks for solving subsurface flow problems

被引:3
|
作者
Pal, Mayur [1 ]
Jadhav, Sandip [2 ]
机构
[1] KTU, Fac Math & Nat Sci, Kaunas, Lithuania
[2] CC Tech Pune, Ctr Computat Technol, Pune, Maharashtra, India
关键词
discretization; discrete fracture networks; lower dimensional; meshing; structured; unstructured; SIMULATIONS; SURFACE; MODEL;
D O I
10.1080/10916466.2022.2033768
中图分类号
TE [石油、天然气工业]; TK [能源与动力工程];
学科分类号
0807 ; 0820 ;
摘要
A large percentage of subsurface hydrocarbon reservoirs are characterized as very complex due to presence of small to large scale fractures. Modeling of multi-physics processes like, environmental flow, CO2 sequestration, hydrocarbon flows, and so on, through such geologically complex reservoirs is challenging. Main challenges comes from the large scale variation in the fracture scales. Use of traditional modeling approaches, based on dual-porosity/dual permeability medium, to model such complex systems is complicated and results in incorrect flow patterns. Precise and efficient modeling of the fracture networks requires fractures to be represented as lower dimensional objects, which requires an efficient gridding technique. In last decade alone modeling of flow through discrete fracture systems has attracted attention from a number of researchers. As a result few new gridding and discretization techniques have been proposed to model flow through discrete fracture network systems (DFNs). DFN's usually involve very high or very low angle fracture-fracture intersections and sometime presence of small to very large length scale fracture networks. In this article an efficient workflow for meshing of large scale complex DFN's networks as lower dimensional objects is presented supported by quantitative results with aim of developing a software tool box, which could be coupled to a subsurface multi-phase flow simulator.
引用
收藏
页码:1945 / 1978
页数:34
相关论文
共 50 条
  • [21] Variable resolution Poisson-disk sampling for meshing discrete fracture networks
    Krotz, Johannes
    Sweeney, Matthew R.
    Gable, Carl W.
    Hyman, Jeffrey D.
    Restrepo, Juan M.
    JOURNAL OF COMPUTATIONAL AND APPLIED MATHEMATICS, 2022, 407
  • [22] A robust and informative method for solving large-scale power flow problems
    Walter Murray
    Tomás Tinoco De Rubira
    Adam Wigington
    Computational Optimization and Applications, 2015, 62 : 431 - 475
  • [23] A robust and informative method for solving large-scale power flow problems
    Murray, Walter
    De Rubira, Tomas Tinoco
    Wigington, Adam
    COMPUTATIONAL OPTIMIZATION AND APPLICATIONS, 2015, 62 (02) : 431 - 475
  • [24] Data-driven Methods for Solving Large-scale Inverse Problems with Applications to Subsurface Imaging
    Lin, Youzuo
    Theiler, James
    Wohlberg, Brendt
    Wu, Yue
    Zhang, Zhongping
    2020 IEEE SOUTHWEST SYMPOSIUM ON IMAGE ANALYSIS AND INTERPRETATION (SSIAI 2020), 2020, : 13 - 13
  • [25] Influence of fracture scale heterogeneity on the flow properties of three-dimensional discrete fracture networks (DFN)
    de Dreuzy, J. -R.
    Meheust, Y.
    Pichot, G.
    JOURNAL OF GEOPHYSICAL RESEARCH-SOLID EARTH, 2012, 117
  • [26] A globally conforming method for solving flow in discrete fracture networks using the Virtual Element Method
    Benedetto, Matias Fernando
    Berrone, Stefano
    Scialo, Stefano
    FINITE ELEMENTS IN ANALYSIS AND DESIGN, 2016, 109 : 23 - 36
  • [27] A new discrete filled function method for solving large scale max-cut problems
    Ai-fan Ling
    Cheng-xian Xu
    Numerical Algorithms, 2012, 60 : 435 - 461
  • [28] Parametrization of ε-approximate algorithms for solving some classes of large-scale problems of discrete optimization
    Sigal, IK
    JOURNAL OF COMPUTER AND SYSTEMS SCIENCES INTERNATIONAL, 2002, 41 (06) : 898 - 907
  • [29] A new discrete filled function method for solving large scale max-cut problems
    Ling, Ai-fan
    Xu, Cheng-xian
    NUMERICAL ALGORITHMS, 2012, 60 (03) : 435 - 461
  • [30] Solving Large-Scale Unconstrained Optimization Problems with an Efficient Conjugate Gradient Class
    Bojari, Sanaz
    Paripour, Mahmoud
    JOURNAL OF MATHEMATICS, 2024, 2024