Search NASA⌕ Search

SEARCH · Search NASA

Results for “model form uncertainty quantification”

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.

221 records · Page 13

Modeling flow and transport in fracture networks using graphs

Fractures form the main pathways for flow in the subsurface within low-permeability rock. For this reason, accurately predicting flow and transport in fractured systems is vital for improving the performance of subsurface applications. Fracture sizes in these systems can range from millimeters to kilometers. Although modeling flow and transport using the discrete fracture network (DFN) approach is known to be more accurate due to incorporation of the detailed fracture network structure over continuum-based methods, capturing the flow and transport in such a wide range of scales is still computationally intractable. Furthermore, if one has to quantify uncertainty, hundreds of realizations of these DFN models have to be run. To reduce the computational burden, we solve flow and transport on a graph representation of a DFN. We study the accuracy of the graph approach by comparing breakthrough times and tracer particle statistical data between the graph-based and the high-fidelity DFN approaches, for fracture networks with varying number of fractures and degree of heterogeneity. Due to our recent developments in capabilities to perform DFN high-fidelity simulations on fracture networks with large number of fractures, we are in a unique position to perform such a comparison. We show that the graph approach shows a consistent bias with up to an order of magnitude slower breakthrough when compared to the DFN approach. We show that this is due to graph algorithm's underprediction of the pressure gradients across intersections on a given fracture, leading to slower tracer particle speeds between intersections and longer travel times. We present a bias correction methodology to the graph algorithm that reduces the discrepancy between the DFN and graph predictions. We show that with this bias correction, the graph algorithm predictions significantly improve and the results are very accurate. In conclusion, the good accuracy and the low computational cost, with O(10 4 ) times lower times than the DFN, makes the graph algorithm an ideal technique to incorporate in uncertainty quantification methods.

58 GEOSCIENCES↗

AEOLUS: Advances in Experimental Design, Optimal Control, and Learning for Uncertain Complex Systems

Sustained advances in the mathematics of modeling and simulation have resulted in the capability today for routine simulation of a number of large scale complex DOE-relevant systems. As remarkable as this capability for solving the so-called forward problem is, it is typically only the first step-an inner loop within an outer loop that explores the simulation model's parameter space and decision space to characterize uncertainty in the model's predictions, learn unknown model parameters from data, design the most informative experiments, determine optimal control strategies, and create optimal designs. Broadly, what unifies all of these outer loop problems is that they are, in one form or another, optimization problems over parameter/control/design space that are constrained by complex uncertain models. To fully realize the power of scientific simulation as a basis for scientific discovery, technological innovation, and rational decision-making, it is imperative to move beyond simulation to tackle the outer loop of optimization for learning from data, experimental design, and control with complex uncertain models. When the models under consideration are large-scale and complex, and when the optimization variable and uncertain parameter spaces are high (or infinite) dimensional, this constitutes a grand challenge of the highest order, and is intractable with conventional methods. To overcome these challenges, the AEOLUS Center was established to develop a unified mathematical, computational, and statistical framework for (1) Learning predictive models from complex data via Bayesian inference and optimization, and (2) Optimizing experiments, processes, and designs using the resulting uncertain models. These problems are intractable with conventional methods, for several reasons: (1) The simulation problems that govern the inner loops of the optimization problems are expensive to execute (due to severe nonlinearity, heterogeneity, multiphysics/multiscale coupling); (2) The optimization variable and uncertain parameter spaces are high dimensional, often stemming from discretizations of infinite dimensional fields such as initial conditions, sources, or material properties. We argue that the key to overcoming these challenges is to develop new mathematical, computational, and statistical methods that exploit the structure of the Bayesian inference and optimization problems mediated by their underlying complex uncertain models. This structure includes the regularity, sparsity, geometry, low intrinsic dimensionality, and multifidelity nature of the maps from uncertain parameter/optimization variable spaces to the specific objectives targeted: Bayesian inference, optimal experimental design, and optimal control design. Black box methods developed as generic tools are incapable of exploiting this structure. To be successful, we must create, integrate, and cross-fertilize ideas across multiple areas of applied math--including approximation theory, Bayesian inference, data science, experimental design, information theory, machine learning, model reduction, optimal control theory, parallel algorithms, PDE-constrained optimization, randomized algorithms, stochastic optimization, and uncertainty quantification--all while exploiting the structure of the problems at hand. With this goal in mind, we have marshaled a team of leading authorities in these areas. While the methods we develop will be broadly applicable across a wide spectrum of DOE problems in which experiments inform models and the systems those models describe must be optimized under uncertainty, we have chosen a specific area, advanced manufacturing and materials, to drive our work. AMM is characterized by complex models across multiple scales, and is a rich source of challenging problems in inference, experimental design, and optimal control, requiring multifaceted and integrated advances in applied mathematics. As such, AMM serves as an excellent vehicle to motivate and demonstrate the advances in applied mathematics developed by our center.

97 MATHEMATICS AND COMPUTING↗

Extended Forward Sensitivity Analysis for Uncertainty Quantification

This report presents the forward sensitivity analysis method as a means for quantification of uncertainty in system analysis. The traditional approach to uncertainty quantification is based on a “black box” approach. The simulation tool is treated as an unknown signal generator, a distribution of inputs according to assumed probability density functions is sent in and the distribution of the outputs is measured and correlated back to the original input distribution. This approach requires large number of simulation runs and therefore has high computational cost. Contrary to the “black box” method, a more efficient sensitivity approach can take advantage of intimate knowledge of the simulation code. In this approach equations for the propagation of uncertainty are constructed and the sensitivity is solved for as variables in the same simulation. This “glass box” method can generate similar sensitivity information as the above “black box” approach with couples of runs to cover a large uncertainty region. Because only small numbers of runs are required, those runs can be done with a high accuracy in space and time ensuring that the uncertainty of the physical model is being measured and not simply the numerical error caused by the coarse discretization. In the forward sensitivity method, the model is differentiated with respect to each parameter to yield an additional system of the same size as the original one, the result of which is the solution sensitivity. The sensitivity of any output variable can then be directly obtained from these sensitivities by applying the chain rule of differentiation. We extend the forward sensitivity method to include time and spatial steps as special parameters so that the numerical errors can be quantified against other physical parameters. This extension makes the forward sensitivity method a much more powerful tool to help uncertainty analysis. By knowing the relative sensitivity of time and space steps with other interested physical parameters, the simulation can be run at appropriate time and space steps that ensure numerical sensitivities will not affect the confidence of the physical parameter sensitivity results. Two well defined benchmark problems, thermal wave and nonlinear diffusion, are utilized to demonstrate the extended forward sensitivity analysis method. All the physical solutions, parameter sensitivity solutions, even time step sensitivity in one case, have analytical forms, which allows the verification to be done in the strictest sense. A pilot code, Extended Forward sensitivity Analysis pilot code (EFA), has been developed to implement the above work.

97 MATHEMATICS AND COMPUTING↗

Quantifying the Uncertainty in Deterministic Phonon Transport Calculations of Thermal Conductivity using Polynomial Chaos Expansions

The nature of computational simulations requires the inclusion of an uncertainty analysis, as we have limited knowledge of all physically determined input parameters for a computationally simulated problem. We rely on uncertainty quantification (UQ) to characterize our confidence in the outcomes. Quantifying uncertainty can provide a basis for certifications in high-consequence decisions, such as nuclear reactor design, and is a fundamental component of model validation. We employ a previously developed method of uncertainty quantification, polynomial chaos expansion with stochastic collocation (PCE-SC), applied to deterministic phonon transport simulations. In these simulations, we use the neutron transport code Rattlesnake, which solves the Self-Adjoint Angular Flux (SAAF) formulation of the transport equation with a continuous finite element (CFEM) spatial discretization and discrete ordinates, spherical harmonics angular discretizations. Rattlesnake was developed in the multi-physics object oriented simulation environment (MOOSE) framework. We have previously shown Rattlesnake to be effective in simulating phonon transport. We aim to provide a deterministic phonon transport framework for heterogeneous nuclear fuel with fission product defects to predict thermal conductivity (?). A first principles, physics-based calculation of thermal conductivity must involve factors such as the microstructure of nuclear fuel, which constantly changes during the fission process through the formation of isotopic decay products. Heat transport in oxide nuclear fuels is dominated by phonon transport. Impurities in the bulk material influence the transport of energy at the fundamental level, altering the scattering behavior of phonons and electrons. Conventionally, heat transport follows classical physics based on the heat equation derived from Fourier's law q = -k∇T, where q is heat flux, k is thermal conductivity and ∇T is a temperature gradient. However, Fourier's law is a macroscopic empirical law in which the thermal conductivity? does not have a mechanistic connection to the underpinning heat transport processes. Thermal conductivity of a material depends both on the material's intrinsic ability to transport heat and a variety of resistive effects caused by defects in the material. Thus ab initio prediction of the macroscopic conductivity - the property of interest for safe reactor operation - requires simulating detailed processes of heat transport, and then determining the effective thermal conductivity of the simulated material from the resulting heat flux under the imposed temperature difference. The thermal conductivity of a bulk, homogeneous, dielectric material can be well estimated by the mechanistically derived expression: k{sub bulk} = 1/3 C{sub ν}νgλ (2), where C{sub ν}, νg, and λ are the volumetric specific heat, phonon speed, and phonon mean free path, respectively. In these problems the relevant parameter is the material's acoustic thickness, its characteristic distance L relative to the phonon mean free path λ. In Eq. (2) the largest source of uncertainty is λ. While propagating uncertainty in λ to uncertainty in k through Eq. (2) is trivial, systems with extrinsic scattering require more sophisticated approaches. At the microscopic level, uncertainty in λ changes both a material's intrinsic thermal conductivity. Our goal is to propagate the uncertainty in λ through the deterministic transport computation of k. Because there are a small number of uncertain input quantities, we use the method of polynomial chaos expansion (PCE), which expresses solutions in the form of spectral expansions of an uncertain variable. This approach combines both intrusive and nonintrusive methods of uncertainty propagation techniques and results in a unique formulation which is very effective and efficient for problems with few uncertain parameters. Uncertainty Quantification and Sensitivity Analysis We use PCE-SC to measure propagation of uncertainty in a 3-D phonon transport problem of homogeneous silicon, to compute the mean and variance in temperature, heat flux and thermal conductivity. (authors)

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗

Learning in Modal Space: Solving Time-Dependent Stochastic PDEs Using Physics-Informed Neural Networks

One of the open problems in scientific computing is the long-time integration of nonlinear stochastic partial differential equations (SPDEs), especially with arbitrary initial data. We address this problem by taking advantage of recent advances in scientific machine learning and the spectral dynamically orthogonal (DO) and borthogonal (BO) methods for representing stochastic processes. The recently introduced DO/BO methods reduce the SPDE to solving a system of deterministic PDEs and a system of stochastic ordinary differential equations. Specifically, we propose two new physics-informed neural networks (PINNs) for solving time-dependent SPDEs, namely the neural network (NN)-DO/BO methods. The proposed methods incorporate the DO/BO constraints into the loss function (along with the modal decomposition of the SPDE) with an implicit form instead of generating explicit expressions for the temporal derivatives of the DO/BO modes. Hence, the NN-DO/BO methods can overcome some of the drawbacks of the original DO/BO methods. For example, we do not need the assumption that the covariance matrix of the random coefficients is invertible as in the original DO method, and we can remove the assumption of no eigenvalue crossing as in the original BO method. Moreover, the NN-DO/BO methods can be used to solve time-dependent stochastic inverse problems with the same formulation and same computational complexity as for forward problems. Furthermore, we demonstrate the capability of the proposed methods via several numerical examples, namely: (1) A linear stochastic advection equation with deterministic initial condition: we obtain good results with the proposed methods, while the original DO/BO methods cannot be applied directly in this case. (2) Long-time integration of the stochastic Burgers' equation: we show the good performance of NN-DO/BO methods, especially the effectiveness of the NN-BO approach for such problems with many eigenvalue crossings during the whole time evolution, while the original BO method fails. (3) Nonlinear reaction diffusion equation: we consider both the forward problem and the inverse problems, including very noisy initial point values, to investigate the flexibility of the NN-DO/BO methods in handling inverse and mixed type problems. Taken together, these simulation results demonstrate that the NN-DO/BO methods can be employed to effectively quantify uncertainty propagation in a wide range of physical problems, but future work should address the efficiency issue of PINNs for forward problems.

97 MATHEMATICS AND COMPUTING↗