Multilevel graph partitioning for three-dimensional discrete fracture network flow simulations
From MaRDI portal
Abstract: We present a topology-based method for mesh-partitioning in three-dimensional discrete fracture network (DFN) simulations that take advantage of the intrinsic multi-level nature of a DFN. DFN models are used to simulate flow and transport through low-permeability fractured media in the subsurface by explicitly representing fractures as discrete entities. The governing equations for flow and transport are numerically integrated on computational meshes generated on the interconnected fracture networks. Modern high-fidelity DFN simulations require high-performance computing on multiple processors where performance and scalability depend partially on obtaining a high-quality partition of the mesh to balance work-loads and minimize communication across all processors. The discrete structure of a DFN naturally lends itself to various graph representations. We develop two applications of the multilevel graph partitioning algorithm to partition the mesh of a DFN. In the first, we project a partition of the graph based on the DFN topology onto the mesh of the DFN and in the second, this projection is used as the initial condition for further partitioning refinement of the mesh. We compare the performance of these methods with standard multi-level graph partitioning using graph-based metrics (cut, imbalance, partitioning time), computational-based metrics (FLOPS, iterations, solver time), and total run time. The DFN-based and the mesh-based partitioning methods are comparable in terms of the graph-based metrics, but the time required to obtain the partition is several orders of magnitude faster using the DFN-based partitions. In combination, these partitions are several orders of magnitude faster than the mesh-based partition. In turn, this hybrid method outperformed both of the other methods in terms of the total run time.
Recommendations
- FraC: a new conforming mesh method for discrete fracture networks
- Parallel meshing, discretization, and computation of flow in massive discrete fracture networks
- Flow Simulation in Three-Dimensional Discrete Fracture Networks
- Identifying backbones in three-dimensional discrete fracture networks: a bipartite graph-based approach
- Towards effective flow simulations in realistic discrete fracture networks
Cites work
- scientific article; zbMATH DE number 595998 (Why is no real title available?)
- scientific article; zbMATH DE number 2068044 (Why is no real title available?)
- scientific article; zbMATH DE number 839542 (Why is no real title available?)
- A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
- A New Approach to Simulating Flow in Discrete Fracture Networks with an Optimized Mesh
- A PDE-constrained optimization formulation for discrete fracture network flows
- A POINT-PLACEMENT STRATEGY FOR CONFORMING DELAUNAY TETRAHEDRALIZATION
- A generalized mixed hybrid mortar method for solving flow in stochastic discrete fracture networks
- A mixed hybrid Mortar method for solving flow in discrete fracture networks
- A multilevel algorithm for wavefront reduction
- A multilevel bilinear programming algorithm for the vertex separator problem
- A parallel solver for large scale DFN flow simulations
- A probabilistic clustering approach for identifying primary subnetworks of discrete fracture networks with quantified uncertainty
- Advanced coarsening schemes for graph partitioning
- An Efficient Heuristic Procedure for Partitioning Graphs
- An efficient method for discretizing 3D fractured media for subsurface flow and transport simulations
- Conforming Delaunay triangulation of stochastically generated three dimensional discrete fracture networks: a feature rejection algorithm for meshing strategy
- Engineering multilevel graph partitioning algorithms
- Flow Simulation in Three-Dimensional Discrete Fracture Networks
- Geometry and topology of fracture systems
- Graph minimum linear arrangement by multilevel weighted edge contractions
- Identifying backbones in three-dimensional discrete fracture networks: a bipartite graph-based approach
- Machine learning for graph-based representations of three-dimensional discrete fracture networks
- Mesh Partitioning: A Multilevel Balancing and Refinement Algorithm
- Multilevel algorithms for linear ordering problems
- Multiphase mesh partitioning
- Relaxation-based coarsening and multiscale graph organization
Cited in
(4)- Fast and robust flow simulations in discrete fracture networks with gpgpus
- Robust system size reduction of discrete fracture networks: a multi-fidelity method that preserves transport characteristics
- Identifying backbones in three-dimensional discrete fracture networks: a bipartite graph-based approach
- Application of Bayesian generative adversarial networks to geological facies modeling
This page was built for publication: Multilevel graph partitioning for three-dimensional discrete fracture network flow simulations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2066832)
