Improving Density Curve Predictions and Uncertainty Quantification with Functional Data Analysis [Slides]
Los Alamos National Laboratory (LANL) has developed advanced simulation methods for predicting subsurface flow.
Engineering topics
Publications and source records attributed to Percus, Allon G..
Los Alamos National Laboratory (LANL) has developed advanced simulation methods for predicting subsurface flow.
Abstract Quantum algorithms provide an exponential speedup for solving certain classes of linear systems, including those that model geologic fracture flow. However, this revolutionary gain in efficiency does not come without difficulty. Quantum algorithms require that problems satisfy not only algorithm-specific constraints, but also application-specific ones. Otherwise, the quantum advantage carefully attained through algorithmic ingenuity can be entirely negated. Previous work addressing quantum algorithms for geologic fracture flow has illustrated core algorithmic approaches while incrementally removing assumptions. This work addresses two further requirements for solving geologic fracture flow systems with quantum algorithms: efficient system state preparation and efficient information extraction. Our approach to addressing each is consistent with an overall exponential speed-up.
Detecting subsurface explosions from radionuclide gas migration through rock fractures is an effective way to identify nuclear activity. Los Alamos National Laboratory (LANL) has developed simulation methods, based on data from the 1962 Hardhat underground nuclear test, to predict gas breakthrough times at the surface. However, these methods rely on an imperfect understanding of the relationship between rock damage and fracture permeability. Our clinic project studies methods for predicting breakthrough curves that characterize total mass produced as a function of time, as well as quantifying the uncertainty associated with these predictions. The model that is currently employed to relate damage to permeability uses an empirically motivated power-law expression, with a range of parameter values that are compatible with the experimental Hardhat data. We develop emulators, built from functional data analysis techniques and trained on simulation data, that rapidly predict the gas breakthrough curve given a damage field and given the parameter values of the power-law equation. Using Bayesian regression, we address the problem of uncertainty quantification in our emulators. Finally, in order to test the robustness of the model, we further validate it on a damage field representing different physical conditions.
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. In conclusion, 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.