Search NASA⌕ Search

SEARCH · Search NASA

Results for “discrete fracture network”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 19 records
All sourcesNASA NTRSDOE OSTI
DOE OSTI2026

From Points to Planes: A Workflow for Converting Three‐Dimensional Point Cloud Data Into Discrete Fracture Network Flow and Transport Models

We present the Point cLoud Algorithm for NEtwork Extraction of Discrete Fracture Networks (PLANE-DFN), a point cloud–based algorithm for automatic fracture network extraction designed to support discrete fracture network (DFN) modeling workflows. PLANE-DFN segments three-dimensional fracture planes from raw point cloud data using RANdom SAmple Consensus coupled with statistical outlier removal and density-based clustering to isolate individual fracture features. Each candidate plane is constrained against site-specific structural constraints based on strike and dip. After segmentation, each fracture is converted into a 2-D convex polygon suitable for meshing and simulation. The PLANE-DFN algorithm is validated by comparing geometric and flow and transport data against data from dfnWorks simulations with ensembles of plane-fit networks. We find that the flow and transport in plane-fit networks are comparable to dfnWorks-generated networks when realistic network geometry is maintained. The PLANE-DFN algorithm provides an automated and streamlined workflow to transform point clouds of data into DFN network geometry.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2024

Sensitivity Analysis in the Presence of Intrinsic Stochasticity for Discrete Fracture Network Simulations

Abstract Large‐scale discrete fracture network (DFN) simulators are standard fare for studies involving the sub‐surface transport of particles since direct observation of real world underground fracture networks is generally infeasible. While these simulators have successfully been used in several engineering applications, estimates of output quantities of interest (QoI) — such as breakthrough time of particles reaching the edge of the system — suffer from two distinct types of uncertainty. A run of a DFN simulator requires several parameters to be set that dictate the placement and size of fractures, the density of fractures, and the overall permeability of the system; uncertainty on the proper parameters will lead to uncertainty in the QoI, called epistemic uncertainty. Furthermore, since these input settings to DFN simulators control the stochastic processes which place fractures and govern flow, understanding how this randomness affects the QoI requires several runs of the simulator at distinct random seeds. The uncertainty in the QoI attributed to different realizations (i.e., different seeds) of the same random process (i.e., identical input parameters) leads to a second type of uncertainty, called aleatoric uncertainty. In this paper, we perform a Sensitivity Analysis, which directly attributes the uncertainty observed in the QoI to the epistemic uncertainty from each input parameter and to the aleatoric uncertainty. Beyond the specific takeaways on which input variables influence uncertainty in the QoI the most, a major contribution of this paper is the introduction of a statistically rigorous workflow for characterizing the uncertainty in DFN flow simulations that exhibit heteroskedasticity.

58 GEOSCIENCES↗
DOE OSTI2024

Utah FORGE: 2024 Discrete Fracture Network Model Data

The Utah FORGE 2024 Discrete Fracture Network (DFN) Model dataset provides a set of files representing discrete fracture network modeling for the FORGE site near Milford, Utah. The dataset includes four distinct DFN model file sets, each corresponding to different time frames and modeling approaches in 2024. These models characterize both natural and induced fractures in the geothermal reservoir, which consists of crystalline granitic and metamorphic rock approximately 8,000 feet below the ground surface. The dataset includes a reference DFN model from February 2024 that incorporates planar fractures and well trajectories, as well as upscaled permeability, porosity, compressibility, and storage values on specified grids. Additionally, there are models based on new microseismic (MEQ) data from May and July 2024, including fracture planes fitted to the latest MEQ catalog datasets, tensile fractures from hydraulic stimulation, and an alternative connected DFN for modeling purposes. Coordinate data is provided in both global and local frames, with detailed instructions on the transformations used to align with principal stress orientations. The dataset also includes notes and calculation files for estimating fracture sizes and differences between various fracture sets. There are subfolders for Global Coordinates and Local Coordinates. To move from the global to the local coordinate frame, fractures and wells were a) rotated 20 degrees counterclockwise looking down about the global point (335376.400482041, 4263189.99998761, 250.093546450195) to better align with the principal stresses; and b) translated by (-335408.68, -4263010.9, 1150). Upscaled permeability values using the _XYZ suffix show directions with respect to the global XYZ coordinate frame, while those using the _IJK suffix are aligned with local coordinate frame.

15 GEOTHERMAL ENERGY↗
DOE OSTI2021

Understanding Discrete Fracture Networks Through Spectral Graph Theory

Discrete Fracture Network models (DFNs) are used to simulate fluid flow and particle transport through fracture networks in low permeability rock. Understanding these processes are essential in many subsurface applications, such as environmental restoration of contaminated fractured media, CO 2 sequestration, detection of low-level nuclear tests, and hydrocarbon extraction. Compared with other models, DFNs allow for incorporation of a wider range of network characteristics but have substantially greater computation cost. These networks can be represented with graphs, allowing the use of graph theory tools to study the networks. I used Python to simulate flow and transport on a range of DFNs and analyzed these networks using methods from network analysis and spectral graph theory. My purpose was to find ways to gain insight about flow and transport on DFNs using these graph representations, bypassing the computationally intensive meshing typically required. My work is still in progress, but I have discovered several interesting trends and patterns that I believe could be useful towards my goal. If I am able to bring these results to fruition, they will aid subsurface geologists in extracting flow and transport information about fracture networks more efficiently.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2023

Utah FORGE: 2023 Large Upscaled Discrete Fracture Network Models

This dataset includes the data and a report on the large upscaled discrete fracture network modeling done for the Utah FORGE project in 2023. The FORGE modeling team is making five discrete fracture network (DFN) realizations of a large reservoir model available to researchers. These models have been upscaled to a continuum mesh or grid at resolutions of 10 meters and 20 meters providing reservoir properties for fracture porosity, permeability, and compressibility. The models are available in both the reference global coordinate frame and a local coordinate frame aligned with principal stress directions.

15 GEOTHERMAL ENERGY↗
DOE OSTI2021

Multilevel Graph Partitioning for Three-Dimensional Discrete Fracture Network Flow Simulations

We present a topology-based method for mesh-partitioning in three-dimensional discrete fracture network (DFN) simulations that takes 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 depends 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, which can be thought of as coarse-scale representations of the computational mesh. Using this concept, 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 DFN-based 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. The computation-based metrics show comparable performance between both methods so, in combination, the DFN-based partitions are several orders of magnitude faster than the mesh-based partition. Furthermore, the method which uses the DFN-partition solution as the initial condition of the mesh partition provided cut and imbalance values that were close to the mesh-based partition but in a fraction of the time. In turn, this hybrid method outperformed both of the other methods in terms of the total run time.

58 GEOSCIENCES↗
DOE OSTI2022

Reactive Transport Modeling of Mineral Precipitation and Carbon Trapping in Discrete Fracture Networks

In this study we use numerical experiments to analyze reactive flow and transport behavior in discrete intersecting fracture networks, focusing on (a) how reaction-induced changes in physical and chemical properties affect flow connectivity and (b) how fracture networks developed in the Earth's critical zone contribute to carbon sequestration via mineral weathering reactions. In the first part of the study, we used two-dimensional reactive flow and transport simulations to analyze the impacts of mixing in a natural discrete fracture network. We concluded that reaction-induced changes can substantially alter the flow connectivity, especially at fracture intersections. The second set of simulations considered the problem of natural weathering of fractured mafic and ultramafic rocks in the partially saturated Earth's critical zone as a function of infiltration rates, fracture permeability, and partially saturated flow parameters. As a model system, we considered an incongruent reaction network with dissolution of forsterite and precipitation of magnesite. The behavior is complex in terms of the rate-controlling processes because of the multicomponent nature of the system as shown by the grid Peclet number: the CO 2 behavior is gas diffusion-controlled in the partially saturated zone, while the rate of water flow via the Damkӧhler number controls Mg 2+ transport through the fracture network. The amounts of carbon that can be trapped are modest, but the naturally fractured domain considered here provides a useful “base case” against which various engineered solutions can be compared.

58 GEOSCIENCES↗
DOE OSTI2022

A Comparison of Linear Solvers for Resolving Flow in Three-Dimensional Discrete Fracture Networks

We compare various methods for resolving steady flow within three-dimensional discrete fracture networks, including direct methods, Krylov subspace methods with and without preconditioning, and multi-grid methods. We compared the performance of the methods based on compute times and scaling of the solution as a function of the number of grid nodes and log-variance of the hydraulic aperture. The methods are applied to three test cases: (a) variable density of networks with a truncated power-law distribution of fracture lengths, (b) a fixed network composed of monodisperse fracture sizes but varied permeability/aperture heterogeneity, (c) and a network based on field site in Nevada, US. We chose these cases to allow us to study the impact of the mesh size and flow properties, as well as to demonstrate our conclusions on a large-scale, realistic problem (more than 40 million mesh nodes). A direct solution using Cholesky factorization outperformed other methods for every example but was closely followed in performance by some algebraic multigrid (AMG) preconditioned Krylov subspace methods. Among the Krylov methods, conjugate gradients (CG) with an AMG preconditioner performs the best. Generally, Cholesky factorization is recommended, but CG with an AMG preconditioner may be suitable for very large problems beyond 40 million nodes where the entire linear system cannot reside in memory.

58 GEOSCIENCES↗
DOE OSTI2025

Discrete fracture network model benchmarks developed and applied in a DECOVALEX-2023 repository performance assessment study

This study presents newly developed benchmarks for modeling flow and transport within discrete fracture networks (DFNs) and useful methods for analyzing the results. The new benchmarks are designed to test modeling approaches for use in probabilistic performance assessment models of deep geologic repositories in fractured rock. The benchmarks simulate flow and transport through a 1 km 3 block of fractured rock. The first simulates migration of a short pulse of tracer through a simple network of four intersecting fractures. The second adds 1089 stochastically generated fractures. The third changes the pulse to a continuous point source. Evaluation of model performance relies on moment analysis and comparison of the results of different models. The expected nondimensional first moment of the conservative tracer for each benchmark is 1. The benchmarks were simulated by teams from Canada, Czechia, Germany, Korea, Sweden, Taiwan, and the United States as part of a DECOVALEX-2023 study (decovalex.org). The teams used various approaches, including explicit DFN modeling, DFN upscaling to an equivalent continuous porous medium (ECPM), and a combination of both methods. Transport mechanisms are modeled using either the advection-dispersion equation or particle tracking. Results demonstrate strong agreement among the models in breakthrough behavior up to the 75th percentile. Significant deviations in first moments and well-clustered outputs led to the identification of inaccuracies in several models. Such findings exemplify the benefit of exercising these benchmarks and using the presented methods to test DFN flow and transport models.

Benchmark↗
DOE OSTI2023

Utah FORGE: Documentation on Discrete Fracture Network and Fracture Propagation Modelling

This dataset includes reports and a slide presentation on discrete fracture network (DFN) generation and hydraulic fracture modeling at the Utah FORGE site. It details the characterization of natural fractures using well log and core data, as well as stochastic modeling techniques. The reports describe simulations of hydraulic fracture propagation, fluid-mechanical interactions, and induced microseismicity. The dataset also includes history-matching of net pressure and analyses of fracture growth in naturally fractured geothermal reservoirs. The slides summarize key findings and future research directions.

15 GEOTHERMAL ENERGY↗
DOE OSTI2022

Variable resolution Poisson-disk sampling for meshing discrete fracture networks

Here, we present the near-Maximal Algorithm for Poisson-disk Sampling (nMAPS) to generate point distributions for variable resolution Delaunay triangular and tetrahedral meshes in two and three-dimensions, respectively. nMAPS consists of two principal stages. In the first stage, an initial point distribution is produced using a cell-based rejection algorithm. In the second stage, holes in the sample are detected using an efficient background grid and filled in to obtain a near-maximal covering. Extensive testing shows that nMAPS generates a variable resolution mesh in linear run time with the number of accepted points. We demonstrate nMAPS capabilities by meshing three-dimensional discrete fracture networks (DFN) and the surrounding volume. The discretized boundaries of the fractures, which are represented as planar polygons, are used as the seed of 2D-nMAPS to produce a conforming Delaunay triangulation. The combined mesh of the DFN is used as the seed for 3D-nMAPS, which produces conforming Delaunay tetrahedra surrounding the network. Under a set of conditions that naturally arise in maximal Poisson-disk samples and are satisfied by nMAPS, the two-dimensional Delaunay triangulations are guaranteed to only have well-behaved triangular faces. While nMAPS does not provide triangulation quality bounds in more than two dimensions, we found that low-quality tetrahedra in 3D are infrequent, can be readily detected and removed, and a high-quality balanced mesh is produced.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Effects of Dead‐End Fractures on Non‐Fickian Transport in Three‐Dimensional Discrete Fracture Networks

Abstract Understanding mechanistic causes of non‐Fickian transport in fractured media is important for many hydrogeologic processes and subsurface applications. This study elucidates the effects of dead‐end fractures on non‐Fickian transport in three‐dimensional (3D) fracture networks. Although dead‐end fractures have been identified as low‐velocity regions that could delay solute transport, the direct relation between dead‐end fractures and non‐Fickian transport has been elusive. We systematically generate a large number of 3D discrete fracture networks with different fracture length distributions and fracture densities. We then identify dead‐end fractures using a novel graph‐based method. The effect of dead‐end fractures on solute residence time maximizes at the critical fracture density of the percolation threshold, leading to strong late‐time tailing. As fracture density increases beyond the percolation threshold, the network connectivity increases, and dead‐end fractures diminish. Consequently, the increase in network connectivity leads to a reduction in the degree of late‐time tailing. We also show that dead‐end fractures can inform about main transport paths, such as the mean tortuosity of particle trajectories. This study advances our mechanistic understanding of solute transport in 3D fracture networks.

58 GEOSCIENCES↗
DOE OSTI2021

Utah FORGE Well 16A(78)-32 Simplified Discrete Fracture Network Data

The FORGE team is making these fracture models available to researchers wanting a set of natural fractures in the FORGE reservoir for use in their own modeling work. They have been used to predict stimulation distances during hydraulic stimulation at the open toe section of well 16A(78)-32. This is a simplified DFN (discrete fracture network) dataset, that was generated using FracMan, for Utah FORGE well 16A(78)-32. A short, well-illustrated, report describing the data is also included in the provided archive file.

15 GEOTHERMAL ENERGY↗
DOE OSTI2024

Code for Experiment in Publication “Sensitivity Analysis in the Presence of Intrinsic Stochasticity for Discrete Fracture Network Simulations”

Following the Open Research requirements for AGU journals, we must release the code used to perform the experiment described in our recent publication, posted at (https://arxiv.org/abs/2312.04722). This code fits a joint emulator to data from a Discrete Fracture Network (DFN) simulation, performed using the open-source software DFNworks (https://dfnworks.lanl.gov/). All code to be released implements existing methods; there are no novel algorithms nor any major innovations to existing software.

Murph, Alexander↗
DOE OSTI2021

Transport Upscaling under Flow Heterogeneity and Matrix-Diffusion in Three-Dimensional Discrete Fracture Networks

For this work, we investigate the combined effects of network scale flow variability and retention due to matrix-diffusion on the scaling behavior of transport through fractured media. Two of the principal mechanisms controlling the transport of solutes through fractured low-permeability media are broad distributions of flow velocities and retention times in the solid matrix. We study the relative impact of these two processes under different initial conditions using a set of three-dimensional discrete fracture network simulations. We use these simulations to develop and calibrate an upscaled continuous time random walk (CTRW) approach for advective transport based on an Ornstein-Uhlenbeck model for the particle velocities that accounts for the fracture-matrix coupling using a compound Poisson process. This CTRW model can be conditioned on the initial solute distribution and allows to observe late-time scaling behavior at distances beyond what is feasible to observe using high-fidelity direct numerical simulations. We determine that the initial distribution of particles leads to marked differences in the persistent long-term scale behavior in the solute travel time distributions, even those undergoing retention due to matrix diffusion through implementation and analysis of the model.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2021

Performance Evaluation of Engineered Geothermal Systems Using Discrete Fracture Network Simulations

Electrical power production from geothermal energy has a solid record of success for permeable reservoirs such as The Geysers in northern California and geothermal systems in Iceland and New Zealand, among other places. Such permeable reservoirs, however, represent only a small fraction of the available heat energy in the earth’s shallow crust. Most of the available energy resides in rocks with insufficient permeability and storage to produce commercial volumes of heated fluids.

15 GEOTHERMAL ENERGY↗