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 条
  • [41] Solving large-scale multiclass learning problems via an efficient support vector classifier
    School of Electrical and Information Engineering, Shanghai Jiaotong Univ., Shanghai 200030, China
    不详
    J Syst Eng Electron, 2006, 4 (910-915):
  • [42] An efficient Hessian based algorithm for solving large-scale sparse group Lasso problems
    Zhang, Yangjing
    Zhang, Ning
    Sun, Defeng
    Toh, Kim-Chuan
    MATHEMATICAL PROGRAMMING, 2020, 179 (1-2) : 223 - 263
  • [43] An efficient Hessian based algorithm for solving large-scale sparse group Lasso problems
    Yangjing Zhang
    Ning Zhang
    Defeng Sun
    Kim-Chuan Toh
    Mathematical Programming, 2020, 179 : 223 - 263
  • [45] Solving large-scale multiclass learning problems via an efficient support vector classifier
    Zheng Shuibo1
    2. Dept. of Electronic Engineering
    JournalofSystemsEngineeringandElectronics, 2006, (04) : 910 - 915
  • [46] An Efficient Vector-Growth Decomposition Algorithm for Cooperative Coevolution in Solving Large Scale Problems
    Ren, Zhigang
    Chen, An
    Wang, Lin
    Liang, Yongsheng
    Pang, Bei
    PROCEEDINGS OF THE 2017 GENETIC AND EVOLUTIONARY COMPUTATION CONFERENCE COMPANION (GECCO'17 COMPANION), 2017, : 41 - 42
  • [47] Computer technology for solving large scale matrix problems
    Joukov, OD
    Rishe, ND
    COMPUTATIONAL SCIENCE AND ITS APPLICATIONS - ICCSA 2003, PT 1, PROCEEDINGS, 2003, 2667 : 848 - 854
  • [48] SOLVING LARGE-SCALE TOUR SCHEDULING PROBLEMS
    JARRAH, AIZ
    BARD, JF
    DESILVA, AH
    MANAGEMENT SCIENCE, 1994, 40 (09) : 1124 - 1144
  • [49] Solving large scale crew scheduling problems in practice
    Abbink E.J.W.
    Albino L.
    Dollevoet T.
    Huisman D.
    Roussado J.
    Saldanha R.L.
    Public Transport, 2011, 3 (2) : 149 - 164
  • [50] SOLVING (LARGE-SCALE) MATCHING PROBLEMS COMBINATORIALLY
    DERIGS, U
    METZ, A
    MATHEMATICAL PROGRAMMING, 1991, 50 (01) : 113 - 121