Network


Latest external collaboration on country level. Dive into details by clicking on the dots.

Hotspot


Dive into the research topics where Jeffrey D. Hyman is active.

Publication


Featured researches published by Jeffrey D. Hyman.


Computational Geosciences | 2002

Mimetic Finite Difference Methods for Diffusion Equations

Jeffrey D. Hyman; Mikhail J. Shashkov; Stanly Steinberg

This paper reviews and extends the theory and application of mimetic finite difference methods for the solution of diffusion problems in strongly heterogeneous anisotropic materials. These difference operators satisfy the fundamental identities, conservation laws and theorems of vector and tensor calculus on nonorthogonal, nonsmooth, structured and unstructured computational grids. We provide explicit approximations for equations in two dimensions with discontinuous anisotropic diffusion tensors. We mention the similarities and differences between the new methods and mixed finite element or hybrid mixed finite element methods.


Computers & Geosciences | 2015

dfnWorks: A discrete fracture network framework for modeling subsurface flow and transport

Jeffrey D. Hyman; Satish Karra; Nataliia Makedonska; Carl W. Gable; Scott L. Painter; Hari S. Viswanathan

Abstract dfn W orks is a parallelized computational suite to generate three-dimensional discrete fracture networks (DFN) and simulate flow and transport. Developed at Los Alamos National Laboratory over the past five years, it has been used to study flow and transport in fractured media at scales ranging from millimeters to kilometers. The networks are created and meshed using dfn G en , which combines fram (the feature rejection algorithm for meshing) methodology to stochastically generate three-dimensional DFNs with the L a G ri T meshing toolbox to create a high-quality computational mesh representation. The representation produces a conforming Delaunay triangulation suitable for high performance computing finite volume solvers in an intrinsically parallel fashion. Flow through the network is simulated in dfn F low , which utilizes the massively parallel subsurface flow and reactive transport finite volume code pflotran . A Lagrangian approach to simulating transport through the DFN is adopted within dfn T rans to determine pathlines and solute transport through the DFN. Example applications of this suite in the areas of nuclear waste repository science, hydraulic fracturing and CO2 sequestration are also included.


SIAM Journal on Scientific Computing | 2014

Conforming Delaunay Triangulation of Stochastically Generated Three Dimensional Discrete Fracture Networks: A Feature Rejection Algorithm for Meshing Strategy

Jeffrey D. Hyman; Carl W. Gable; Scott L. Painter; Nataliia Makedonska

We introduce the feature rejection algorithm for meshing (FRAM) to generate a high quality conforming Delaunay triangulation of a three-dimensional discrete fracture network (DFN). The geometric features (fractures, fracture intersections, spaces between fracture intersections, etc.) that must be resolved in a stochastically generated DFN typically span a wide range of spatial scales and make the efficient automated generation of high-quality meshes a challenge. To deal with these challenges, many previous approaches often deformed the DFN to align its features with a mesh through various techniques including redefining lines of intersection as stair step functions and distorting the fracture edges. In contrast, FRAM generates networks on which high-quality meshes occur automatically by constraining the generation of the network. The cornerstone of FRAM is prescribing a minimum length scale and then restricting the generation of the network to only create features of that size and larger. The process is f...


Water Resources Research | 2015

Effect of advective flow in fractures and matrix diffusion on natural gas production

Satish Karra; Nataliia Makedonska; Hari S. Viswanathan; Scott L. Painter; Jeffrey D. Hyman

Although hydraulic fracturing has been used for natural gas production for the past couple of decades, there are significant uncertainties about the underlying mechanisms behind the production curves that are seen in the field. A discrete fracture network based reservoir-scale work flow is used to identify the relative effect of flow of gas in fractures and matrix diffusion on the production curve. With realistic three dimensional representations of fracture network geometry and aperture variability, simulated production decline curves qualitatively resemble observed production decline curves. The high initial peak of the production curve is controlled by advective fracture flow of free gas within the network and is sensitive to the fracture aperture variability. Matrix diffusion does not significantly affect the production decline curve in the first few years, but contributes to production after approximately 10 years. These results suggest that the initial flushing of gas-filled background fractures combined with highly heterogeneous flow paths to the production well are sufficient to explain observed initial production decline. Lastly, these results also suggest that matrix diffusion may support reduced production over longer time frames.


Water Resources Research | 2015

Influence of injection mode on transport properties in kilometer-scale three-dimensional discrete fracture networks

Jeffrey D. Hyman; Scott L. Painter; Hari S. Viswanathan; Nataliia Makedonska; Satish Karra

We investigate how the choice of injection mode impacts transport properties in kilometer-scale three-dimensional discrete fracture networks (DFN). The choice of injection mode, resident or flux-weighted, is designed to mimic different physical phenomena. It has been hypothesized that solute plumes injected under resident conditions evolve to behave similarly to solutes injected under flux-weighted conditions. Previously, computational limitations have prohibited the large scale simulations required to investigate this hypothesis. We investigate this hypothesis by using a high performance DFN suite, dfnWorks, to simulate flow in kilometer-scale three-dimensional DFNs based on fractured granite at the Forsmark site in Sweden, and adopt a Lagrangian approach to simulate transport therein. Results show that after traveling through a pre-equilibrium region both injection methods exhibit linear scaling of the first moment of travel time and power law scaling of the breakthrough curve with similar exponents, slightly larger than two. The physical mechanisms behind this evolution appear to be the combination of in-network channeling of mass into larger fractures, which offer reduced resistance to flow, and in-fracture channeling, which results from the topology of the DFN. This article is protected by copyright. All rights reserved.


Philosophical Transactions of the Royal Society A | 2016

Understanding hydraulic fracturing: a multi-scale problem

Jeffrey D. Hyman; Joaquín Jiménez-Martínez; Hari S. Viswanathan; James William Carey; Mark L. Porter; Esteban Rougier; Satish Karra; Qinjun Kang; Luke P. Frash; Li Chen; Zhou Lei; D. O’Malley; Nataliia Makedonska

Despite the impact that hydraulic fracturing has had on the energy sector, the physical mechanisms that control its efficiency and environmental impacts remain poorly understood in part because the length scales involved range from nanometres to kilometres. We characterize flow and transport in shale formations across and between these scales using integrated computational, theoretical and experimental efforts/methods. At the field scale, we use discrete fracture network modelling to simulate production of a hydraulically fractured well from a fracture network that is based on the site characterization of a shale gas reservoir. At the core scale, we use triaxial fracture experiments and a finite-discrete element model to study dynamic fracture/crack propagation in low permeability shale. We use lattice Boltzmann pore-scale simulations and microfluidic experiments in both synthetic and shale rock micromodels to study pore-scale flow and transport phenomena, including multi-phase flow and fluids mixing. A mechanistic description and integration of these multiple scales is required for accurate predictions of production and the eventual optimization of hydrocarbon extraction from unconventional reservoirs. Finally, we discuss the potential of CO2 as an alternative working fluid, both in fracturing and re-stimulating activities, beyond its environmental advantages. This article is part of the themed issue ‘Energy and the subsurface’.


Ground Water | 2016

Where Does Water Go During Hydraulic Fracturing

Daniel O'Malley; Satish Karra; Robert P. Currier; Nataliia Makedonska; Jeffrey D. Hyman; Hari S. Viswanathan

During hydraulic fracturing millions of gallons of water are typically injected at high pressure into deep shale formations. This water can be housed in fractures, within the shale matrix, and can potentially migrate beyond the shale formation via fractures and/or faults raising environmental concerns. We describe a generic framework for producing estimates of the volume available in fractures and undamaged shale matrix where water injected into a representative shale site could reside during hydraulic fracturing, and apply it to a representative site that incorporates available field data. The amount of water that can be stored in the fractures is estimated by calculating the volume of all the fractures associated with a discrete fracture network (DFN) based on real data and using probability theory to estimate the volume of smaller fractures that are below the lower cutoff for the fracture radius in the DFN. The amount of water stored in the matrix is estimated utilizing two distinct methods-one using a two-phase model at the pore-scale and the other using a single-phase model at the continuum scale. Based on these calculations, it appears that most of the water resides in the matrix with a lesser amount in the fractures.


Water Resources Research | 2016

Fracture size and transmissivity correlations: Implications for transport simulations in sparse three‐dimensional discrete fracture networks following a truncated power law distribution of fracture size

Jeffrey D. Hyman; Garrett Aldrich; Hari S. Viswanathan; Nataliia Makedonska; Satish Karra

We characterize how different fracture size-transmissivity relationships influence flow and transport simulations through sparse three-dimensional discrete fracture networks. Although it is generally accepted that there is a positive correlation between a fractures size and its transmissivity/aperture, the functional form of that relationship remains a matter of debate. Relationships that assume perfect correlation, semi-correlation, and non-correlation between the two have been proposed. To study the impact that adopting one of these relationships has on transport properties, we generate multiple sparse fracture networks composed of circular fractures whose radii follow a truncated power law distribution. The distribution of transmissivities are selected so that the mean transmissivity of the fracture networks are the same and the distributions of aperture and transmissivity in models that include a stochastic term are also the same. We observe that adopting a correlation between a fracture size and its transmissivity leads to earlier breakthrough times and higher effective permeability when compared to networks where no correlation is used. While fracture network geometry plays the principal role in determining where transport occurs within the network, the relationship between size and transmissivity controls the flow speed. These observations indicate DFN modelers should be aware that breakthrough times and effective permeabilities can be strongly influenced by such a relationship in addition to fracture and network statistics. This article is protected by copyright. All rights reserved.


Physical Review E | 2017

Predictions of first passage times in sparse discrete fracture networks using graph-based reductions

Jeffrey D. Hyman; Aric Hagberg; Gowri Srinivasan; Jamaludin Mohd-Yusof; Hari S. Viswanathan

We present a graph-based methodology to reduce the computational cost of obtaining first passage times through sparse fracture networks. We derive graph representations of generic three-dimensional discrete fracture networks (DFNs) using the DFN topology and flow boundary conditions. Subgraphs corresponding to the union of the k shortest paths between the inflow and outflow boundaries are identified and transport on their equivalent subnetworks is compared to transport through the full network. The number of paths included in the subgraphs is based on the scaling behavior of the number of edges in the graph with the number of shortest paths. First passage times through the subnetworks are in good agreement with those obtained in the full network, both for individual realizations and in distribution. Accurate estimates of first passage times are obtained with an order of magnitude reduction of CPU time and mesh size using the proposed method.


Computational Geosciences | 2018

Machine learning for graph-based representations of three-dimensional discrete fracture networks

Manuel Valera; Zhengyang Guo; Priscilla Kelly; Sean Matz; Vito Adrian Cantu; Allon G. Percus; Jeffrey D. Hyman; Gowri Srinivasan; Hari S. Viswanathan

Structural and topological information play a key role in modeling flow and transport through fractured rock in the subsurface. Discrete fracture network (DFN) computational suites such as dfnWorks (Hyman et al. Comput. Geosci. 84, 10–19 2015) are designed to simulate flow and transport in such porous media. Flow and transport calculations reveal that a small backbone of fractures exists, where most flow and transport occurs. Restricting the flowing fracture network to this backbone provides a significant reduction in the network’s effective size. However, the particle-tracking simulations needed to determine this reduction are computationally intensive. Such methods may be impractical for large systems or for robust uncertainty quantification of fracture networks, where thousands of forward simulations are needed to bound system behavior. In this paper, we develop an alternative network reduction approach to characterizing transport in DFNs, by combining graph theoretical and machine learning methods. We consider a graph representation where nodes signify fractures and edges denote their intersections. Using random forest and support vector machines, we rapidly identify a subnetwork that captures the flow patterns of the full DFN, based primarily on node centrality features in the graph. Our supervised learning techniques train on particle-tracking backbone paths found by dfnWorks, but run in negligible time compared to those simulations. We find that our predictions can reduce the network to approximately 20% of its original size, while still generating breakthrough curves consistent with those of the original network.

Collaboration


Dive into the Jeffrey D. Hyman's collaboration.

Top Co-Authors

Avatar

Hari S. Viswanathan

Los Alamos National Laboratory

View shared research outputs
Top Co-Authors

Avatar

Satish Karra

Los Alamos National Laboratory

View shared research outputs
Top Co-Authors

Avatar

Nataliia Makedonska

Los Alamos National Laboratory

View shared research outputs
Top Co-Authors

Avatar

Gowri Srinivasan

Los Alamos National Laboratory

View shared research outputs
Top Co-Authors

Avatar

Scott L. Painter

Oak Ridge National Laboratory

View shared research outputs
Top Co-Authors

Avatar

Carl W. Gable

Los Alamos National Laboratory

View shared research outputs
Top Co-Authors

Avatar
Top Co-Authors

Avatar

Esteban Rougier

Los Alamos National Laboratory

View shared research outputs
Top Co-Authors

Avatar

J. William Carey

Los Alamos National Laboratory

View shared research outputs
Top Co-Authors

Avatar
Researchain Logo
Decentralizing Knowledge